oj.uz

답안 #784628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784628 2023-07-16T11:17:20 Z ToniB Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 9632 KB 
#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
const int MAXN = 1e5 + 5;
const int OFF = 1 << 18;
typedef long long ll;

int n, k, tour[OFF];
vector<pair<int, int> > v[MAXN];
bool prop[OFF];

void propagate(int x, int l, int r){
	prop[x] = 0;
	tour[x] = r - l + 1 - tour[x];
	if(l != r){
		prop[x * 2 + 1] ^= 1;
		prop[x * 2 + 2] ^= 1;
	}
}

void upd(int x, int l, int r, int ql, int qr){
	if(prop[x]) propagate(x, l, r);
	if(ql <= l && r <= qr){
		prop[x] = 1;
		propagate(x, l, r);
		return ;
	}
	if(ql > r || l > qr) return ;
	int mid = (l + r) >> 1;
	upd(x * 2 + 1, l, mid, ql, qr);
	upd(x * 2 + 2, mid + 1, r, ql, qr);
	tour[x] = tour[x * 2 + 1] + tour[x * 2 + 2];
}

ll solve(int k){
	ll ret = 5e9;
	for(int b = 0; b < 2; ++b){
		memset(tour, 0, sizeof tour);
		memset(prop, 0, sizeof prop);
		ll cur = 0;
		for(int i = b * k; i < n; i += 2 * k){
			upd(0, 0, n - 1, i, i + k - 1);
		}
		for(int i = 0; i < n; ++i){
			for(pair<int, int> p : v[i]){
				upd(0, 0, n - 1, p.X, p.Y);
			}
			if(i % k == 0) upd(0, 0, n - 1, 0, n - 1);
			cur += tour[0];
		}
		ret = min(ret, cur);
	}
	return ret;
}

