oj.uz

Submission #43750

# Submission time Handle Problem Language Result Execution time Memory
43750 2018-03-22T03:59:51 Z nickyrio Chessboard (IZhO18_chessboard) C++14
70 / 100
 2000 ms 262144 KB 
#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];

pp operator+ (pp a, pp b) {
    return pp(a.first + b.first, a.second + b.second);
}
pp cal(int l, int x1, int y1, int x2, int y2) {
    if (x2 < x1 || y2 < y1) return pp(0, 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 (((x1 / l) % 2) == (y1 / l) % 2) return pp(0, 1ll * (x2 - x1 + 1) * (y2 - y1 + 1));
            return pp(1ll * (x2 - x1 + 1) * (y2 - y1 + 1), 0);
        }
        if (my1 == y1 && my2 == y2) {
            int sz = (y2 + 1 - y1) / l;
            if (sz % 2 == 0) return pp(0, 0);
            if (((x1 / l) % 2) == (y1 / l) % 2) return pp(0, 1ll * (x2 - x1 + 1) * l);
            return pp(1ll * (x2 - x1 + 1) * l, 0);
        }
        return cal(l, x1, y1, x2, my1 - 1)
            +  cal(l, x1, my1, x2, my2)
            +  cal(l, 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 pp(0, 0);
        if (((x1 / l) % 2) == (y1 / l) % 2) return pp(0, 1ll * l * l);
        return pp(1ll * l * l, 0);    
    }
    return cal(l,  x1, y1, mx1 - 1, y2)
        + cal(l, mx1, y1, mx2, y2) 
        + cal(l, mx2 + 1, y1, x2, y2);
}
long long solve(int l) {// color = 0 -> Top-left is black
    long long ans1 = ((1ll * (n / l) * (n / l) + 1) / 2) * l * l;
    long long ans2 = ((1ll * (n / l) * (n / l)) / 2) * l * l; 
    /*REP(i, k) {
        if (color ^ (((xx1[i] / l) % 2) == (xy1[i] / l) % 2)) ans--;
        else ans++;
    }*/
    REP(i, k) {
        pp t =  cal(l, xx1[i], xy1[i], xx2[i], xy2[i]);
        ans1 += t.first - t.second;
        ans2 += t.second - t.first;
    }
    return min(ans1, ans2);
} 
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]--;
    ans = solve(1);
    FOR(i, 2, sqrt(n)) if (n % i == 0) {
        ans = min(ans, min(solve(i), solve(n / i)));
    }
    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:68: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:70: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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 476 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Correct 2 ms 548 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1560 KB Output is correct
