oj.uz

답안 #378567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378567 2021-03-17T01:49:48 Z balbit Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 12140 KB 
#include <bits/stdc++.h>
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; --r2; --c2; --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;
                    ++r.x; ++r.y;
                    tmp += (r.x%d) * (ps[((r.x-1)/d)&1][r.y]);
                    tmp += (r.y%d) * (ps[((r.y-1)/d)&1][r.x-r.x%d]);
                    r.x -= r.x%d; r.y -= r.y%d;
//                    --r.x; --r.y;
                    if (((r.x/d)&1) && ((r.y/d)&1)) {
                        tmp += ((r.x*r.y)+d*d)/2;
                    }else{
                        tmp += r.x*r.y/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

# 결과 실행 시간 메모리 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 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 1 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 7660 KB Output is correct
2 Correct 11 ms 2412 KB Output is correct
3 Correct 27 ms 5996 KB Output is correct
4 Correct 27 ms 5228 KB Output is correct
5 Correct 35 ms 7020 KB Output is correct
6 Correct 23 ms 4844 KB Output is correct
7 Correct 6 ms 1516 KB Output is correct
8 Correct 23 ms 4844 KB Output is correct
9 Correct 57 ms 10220 KB Output is correct
10 Correct 34 ms 6252 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 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 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 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 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 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 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 25 ms 3308 KB Output is correct
17 Correct 46 ms 8812 KB Output is correct
18 Correct 80 ms 10220 KB Output is correct
19 Correct 362 ms 9196 KB Output is correct
20 Correct 407 ms 10092 KB Output is correct
21 Correct 44 ms 8428 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 58 ms 4844 KB Output is correct
24 Correct 73 ms 9324 KB Output is correct
25 Correct 12 ms 1260 KB Output is correct
26 Correct 49 ms 6124 KB Output is correct
27 Correct 75 ms 7276 KB Output is correct
28 Correct 79 ms 9836 KB Output is correct
29 Correct 18 ms 3948 KB Output is correct
30 Correct 3 ms 620 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 7660 KB Output is correct
2 Correct 11 ms 2412 KB Output is correct
3 Correct 27 ms 5996 KB Output is correct
4 Correct 27 ms 5228 KB Output is correct
5 Correct 35 ms 7020 KB Output is correct
6 Correct 23 ms 4844 KB Output is correct
7 Correct 6 ms 1516 KB Output is correct
8 Correct 23 ms 4844 KB Output is correct
9 Correct 57 ms 10220 KB Output is correct
10 Correct 34 ms 6252 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 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 2 ms 364 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 1 ms 364 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 25 ms 3308 KB Output is correct
27 Correct 46 ms 8812 KB Output is correct
28 Correct 80 ms 10220 KB Output is correct
29 Correct 362 ms 9196 KB Output is correct
30 Correct 407 ms 10092 KB Output is correct
31 Correct 44 ms 8428 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 58 ms 4844 KB Output is correct
34 Correct 73 ms 9324 KB Output is correct
35 Correct 12 ms 1260 KB Output is correct
36 Correct 49 ms 6124 KB Output is correct
37 Correct 75 ms 7276 KB Output is correct
38 Correct 79 ms 9836 KB Output is correct
39 Correct 18 ms 3948 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 358 ms 10476 KB Output is correct
42 Correct 93 ms 11628 KB Output is correct
43 Correct 234 ms 10476 KB Output is correct
44 Correct 97 ms 11328 KB Output is correct
45 Correct 63 ms 12140 KB Output is correct
46 Correct 407 ms 11500 KB Output is correct
47 Correct 55 ms 10732 KB Output is correct
48 Correct 140 ms 10860 KB Output is correct
49 Correct 83 ms 10476 KB Output is correct
50 Correct 1876 ms 11244 KB Output is correct
51 Execution timed out 2011 ms 11708 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 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 1 ms 364 KB Output is correct
9 Correct 42 ms 7660 KB Output is correct
10 Correct 11 ms 2412 KB Output is correct
11 Correct 27 ms 5996 KB Output is correct
12 Correct 27 ms 5228 KB Output is correct
13 Correct 35 ms 7020 KB Output is correct
14 Correct 23 ms 4844 KB Output is correct
15 Correct 6 ms 1516 KB Output is correct
16 Correct 23 ms 4844 KB Output is correct
17 Correct 57 ms 10220 KB Output is correct
18 Correct 34 ms 6252 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 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 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 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 25 ms 3308 KB Output is correct
35 Correct 46 ms 8812 KB Output is correct
36 Correct 80 ms 10220 KB Output is correct
37 Correct 362 ms 9196 KB Output is correct
38 Correct 407 ms 10092 KB Output is correct
39 Correct 44 ms 8428 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 58 ms 4844 KB Output is correct
42 Correct 73 ms 9324 KB Output is correct
43 Correct 12 ms 1260 KB Output is correct
44 Correct 49 ms 6124 KB Output is correct
45 Correct 75 ms 7276 KB Output is correct
46 Correct 79 ms 9836 KB Output is correct
47 Correct 18 ms 3948 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 358 ms 10476 KB Output is correct
50 Correct 93 ms 11628 KB Output is correct
51 Correct 234 ms 10476 KB Output is correct
52 Correct 97 ms 11328 KB Output is correct
53 Correct 63 ms 12140 KB Output is correct
54 Correct 407 ms 11500 KB Output is correct
55 Correct 55 ms 10732 KB Output is correct
56 Correct 140 ms 10860 KB Output is correct
57 Correct 83 ms 10476 KB Output is correct
58 Correct 1876 ms 11244 KB Output is correct
59 Execution timed out 2011 ms 11708 KB Time limit exceeded
60 Halted 0 ms 0 KB -