oj.uz

답안 #378583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378583 2021-03-17T01:58:46 Z balbit Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 11884 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; --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 492 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 39 ms 7916 KB Output is correct
2 Correct 11 ms 2412 KB Output is correct
3 Correct 26 ms 5996 KB Output is correct
4 Correct 26 ms 5228 KB Output is correct
5 Correct 35 ms 7148 KB Output is correct
6 Correct 22 ms 5100 KB Output is correct
7 Correct 7 ms 1516 KB Output is correct
8 Correct 22 ms 5120 KB Output is correct
9 Correct 57 ms 10092 KB Output is correct
10 Correct 31 ms 6380 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 1 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 1 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 1 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 1 ms 492 KB Output is correct
16 Correct 26 ms 3180 KB Output is correct
17 Correct 43 ms 9068 KB Output is correct
18 Correct 78 ms 10476 KB Output is correct
19 Correct 365 ms 9452 KB Output is correct
20 Correct 398 ms 10348 KB Output is correct
21 Correct 43 ms 8684 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 57 ms 4716 KB Output is correct
24 Correct 71 ms 9580 KB Output is correct
25 Correct 12 ms 1260 KB Output is correct
26 Correct 45 ms 6252 KB Output is correct
27 Correct 72 ms 7404 KB Output is correct
28 Correct 81 ms 10220 KB Output is correct
29 Correct 18 ms 3820 KB Output is correct
30 Correct 3 ms 620 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 7916 KB Output is correct
2 Correct 11 ms 2412 KB Output is correct
3 Correct 26 ms 5996 KB Output is correct
4 Correct 26 ms 5228 KB Output is correct
5 Correct 35 ms 7148 KB Output is correct
6 Correct 22 ms 5100 KB Output is correct
7 Correct 7 ms 1516 KB Output is correct
8 Correct 22 ms 5120 KB Output is correct
9 Correct 57 ms 10092 KB Output is correct
10 Correct 31 ms 6380 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 1 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 1 ms 492 KB Output is correct
26 Correct 26 ms 3180 KB Output is correct
27 Correct 43 ms 9068 KB Output is correct
28 Correct 78 ms 10476 KB Output is correct
29 Correct 365 ms 9452 KB Output is correct
30 Correct 398 ms 10348 KB Output is correct
31 Correct 43 ms 8684 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 57 ms 4716 KB Output is correct
34 Correct 71 ms 9580 KB Output is correct
35 Correct 12 ms 1260 KB Output is correct
36 Correct 45 ms 6252 KB Output is correct
37 Correct 72 ms 7404 KB Output is correct
38 Correct 81 ms 10220 KB Output is correct
39 Correct 18 ms 3820 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 347 ms 10476 KB Output is correct
42 Correct 90 ms 11500 KB Output is correct
43 Correct 192 ms 10476 KB Output is correct
44 Correct 86 ms 11244 KB Output is correct
45 Correct 61 ms 11884 KB Output is correct
46 Correct 391 ms 11372 KB Output is correct
47 Correct 53 ms 10732 KB Output is correct
48 Correct 144 ms 10872 KB Output is correct
49 Correct 81 ms 10476 KB Output is correct
50 Correct 1877 ms 10988 KB Output is correct
51 Correct 1977 ms 11116 KB Output is correct
52 Correct 1846 ms 10476 KB Output is correct
53 Correct 1934 ms 10604 KB Output is correct
54 Correct 1815 ms 9964 KB Output is correct
55 Execution timed out 2033 ms 10988 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 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 39 ms 7916 KB Output is correct
10 Correct 11 ms 2412 KB Output is correct
11 Correct 26 ms 5996 KB Output is correct
12 Correct 26 ms 5228 KB Output is correct
13 Correct 35 ms 7148 KB Output is correct
14 Correct 22 ms 5100 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 22 ms 5120 KB Output is correct
17 Correct 57 ms 10092 KB Output is correct
18 Correct 31 ms 6380 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 1 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 1 ms 492 KB Output is correct
34 Correct 26 ms 3180 KB Output is correct
35 Correct 43 ms 9068 KB Output is correct
36 Correct 78 ms 10476 KB Output is correct
37 Correct 365 ms 9452 KB Output is correct
38 Correct 398 ms 10348 KB Output is correct
39 Correct 43 ms 8684 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 57 ms 4716 KB Output is correct
42 Correct 71 ms 9580 KB Output is correct
43 Correct 12 ms 1260 KB Output is correct
44 Correct 45 ms 6252 KB Output is correct
45 Correct 72 ms 7404 KB Output is correct
46 Correct 81 ms 10220 KB Output is correct
47 Correct 18 ms 3820 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 347 ms 10476 KB Output is correct
50 Correct 90 ms 11500 KB Output is correct
51 Correct 192 ms 10476 KB Output is correct
52 Correct 86 ms 11244 KB Output is correct
53 Correct 61 ms 11884 KB Output is correct
54 Correct 391 ms 11372 KB Output is correct
55 Correct 53 ms 10732 KB Output is correct
56 Correct 144 ms 10872 KB Output is correct
57 Correct 81 ms 10476 KB Output is correct
58 Correct 1877 ms 10988 KB Output is correct
59 Correct 1977 ms 11116 KB Output is correct
60 Correct 1846 ms 10476 KB Output is correct
61 Correct 1934 ms 10604 KB Output is correct
62 Correct 1815 ms 9964 KB Output is correct
63 Execution timed out 2033 ms 10988 KB Time limit exceeded
64 Halted 0 ms 0 KB -