답안 #42735 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42735	2018-03-03T11:43:12 Z	bash	Chessboard (IZhO18_chessboard)	C++14	100 / 100	982 ms	19796 KB

chessboard

/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <bits/stdc++.h>
 
#define F first
#define S second
#define endl '\n'
#define pb push_back
 
#define int __int64_t
 
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;
using namespace std;
 
typedef long long ll;
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;                                              
}
 
int n, k;
 
pair <pair <int, int> ,pair <int, int> > a[MAXN];
/* 
int check(int v) {
	int kvad = v * v;
	int kolvo_1 = (n/v) / 2;
	int kolvo_2 = ((n/v)+1) / 2;
	int ans_1 = kvad * (kolvo_1 * kolvo_1 + kolvo_2 * kolvo_2); /// BLACK First
	int ans_2 = kvad * (kolvo_1 * kolvo_2 + kolvo_2 * kolvo_1); /// WHITE First
	
	for (int i = 1; i <= k; i++) {
		int x = a[i].first.first;                              
		int y = a[i].first.second;
		int num_x = (x + v - 1) / v;
		int num_y = (y + v - 1) / v;
		if ((num_x + num_y) % 2 == 0) {
			ans_1 --;
			ans_2 ++;
		} else {
			ans_1 ++;
			ans_2 --;
		}
	}
	return min(ans_1, ans_2);
}
*/

long long get(long long x, long long len){
	if(x <= 0) return 0;
	long res = (x / len) / 2 * len;
	if(((x / len) & 1) == 1) res += x % len + 1;
	return res;
}

int check(int len){
    long long odd = 0ll, even = 0ll;
	for(int i = 1; i <= k; i++){
		long long x1 = a[i].first.first;
		long long x2 = a[i].second.first;
		long long y1 = a[i].first.second;
		long long y2 = a[i].second.second;		
		long long o1 = get(y2, len) - get(y1 - 1, len);
		long long e1 = (y2 - y1 + 1) - o1;
		long long o2 = get(x2, len) -  get(x1 - 1, len);
		long long e2 = (x2 - x1 + 1) - o2;
		long long od = o1 * e2 + e1 * o2;
		long long ev = (x2 - x1 + 1) * (y2 - y1 + 1) - od;
		odd += od;
		even += ev;
	}
	long long cnt =  (n / len) * (n / len);
	long long res = min(cnt / 2 * len * len + even - odd, (cnt + 1) / 2 * len * len + odd - even);
	return res; 
}

 
main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    n = readInt(), k = readInt();
	for (int i = 1; i <= k; i++) {
		a[i] = {{readInt()-1, readInt()-1}, {readInt()-1, readInt()-1}};
	}
	int ans = 4e18;
	ans = min(check(1), ans);
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0) {
			ans = min(ans, check(i));
			ans = min(ans, check(n/i));						 
		}
	}
	cout << ans;
    return 0;
}

Compilation message

