oj.uz

Submission #378591

# Submission time Handle Problem Language Result Execution time Memory
378591 2021-03-17T02:04:44 Z balbit Chessboard (IZhO18_chessboard) C++14
100 / 100
 1502 ms 11116 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;

#define ll long long
#define int ll
#define f first
#define s second
#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define pii pair<int, int>
#define SZ(x) (int)((x).size())
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define MX(a,b) a = max(a,b)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y){cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT

struct rect{
    int x,y,d;
};

int ps[2][100005];

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);
    bug(1,2);
    int n,k; cin>>n>>k;
    vector<rect> v; v.reserve(k*4);
    ll rr = 0;
    REP(i,k) {
        ll r1,c1,r2,c2; cin>>r1>>c1>>r2>>c2;
        rr += (r2-r1+1) * (c2-c1+1);
        --r1; --c1;
        v.pb({r2,c2,1});
        v.pb({r1,c1,1});
        v.pb({r2,c1,-1});
        v.pb({r1,c2,-1});
    }
    ll re = 1e18;
    for (int d = 1; d<n; ++d) {
        if (n % d == 0) {
            ll totb = (n*n + ((n/d)&1?d*d:0))/2;
            REP1(i,n) {
                if (i) ps[0][i] = ps[0][i-1];
                ps[0][i] += ((i-1)/d)%2==0;
                ps[1][i] = i-ps[0][i];
            }
            bug(d, totb);
            int over = 0;
            for (rect r : v) {
                if (r.x>=0&&r.y>=0) {
                    int tmp = 0;
                    int rx = r.x/d, ry = r.y/d;
                    tmp += (r.x-rx*d) * (ps[((r.x-1)/d)&1][r.y]);
//                    r.x -= r.x%d;
                    tmp += (r.y%d) * (ps[((r.y-1)/d)&1][rx*d]);
//                    r.y -= r.y%d;
//                    --r.x; --r.y;
                    if (((rx)&1) && ((ry)&1)) {
                        tmp += ((rx*ry+1)*d*d)/2;
                    }else{
                        tmp += rx*ry*d*d/2;
                    }
                    over += tmp * r.d;
                }
            }
            bug(over);
            bug(totb + rr - over*2);
//            MX(over, rr-over);
            re = min(re, totb + rr - over*2);
            over = rr-over;
            re = min(re, n*n-totb + rr - over*2);
        }
    }
    cout<<re<<endl;
}

