oj.uz

Submission #962458

# Submission time Handle Problem Language Result Execution time Memory
962458 2024-04-13T15:17:24 Z Cookie Chessboard (IZhO18_chessboard) C++14
70 / 100
 537 ms 17356 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const ld PI = 3.14159265359, prec = 1e-9;;
//using u128 = __uint128_t;
//const int x[4] = {1, 0, -1, 0};
//const int y[4] = {0, -1, 0, 1};
const ll mod = 1e9 + 7, pr = 31;
const int mxn = 5e5 + 5, mxq = 1e5 + 5, sq = 450, mxv = 5e4 + 1;
//const int base = (1 <<18);
const ll inf = 1e18 + 5, neg = -69420, inf2 = 1e14;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// have fun!
ll n, k;
ll ans = inf;
ll x[mxn + 1], y[mxn + 1], x2[mxn + 1], y2[mxn + 1];
ll cntodd(ll l, ll r){
    return((r + 1) / 2 - l / 2);
}
ll cnteven(ll l, ll r){
    return((r + 2) / 2 - (l + 1) / 2);
}
pll get(ll l, ll r, ll k){
    ll lw = (l + k - 1) / k, hg = (r - k + 1) / k;
   
    ll odd = 0, even = 0;
    if(r < k || lw == hg + 2){
        if((r / k) & 1)odd += r - l + 1;
        else even += r - l + 1;
        return(mpp(odd, even));
    }
    odd += cntodd(lw, hg) * k; even += cnteven(lw, hg) * k;
    
    if(l % k != 0){
        if((l / k) & 1){
            odd += min(n - l, (k - (l % k)));
        }else{
            even += min(n - l, (k - (l % k)));
        }
    }if(r % k != k - 1){
        if((r / k) & 1){
            odd += (r % k) + 1;
        }else{
            even += (r % k) + 1;
        }
    }
    
    return(mpp(odd, even));
}
ll area = 0;
void solve(int cand){
    
    ll odd = 0, even = 0;
    for(int i = 1; i <= k; i++){
        pll col = get(y[i], y2[i], cand), row = get(x[i], x2[i], cand);
        //cout << col.fi << " " << col.se << " " << row.fi << " " << row.se << "\n";
        odd += col.fi * row.se + col.se * row.fi; even += col.fi * row.fi + col.se * row.se;
        
    }
    ll totodd = 0, toteven = 0;
    if((n / cand) & 1){
        toteven = (n * n / (cand * cand) + 1) / 2 * cand * cand;
        totodd = (n * n / (cand * cand)) / 2 * cand * cand;
    }else{
        toteven = (n * n / (cand * cand)) / 2 * cand * cand;
        totodd = (n * n / (cand * cand)) / 2 * cand * cand;
    }
    assert(even + odd == area);
    //cout << cand << " " << even << " " << odd << "\n";
    ans = min(ans, min(abs(toteven - even) + area - even, abs(totodd - odd) + area - odd));
}
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= k; i++){
        cin >> x[i] >> y[i] >> x2[i] >> y2[i]; --x[i]; --y[i]; --x2[i]; --y2[i];
        area += (y2[i] - y[i] + 1) * (x2[i] - x[i] + 1);
    }
    for(int i = 1; i < n; i++){
        if(n % i == 0){
            solve(i);
        }
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("netw.inp", "r", stdin);
    //freopen("netw.out", "w", stdout)
    int tt; tt = 1;
    while(tt--){
        solve();
 
    }
    return(0);
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12292 KB Output is correct
2 Correct 7 ms 7032 KB Output is correct
3 Correct 16 ms 9592 KB Output is correct
4 Correct 19 ms 9564 KB Output is correct
5 Correct 17 ms 12120 KB Output is correct
6 Correct 15 ms 9564 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 12 ms 9440 KB Output is correct
9 Correct 29 ms 14936 KB Output is correct
10 Correct 16 ms 11868 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6628 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6620 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6644 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6616 KB Output is correct
16 Correct 10 ms 9296 KB Output is correct
17 Correct 22 ms 14088 KB Output is correct
18 Correct 39 ms 16468 KB Output is correct
19 Correct 117 ms 14360 KB Output is correct
20 Correct 126 ms 16592 KB Output is correct
21 Correct 27 ms 14164 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 23 ms 9544 KB Output is correct
24 Correct 30 ms 14336 KB Output is correct
25 Correct 5 ms 6748 KB Output is correct
26 Correct 20 ms 11612 KB Output is correct
27 Correct 27 ms 11868 KB Output is correct
28 Correct 31 ms 14340 KB Output is correct
29 Correct 10 ms 9144 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 12292 KB Output is correct
2 Correct 7 ms 7032 KB Output is correct
3 Correct 16 ms 9592 KB Output is correct
4 Correct 19 ms 9564 KB Output is correct
5 Correct 17 ms 12120 KB Output is correct
6 Correct 15 ms 9564 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Correct 12 ms 9440 KB Output is correct
9 Correct 29 ms 14936 KB Output is correct
10 Correct 16 ms 11868 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6628 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6620 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6644 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6616 KB Output is correct
26 Correct 10 ms 9296 KB Output is correct
27 Correct 22 ms 14088 KB Output is correct
28 Correct 39 ms 16468 KB Output is correct
29 Correct 117 ms 14360 KB Output is correct
30 Correct 126 ms 16592 KB Output is correct
31 Correct 27 ms 14164 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 23 ms 9544 KB Output is correct
34 Correct 30 ms 14336 KB Output is correct
35 Correct 5 ms 6748 KB Output is correct
36 Correct 20 ms 11612 KB Output is correct
37 Correct 27 ms 11868 KB Output is correct
38 Correct 31 ms 14340 KB Output is correct
39 Correct 10 ms 9144 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 99 ms 14912 KB Output is correct
42 Correct 39 ms 15188 KB Output is correct
43 Correct 67 ms 14924 KB Output is correct
44 Correct 36 ms 15112 KB Output is correct
45 Correct 30 ms 17272 KB Output is correct
46 Correct 110 ms 14936 KB Output is correct
47 Correct 26 ms 14936 KB Output is correct
48 Correct 47 ms 14940 KB Output is correct
49 Correct 33 ms 15192 KB Output is correct
50 Correct 485 ms 15100 KB Output is correct
51 Correct 520 ms 17300 KB Output is correct
52 Correct 485 ms 15068 KB Output is correct
53 Correct 512 ms 17300 KB Output is correct
54 Correct 482 ms 15056 KB Output is correct
55 Correct 537 ms 17256 KB Output is correct
56 Correct 464 ms 14992 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 20 ms 12292 KB Output is correct
10 Correct 7 ms 7032 KB Output is correct
11 Correct 16 ms 9592 KB Output is correct
12 Correct 19 ms 9564 KB Output is correct
13 Correct 17 ms 12120 KB Output is correct
14 Correct 15 ms 9564 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 12 ms 9440 KB Output is correct
17 Correct 29 ms 14936 KB Output is correct
18 Correct 16 ms 11868 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6628 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6620 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 2 ms 6644 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6616 KB Output is correct
34 Correct 10 ms 9296 KB Output is correct
35 Correct 22 ms 14088 KB Output is correct
36 Correct 39 ms 16468 KB Output is correct
37 Correct 117 ms 14360 KB Output is correct
38 Correct 126 ms 16592 KB Output is correct
39 Correct 27 ms 14164 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 23 ms 9544 KB Output is correct
42 Correct 30 ms 14336 KB Output is correct
43 Correct 5 ms 6748 KB Output is correct
44 Correct 20 ms 11612 KB Output is correct
45 Correct 27 ms 11868 KB Output is correct
46 Correct 31 ms 14340 KB Output is correct
47 Correct 10 ms 9144 KB Output is correct
48 Correct 2 ms 6492 KB Output is correct
49 Correct 99 ms 14912 KB Output is correct
50 Correct 39 ms 15188 KB Output is correct
51 Correct 67 ms 14924 KB Output is correct
52 Correct 36 ms 15112 KB Output is correct
53 Correct 30 ms 17272 KB Output is correct
54 Correct 110 ms 14936 KB Output is correct
55 Correct 26 ms 14936 KB Output is correct
56 Correct 47 ms 14940 KB Output is correct
57 Correct 33 ms 15192 KB Output is correct
58 Correct 485 ms 15100 KB Output is correct
59 Correct 520 ms 17300 KB Output is correct
60 Correct 485 ms 15068 KB Output is correct
61 Correct 512 ms 17300 KB Output is correct
62 Correct 482 ms 15056 KB Output is correct
63 Correct 537 ms 17256 KB Output is correct
64 Correct 464 ms 14992 KB Output is correct
65 Correct 1 ms 6492 KB Output is correct
66 Correct 1 ms 6612 KB Output is correct
67 Correct 535 ms 15172 KB Output is correct
68 Correct 528 ms 15152 KB Output is correct
69 Correct 467 ms 14680 KB Output is correct
70 Correct 512 ms 15108 KB Output is correct
71 Correct 501 ms 15064 KB Output is correct
72 Correct 493 ms 15040 KB Output is correct
73 Correct 486 ms 14968 KB Output is correct
74 Correct 519 ms 14932 KB Output is correct
75 Correct 507 ms 14984 KB Output is correct
76 Correct 532 ms 15192 KB Output is correct
77 Incorrect 97 ms 17356 KB Output isn't correct
78 Halted 0 ms 0 KB -