답안 #43749 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43749	2018-03-22T03:50:26 Z	nickyrio	Chessboard (IZhO18_chessboard)	C++14	70 / 100	2000 ms	262144 KB

chessboard

#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define DEBUG(x) { cerr << #x << '=' << x << endl; }
#define Arr(a, l, r) { cerr << #a << " = {"; FOR(_, l, r) cerr << ' ' << a[_]; cerr << "}\n"; }
#define N 100100
#define pp pair<int, int>
#define endl '\n'
#define IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define taskname ""
#define bit(S, i) (((S) >> (i)) & 1)
using namespace std;
int n, k, xx1[N], xx2[N], xy1[N], xy2[N];

long long cal(int l, int color, int x1, int y1, int x2, int y2) {
    if (x2 < x1 || y2 < y1) return 0;
    int mx1 = (x1 - 1 + l) / l * l, mx2 = (x2 + 1) / l * l - 1;
    int my1 = (y1 - 1 + l) / l * l, my2 = (y2 + 1) / l * l - 1;
    if (x1 / l == x2 / l) {
        if (y1 / l == y2 / l) {
            if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * (x2 - x1 + 1) * (y2 - y1 + 1);
            return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1);
        }
        if (my1 == y1 && my2 == y2) {
            int sz = (y2 + 1 - y1) / l;
            if (sz % 2 == 0) return 0;
            if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * (x2 - x1 + 1) * l;
            return 1ll * (x2 - x1 + 1) * l;;
        }
        return cal(l, color, x1, y1, x2, my1 - 1)
            +  cal(l, color, x1, my1, x2, my2)
            +  cal(l, color, x1, my2 + 1, x2, y2);
    }
    if (mx1 == x1 && mx2 == x2 && y1 == my1 && y2 == my2) {
        int sz = (y2 + 1 - y1) / l * (x2 + 1 - x1) / l;
        if (sz % 2 == 0) return 0;
        if (color ^ (((x1 / l) % 2) == (y1 / l) % 2)) return - 1ll * l * l;
        return l * l;    
    }
    return cal(l, color, x1, y1, mx1 - 1, y2)
        + cal(l, color, mx1, y1, mx2, y2) 
        + cal(l, color, mx2 + 1, y1, x2, y2);
}
long long solve(int l, int color) {// color = 0 -> Top-left is black
    long long ans = ((1ll * (n / l) * (n / l) + 1 - color) / 2) * l * l ;
    /*REP(i, k) {
        if (color ^ (((xx1[i] / l) % 2) == (xy1[i] / l) % 2)) ans--;
        else ans++;
    }*/
    REP(i, k) {
        ans += cal(l, color, xx1[i], xy1[i], xx2[i], xy2[i]);
    }
    return ans;
} 
int main() {
    #ifdef NERO
    freopen("test.inp","r",stdin);
    freopen("test.out","w",stdout);
    clock_t stime = clock();
    #endif //NERO
    scanf("%d %d", &n, &k);
    long long ans = 1e10;
    REP(i, k) scanf("%d %d %d %d", &xx1[i], &xy1[i], &xx2[i], &xy2[i]);
    REP(i, k) xx1[i]--,xx2[i]--,xy1[i]--,xy2[i]--;
    FOR(i, 1, sqrt(n)) if (n % i == 0) {
        ans = min(ans, solve(i, 0));
        ans = min(ans, solve(i, 1));
        if (i != 1) ans = min(ans, solve(n / i, 0));
        if (i != 1) ans = min(ans, solve(n / i, 1));
    }
    printf("%lld", ans);
    #ifdef NERO
    clock_t etime = clock();
    cerr << "Execution time: " << (etime - stime) / CLOCKS_PER_SEC * 1000 << " ms.";
    #endif // NERO
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:62:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
                           ^
chessboard.cpp:64:71: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     REP(i, k) scanf("%d %d %d %d", &xx1[i], &xy1[i], &xx2[i], &xy2[i]);
                                                                       ^

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	1572 KB	Output is correct
2	Correct	11 ms	1572 KB	Output is correct
3	Correct	22 ms	1572 KB	Output is correct
4	Correct	41 ms	1572 KB	Output is correct
5	Correct	31 ms	1572 KB	Output is correct
6	Correct	21 ms	1572 KB	Output is correct
7	Correct	8 ms	1572 KB	Output is correct
8	Correct	34 ms	1572 KB	Output is correct
9	Correct	50 ms	2120 KB	Output is correct
10	Correct	29 ms	2120 KB	Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	2120 KB	Output is correct
2	Correct	1 ms	2120 KB	Output is correct
3	Correct	2 ms	2120 KB	Output is correct
4	Correct	2 ms	2120 KB	Output is correct
5	Correct	2 ms	2120 KB	Output is correct
6	Correct	2 ms	2120 KB	Output is correct
7	Correct	2 ms	2120 KB	Output is correct
8	Correct	3 ms	2120 KB	Output is correct
9	Correct	2 ms	2120 KB	Output is correct
10	Correct	2 ms	2120 KB	Output is correct
11	Correct	2 ms	2120 KB	Output is correct
12	Correct	2 ms	2120 KB	Output is correct
13	Correct	3 ms	2120 KB	Output is correct
14	Correct	2 ms	2120 KB	Output is correct
15	Correct	2 ms	2120 KB	Output is correct
16	Correct	19 ms	2120 KB	Output is correct
17	Correct	49 ms	2120 KB	Output is correct
18	Correct	61 ms	2164 KB	Output is correct
19	Correct	201 ms	2164 KB	Output is correct
20	Correct	223 ms	2164 KB	Output is correct
21	Correct	38 ms	2164 KB	Output is correct
22	Correct	2 ms	2164 KB	Output is correct
23	Correct	38 ms	2164 KB	Output is correct
24	Correct	64 ms	2164 KB	Output is correct
25	Correct	10 ms	2164 KB	Output is correct
26	Correct	35 ms	2164 KB	Output is correct
27	Correct	62 ms	2164 KB	Output is correct
28	Correct	79 ms	2164 KB	Output is correct
29	Correct	21 ms	2164 KB	Output is correct
30	Correct	3 ms	2164 KB	Output is correct

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	1572 KB	Output is correct
2	Correct	11 ms	1572 KB	Output is correct
3	Correct	22 ms	1572 KB	Output is correct
4	Correct	41 ms	1572 KB	Output is correct
5	Correct	31 ms	1572 KB	Output is correct
6	Correct	21 ms	1572 KB	Output is correct
7	Correct	8 ms	1572 KB	Output is correct
8	Correct	34 ms	1572 KB	Output is correct
9	Correct	50 ms	2120 KB	Output is correct
10	Correct	29 ms	2120 KB	Output is correct
11	Correct	2 ms	2120 KB	Output is correct
12	Correct	1 ms	2120 KB	Output is correct
13	Correct	2 ms	2120 KB	Output is correct
14	Correct	2 ms	2120 KB	Output is correct
15	Correct	2 ms	2120 KB	Output is correct
16	Correct	2 ms	2120 KB	Output is correct
17	Correct	2 ms	2120 KB	Output is correct
18	Correct	3 ms	2120 KB	Output is correct
19	Correct	2 ms	2120 KB	Output is correct
20	Correct	2 ms	2120 KB	Output is correct
21	Correct	2 ms	2120 KB	Output is correct
22	Correct	2 ms	2120 KB	Output is correct
23	Correct	3 ms	2120 KB	Output is correct
24	Correct	2 ms	2120 KB	Output is correct
25	Correct	2 ms	2120 KB	Output is correct
26	Correct	19 ms	2120 KB	Output is correct
27	Correct	49 ms	2120 KB	Output is correct
28	Correct	61 ms	2164 KB	Output is correct
29	Correct	201 ms	2164 KB	Output is correct
30	Correct	223 ms	2164 KB	Output is correct
31	Correct	38 ms	2164 KB	Output is correct
32	Correct	2 ms	2164 KB	Output is correct
33	Correct	38 ms	2164 KB	Output is correct
34	Correct	64 ms	2164 KB	Output is correct
35	Correct	10 ms	2164 KB	Output is correct
36	Correct	35 ms	2164 KB	Output is correct
37	Correct	62 ms	2164 KB	Output is correct
38	Correct	79 ms	2164 KB	Output is correct
39	Correct	21 ms	2164 KB	Output is correct
40	Correct	3 ms	2164 KB	Output is correct
41	Correct	202 ms	2164 KB	Output is correct
42	Correct	73 ms	2172 KB	Output is correct
43	Correct	133 ms	2172 KB	Output is correct
44	Correct	66 ms	2172 KB	Output is correct
45	Correct	56 ms	2172 KB	Output is correct
46	Correct	204 ms	2172 KB	Output is correct
47	Correct	48 ms	2172 KB	Output is correct
48	Correct	84 ms	2172 KB	Output is correct
49	Correct	60 ms	2172 KB	Output is correct
50	Correct	833 ms	2172 KB	Output is correct
51	Correct	895 ms	2280 KB	Output is correct
52	Correct	843 ms	2280 KB	Output is correct
53	Correct	880 ms	2280 KB	Output is correct
54	Correct	823 ms	2280 KB	Output is correct
55	Correct	937 ms	2284 KB	Output is correct
56	Correct	820 ms	2284 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	1 ms	424 KB	Output is correct
4	Correct	1 ms	496 KB	Output is correct
5	Correct	1 ms	496 KB	Output is correct
6	Correct	1 ms	496 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	38 ms	1572 KB	Output is correct
10	Correct	11 ms	1572 KB	Output is correct
11	Correct	22 ms	1572 KB	Output is correct
12	Correct	41 ms	1572 KB	Output is correct
13	Correct	31 ms	1572 KB	Output is correct
14	Correct	21 ms	1572 KB	Output is correct
15	Correct	8 ms	1572 KB	Output is correct
16	Correct	34 ms	1572 KB	Output is correct
17	Correct	50 ms	2120 KB	Output is correct
18	Correct	29 ms	2120 KB	Output is correct
19	Correct	2 ms	2120 KB	Output is correct
20	Correct	1 ms	2120 KB	Output is correct
21	Correct	2 ms	2120 KB	Output is correct
22	Correct	2 ms	2120 KB	Output is correct
23	Correct	2 ms	2120 KB	Output is correct
24	Correct	2 ms	2120 KB	Output is correct
25	Correct	2 ms	2120 KB	Output is correct
26	Correct	3 ms	2120 KB	Output is correct
27	Correct	2 ms	2120 KB	Output is correct
28	Correct	2 ms	2120 KB	Output is correct
29	Correct	2 ms	2120 KB	Output is correct
30	Correct	2 ms	2120 KB	Output is correct
31	Correct	3 ms	2120 KB	Output is correct
32	Correct	2 ms	2120 KB	Output is correct
33	Correct	2 ms	2120 KB	Output is correct
34	Correct	19 ms	2120 KB	Output is correct
35	Correct	49 ms	2120 KB	Output is correct
36	Correct	61 ms	2164 KB	Output is correct
37	Correct	201 ms	2164 KB	Output is correct
38	Correct	223 ms	2164 KB	Output is correct
39	Correct	38 ms	2164 KB	Output is correct
40	Correct	2 ms	2164 KB	Output is correct
41	Correct	38 ms	2164 KB	Output is correct
42	Correct	64 ms	2164 KB	Output is correct
43	Correct	10 ms	2164 KB	Output is correct
44	Correct	35 ms	2164 KB	Output is correct
45	Correct	62 ms	2164 KB	Output is correct
46	Correct	79 ms	2164 KB	Output is correct
47	Correct	21 ms	2164 KB	Output is correct
48	Correct	3 ms	2164 KB	Output is correct
49	Correct	202 ms	2164 KB	Output is correct
50	Correct	73 ms	2172 KB	Output is correct
51	Correct	133 ms	2172 KB	Output is correct
52	Correct	66 ms	2172 KB	Output is correct
53	Correct	56 ms	2172 KB	Output is correct
54	Correct	204 ms	2172 KB	Output is correct
55	Correct	48 ms	2172 KB	Output is correct
56	Correct	84 ms	2172 KB	Output is correct
57	Correct	60 ms	2172 KB	Output is correct
58	Correct	833 ms	2172 KB	Output is correct
59	Correct	895 ms	2280 KB	Output is correct
60	Correct	843 ms	2280 KB	Output is correct
61	Correct	880 ms	2280 KB	Output is correct
62	Correct	823 ms	2280 KB	Output is correct
63	Correct	937 ms	2284 KB	Output is correct
64	Correct	820 ms	2284 KB	Output is correct
65	Correct	1 ms	2284 KB	Output is correct
66	Correct	1 ms	2284 KB	Output is correct
67	Execution timed out	2098 ms	262144 KB	Time limit exceeded
68	Halted	0 ms	0 KB	-

답안 #43749

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 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
0 / 30.0