2 Correct 10 ms 1560 KB Output is correct
3 Correct 23 ms 1560 KB Output is correct
4 Correct 23 ms 1560 KB Output is correct
5 Correct 31 ms 1560 KB Output is correct
6 Correct 20 ms 1560 KB Output is correct
7 Correct 5 ms 1560 KB Output is correct
8 Correct 19 ms 1560 KB Output is correct
9 Correct 49 ms 1904 KB Output is correct
10 Correct 28 ms 1904 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1904 KB Output is correct
2 Correct 2 ms 1904 KB Output is correct
3 Correct 2 ms 1904 KB Output is correct
4 Correct 2 ms 1904 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1904 KB Output is correct
7 Correct 2 ms 1904 KB Output is correct
8 Correct 2 ms 1904 KB Output is correct
9 Correct 2 ms 1904 KB Output is correct
10 Correct 2 ms 1904 KB Output is correct
11 Correct 2 ms 1904 KB Output is correct
12 Correct 3 ms 1904 KB Output is correct
13 Correct 2 ms 1904 KB Output is correct
14 Correct 3 ms 1904 KB Output is correct
15 Correct 2 ms 1904 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1904 KB Output is correct
2 Correct 2 ms 1904 KB Output is correct
3 Correct 2 ms 1904 KB Output is correct
4 Correct 2 ms 1904 KB Output is correct
5 Correct 2 ms 1904 KB Output is correct
6 Correct 2 ms 1904 KB Output is correct
7 Correct 2 ms 1904 KB Output is correct
8 Correct 2 ms 1904 KB Output is correct
9 Correct 2 ms 1904 KB Output is correct
10 Correct 2 ms 1904 KB Output is correct
11 Correct 2 ms 1904 KB Output is correct
12 Correct 3 ms 1904 KB Output is correct
13 Correct 2 ms 1904 KB Output is correct
14 Correct 3 ms 1904 KB Output is correct
15 Correct 2 ms 1904 KB Output is correct
16 Correct 16 ms 1904 KB Output is correct
17 Correct 43 ms 1904 KB Output is correct
18 Correct 53 ms 2156 KB Output is correct
19 Correct 122 ms 2156 KB Output is correct
20 Correct 133 ms 2284 KB Output is correct
21 Correct 38 ms 2284 KB Output is correct
22 Correct 2 ms 2284 KB Output is correct
23 Correct 29 ms 2284 KB Output is correct
24 Correct 51 ms 2284 KB Output is correct
25 Correct 7 ms 2284 KB Output is correct
26 Correct 30 ms 2284 KB Output is correct
27 Correct 41 ms 2284 KB Output is correct
28 Correct 51 ms 2284 KB Output is correct
29 Correct 17 ms 2284 KB Output is correct
30 Correct 3 ms 2284 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1560 KB Output is correct
2 Correct 10 ms 1560 KB Output is correct
3 Correct 23 ms 1560 KB Output is correct
4 Correct 23 ms 1560 KB Output is correct
5 Correct 31 ms 1560 KB Output is correct
6 Correct 20 ms 1560 KB Output is correct
7 Correct 5 ms 1560 KB Output is correct
8 Correct 19 ms 1560 KB Output is correct
9 Correct 49 ms 1904 KB Output is correct
10 Correct 28 ms 1904 KB Output is correct
11 Correct 2 ms 1904 KB Output is correct
12 Correct 2 ms 1904 KB Output is correct
13 Correct 2 ms 1904 KB Output is correct
14 Correct 2 ms 1904 KB Output is correct
15 Correct 2 ms 1904 KB Output is correct
16 Correct 2 ms 1904 KB Output is correct
17 Correct 2 ms 1904 KB Output is correct
18 Correct 2 ms 1904 KB Output is correct
19 Correct 2 ms 1904 KB Output is correct
20 Correct 2 ms 1904 KB Output is correct
21 Correct 2 ms 1904 KB Output is correct
22 Correct 3 ms 1904 KB Output is correct
23 Correct 2 ms 1904 KB Output is correct
24 Correct 3 ms 1904 KB Output is correct
25 Correct 2 ms 1904 KB Output is correct
26 Correct 16 ms 1904 KB Output is correct
27 Correct 43 ms 1904 KB Output is correct
28 Correct 53 ms 2156 KB Output is correct
29 Correct 122 ms 2156 KB Output is correct
30 Correct 133 ms 2284 KB Output is correct
31 Correct 38 ms 2284 KB Output is correct
32 Correct 2 ms 2284 KB Output is correct
33 Correct 29 ms 2284 KB Output is correct
34 Correct 51 ms 2284 KB Output is correct
35 Correct 7 ms 2284 KB Output is correct
36 Correct 30 ms 2284 KB Output is correct
37 Correct 41 ms 2284 KB Output is correct
38 Correct 51 ms 2284 KB Output is correct
39 Correct 17 ms 2284 KB Output is correct
40 Correct 3 ms 2284 KB Output is correct
41 Correct 132 ms 2284 KB Output is correct
42 Correct 58 ms 2284 KB Output is correct
43 Correct 75 ms 2284 KB Output is correct
44 Correct 56 ms 2284 KB Output is correct
45 Correct 55 ms 2284 KB Output is correct
46 Correct 123 ms 2284 KB Output is correct
47 Correct 46 ms 2284 KB Output is correct
48 Correct 66 ms 2284 KB Output is correct
49 Correct 58 ms 2284 KB Output is correct
50 Correct 460 ms 2284 KB Output is correct
51 Correct 492 ms 2284 KB Output is correct
52 Correct 454 ms 2284 KB Output is correct
53 Correct 510 ms 2284 KB Output is correct
54 Correct 587 ms 2284 KB Output is correct
55 Correct 580 ms 2284 KB Output is correct
56 Correct 500 ms 2284 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 476 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 2 ms 528 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 34 ms 1560 KB Output is correct
10 Correct 10 ms 1560 KB Output is correct
11 Correct 23 ms 1560 KB Output is correct
12 Correct 23 ms 1560 KB Output is correct
13 Correct 31 ms 1560 KB Output is correct
14 Correct 20 ms 1560 KB Output is correct
15 Correct 5 ms 1560 KB Output is correct
16 Correct 19 ms 1560 KB Output is correct
17 Correct 49 ms 1904 KB Output is correct
18 Correct 28 ms 1904 KB Output is correct
19 Correct 2 ms 1904 KB Output is correct
20 Correct 2 ms 1904 KB Output is correct
21 Correct 2 ms 1904 KB Output is correct
22 Correct 2 ms 1904 KB Output is correct
23 Correct 2 ms 1904 KB Output is correct
24 Correct 2 ms 1904 KB Output is correct
25 Correct 2 ms 1904 KB Output is correct
26 Correct 2 ms 1904 KB Output is correct
27 Correct 2 ms 1904 KB Output is correct
28 Correct 2 ms 1904 KB Output is correct
29 Correct 2 ms 1904 KB Output is correct
30 Correct 3 ms 1904 KB Output is correct
31 Correct 2 ms 1904 KB Output is correct
32 Correct 3 ms 1904 KB Output is correct
33 Correct 2 ms 1904 KB Output is correct
34 Correct 16 ms 1904 KB Output is correct
35 Correct 43 ms 1904 KB Output is correct
36 Correct 53 ms 2156 KB Output is correct
37 Correct 122 ms 2156 KB Output is correct
38 Correct 133 ms 2284 KB Output is correct
39 Correct 38 ms 2284 KB Output is correct
40 Correct 2 ms 2284 KB Output is correct
41 Correct 29 ms 2284 KB Output is correct
42 Correct 51 ms 2284 KB Output is correct
43 Correct 7 ms 2284 KB Output is correct
44 Correct 30 ms 2284 KB Output is correct
45 Correct 41 ms 2284 KB Output is correct
46 Correct 51 ms 2284 KB Output is correct
47 Correct 17 ms 2284 KB Output is correct
48 Correct 3 ms 2284 KB Output is correct
49 Correct 132 ms 2284 KB Output is correct
50 Correct 58 ms 2284 KB Output is correct
51 Correct 75 ms 2284 KB Output is correct
52 Correct 56 ms 2284 KB Output is correct
53 Correct 55 ms 2284 KB Output is correct
54 Correct 123 ms 2284 KB Output is correct
55 Correct 46 ms 2284 KB Output is correct
56 Correct 66 ms 2284 KB Output is correct
57 Correct 58 ms 2284 KB Output is correct
58 Correct 460 ms 2284 KB Output is correct
59 Correct 492 ms 2284 KB Output is correct
60 Correct 454 ms 2284 KB Output is correct
61 Correct 510 ms 2284 KB Output is correct
62 Correct 587 ms 2284 KB Output is correct
63 Correct 580 ms 2284 KB Output is correct
64 Correct 500 ms 2284 KB Output is correct
65 Correct 2 ms 2284 KB Output is correct
66 Correct 2 ms 2284 KB Output is correct
67 Execution timed out 2097 ms 262144 KB Time limit exceeded
68 Halted 0 ms 0 KB -