oj.uz

Submission #684156

# Submission time Handle Problem Language Result Execution time Memory
684156 2023-01-20T14:58:55 Z mychecksedad Chessboard (IZhO18_chessboard) C++17
8 / 100
 67 ms 896 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin() x.end()
#define MOD (1e9+7)
const int N = 1e6;

int n, k;
vector<pair<int, int>> v;
void solve(){
	cin >> n >> k;
	int a = 0;
	for(int i = 0; i < k; ++i){
		int x1, x2, y1, y2; cin >> x1 >> y1 >> x2 >> y2;
		v.pb({x1-1,y1-1});
	}
	int ans = MOD;
	for(int i = 1; i < n; ++i){
		if(n % i == 0){
			for(int rep = 0; rep < 2; ++rep){
				int c = 0;
				for(int j = 0; j < k; ++j){
					bool type = (v[j].first / i + v[j].second / i) % 2;
					c -= type ^ rep;
				}
				ans = min(ans, c + (rep ? ((n/i)*(n/i)/2)*i*i : (((n/i)*(n/i) + 1)/2)*i*i));
			}

		}
	}
	cout << ans;
}

int main(){
	solve();
	return 0;
}

Compilation message

chessboard.cpp: In function 'void solve()':
chessboard.cpp:13:6: warning: unused variable 'a' [-Wunused-variable]
   13 |  int a = 0;
      |      ^

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 67 ms 896 KB Output isn't correct
10 Halted 0 ms 0 KB -