Submission #1573967
Source Code Expand
#include <bits/stdc++.h> #define maxn 100010 typedef long long LL; const LL mod = 998244353; LL x[maxn], y[maxn], P[maxn]; int main() { LL n; scanf("%lld", &n); for (int i = 0; i < n; ++i) scanf("%lld%lld", &x[i], &y[i]); P[0] = 1; for (int i = 1; i <= n; ++i) (P[i] = P[i-1] << 1) %= mod; LL ans = P[n] - 1 - n - n*(n-1)/2; for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) { int cnt = 0; for (int k = j+1; k < n; ++k) { if ((x[j]-x[i]) * (y[k]-y[j]) == (x[k]-x[j]) * (y[j]-y[i])) ++cnt; } ((ans -= P[cnt]-1) += mod) %= mod; } } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - ConvexScore |
User | kahlua |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 719 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &n); ^ ./Main.cpp:9:64: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 0; i < n; ++i) scanf("%lld%lld", &x[i], &y[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 2 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 2 ms | 256 KB |
1_008.txt | AC | 2 ms | 256 KB |
1_009.txt | AC | 2 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 2 ms | 256 KB |
1_012.txt | AC | 2 ms | 256 KB |
1_013.txt | AC | 2 ms | 256 KB |
1_014.txt | AC | 1 ms | 256 KB |
1_015.txt | AC | 2 ms | 256 KB |
1_016.txt | AC | 1 ms | 256 KB |
1_017.txt | AC | 3 ms | 256 KB |
1_018.txt | AC | 3 ms | 256 KB |
1_019.txt | AC | 3 ms | 256 KB |
1_020.txt | AC | 3 ms | 256 KB |
1_021.txt | AC | 3 ms | 256 KB |
1_022.txt | AC | 3 ms | 256 KB |
1_023.txt | AC | 3 ms | 256 KB |
1_024.txt | AC | 3 ms | 256 KB |
1_025.txt | AC | 3 ms | 256 KB |
1_026.txt | AC | 3 ms | 256 KB |
1_027.txt | AC | 3 ms | 256 KB |
1_028.txt | AC | 3 ms | 256 KB |
1_029.txt | AC | 3 ms | 256 KB |
1_030.txt | AC | 3 ms | 256 KB |
1_031.txt | AC | 3 ms | 256 KB |
1_032.txt | AC | 3 ms | 256 KB |
1_033.txt | AC | 3 ms | 256 KB |
1_034.txt | AC | 3 ms | 256 KB |
1_035.txt | AC | 3 ms | 256 KB |