Submission #1647548
Source Code Expand
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
const int Mod = 998244353;
const int N = 310;
struct Point{
int x, y;
}P[N];
int n, Pow[N];
double s[N];
int main(){
scanf("%d", &n);
Pow[0] = 1;
For(i, 1, n) scanf("%d%d", &P[i].x, &P[i].y), Pow[i] = Pow[i - 1] * 2 % Mod;
int ans = Pow[n] - n;
For(i, 1, n){
int c = 0;
For(j, i + 1, n) s[++c] = P[i].x == P[j].x ? 1e10 : double(P[j].y - P[i].y) / double(P[j].x - P[i].x);
sort(s + 1, s + c + 1);
For(j, 1, c){
int r = j;
while(r < c && fabs(s[r + 1] - s[j]) < 1e-10) ++r;
ans = (Mod + ans - Pow[r - j + 1] + 1) % Mod;
j = r;
}
}
printf("%d\n", (ans + Mod - 1) % Mod);
return 0;
}
Submission Info
Submission Time |
|
Task |
E - ConvexScore |
User |
dy0607 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
873 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:26:77: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
For(i, 1, n) scanf("%d%d", &P[i].x, &P[i].y), Pow[i] = Pow[i - 1] * 2 % Mod;
^
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 |
1 ms |
256 KB |
1_006.txt |
AC |
1 ms |
256 KB |
1_007.txt |
AC |
2 ms |
256 KB |
1_008.txt |
AC |
1 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 |
1 ms |
256 KB |
1_014.txt |
AC |
1 ms |
256 KB |
1_015.txt |
AC |
1 ms |
256 KB |
1_016.txt |
AC |
1 ms |
256 KB |
1_017.txt |
AC |
2 ms |
256 KB |
1_018.txt |
AC |
2 ms |
256 KB |
1_019.txt |
AC |
2 ms |
256 KB |
1_020.txt |
AC |
2 ms |
256 KB |
1_021.txt |
AC |
2 ms |
256 KB |
1_022.txt |
AC |
2 ms |
256 KB |
1_023.txt |
AC |
2 ms |
256 KB |
1_024.txt |
AC |
2 ms |
256 KB |
1_025.txt |
AC |
2 ms |
256 KB |
1_026.txt |
AC |
2 ms |
256 KB |
1_027.txt |
AC |
1 ms |
256 KB |
1_028.txt |
AC |
1 ms |
256 KB |
1_029.txt |
AC |
2 ms |
256 KB |
1_030.txt |
AC |
2 ms |
256 KB |
1_031.txt |
AC |
2 ms |
256 KB |
1_032.txt |
AC |
2 ms |
256 KB |
1_033.txt |
AC |
2 ms |
256 KB |
1_034.txt |
AC |
2 ms |
256 KB |
1_035.txt |
AC |
2 ms |
256 KB |