/*
6 8
3 3 3 3
1 2 1 2
3 4 3 4
5 5 5 5
4 3 4 3
4 4 4 4
2 1 2 1
3 6 3 6
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7148 KB Output is correct
2 Correct 8 ms 2156 KB Output is correct
3 Correct 19 ms 5356 KB Output is correct
4 Correct 19 ms 4716 KB Output is correct
5 Correct 25 ms 6380 KB Output is correct
6 Correct 16 ms 4332 KB Output is correct
7 Correct 5 ms 1388 KB Output is correct
8 Correct 16 ms 4332 KB Output is correct
9 Correct 43 ms 9324 KB Output is correct
10 Correct 23 ms 5612 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 16 ms 2924 KB Output is correct
17 Correct 36 ms 8300 KB Output is correct
18 Correct 56 ms 9708 KB Output is correct
19 Correct 250 ms 8684 KB Output is correct
20 Correct 280 ms 9580 KB Output is correct
21 Correct 31 ms 7916 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 40 ms 4332 KB Output is correct
24 Correct 51 ms 8812 KB Output is correct
25 Correct 9 ms 1280 KB Output is correct
26 Correct 34 ms 5612 KB Output is correct
27 Correct 51 ms 6764 KB Output is correct
28 Correct 54 ms 9324 KB Output is correct
29 Correct 13 ms 3436 KB Output is correct
30 Correct 2 ms 620 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7148 KB Output is correct
2 Correct 8 ms 2156 KB Output is correct
3 Correct 19 ms 5356 KB Output is correct
4 Correct 19 ms 4716 KB Output is correct
5 Correct 25 ms 6380 KB Output is correct
6 Correct 16 ms 4332 KB Output is correct
7 Correct 5 ms 1388 KB Output is correct
8 Correct 16 ms 4332 KB Output is correct
9 Correct 43 ms 9324 KB Output is correct
10 Correct 23 ms 5612 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 16 ms 2924 KB Output is correct
27 Correct 36 ms 8300 KB Output is correct
28 Correct 56 ms 9708 KB Output is correct
29 Correct 250 ms 8684 KB Output is correct
30 Correct 280 ms 9580 KB Output is correct
31 Correct 31 ms 7916 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 40 ms 4332 KB Output is correct
34 Correct 51 ms 8812 KB Output is correct
35 Correct 9 ms 1280 KB Output is correct
36 Correct 34 ms 5612 KB Output is correct
37 Correct 51 ms 6764 KB Output is correct
38 Correct 54 ms 9324 KB Output is correct
39 Correct 13 ms 3436 KB Output is correct
40 Correct 2 ms 620 KB Output is correct
41 Correct 248 ms 9624 KB Output is correct
42 Correct 69 ms 10860 KB Output is correct
43 Correct 136 ms 9708 KB Output is correct
44 Correct 62 ms 10476 KB Output is correct
45 Correct 43 ms 11116 KB Output is correct
46 Correct 276 ms 10600 KB Output is correct
47 Correct 38 ms 9964 KB Output is correct
48 Correct 103 ms 10092 KB Output is correct
49 Correct 58 ms 9708 KB Output is correct
50 Correct 1317 ms 10220 KB Output is correct
51 Correct 1405 ms 10732 KB Output is correct
52 Correct 1312 ms 10092 KB Output is correct
53 Correct 1407 ms 10604 KB Output is correct
54 Correct 1320 ms 9964 KB Output is correct
55 Correct 1450 ms 11116 KB Output is correct
56 Correct 1249 ms 9708 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 28 ms 7148 KB Output is correct
10 Correct 8 ms 2156 KB Output is correct
11 Correct 19 ms 5356 KB Output is correct
12 Correct 19 ms 4716 KB Output is correct
13 Correct 25 ms 6380 KB Output is correct
14 Correct 16 ms 4332 KB Output is correct
15 Correct 5 ms 1388 KB Output is correct
16 Correct 16 ms 4332 KB Output is correct
17 Correct 43 ms 9324 KB Output is correct
18 Correct 23 ms 5612 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 16 ms 2924 KB Output is correct
35 Correct 36 ms 8300 KB Output is correct
36 Correct 56 ms 9708 KB Output is correct
37 Correct 250 ms 8684 KB Output is correct
38 Correct 280 ms 9580 KB Output is correct
39 Correct 31 ms 7916 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 40 ms 4332 KB Output is correct
42 Correct 51 ms 8812 KB Output is correct
43 Correct 9 ms 1280 KB Output is correct
44 Correct 34 ms 5612 KB Output is correct
45 Correct 51 ms 6764 KB Output is correct
46 Correct 54 ms 9324 KB Output is correct
47 Correct 13 ms 3436 KB Output is correct
48 Correct 2 ms 620 KB Output is correct
49 Correct 248 ms 9624 KB Output is correct
50 Correct 69 ms 10860 KB Output is correct
51 Correct 136 ms 9708 KB Output is correct
52 Correct 62 ms 10476 KB Output is correct
53 Correct 43 ms 11116 KB Output is correct
54 Correct 276 ms 10600 KB Output is correct
55 Correct 38 ms 9964 KB Output is correct
56 Correct 103 ms 10092 KB Output is correct
57 Correct 58 ms 9708 KB Output is correct
58 Correct 1317 ms 10220 KB Output is correct
59 Correct 1405 ms 10732 KB Output is correct
60 Correct 1312 ms 10092 KB Output is correct
61 Correct 1407 ms 10604 KB Output is correct
62 Correct 1320 ms 9964 KB Output is correct
63 Correct 1450 ms 11116 KB Output is correct
64 Correct 1249 ms 9708 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1350 ms 10348 KB Output is correct
68 Correct 1345 ms 10368 KB Output is correct
69 Correct 1188 ms 9324 KB Output is correct
70 Correct 1329 ms 10092 KB Output is correct
71 Correct 1323 ms 9964 KB Output is correct
72 Correct 1297 ms 9836 KB Output is correct
73 Correct 1249 ms 9580 KB Output is correct
74 Correct 1351 ms 10348 KB Output is correct
75 Correct 1320 ms 9964 KB Output is correct
76 Correct 1389 ms 10476 KB Output is correct
77 Correct 204 ms 11116 KB Output is correct
78 Correct 62 ms 10476 KB Output is correct
79 Correct 134 ms 9836 KB Output is correct
80 Correct 141 ms 10220 KB Output is correct
81 Correct 133 ms 9580 KB Output is correct
82 Correct 107 ms 10732 KB Output is correct
83 Correct 80 ms 9964 KB Output is correct
84 Correct 854 ms 10988 KB Output is correct
85 Correct 1483 ms 10988 KB Output is correct
86 Correct 71 ms 1644 KB Output is correct
87 Correct 72 ms 1644 KB Output is correct
88 Correct 1502 ms 10988 KB Output is correct
89 Correct 330 ms 3436 KB Output is correct
90 Correct 70 ms 1700 KB Output is correct