Submission #1561069


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int N = 200;
const int mod = 998244353;
int x[N],y[N];
typedef pair<int,int> pii;
int C(int i,int j){
	return x[i]*y[j]-x[j]*y[i];
}
int ccw(int i,int j,int k){
	return C(i,j)+C(j,k)+C(k,i);
}
int pp[N+1];
#define mul(x,y) ((long long)(x)*(y)%mod)
int main(){
	int n;scanf("%d",&n);
	pp[0]=1;for(int i=1;i<=n;i++)pp[i]=mul(pp[i-1],2);
	for(int i=0;i<n;i++){
		scanf("%d%d",x+i,y+i);
	}
	int ans=pp[n];
	ans = (ans+mod-1)%mod;
	ans = (ans+mod-n)%mod;
	for(int i=0;i<n;i++){
		for(int j=0;j<i;j++){
			int r=n;
			pii a = min(pii(x[i],y[i]),pii(x[j],y[j]));
			pii b = max(pii(x[i],y[i]),pii(x[j],y[j]));
			for(int k=0;k<n;k++){
				if(ccw(i,j,k)==0 && a <= pii(x[k],y[k]) && pii(x[k],y[k])<=b)r--;
			}
			ans-=pp[n-2-r];
			if(ans<0)ans+=mod;
		}
	}
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task E - ConvexScore
User OnionPringles
Language C++14 (GCC 5.4.1)
Score 700
Code Size 860 Byte
Status AC
Exec Time 20 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n;scanf("%d",&n);
                      ^
./Main.cpp:19:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",x+i,y+i);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 36
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 3 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 5 ms 256 KB
1_008.txt AC 4 ms 256 KB
1_009.txt AC 4 ms 256 KB
1_010.txt AC 2 ms 256 KB
1_011.txt AC 5 ms 256 KB
1_012.txt AC 5 ms 256 KB
1_013.txt AC 4 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt AC 10 ms 256 KB
1_016.txt AC 4 ms 256 KB
1_017.txt AC 9 ms 256 KB
1_018.txt AC 9 ms 256 KB
1_019.txt AC 10 ms 256 KB
1_020.txt AC 10 ms 256 KB
1_021.txt AC 9 ms 256 KB
1_022.txt AC 9 ms 256 KB
1_023.txt AC 9 ms 256 KB
1_024.txt AC 9 ms 256 KB
1_025.txt AC 10 ms 256 KB
1_026.txt AC 10 ms 256 KB
1_027.txt AC 17 ms 256 KB
1_028.txt AC 20 ms 256 KB
1_029.txt AC 10 ms 256 KB
1_030.txt AC 9 ms 256 KB
1_031.txt AC 9 ms 256 KB
1_032.txt AC 9 ms 256 KB
1_033.txt AC 9 ms 256 KB
1_034.txt AC 9 ms 256 KB
1_035.txt AC 12 ms 256 KB