oj.uz

Submission #1112563

# Submission time Handle Problem Language Result Execution time Memory
1112563 2024-11-14T10:40:35 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 27992 KB 
//Dost SEFEROĞLU
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " << 
#define vi vector<int>
#define all(xx) xx.begin(),xx.end()
#define ps(xxx) cout << (xxx) << endl;
const int N = 5e2+1,inf = 1e16,MOD = 1e9+7; 
 

struct ST {
    vector<pii> t;
    vi lazy;
    void build(int node,int l,int r) {
        if (l == r) {
            t[node] = {0,1};
            return;
        }
        int m = (l+r) >> 1;
        build(2*node,l,m),build(2*node+1,m+1,r);
        t[node].ff = 0;
        t[node].ss = t[2*node].ss+t[2*node+1].ss;
    }
    ST(int nn) {
        t.resize(4*nn+1);
        build(1,1,nn);
        lazy.assign(4*nn+1,0);
    }
    void push(int node,bool leaf) {
        if (!lazy[node]) return;
        t[node].ff = t[node].ss-t[node].ff;
        if (!leaf) {
            lazy[2*node]^=1;
            lazy[2*node+1]^=1;
        }
        lazy[node] = 0;
    }

    void update(int node,int l,int r,int L,int R) {
        push(node,l==r);
        if (l > R || r < L) return;
        if (l >= L && r <= R) {
            lazy[node]^=1;
            push(node,l==r);
            return;
        }
        int m = (l+r) >> 1;
        update(2*node,l,m,L,R),update(2*node+1,m+1,r,L,R);
        t[node].ff = t[2*node].ff+t[2*node+1].ff;
    }

    int query(int node,int l,int r,int L,int R) {
        push(node,l==r);
        if (l > R || r < L) return 0;
        if (l >= L && r <= R) return t[node].ff;
        int m = (l+r) >> 1;
        return query(2*node,l,m,L,R)+query(2*node+1,m+1,r,L,R); 
    }
    void clear(int nn) {
        lazy.assign(4*nn+1,0);
        for (auto& it : t) it.ff = 0;
    }
};

