oj.uz

Submission #495265

# Submission time Handle Problem Language Result Execution time Memory
495265 2021-12-18T08:16:38 Z pragmatist Chessboard (IZhO18_chessboard) C++14
70 / 100
 281 ms 1896 KB 
#include <bits/stdc++.h>                            
 
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define x first
#define y second
#define int long long
#define nl "\n"
 
using namespace std;

typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair <ll, ll> pii;

const int N = (int)3e5 + 7;
const int M = (int)7e6 + 7;
const ll MOD = (ll)1e9 + 7;                    
const int inf = (int)1e9 + 7;
const ll INF = (ll)3e18 + 7;

pii dir[] = {{-1, -1}, {1, 1}, {-1, 1}, {1, -1}};

int n, k;
bool c[1001][1001];

int f(int x, bool cur) {
    int ans = 0;
	for(int i = 1; i <= n; i += x) {
	    bool ok = cur;
	    for(int j = 1; j <= n; j += x) {
	    	int k = j + x - 1, t = i + x - 1;
	    	for(int l = i; l <= t; ++l) {
	    		for(int r = j; r <= k; ++r) {
	    			if(ok) ans += (c[l][r] == 0);
	    			else ans += (c[l][r] == 1);
	    		}
	    	}
	    	ok ^= 1;
	    }
		cur ^= 1;
	}
	return ans;
}

void solve() {          	             
	cin >> n >> k;
	int ans = INF;
	vector<pii> v;
	vector<int> di;
	for(int i = 1; i < n; ++i) {
		if(n % i == 0) {
			di.pb(i);
			int x = n / i;
			int a = (x * x) / 2, b = ((x / 2) * (x / 2)) + (((x + 1) / 2) * ((x + 1) / 2));
			v.pb({a * i * i, b * i * i});
		}
	}
	while(k--) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		for(int i = 0; i < sz(di); ++i) {
			int pos = (x1 + di[i] - 1) / di[i];
			int sop = (y1 + di[i] - 1) / di[i];
			if(pos & 1) {
				if(sop & 1) v[i].x++, v[i].y--;
				else v[i].x--, v[i].y++;
			} else {
				if(sop & 1) v[i].x--, v[i].y++;
				else v[i].x++, v[i].y--;
			} 
		}					
	}             
	for(auto [x, y] : v) ans = min(ans, min(x, y));	
	cout << ans << nl;
}

