oj.uz

답안 #1112587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112587 2024-11-14T11:09:51 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 11592 KB 
//Dost SEFEROĞLU
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
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; 
 

int t[400001],lazy[400001];
struct ST {
    inline void push(const int& node,const int& l,const int& r) {
        if (!lazy[node]) return;
        t[node] = (r-l+1)-t[node];
        if (l != r) {
            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] = t[2*node]+t[2*node+1];
    }

    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];
        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+2];
    for (int i=1;i<=k;i++) {
        int x1,y1,x2,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        upds[x1].push_back({y1,y2});
        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;
    for (int d : divs) {
        int cur = 1;
        int fl = 0;
        while (cur <= n) {
            if (!fl) st1.update(1,1,n,cur,cur+d-1);
            cur+=d;
            fl^=1;
        }
        int need = 0;
        for (int j = 1;j<=n+1;j++) {
            for (auto it : upds[j]) st1.update(1,1,n,it.ff,it.ss);
            if (j > n) break;
            if (((j-1)/d)%2 == 0) need+=st1.query(1,1,n,1,n);
            else need+=n-st1.query(1,1,n,1,n);
        }
        ans = min(ans,need);
        ans = min(ans,n*n-need);
        cur = 1;
        fl = 0;
        while (cur <= n) {
            if (!fl) st1.update(1,1,n,cur,cur+d-1);
            cur+=d;
            fl^=1;
        }
    }
    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

# 결과 실행 시간 메모리 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 336 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

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 6984 KB Output is correct
2 Correct 11 ms 2128 KB Output is correct
3 Correct 40 ms 8116 KB Output is correct
4 Correct 22 ms 3164 KB Output is correct
5 Correct 40 ms 6216 KB Output is correct
6 Correct 28 ms 5192 KB Output is correct
7 Correct 8 ms 2128 KB Output is correct
8 Correct 30 ms 5200 KB Output is correct
9 Correct 57 ms 6736 KB Output is correct
10 Correct 42 ms 5712 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 508 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 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 336 KB Output is correct
8 Correct 1 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 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 1 ms 508 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 508 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 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 336 KB Output is correct
8 Correct 1 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 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 1 ms 508 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 19 ms 1872 KB Output is correct
17 Correct 35 ms 4960 KB Output is correct
18 Correct 68 ms 4944 KB Output is correct
19 Correct 342 ms 4804 KB Output is correct
20 Correct 383 ms 4688 KB Output is correct
21 Correct 29 ms 4984 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 49 ms 2716 KB Output is correct
24 Correct 56 ms 4944 KB Output is correct
25 Correct 11 ms 848 KB Output is correct
26 Correct 34 ms 2896 KB Output is correct
27 Correct 59 ms 4432 KB Output is correct
28 Correct 58 ms 4688 KB Output is correct
29 Correct 12 ms 2384 KB Output is correct
30 Correct 3 ms 436 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 6984 KB Output is correct
2 Correct 11 ms 2128 KB Output is correct
3 Correct 40 ms 8116 KB Output is correct
4 Correct 22 ms 3164 KB Output is correct
5 Correct 40 ms 6216 KB Output is correct
6 Correct 28 ms 5192 KB Output is correct
7 Correct 8 ms 2128 KB Output is correct
8 Correct 30 ms 5200 KB Output is correct
9 Correct 57 ms 6736 KB Output is correct
10 Correct 42 ms 5712 KB Output is correct
11 Correct 1 ms 508 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 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 1 ms 336 KB Output is correct
18 Correct 1 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 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 1 ms 508 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 19 ms 1872 KB Output is correct
27 Correct 35 ms 4960 KB Output is correct
28 Correct 68 ms 4944 KB Output is correct
29 Correct 342 ms 4804 KB Output is correct
30 Correct 383 ms 4688 KB Output is correct
31 Correct 29 ms 4984 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 49 ms 2716 KB Output is correct
34 Correct 56 ms 4944 KB Output is correct
35 Correct 11 ms 848 KB Output is correct
36 Correct 34 ms 2896 KB Output is correct
37 Correct 59 ms 4432 KB Output is correct
38 Correct 58 ms 4688 KB Output is correct
39 Correct 12 ms 2384 KB Output is correct
40 Correct 3 ms 436 KB Output is correct
41 Correct 608 ms 11084 KB Output is correct
42 Correct 131 ms 11592 KB Output is correct
43 Correct 322 ms 11080 KB Output is correct
44 Correct 137 ms 11404 KB Output is correct
45 Correct 88 ms 11468 KB Output is correct
46 Correct 752 ms 11592 KB Output is correct
47 Correct 80 ms 10796 KB Output is correct
48 Correct 287 ms 11456 KB Output is correct
49 Correct 142 ms 11048 KB Output is correct
50 Execution timed out 2070 ms 11244 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 50 ms 6984 KB Output is correct
10 Correct 11 ms 2128 KB Output is correct
11 Correct 40 ms 8116 KB Output is correct
12 Correct 22 ms 3164 KB Output is correct
13 Correct 40 ms 6216 KB Output is correct
14 Correct 28 ms 5192 KB Output is correct
15 Correct 8 ms 2128 KB Output is correct
16 Correct 30 ms 5200 KB Output is correct
17 Correct 57 ms 6736 KB Output is correct
18 Correct 42 ms 5712 KB Output is correct
19 Correct 1 ms 508 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 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 1 ms 336 KB Output is correct
26 Correct 1 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 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 1 ms 508 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 19 ms 1872 KB Output is correct
35 Correct 35 ms 4960 KB Output is correct
36 Correct 68 ms 4944 KB Output is correct
37 Correct 342 ms 4804 KB Output is correct
38 Correct 383 ms 4688 KB Output is correct
39 Correct 29 ms 4984 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 49 ms 2716 KB Output is correct
42 Correct 56 ms 4944 KB Output is correct
43 Correct 11 ms 848 KB Output is correct
44 Correct 34 ms 2896 KB Output is correct
45 Correct 59 ms 4432 KB Output is correct
46 Correct 58 ms 4688 KB Output is correct
47 Correct 12 ms 2384 KB Output is correct
48 Correct 3 ms 436 KB Output is correct
49 Correct 608 ms 11084 KB Output is correct
50 Correct 131 ms 11592 KB Output is correct
51 Correct 322 ms 11080 KB Output is correct
52 Correct 137 ms 11404 KB Output is correct
53 Correct 88 ms 11468 KB Output is correct
54 Correct 752 ms 11592 KB Output is correct
55 Correct 80 ms 10796 KB Output is correct
56 Correct 287 ms 11456 KB Output is correct
57 Correct 142 ms 11048 KB Output is correct
58 Execution timed out 2070 ms 11244 KB Time limit exceeded
59 Halted 0 ms 0 KB -