oj.uz

Submission #498779

# Submission time Handle Problem Language Result Execution time Memory
498779 2021-12-26T10:31:47 Z sireanu_vlad Chessboard (IZhO18_chessboard) C++14
16 / 100
 92 ms 2316 KB 
#include <iostream>
using namespace std;

long long n, x, x2;
int k, t;

void f()
{
	x = n*n/2;
	for(int i = n/2; i >= 1; --i)
		if(n % i == 0)
			x = min(x, i*i*((n/i)*(n/i)/2));
	cout << x;
}

bool isprime(long long x)
{
	if(x < 2) return 0;
	if(x == 2 || x == 3) return 1;
	if(x % 2 == 0 || x % 3 == 0) return 0;
	for(int i = 5; i * i <= n; i += 6)
		if(x % i == 0 || x % (i+2) == 0)
			return 0;
	return 1;
}

void f2()
{
	x = n*n/2;
	x2 = x + 1;
	for(int c = 0, i1, i2, j1, j2; c < k; ++c)
	{
		cin >> i1 >> j1 >> i2 >> j2;
		for(int i = i1; i <= i2; ++i)
			for(int j = j1; j <= j2; ++j)
			{
				if(i % 2 == j % 2) x++, x2--;
				if(i % 2 != j % 2) x2++, x--;
			}
	}
	
	cout << min(x, x2);
}

int main()
{
	cin >> n >> k;
	if(k == 0) f();
	else if(isprime(n)) f2();
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1624 KB Output is correct
2 Correct 18 ms 620 KB Output is correct
3 Correct 57 ms 1092 KB Output is correct
4 Correct 46 ms 1016 KB Output is correct
5 Correct 56 ms 1564 KB Output is correct
6 Correct 40 ms 1020 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 48 ms 1096 KB Output is correct
9 Correct 92 ms 2316 KB Output is correct
10 Correct 58 ms 1532 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 1624 KB Output is correct
2 Correct 18 ms 620 KB Output is correct
3 Correct 57 ms 1092 KB Output is correct
4 Correct 46 ms 1016 KB Output is correct
5 Correct 56 ms 1564 KB Output is correct
6 Correct 40 ms 1020 KB Output is correct
7 Correct 9 ms 436 KB Output is correct
8 Correct 48 ms 1096 KB Output is correct
9 Correct 92 ms 2316 KB Output is correct
10 Correct 58 ms 1532 KB Output is correct
11 Incorrect 1 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 66 ms 1624 KB Output is correct
10 Correct 18 ms 620 KB Output is correct
11 Correct 57 ms 1092 KB Output is correct
12 Correct 46 ms 1016 KB Output is correct
13 Correct 56 ms 1564 KB Output is correct
14 Correct 40 ms 1020 KB Output is correct
15 Correct 9 ms 436 KB Output is correct
16 Correct 48 ms 1096 KB Output is correct
17 Correct 92 ms 2316 KB Output is correct
18 Correct 58 ms 1532 KB Output is correct
19 Incorrect 1 ms 204 KB Output isn't correct
20 Halted 0 ms 0 KB -