Submission #1748582


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=210,mod=998244353;
int inc(int x,int y){x+=y;return x>=mod?x-mod:x;}
int dec(int x,int y){x-=y;return x<0?x+mod:x;}
int mul(int x,int y){return (ll)x*y%mod;}
int power(int x,int y){
	int ans=1;
	for (;y;y>>=1,x=mul(x,x))
		if (y&1) ans=mul(ans,x);
	return ans;
}
int calc(int n){
	return dec(power(2,n),n*(n+1)/2+1);
}
typedef pair<int,int> pii;
pii operator - (pii a,pii b){
	return pii(a.first-b.first,a.second-b.second);
}
int operator * (pii a,pii b){
	return a.first*b.second-a.second*b.first;
}
int n,q[N],size;pii p[N];
bool use[N][N];
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++) scanf("%d%d",&p[i].first,&p[i].second);
	int ans=calc(n);
	for (int i=1;i<=n;i++)
	for (int j=1;j<i;j++)
	if (!use[i][j]){
		pii vec=p[i]-p[j];size=0;
		for (int k=1;k<=n;k++)
			if ((p[k]-p[j])*vec==0) q[++size]=k;
		ans=dec(ans,calc(size));
		for (int a=1;a<=size;a++)
		for (int b=1;b<=size;b++)
			use[q[a]][q[b]]=1;
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:29:63: 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",&p[i].first,&p[i].second);
                                                               ^

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 3 ms 256 KB
1_008.txt AC 2 ms 256 KB
1_009.txt AC 3 ms 256 KB
1_010.txt AC 2 ms 256 KB
1_011.txt AC 3 ms 256 KB
1_012.txt AC 4 ms 256 KB
1_013.txt AC 2 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 6 ms 256 KB
1_018.txt AC 6 ms 256 KB
1_019.txt AC 4 ms 256 KB
1_020.txt AC 4 ms 256 KB
1_021.txt AC 4 ms 256 KB
1_022.txt AC 5 ms 256 KB
1_023.txt AC 6 ms 256 KB
1_024.txt AC 6 ms 256 KB
1_025.txt AC 5 ms 256 KB
1_026.txt AC 5 ms 256 KB
1_027.txt AC 1 ms 256 KB
1_028.txt AC 1 ms 256 KB
1_029.txt AC 5 ms 256 KB
1_030.txt AC 6 ms 256 KB
1_031.txt AC 6 ms 256 KB
1_032.txt AC 6 ms 256 KB
1_033.txt AC 6 ms 256 KB
1_034.txt AC 6 ms 256 KB
1_035.txt AC 4 ms 256 KB