signed main() {                   
	ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
   	int test = 1;
	//cin >> test;
	for(int i = 1; i <= test; ++i) {
        //cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}
/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

Compilation message

chessboard.cpp: In function 'void solve()':
chessboard.cpp:76:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |  for(auto [x, y] : v) ans = min(ans, min(x, y));
      |           ^

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 0 ms 204 KB Output is correct
4 Correct 0 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 21 ms 204 KB Output is correct
2 Correct 6 ms 204 KB Output is correct
3 Correct 16 ms 316 KB Output is correct
4 Correct 15 ms 320 KB Output is correct
5 Correct 26 ms 204 KB Output is correct
6 Correct 13 ms 324 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 15 ms 204 KB Output is correct
9 Correct 31 ms 300 KB Output is correct
10 Correct 16 ms 320 KB Output is correct

Subtask #3
15.0 / 15.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 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct

Subtask #4
16.0 / 16.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 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 8 ms 204 KB Output is correct
17 Correct 42 ms 204 KB Output is correct
18 Correct 30 ms 204 KB Output is correct
19 Correct 67 ms 204 KB Output is correct
20 Correct 77 ms 304 KB Output is correct
21 Correct 24 ms 320 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 15 ms 320 KB Output is correct
24 Correct 28 ms 204 KB Output is correct
25 Correct 3 ms 204 KB Output is correct
26 Correct 16 ms 316 KB Output is correct
27 Correct 24 ms 204 KB Output is correct
28 Correct 29 ms 204 KB Output is correct
29 Correct 10 ms 204 KB Output is correct
30 Correct 2 ms 204 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 204 KB Output is correct
2 Correct 6 ms 204 KB Output is correct
3 Correct 16 ms 316 KB Output is correct
4 Correct 15 ms 320 KB Output is correct
5 Correct 26 ms 204 KB Output is correct
6 Correct 13 ms 324 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 15 ms 204 KB Output is correct
9 Correct 31 ms 300 KB Output is correct
10 Correct 16 ms 320 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 8 ms 204 KB Output is correct
27 Correct 42 ms 204 KB Output is correct
28 Correct 30 ms 204 KB Output is correct
29 Correct 67 ms 204 KB Output is correct
30 Correct 77 ms 304 KB Output is correct
31 Correct 24 ms 320 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 15 ms 320 KB Output is correct
34 Correct 28 ms 204 KB Output is correct
35 Correct 3 ms 204 KB Output is correct
36 Correct 16 ms 316 KB Output is correct
37 Correct 24 ms 204 KB Output is correct
38 Correct 29 ms 204 KB Output is correct
39 Correct 10 ms 204 KB Output is correct
40 Correct 2 ms 204 KB Output is correct
41 Correct 73 ms 300 KB Output is correct
42 Correct 44 ms 1492 KB Output is correct
43 Correct 48 ms 1204 KB Output is correct
44 Correct 44 ms 1336 KB Output is correct
45 Correct 36 ms 1464 KB Output is correct
46 Correct 75 ms 1424 KB Output is correct
47 Correct 32 ms 1344 KB Output is correct
48 Correct 63 ms 1324 KB Output is correct
49 Correct 31 ms 1304 KB Output is correct
50 Correct 255 ms 1444 KB Output is correct
51 Correct 281 ms 1684 KB Output is correct
52 Correct 245 ms 1544 KB Output is correct
53 Correct 268 ms 1720 KB Output is correct
54 Correct 241 ms 1672 KB Output is correct
55 Correct 271 ms 1896 KB Output is correct
56 Correct 216 ms 1644 KB Output is correct

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 0 ms 204 KB Output is correct
4 Correct 0 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 21 ms 204 KB Output is correct
10 Correct 6 ms 204 KB Output is correct
11 Correct 16 ms 316 KB Output is correct
12 Correct 15 ms 320 KB Output is correct
13 Correct 26 ms 204 KB Output is correct
14 Correct 13 ms 324 KB Output is correct
15 Correct 3 ms 204 KB Output is correct
16 Correct 15 ms 204 KB Output is correct
17 Correct 31 ms 300 KB Output is correct
18 Correct 16 ms 320 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 8 ms 204 KB Output is correct
35 Correct 42 ms 204 KB Output is correct
36 Correct 30 ms 204 KB Output is correct
37 Correct 67 ms 204 KB Output is correct
38 Correct 77 ms 304 KB Output is correct
39 Correct 24 ms 320 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 15 ms 320 KB Output is correct
42 Correct 28 ms 204 KB Output is correct
43 Correct 3 ms 204 KB Output is correct
44 Correct 16 ms 316 KB Output is correct
45 Correct 24 ms 204 KB Output is correct
46 Correct 29 ms 204 KB Output is correct
47 Correct 10 ms 204 KB Output is correct
48 Correct 2 ms 204 KB Output is correct
49 Correct 73 ms 300 KB Output is correct
50 Correct 44 ms 1492 KB Output is correct
51 Correct 48 ms 1204 KB Output is correct
52 Correct 44 ms 1336 KB Output is correct
53 Correct 36 ms 1464 KB Output is correct
54 Correct 75 ms 1424 KB Output is correct
55 Correct 32 ms 1344 KB Output is correct
56 Correct 63 ms 1324 KB Output is correct
57 Correct 31 ms 1304 KB Output is correct
58 Correct 255 ms 1444 KB Output is correct
59 Correct 281 ms 1684 KB Output is correct
60 Correct 245 ms 1544 KB Output is correct
61 Correct 268 ms 1720 KB Output is correct
62 Correct 241 ms 1672 KB Output is correct
63 Correct 271 ms 1896 KB Output is correct
64 Correct 216 ms 1644 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Incorrect 0 ms 204 KB Output isn't correct
67 Halted 0 ms 0 KB -