oj.uz

답안 #684238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684238 2023-01-20T18:10:04 Z mychecksedad Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 4540 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;

ll n, k, ans = 1e18;
vector<array<ll, 4>> vv;

ll wh(ll x, ll y, ll d){
	x++, y++;
	if(x <= 0 || y <= 0) return 0;
	ll xd = x / d;
	ll yd = y / d;
	ll res = (xd * yd >> 1) * d * d;
	if(x % (2*d) >= d){
		ll y1 = (yd >> 1) * 2 * d;
		res += (yd >> 1) * (x % d) * d;
		res += (x % d) * min(d, y % (2*d));
	}else{
		ll y1 = (yd >> 1) * 2 * d;
		res += (yd >> 1) * (x % d) * d;
	}
	if(y % (2*d) >= d){
		ll x1 = (xd >> 1) * 2*d;
		res += (xd >> 1) * (y % d) * d;
		res += (y % d) * min(d, x % (2*d));
	}else{
		ll x1 = (xd >> 1) * 2*d;
		res += x1 / (2*d) * (y % d) * d;
	}
	return res;
}
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;
		vv.pb({x1-1,y1-1,x2-1,y2-1});
	}
	for(ll i = 1; i < n; ++i){
		if(n % i == 0){
			for(int rep = 0; rep < 2; ++rep){
				ll c = 0;
				for(auto v: vv){
					ll white = wh(v[2], v[3], i) - wh(v[0] - 1, v[3], i) - wh(v[2], v[1] - 1, i) + wh(v[0] - 1, v[1] - 1, i);					
					ll black = (v[2] + 1) * (v[3] + 1) - (v[0]) * (v[3] + 1) - (v[2] + 1) * (v[1]) + (v[0] * v[1]) - white;					
					ll val = white - black;
					if(!rep) c += val;
					else c -= val;
				}
				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 'll wh(ll, ll, ll)':
chessboard.cpp:19:6: warning: unused variable 'y1' [-Wunused-variable]
   19 |   ll y1 = (yd >> 1) * 2 * d;
      |      ^~
chessboard.cpp:23:6: warning: unused variable 'y1' [-Wunused-variable]
   23 |   ll y1 = (yd >> 1) * 2 * d;
      |      ^~
chessboard.cpp:27:6: warning: unused variable 'x1' [-Wunused-variable]
   27 |   ll x1 = (xd >> 1) * 2*d;
      |      ^~
chessboard.cpp: In function 'void solve()':
chessboard.cpp:38:6: warning: unused variable 'a' [-Wunused-variable]
   38 |  int a = 0;
      |      ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 0 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
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 2444 KB Output is correct
2 Correct 23 ms 1412 KB Output is correct
3 Correct 68 ms 2372 KB Output is correct
4 Correct 58 ms 2380 KB Output is correct
5 Correct 76 ms 2388 KB Output is correct
6 Correct 46 ms 2368 KB Output is correct
7 Correct 10 ms 596 KB Output is correct
8 Correct 49 ms 2368 KB Output is correct
9 Correct 130 ms 4440 KB Output is correct
10 Correct 67 ms 2368 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 2 ms 360 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 2 ms 360 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 45 ms 1456 KB Output is correct
17 Correct 91 ms 4468 KB Output is correct
18 Correct 141 ms 4408 KB Output is correct
19 Correct 557 ms 4448 KB Output is correct
20 Correct 628 ms 4492 KB Output is correct
21 Correct 102 ms 4516 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 95 ms 2392 KB Output is correct
24 Correct 130 ms 4412 KB Output is correct
25 Correct 19 ms 848 KB Output is correct
26 Correct 84 ms 2448 KB Output is correct
27 Correct 138 ms 4520 KB Output is correct
28 Correct 140 ms 4408 KB Output is correct
29 Correct 35 ms 2376 KB Output is correct
30 Correct 4 ms 468 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 2444 KB Output is correct
2 Correct 23 ms 1412 KB Output is correct
3 Correct 68 ms 2372 KB Output is correct
4 Correct 58 ms 2380 KB Output is correct
5 Correct 76 ms 2388 KB Output is correct
6 Correct 46 ms 2368 KB Output is correct
7 Correct 10 ms 596 KB Output is correct
8 Correct 49 ms 2368 KB Output is correct
9 Correct 130 ms 4440 KB Output is correct
10 Correct 67 ms 2368 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 2 ms 360 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 45 ms 1456 KB Output is correct
27 Correct 91 ms 4468 KB Output is correct
28 Correct 141 ms 4408 KB Output is correct
29 Correct 557 ms 4448 KB Output is correct
30 Correct 628 ms 4492 KB Output is correct
31 Correct 102 ms 4516 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 95 ms 2392 KB Output is correct
34 Correct 130 ms 4412 KB Output is correct
35 Correct 19 ms 848 KB Output is correct
36 Correct 84 ms 2448 KB Output is correct
37 Correct 138 ms 4520 KB Output is correct
38 Correct 140 ms 4408 KB Output is correct
39 Correct 35 ms 2376 KB Output is correct
40 Correct 4 ms 468 KB Output is correct
41 Correct 559 ms 4540 KB Output is correct
42 Correct 164 ms 4508 KB Output is correct
43 Correct 292 ms 4468 KB Output is correct
44 Correct 182 ms 4464 KB Output is correct
45 Correct 128 ms 4496 KB Output is correct
46 Correct 573 ms 4408 KB Output is correct
47 Correct 120 ms 4464 KB Output is correct
48 Correct 226 ms 4492 KB Output is correct
49 Correct 149 ms 4484 KB Output is correct
50 Execution timed out 2088 ms 4472 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 0 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 Correct 86 ms 2444 KB Output is correct
10 Correct 23 ms 1412 KB Output is correct
11 Correct 68 ms 2372 KB Output is correct
12 Correct 58 ms 2380 KB Output is correct
13 Correct 76 ms 2388 KB Output is correct
14 Correct 46 ms 2368 KB Output is correct
15 Correct 10 ms 596 KB Output is correct
16 Correct 49 ms 2368 KB Output is correct
17 Correct 130 ms 4440 KB Output is correct
18 Correct 67 ms 2368 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 2 ms 360 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 45 ms 1456 KB Output is correct
35 Correct 91 ms 4468 KB Output is correct
36 Correct 141 ms 4408 KB Output is correct
37 Correct 557 ms 4448 KB Output is correct
38 Correct 628 ms 4492 KB Output is correct
39 Correct 102 ms 4516 KB Output is correct
40 Correct 2 ms 212 KB Output is correct
41 Correct 95 ms 2392 KB Output is correct
42 Correct 130 ms 4412 KB Output is correct
43 Correct 19 ms 848 KB Output is correct
44 Correct 84 ms 2448 KB Output is correct
45 Correct 138 ms 4520 KB Output is correct
46 Correct 140 ms 4408 KB Output is correct
47 Correct 35 ms 2376 KB Output is correct
48 Correct 4 ms 468 KB Output is correct
49 Correct 559 ms 4540 KB Output is correct
50 Correct 164 ms 4508 KB Output is correct
51 Correct 292 ms 4468 KB Output is correct
52 Correct 182 ms 4464 KB Output is correct
53 Correct 128 ms 4496 KB Output is correct
54 Correct 573 ms 4408 KB Output is correct
55 Correct 120 ms 4464 KB Output is correct
56 Correct 226 ms 4492 KB Output is correct
57 Correct 149 ms 4484 KB Output is correct
58 Execution timed out 2088 ms 4472 KB Time limit exceeded
59 Halted 0 ms 0 KB -