oj.uz

Submission #962460

# Submission time Handle Problem Language Result Execution time Memory
962460 2024-04-13T15:21:00 Z Cookie Chessboard (IZhO18_chessboard) C++14
70 / 100
 530 ms 16528 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 += (k - (l % k));
        }else{
            even += (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;
    assert(max(n, k) <= 100000);
    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 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 21 ms 11784 KB Output is correct
2 Correct 7 ms 7000 KB Output is correct
3 Correct 17 ms 9560 KB Output is correct
4 Correct 16 ms 9620 KB Output is correct
5 Correct 19 ms 11876 KB Output is correct
6 Correct 16 ms 9564 KB Output is correct
7 Correct 4 ms 6744 KB Output is correct
8 Correct 12 ms 9556 KB Output is correct
9 Correct 28 ms 14160 KB Output is correct
10 Correct 17 ms 11496 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6900 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 10 ms 9292 KB Output is correct
17 Correct 22 ms 13916 KB Output is correct
18 Correct 36 ms 15952 KB Output is correct
19 Correct 112 ms 13952 KB Output is correct
20 Correct 121 ms 15960 KB Output is correct
21 Correct 24 ms 13916 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 21 ms 9124 KB Output is correct
24 Correct 32 ms 13972 KB Output is correct
25 Correct 6 ms 6744 KB Output is correct
26 Correct 19 ms 11608 KB Output is correct
27 Correct 28 ms 11564 KB Output is correct
28 Correct 32 ms 13916 KB Output is correct
29 Correct 11 ms 9304 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 21 ms 11784 KB Output is correct
2 Correct 7 ms 7000 KB Output is correct
3 Correct 17 ms 9560 KB Output is correct
4 Correct 16 ms 9620 KB Output is correct
5 Correct 19 ms 11876 KB Output is correct
6 Correct 16 ms 9564 KB Output is correct
7 Correct 4 ms 6744 KB Output is correct
8 Correct 12 ms 9556 KB Output is correct
9 Correct 28 ms 14160 KB Output is correct
10 Correct 17 ms 11496 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6744 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6900 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 10 ms 9292 KB Output is correct
27 Correct 22 ms 13916 KB Output is correct
28 Correct 36 ms 15952 KB Output is correct
29 Correct 112 ms 13952 KB Output is correct
30 Correct 121 ms 15960 KB Output is correct
31 Correct 24 ms 13916 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 21 ms 9124 KB Output is correct
34 Correct 32 ms 13972 KB Output is correct
35 Correct 6 ms 6744 KB Output is correct
36 Correct 19 ms 11608 KB Output is correct
37 Correct 28 ms 11564 KB Output is correct
38 Correct 32 ms 13916 KB Output is correct
39 Correct 11 ms 9304 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 98 ms 14212 KB Output is correct
42 Correct 45 ms 14420 KB Output is correct
43 Correct 62 ms 14164 KB Output is correct
44 Correct 37 ms 14188 KB Output is correct
45 Correct 31 ms 16528 KB Output is correct
46 Correct 111 ms 14220 KB Output is correct
47 Correct 29 ms 14128 KB Output is correct
48 Correct 48 ms 14212 KB Output is correct
49 Correct 34 ms 14092 KB Output is correct
50 Correct 477 ms 14220 KB Output is correct
51 Correct 504 ms 16516 KB Output is correct
52 Correct 469 ms 14208 KB Output is correct
53 Correct 507 ms 16264 KB Output is correct
54 Correct 462 ms 14208 KB Output is correct
55 Correct 522 ms 16468 KB Output is correct
56 Correct 452 ms 14240 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 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 21 ms 11784 KB Output is correct
10 Correct 7 ms 7000 KB Output is correct
11 Correct 17 ms 9560 KB Output is correct
12 Correct 16 ms 9620 KB Output is correct
13 Correct 19 ms 11876 KB Output is correct
14 Correct 16 ms 9564 KB Output is correct
15 Correct 4 ms 6744 KB Output is correct
16 Correct 12 ms 9556 KB Output is correct
17 Correct 28 ms 14160 KB Output is correct
18 Correct 17 ms 11496 KB Output is correct
19 Correct 1 ms 6488 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 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 6492 KB Output is correct
26 Correct 1 ms 6744 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6900 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 10 ms 9292 KB Output is correct
35 Correct 22 ms 13916 KB Output is correct
36 Correct 36 ms 15952 KB Output is correct
37 Correct 112 ms 13952 KB Output is correct
38 Correct 121 ms 15960 KB Output is correct
39 Correct 24 ms 13916 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 21 ms 9124 KB Output is correct
42 Correct 32 ms 13972 KB Output is correct
43 Correct 6 ms 6744 KB Output is correct
44 Correct 19 ms 11608 KB Output is correct
45 Correct 28 ms 11564 KB Output is correct
46 Correct 32 ms 13916 KB Output is correct
47 Correct 11 ms 9304 KB Output is correct
48 Correct 2 ms 6492 KB Output is correct
49 Correct 98 ms 14212 KB Output is correct
50 Correct 45 ms 14420 KB Output is correct
51 Correct 62 ms 14164 KB Output is correct
52 Correct 37 ms 14188 KB Output is correct
53 Correct 31 ms 16528 KB Output is correct
54 Correct 111 ms 14220 KB Output is correct
55 Correct 29 ms 14128 KB Output is correct
56 Correct 48 ms 14212 KB Output is correct
57 Correct 34 ms 14092 KB Output is correct
58 Correct 477 ms 14220 KB Output is correct
59 Correct 504 ms 16516 KB Output is correct
60 Correct 469 ms 14208 KB Output is correct
61 Correct 507 ms 16264 KB Output is correct
62 Correct 462 ms 14208 KB Output is correct
63 Correct 522 ms 16468 KB Output is correct
64 Correct 452 ms 14240 KB Output is correct
65 Correct 1 ms 6492 KB Output is correct
66 Correct 1 ms 6608 KB Output is correct
67 Correct 518 ms 14228 KB Output is correct
68 Correct 516 ms 14212 KB Output is correct
69 Correct 462 ms 14064 KB Output is correct
70 Correct 513 ms 14208 KB Output is correct
71 Correct 504 ms 14212 KB Output is correct
72 Correct 490 ms 14208 KB Output is correct
73 Correct 484 ms 14216 KB Output is correct
74 Correct 520 ms 14212 KB Output is correct
75 Correct 504 ms 14212 KB Output is correct
76 Correct 530 ms 14124 KB Output is correct
77 Incorrect 96 ms 16460 KB Output isn't correct
78 Halted 0 ms 0 KB -