oj.uz

Submission #1112559

# Submission time Handle Problem Language Result Execution time Memory
1112559 2024-11-14T10:32:51 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 28836 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 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;
    for (int d : divs) {
        ST st1(n),st2(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 336 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 504 KB Output is correct
7 Correct 1 ms 336 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 78 ms 18168 KB Output is correct
2 Correct 19 ms 4432 KB Output is correct
3 Correct 61 ms 21072 KB Output is correct
4 Correct 33 ms 4176 KB Output is correct
5 Correct 72 ms 16452 KB Output is correct
6 Correct 49 ms 13308 KB Output is correct
7 Correct 15 ms 5744 KB Output is correct
8 Correct 53 ms 13392 KB Output is correct
9 Correct 93 ms 13384 KB Output is correct
10 Correct 60 ms 12036 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 456 KB Output is correct
4 Correct 3 ms 544 KB Output is correct
5 Correct 2 ms 468 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 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 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 456 KB Output is correct
4 Correct 3 ms 544 KB Output is correct
5 Correct 2 ms 468 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 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 39 ms 2384 KB Output is correct
17 Correct 50 ms 6224 KB Output is correct
18 Correct 128 ms 6736 KB Output is correct
19 Correct 896 ms 6368 KB Output is correct
20 Correct 1006 ms 6504 KB Output is correct
21 Correct 48 ms 6224 KB Output is correct
22 Correct 5 ms 700 KB Output is correct
23 Correct 118 ms 3520 KB Output is correct
24 Correct 121 ms 6480 KB Output is correct
25 Correct 24 ms 1248 KB Output is correct
26 Correct 75 ms 4176 KB Output is correct
27 Correct 139 ms 5804 KB Output is correct
28 Correct 133 ms 6480 KB Output is correct
29 Correct 22 ms 2896 KB Output is correct
30 Correct 6 ms 848 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 18168 KB Output is correct
2 Correct 19 ms 4432 KB Output is correct
3 Correct 61 ms 21072 KB Output is correct
4 Correct 33 ms 4176 KB Output is correct
5 Correct 72 ms 16452 KB Output is correct
6 Correct 49 ms 13308 KB Output is correct
7 Correct 15 ms 5744 KB Output is correct
8 Correct 53 ms 13392 KB Output is correct
9 Correct 93 ms 13384 KB Output is correct
10 Correct 60 ms 12036 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 456 KB Output is correct
14 Correct 3 ms 544 KB Output is correct
15 Correct 2 ms 468 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 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 39 ms 2384 KB Output is correct
27 Correct 50 ms 6224 KB Output is correct
28 Correct 128 ms 6736 KB Output is correct
29 Correct 896 ms 6368 KB Output is correct
30 Correct 1006 ms 6504 KB Output is correct
31 Correct 48 ms 6224 KB Output is correct
32 Correct 5 ms 700 KB Output is correct
33 Correct 118 ms 3520 KB Output is correct
34 Correct 121 ms 6480 KB Output is correct
35 Correct 24 ms 1248 KB Output is correct
36 Correct 75 ms 4176 KB Output is correct
37 Correct 139 ms 5804 KB Output is correct
38 Correct 133 ms 6480 KB Output is correct
39 Correct 22 ms 2896 KB Output is correct
40 Correct 6 ms 848 KB Output is correct
41 Correct 1917 ms 27852 KB Output is correct
42 Correct 290 ms 28752 KB Output is correct
43 Correct 871 ms 28088 KB Output is correct
44 Correct 311 ms 28512 KB Output is correct
45 Correct 124 ms 28836 KB Output is correct
46 Execution timed out 2061 ms 28596 KB Time limit exceeded
47 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 336 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 504 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 78 ms 18168 KB Output is correct
10 Correct 19 ms 4432 KB Output is correct
11 Correct 61 ms 21072 KB Output is correct
12 Correct 33 ms 4176 KB Output is correct
13 Correct 72 ms 16452 KB Output is correct
14 Correct 49 ms 13308 KB Output is correct
15 Correct 15 ms 5744 KB Output is correct
16 Correct 53 ms 13392 KB Output is correct
17 Correct 93 ms 13384 KB Output is correct
18 Correct 60 ms 12036 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 456 KB Output is correct
22 Correct 3 ms 544 KB Output is correct
23 Correct 2 ms 468 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 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 39 ms 2384 KB Output is correct
35 Correct 50 ms 6224 KB Output is correct
36 Correct 128 ms 6736 KB Output is correct
37 Correct 896 ms 6368 KB Output is correct
38 Correct 1006 ms 6504 KB Output is correct
39 Correct 48 ms 6224 KB Output is correct
40 Correct 5 ms 700 KB Output is correct
41 Correct 118 ms 3520 KB Output is correct
42 Correct 121 ms 6480 KB Output is correct
43 Correct 24 ms 1248 KB Output is correct
44 Correct 75 ms 4176 KB Output is correct
45 Correct 139 ms 5804 KB Output is correct
46 Correct 133 ms 6480 KB Output is correct
47 Correct 22 ms 2896 KB Output is correct
48 Correct 6 ms 848 KB Output is correct
49 Correct 1917 ms 27852 KB Output is correct
50 Correct 290 ms 28752 KB Output is correct
51 Correct 871 ms 28088 KB Output is correct
52 Correct 311 ms 28512 KB Output is correct
53 Correct 124 ms 28836 KB Output is correct
54 Execution timed out 2061 ms 28596 KB Time limit exceeded
55 Halted 0 ms 0 KB -