Submission #1567933
Source Code Expand
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include<bitset>
#include <utility>
using namespace std;
#define rank rankk
#define mp make_pair
#define pb push_back
#define xo(a,b) ((b)&1?(a):0)
//#define LL ll
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<ll,int> pli;
const int INF=0x3f3f3f3f;
const ll INFF=0x3f3f3f3f3f3f3f3fll;
const int MAX=1e5+5;
const int MAX_N=MAX;
const ll MOD=998244353;
const long double pi=acos(-1.0);
//const double eps=0.00000001;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
template<typename T>inline T abs(T a) {return a>0?a:-a;}
template<class T> inline
void read(T& num) {
bool start=false,neg=false;
char c;
num=0;
while((c=getchar())!=EOF) {
if(c=='-') start=neg=true;
else if(c>='0' && c<='9') {
start=true;
num=num*10+c-'0';
} else if(start) break;
}
if(neg) num=-num;
}
inline ll powMM(ll a,ll b,ll M){
ll ret=1;
a%=M;
// b%=M;
while (b){
if (b&1) ret=ret*a%M;
b>>=1;
a=a*a%M;
}
return ret;
}
void open()
{
freopen("1009.in","r",stdin);
freopen("out.txt","w",stdout);
}
int n,cnt;
ll mi[205];
int x[205],y[205];
ll an;
inline bool check(int i,int j,int k)
{
return ((x[i]-x[j])*(y[k]-y[j])-(x[k]-x[j])*(y[i]-y[j]))==0;
}
int main()
{
scanf("%d",&n);
mi[0]=1;for(int i=1;i<=n;i++)mi[i]=2*mi[i-1]%MOD;
for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
an=(mi[n]-1-n+MOD)%MOD;
for(int i=1;i<=n-1;i++)
for(int j=i+1;j<=n;j++,an=(an-mi[cnt]+MOD)%MOD,cnt=0)
for(int k=j+1;k<=n;k++)
if(check(i,j,k))++cnt;
printf("%lld\n",an);
return 0;
}
Submission Info
Submission Time |
|
Task |
E - ConvexScore |
User |
for0nething |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1963 Byte |
Status |
AC |
Exec Time |
4 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘void open()’:
./Main.cpp:61:33: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("1009.in","r",stdin);
^
./Main.cpp:62:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("out.txt","w",stdout);
^
./Main.cpp: In function ‘int main()’:
./Main.cpp:74:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:76:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i=1;i<=n;i++)scanf("%d%d",&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 |
4 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 |