Submission #2161272


Source Code Expand

#include <algorithm>
#include <utility>
#include <cstdio>
#include <set>
#define MOD 998244353
#define mp std::make_pair
typedef long long ll; 
int x[405], y[405], seq[405]; 
std::set<std::pair<int, int> > se; 
inline bool comp(int a, int b)
{
	if (x[a] == x[b])
		return y[a] < y[b]; 
	return x[a] < x[b]; 
}
inline bool same(int a, int b, int c)
{
	return (x[b] - x[a]) * (y[c] - y[a]) == (x[c] - x[a]) * (y[b] - y[a]); 
}
inline int quick_pow(int a, int n)
{
	int res = 1; 
	while (n)
	{
		if (n & 1)
			res = (ll)res * a % MOD; 
		a = (ll)a * a % MOD; 
		n >>= 1; 
	}
	return res; 
}
int main()
{
	// freopen("ARC082-E.in", "r", stdin); 
	int n; 
	scanf("%d", &n); 
	for (int i = 0; i < n; i++)
		scanf("%d%d", x + i, y + i); 
	int ans = (quick_pow(2, n) - n - 1 + MOD) % MOD; 
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if (i == j)
				continue; 
			int cnt = 0; 
			for (int k = 0; k < n; k++)
			{
				if (same(i, j, k))
					seq[cnt++] = k; 
			}
			std::sort(seq, seq + cnt, comp); 
			se.insert(mp(seq[0], seq[1])); 
		}
	}
	for (auto line : se)
	{
		int cnt = 0; 
		for (int i = 0; i < n; i++)
		{
			if (same(line.first, line.second, i))
				cnt++; 
		}
		ans = (ans - quick_pow(2, cnt) + cnt + 1 + MOD) % MOD; 
	}
	printf("%d\n", ans);
	return 0; 
}

Submission Info

Submission Time
Task E - ConvexScore
User diamond_duke
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1357 Byte
Status AC
Exec Time 225 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n); 
                 ^
./Main.cpp:38:30: 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 7 ms 640 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 11 ms 512 KB
1_008.txt AC 8 ms 512 KB
1_009.txt AC 9 ms 512 KB
1_010.txt AC 3 ms 384 KB
1_011.txt AC 10 ms 640 KB
1_012.txt AC 12 ms 768 KB
1_013.txt AC 8 ms 512 KB
1_014.txt AC 1 ms 256 KB
1_015.txt AC 94 ms 256 KB
1_016.txt AC 29 ms 256 KB
1_017.txt AC 21 ms 1152 KB
1_018.txt AC 21 ms 1152 KB
1_019.txt AC 20 ms 640 KB
1_020.txt AC 20 ms 640 KB
1_021.txt AC 20 ms 768 KB
1_022.txt AC 20 ms 896 KB
1_023.txt AC 22 ms 1024 KB
1_024.txt AC 22 ms 1024 KB
1_025.txt AC 24 ms 1024 KB
1_026.txt AC 25 ms 1024 KB
1_027.txt AC 157 ms 256 KB
1_028.txt AC 225 ms 256 KB
1_029.txt AC 26 ms 1024 KB
1_030.txt AC 21 ms 1152 KB
1_031.txt AC 21 ms 1152 KB
1_032.txt AC 21 ms 1152 KB
1_033.txt AC 21 ms 1152 KB
1_034.txt AC 21 ms 1152 KB
1_035.txt AC 32 ms 768 KB