chessboard.cpp:98:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	480 KB	Output is correct
3	Correct	1 ms	480 KB	Output is correct
4	Correct	1 ms	480 KB	Output is correct
5	Correct	1 ms	496 KB	Output is correct
6	Correct	1 ms	532 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	532 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	2468 KB	Output is correct
2	Correct	6 ms	2468 KB	Output is correct
3	Correct	14 ms	2468 KB	Output is correct
4	Correct	15 ms	2468 KB	Output is correct
5	Correct	18 ms	2468 KB	Output is correct
6	Correct	16 ms	2468 KB	Output is correct
7	Correct	4 ms	2468 KB	Output is correct
8	Correct	12 ms	2468 KB	Output is correct
9	Correct	32 ms	3436 KB	Output is correct
10	Correct	19 ms	3436 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	3436 KB	Output is correct
2	Correct	1 ms	3436 KB	Output is correct
3	Correct	2 ms	3436 KB	Output is correct
4	Correct	2 ms	3436 KB	Output is correct
5	Correct	2 ms	3436 KB	Output is correct
6	Correct	2 ms	3436 KB	Output is correct
7	Correct	2 ms	3436 KB	Output is correct
8	Correct	2 ms	3436 KB	Output is correct
9	Correct	2 ms	3436 KB	Output is correct
10	Correct	1 ms	3436 KB	Output is correct
11	Correct	2 ms	3436 KB	Output is correct
12	Correct	1 ms	3436 KB	Output is correct
13	Correct	2 ms	3436 KB	Output is correct
14	Correct	2 ms	3436 KB	Output is correct
15	Correct	2 ms	3436 KB	Output is correct
16	Correct	12 ms	3436 KB	Output is correct
17	Correct	22 ms	3500 KB	Output is correct
18	Correct	41 ms	3920 KB	Output is correct
19	Correct	196 ms	3920 KB	Output is correct
20	Correct	216 ms	3984 KB	Output is correct
21	Correct	21 ms	3984 KB	Output is correct
22	Correct	2 ms	3984 KB	Output is correct
23	Correct	31 ms	3984 KB	Output is correct
24	Correct	37 ms	3984 KB	Output is correct
25	Correct	7 ms	3984 KB	Output is correct
26	Correct	23 ms	3984 KB	Output is correct
27	Correct	39 ms	3984 KB	Output is correct
28	Correct	43 ms	3984 KB	Output is correct
29	Correct	10 ms	3984 KB	Output is correct
30	Correct	2 ms	3984 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	21 ms	2468 KB	Output is correct
2	Correct	6 ms	2468 KB	Output is correct
3	Correct	14 ms	2468 KB	Output is correct
4	Correct	15 ms	2468 KB	Output is correct
5	Correct	18 ms	2468 KB	Output is correct
6	Correct	16 ms	2468 KB	Output is correct
7	Correct	4 ms	2468 KB	Output is correct
8	Correct	12 ms	2468 KB	Output is correct
9	Correct	32 ms	3436 KB	Output is correct
10	Correct	19 ms	3436 KB	Output is correct
11	Correct	2 ms	3436 KB	Output is correct
12	Correct	1 ms	3436 KB	Output is correct
13	Correct	2 ms	3436 KB	Output is correct
14	Correct	2 ms	3436 KB	Output is correct
15	Correct	2 ms	3436 KB	Output is correct
16	Correct	2 ms	3436 KB	Output is correct
17	Correct	2 ms	3436 KB	Output is correct
18	Correct	2 ms	3436 KB	Output is correct
19	Correct	2 ms	3436 KB	Output is correct
20	Correct	1 ms	3436 KB	Output is correct
21	Correct	2 ms	3436 KB	Output is correct
22	Correct	1 ms	3436 KB	Output is correct
23	Correct	2 ms	3436 KB	Output is correct
24	Correct	2 ms	3436 KB	Output is correct
25	Correct	2 ms	3436 KB	Output is correct
26	Correct	12 ms	3436 KB	Output is correct
27	Correct	22 ms	3500 KB	Output is correct
28	Correct	41 ms	3920 KB	Output is correct
29	Correct	196 ms	3920 KB	Output is correct
30	Correct	216 ms	3984 KB	Output is correct
31	Correct	21 ms	3984 KB	Output is correct
32	Correct	2 ms	3984 KB	Output is correct
33	Correct	31 ms	3984 KB	Output is correct
34	Correct	37 ms	3984 KB	Output is correct
35	Correct	7 ms	3984 KB	Output is correct
36	Correct	23 ms	3984 KB	Output is correct
37	Correct	39 ms	3984 KB	Output is correct
38	Correct	43 ms	3984 KB	Output is correct
39	Correct	10 ms	3984 KB	Output is correct
40	Correct	2 ms	3984 KB	Output is correct
41	Correct	166 ms	3984 KB	Output is correct
42	Correct	47 ms	3984 KB	Output is correct
43	Correct	90 ms	3984 KB	Output is correct
44	Correct	54 ms	3984 KB	Output is correct
45	Correct	34 ms	3984 KB	Output is correct
46	Correct	179 ms	3984 KB	Output is correct
47	Correct	28 ms	4240 KB	Output is correct
48	Correct	67 ms	6356 KB	Output is correct
49	Correct	41 ms	8316 KB	Output is correct
50	Correct	867 ms	10720 KB	Output is correct
51	Correct	923 ms	13264 KB	Output is correct
52	Correct	870 ms	15288 KB	Output is correct
53	Correct	910 ms	17728 KB	Output is correct
54	Correct	841 ms	19364 KB	Output is correct
55	Correct	944 ms	19792 KB	Output is correct
56	Correct	831 ms	19792 KB	Output is correct