void solve() { 
    int n,k;
    cin >> n >> k;
    vector<pii> upds[n+1];
    for (int i=1;i<=k;i++) {
        int x1,y1,x2,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        upds[x1].push_back({y1,y2});
        if (x2 < n) upds[x2+1].push_back({y1,y2});
    }
    vi divs;
    for (int i=1;i<n;i++) if (n%i == 0) divs.push_back(i);
    int ans = inf;
    ST st1(n),st2(n);
    for (int d : divs) {
        st1.clear(n);
        st2.clear(n);
        int cur = 1;
        while (cur <= n) {
            if ((cur/d)%2) st2.update(1,1,n,cur,cur+d-1);
            else st1.update(1,1,n,cur,cur+d-1);
            cur+=d;
        }
        int need = 0;
        for (int j = 1;j<=n;j++) {
            for (auto it : upds[j]) {
                st1.update(1,1,n,it.ff,it.ss);
                st2.update(1,1,n,it.ff,it.ss);
            }
            if (((j-1)/d)%2 == 0) need+=st1.query(1,1,n,1,n);
            else need+=st2.query(1,1,n,1,n);
        }
        ans = min(ans,need);
        ans = min(ans,n*n-need);
    }
    cout << ans << endl;
}  
 
                
                            
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 16720 KB Output is correct
2 Correct 20 ms 4176 KB Output is correct
3 Correct 63 ms 19976 KB Output is correct
4 Correct 35 ms 3408 KB Output is correct
5 Correct 72 ms 15176 KB Output is correct
6 Correct 48 ms 12292 KB Output is correct
7 Correct 14 ms 5624 KB Output is correct
8 Correct 48 ms 12792 KB Output is correct
9 Correct 100 ms 11336 KB Output is correct
10 Correct 57 ms 11020 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 2 ms 336 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 35 ms 1872 KB Output is correct
17 Correct 53 ms 5104 KB Output is correct
18 Correct 134 ms 4944 KB Output is correct
19 Correct 928 ms 4944 KB Output is correct
20 Correct 980 ms 4688 KB Output is correct
21 Correct 46 ms 4892 KB Output is correct
22 Correct 4 ms 760 KB Output is correct
23 Correct 114 ms 2640 KB Output is correct
24 Correct 125 ms 5088 KB Output is correct
25 Correct 24 ms 1104 KB Output is correct
26 Correct 76 ms 3152 KB Output is correct
27 Correct 151 ms 4856 KB Output is correct
28 Correct 135 ms 4940 KB Output is correct
29 Correct 21 ms 2384 KB Output is correct
30 Correct 4 ms 592 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 16720 KB Output is correct
2 Correct 20 ms 4176 KB Output is correct
3 Correct 63 ms 19976 KB Output is correct
4 Correct 35 ms 3408 KB Output is correct
5 Correct 72 ms 15176 KB Output is correct
6 Correct 48 ms 12292 KB Output is correct
7 Correct 14 ms 5624 KB Output is correct
8 Correct 48 ms 12792 KB Output is correct
9 Correct 100 ms 11336 KB Output is correct
10 Correct 57 ms 11020 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 336 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 35 ms 1872 KB Output is correct
27 Correct 53 ms 5104 KB Output is correct
28 Correct 134 ms 4944 KB Output is correct
29 Correct 928 ms 4944 KB Output is correct
30 Correct 980 ms 4688 KB Output is correct
31 Correct 46 ms 4892 KB Output is correct
32 Correct 4 ms 760 KB Output is correct
33 Correct 114 ms 2640 KB Output is correct
34 Correct 125 ms 5088 KB Output is correct
35 Correct 24 ms 1104 KB Output is correct
36 Correct 76 ms 3152 KB Output is correct
37 Correct 151 ms 4856 KB Output is correct
38 Correct 135 ms 4940 KB Output is correct
39 Correct 21 ms 2384 KB Output is correct
40 Correct 4 ms 592 KB Output is correct
41 Correct 1581 ms 25876 KB Output is correct
42 Correct 284 ms 26500 KB Output is correct
43 Correct 881 ms 25672 KB Output is correct
44 Correct 303 ms 26184 KB Output is correct
45 Correct 144 ms 26472 KB Output is correct
46 Correct 1763 ms 26392 KB Output is correct
47 Correct 124 ms 27976 KB Output is correct
48 Correct 561 ms 27976 KB Output is correct
49 Correct 340 ms 27992 KB Output is correct
50 Execution timed out 2076 ms 24856 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 88 ms 16720 KB Output is correct
10 Correct 20 ms 4176 KB Output is correct
11 Correct 63 ms 19976 KB Output is correct
12 Correct 35 ms 3408 KB Output is correct
13 Correct 72 ms 15176 KB Output is correct
14 Correct 48 ms 12292 KB Output is correct
15 Correct 14 ms 5624 KB Output is correct
16 Correct 48 ms 12792 KB Output is correct
17 Correct 100 ms 11336 KB Output is correct
18 Correct 57 ms 11020 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 1 ms 504 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 336 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 2 ms 336 KB Output is correct
34 Correct 35 ms 1872 KB Output is correct
35 Correct 53 ms 5104 KB Output is correct
36 Correct 134 ms 4944 KB Output is correct
37 Correct 928 ms 4944 KB Output is correct
38 Correct 980 ms 4688 KB Output is correct
39 Correct 46 ms 4892 KB Output is correct
40 Correct 4 ms 760 KB Output is correct
41 Correct 114 ms 2640 KB Output is correct
42 Correct 125 ms 5088 KB Output is correct
43 Correct 24 ms 1104 KB Output is correct
44 Correct 76 ms 3152 KB Output is correct
45 Correct 151 ms 4856 KB Output is correct
46 Correct 135 ms 4940 KB Output is correct
47 Correct 21 ms 2384 KB Output is correct
48 Correct 4 ms 592 KB Output is correct
49 Correct 1581 ms 25876 KB Output is correct
50 Correct 284 ms 26500 KB Output is correct
51 Correct 881 ms 25672 KB Output is correct
52 Correct 303 ms 26184 KB Output is correct
53 Correct 144 ms 26472 KB Output is correct
54 Correct 1763 ms 26392 KB Output is correct
55 Correct 124 ms 27976 KB Output is correct
56 Correct 561 ms 27976 KB Output is correct
57 Correct 340 ms 27992 KB Output is correct
58 Execution timed out 2076 ms 24856 KB Time limit exceeded
59 Halted 0 ms 0 KB -