int main(){
	cin >> n >> k;
	for(int i = 0; i < k; ++i){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		--x1, --y1, --x2, --y2;
		v[x1].push_back({y1, y2});
		v[x2 + 1].push_back({y1, y2});
	}
	long long ans = 5e9;
	for(int i = 1; i < n; ++i){
		if(n % i == 0){
			ans = min(ans, solve(i));
		}
	}
	cout << ans;
	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3924 KB Output is correct
2 Correct 3 ms 3928 KB Output is correct
3 Correct 2 ms 3928 KB Output is correct
4 Correct 2 ms 3924 KB Output is correct
5 Correct 2 ms 3816 KB Output is correct
6 Correct 2 ms 3924 KB Output is correct
7 Correct 2 ms 3924 KB Output is correct
8 Correct 2 ms 3924 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 6464 KB Output is correct
2 Correct 39 ms 4784 KB Output is correct
3 Correct 98 ms 6548 KB Output is correct
4 Correct 79 ms 6084 KB Output is correct
5 Correct 119 ms 7128 KB Output is correct
6 Correct 81 ms 6044 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 82 ms 5976 KB Output is correct
9 Correct 178 ms 8652 KB Output is correct
10 Correct 135 ms 6700 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3924 KB Output is correct
2 Correct 2 ms 3824 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 6 ms 3964 KB Output is correct
5 Correct 3 ms 3924 KB Output is correct
6 Correct 3 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 3 ms 3924 KB Output is correct
9 Correct 3 ms 3924 KB Output is correct
10 Correct 2 ms 3816 KB Output is correct
11 Correct 3 ms 3924 KB Output is correct
12 Correct 2 ms 3924 KB Output is correct
13 Correct 4 ms 3924 KB Output is correct
14 Correct 4 ms 3924 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3924 KB Output is correct
2 Correct 2 ms 3824 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 6 ms 3964 KB Output is correct
5 Correct 3 ms 3924 KB Output is correct
6 Correct 3 ms 3924 KB Output is correct
7 Correct 3 ms 3924 KB Output is correct
8 Correct 3 ms 3924 KB Output is correct
9 Correct 3 ms 3924 KB Output is correct
10 Correct 2 ms 3816 KB Output is correct
11 Correct 3 ms 3924 KB Output is correct
12 Correct 2 ms 3924 KB Output is correct
13 Correct 4 ms 3924 KB Output is correct
14 Correct 4 ms 3924 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 60 ms 4604 KB Output is correct
17 Correct 106 ms 6160 KB Output is correct
18 Correct 232 ms 6092 KB Output is correct
19 Correct 1303 ms 6076 KB Output is correct
20 Correct 1263 ms 6068 KB Output is correct
21 Correct 97 ms 6096 KB Output is correct
22 Correct 8 ms 3952 KB Output is correct
23 Correct 172 ms 5024 KB Output is correct
24 Correct 186 ms 6148 KB Output is correct
25 Correct 36 ms 4180 KB Output is correct
26 Correct 116 ms 5252 KB Output is correct
27 Correct 202 ms 5960 KB Output is correct
28 Correct 203 ms 6080 KB Output is correct
29 Correct 45 ms 4820 KB Output is correct
30 Correct 10 ms 3924 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 6464 KB Output is correct
2 Correct 39 ms 4784 KB Output is correct
3 Correct 98 ms 6548 KB Output is correct
4 Correct 79 ms 6084 KB Output is correct
5 Correct 119 ms 7128 KB Output is correct
6 Correct 81 ms 6044 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 82 ms 5976 KB Output is correct
9 Correct 178 ms 8652 KB Output is correct
10 Correct 135 ms 6700 KB Output is correct
11 Correct 4 ms 3924 KB Output is correct
12 Correct 2 ms 3824 KB Output is correct
13 Correct 3 ms 3924 KB Output is correct
14 Correct 6 ms 3964 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 3 ms 3924 KB Output is correct
17 Correct 3 ms 3924 KB Output is correct
18 Correct 3 ms 3924 KB Output is correct
19 Correct 3 ms 3924 KB Output is correct
20 Correct 2 ms 3816 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 2 ms 3924 KB Output is correct
23 Correct 4 ms 3924 KB Output is correct
24 Correct 4 ms 3924 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct
26 Correct 60 ms 4604 KB Output is correct
27 Correct 106 ms 6160 KB Output is correct
28 Correct 232 ms 6092 KB Output is correct
29 Correct 1303 ms 6076 KB Output is correct
30 Correct 1263 ms 6068 KB Output is correct
31 Correct 97 ms 6096 KB Output is correct
32 Correct 8 ms 3952 KB Output is correct
33 Correct 172 ms 5024 KB Output is correct
34 Correct 186 ms 6148 KB Output is correct
35 Correct 36 ms 4180 KB Output is correct
36 Correct 116 ms 5252 KB Output is correct
37 Correct 202 ms 5960 KB Output is correct
38 Correct 203 ms 6080 KB Output is correct
39 Correct 45 ms 4820 KB Output is correct
40 Correct 10 ms 3924 KB Output is correct
41 Correct 1800 ms 8908 KB Output is correct
42 Correct 380 ms 9508 KB Output is correct
43 Correct 945 ms 8928 KB Output is correct
44 Correct 370 ms 9332 KB Output is correct
45 Correct 213 ms 9632 KB Output is correct
46 Execution timed out 2055 ms 9432 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3924 KB Output is correct
2 Correct 3 ms 3928 KB Output is correct
3 Correct 2 ms 3928 KB Output is correct
4 Correct 2 ms 3924 KB Output is correct
5 Correct 2 ms 3816 KB Output is correct
6 Correct 2 ms 3924 KB Output is correct
7 Correct 2 ms 3924 KB Output is correct
8 Correct 2 ms 3924 KB Output is correct
9 Correct 146 ms 6464 KB Output is correct
10 Correct 39 ms 4784 KB Output is correct
11 Correct 98 ms 6548 KB Output is correct
12 Correct 79 ms 6084 KB Output is correct
13 Correct 119 ms 7128 KB Output is correct
14 Correct 81 ms 6044 KB Output is correct
15 Correct 19 ms 4444 KB Output is correct
16 Correct 82 ms 5976 KB Output is correct
17 Correct 178 ms 8652 KB Output is correct
18 Correct 135 ms 6700 KB Output is correct
19 Correct 4 ms 3924 KB Output is correct
20 Correct 2 ms 3824 KB Output is correct
21 Correct 3 ms 3924 KB Output is correct
22 Correct 6 ms 3964 KB Output is correct
23 Correct 3 ms 3924 KB Output is correct
24 Correct 3 ms 3924 KB Output is correct
25 Correct 3 ms 3924 KB Output is correct
26 Correct 3 ms 3924 KB Output is correct
27 Correct 3 ms 3924 KB Output is correct
28 Correct 2 ms 3816 KB Output is correct
29 Correct 3 ms 3924 KB Output is correct
30 Correct 2 ms 3924 KB Output is correct
31 Correct 4 ms 3924 KB Output is correct
32 Correct 4 ms 3924 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 60 ms 4604 KB Output is correct
35 Correct 106 ms 6160 KB Output is correct
36 Correct 232 ms 6092 KB Output is correct
37 Correct 1303 ms 6076 KB Output is correct
38 Correct 1263 ms 6068 KB Output is correct
39 Correct 97 ms 6096 KB Output is correct
40 Correct 8 ms 3952 KB Output is correct
41 Correct 172 ms 5024 KB Output is correct
42 Correct 186 ms 6148 KB Output is correct
43 Correct 36 ms 4180 KB Output is correct
44 Correct 116 ms 5252 KB Output is correct
45 Correct 202 ms 5960 KB Output is correct
46 Correct 203 ms 6080 KB Output is correct
47 Correct 45 ms 4820 KB Output is correct
48 Correct 10 ms 3924 KB Output is correct
49 Correct 1800 ms 8908 KB Output is correct
50 Correct 380 ms 9508 KB Output is correct
51 Correct 945 ms 8928 KB Output is correct
52 Correct 370 ms 9332 KB Output is correct
53 Correct 213 ms 9632 KB Output is correct
54 Execution timed out 2055 ms 9432 KB Time limit exceeded
55 Halted 0 ms 0 KB -