Submission #1595270


Source Code Expand

#include<bits/stdc++.h>
#include<ctime>
#include<random>
using namespace std;

int n;
vector<pair<int, int> > v;

bool use[202];
long long int p2[202];
#define MOD 998244353
int main(){
	p2[0] = 1;
	for (int i = 1; i < 202; i++){
		p2[i] = p2[i - 1];
		p2[i] *= 2;
		if (p2[i] >= MOD){
			p2[i] %= MOD;
		}
	}
	cin >> n;
	for (int i = 0; i < n; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		v.push_back(make_pair(a, b));
	}
	long long int ng = 0;
	for (int i = 0; i < n; i++){
		ng++;
		memset(use, false, sizeof(use));
		for (int j = i + 1; j < n; j++){
			int cnt = 1;
			if (use[j])continue;
			use[j] = true;
			pair<long long int, long long int> vec = make_pair(v[j].first - v[i].first, v[j].second - v[i].second);
			for (int k = j+1; k < n; k++){
				pair<long long int, long long int> vec2 = make_pair(v[k].first - v[i].first, v[k].second - v[i].second);
				if (vec.first*vec2.second == vec.second*vec2.first){
					use[k] = true;
					cnt++;
				}
			}
			long long int way = p2[cnt];
			way += MOD - 1;
			if (way >= MOD)way %= MOD;
			ng += way;
			if (ng >= MOD)ng %= MOD;
		}
	}
	long long int ALL = p2[n] + MOD - 1 + MOD - ng;
	ALL %= MOD;
	printf("%lld\n", ALL);
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

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 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 1 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 1 ms 256 KB
1_028.txt AC 1 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