Subtask #6
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	1 ms	480 KB	Output is correct
3	Correct	1 ms	480 KB	Output is correct
4	Correct	1 ms	480 KB	Output is correct
5	Correct	1 ms	496 KB	Output is correct
6	Correct	1 ms	532 KB	Output is correct
7	Correct	1 ms	532 KB	Output is correct
8	Correct	1 ms	532 KB	Output is correct
9	Correct	21 ms	2468 KB	Output is correct
10	Correct	6 ms	2468 KB	Output is correct
11	Correct	14 ms	2468 KB	Output is correct
12	Correct	15 ms	2468 KB	Output is correct
13	Correct	18 ms	2468 KB	Output is correct
14	Correct	16 ms	2468 KB	Output is correct
15	Correct	4 ms	2468 KB	Output is correct
16	Correct	12 ms	2468 KB	Output is correct
17	Correct	32 ms	3436 KB	Output is correct
18	Correct	19 ms	3436 KB	Output is correct
19	Correct	2 ms	3436 KB	Output is correct
20	Correct	1 ms	3436 KB	Output is correct
21	Correct	2 ms	3436 KB	Output is correct
22	Correct	2 ms	3436 KB	Output is correct
23	Correct	2 ms	3436 KB	Output is correct
24	Correct	2 ms	3436 KB	Output is correct
25	Correct	2 ms	3436 KB	Output is correct
26	Correct	2 ms	3436 KB	Output is correct
27	Correct	2 ms	3436 KB	Output is correct
28	Correct	1 ms	3436 KB	Output is correct
29	Correct	2 ms	3436 KB	Output is correct
30	Correct	1 ms	3436 KB	Output is correct
31	Correct	2 ms	3436 KB	Output is correct
32	Correct	2 ms	3436 KB	Output is correct
33	Correct	2 ms	3436 KB	Output is correct
34	Correct	12 ms	3436 KB	Output is correct
35	Correct	22 ms	3500 KB	Output is correct
36	Correct	41 ms	3920 KB	Output is correct
37	Correct	196 ms	3920 KB	Output is correct
38	Correct	216 ms	3984 KB	Output is correct
39	Correct	21 ms	3984 KB	Output is correct
40	Correct	2 ms	3984 KB	Output is correct
41	Correct	31 ms	3984 KB	Output is correct
42	Correct	37 ms	3984 KB	Output is correct
43	Correct	7 ms	3984 KB	Output is correct
44	Correct	23 ms	3984 KB	Output is correct
45	Correct	39 ms	3984 KB	Output is correct
46	Correct	43 ms	3984 KB	Output is correct
47	Correct	10 ms	3984 KB	Output is correct
48	Correct	2 ms	3984 KB	Output is correct
49	Correct	166 ms	3984 KB	Output is correct
50	Correct	47 ms	3984 KB	Output is correct
51	Correct	90 ms	3984 KB	Output is correct
52	Correct	54 ms	3984 KB	Output is correct
53	Correct	34 ms	3984 KB	Output is correct
54	Correct	179 ms	3984 KB	Output is correct
55	Correct	28 ms	4240 KB	Output is correct
56	Correct	67 ms	6356 KB	Output is correct
57	Correct	41 ms	8316 KB	Output is correct
58	Correct	867 ms	10720 KB	Output is correct
59	Correct	923 ms	13264 KB	Output is correct
60	Correct	870 ms	15288 KB	Output is correct
61	Correct	910 ms	17728 KB	Output is correct
62	Correct	841 ms	19364 KB	Output is correct
63	Correct	944 ms	19792 KB	Output is correct
64	Correct	831 ms	19792 KB	Output is correct
65	Correct	1 ms	19792 KB	Output is correct
66	Correct	1 ms	19792 KB	Output is correct
67	Correct	921 ms	19792 KB	Output is correct
68	Correct	926 ms	19792 KB	Output is correct
69	Correct	784 ms	19792 KB	Output is correct
70	Correct	871 ms	19792 KB	Output is correct
71	Correct	863 ms	19792 KB	Output is correct
72	Correct	825 ms	19792 KB	Output is correct
73	Correct	833 ms	19792 KB	Output is correct
74	Correct	900 ms	19792 KB	Output is correct
75	Correct	858 ms	19792 KB	Output is correct
76	Correct	924 ms	19792 KB	Output is correct
77	Correct	135 ms	19792 KB	Output is correct
78	Correct	45 ms	19792 KB	Output is correct
79	Correct	92 ms	19792 KB	Output is correct
80	Correct	96 ms	19792 KB	Output is correct
81	Correct	89 ms	19792 KB	Output is correct
82	Correct	73 ms	19792 KB	Output is correct
83	Correct	55 ms	19792 KB	Output is correct
84	Correct	537 ms	19792 KB	Output is correct
85	Correct	968 ms	19796 KB	Output is correct
86	Correct	2 ms	19796 KB	Output is correct
87	Correct	1 ms	19796 KB	Output is correct
88	Correct	982 ms	19796 KB	Output is correct
89	Correct	184 ms	19796 KB	Output is correct
90	Correct	1 ms	19796 KB	Output is correct

답안 #42735

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 23.0 / 23.0

Subtask #6 30.0 / 30.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
23.0 / 23.0

Subtask #6
30.0 / 30.0