oj.uz

답안 #1112579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112579 2024-11-14T11:01:37 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 15944 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 t1[400001],lazy1[400001];
struct ST {
    int* t;
    int* lazy;

    ST(int* p1,int* p2) {
        t  = p1,lazy = p2;
    }
    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 clear() {
        fill(lazy,lazy+400001,0);
        fill(t,t+400001,0);
    }
};

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(t1,lazy1);
    for (int d : divs) {
        st1.clear();
        int cur = 1;
        while (cur <= n) {
            if ((cur/d)%2 == 0) st1.update(1,1,n,cur,cur+d-1);
            cur+=d;
        }
        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);
    }
    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 2 ms 6480 KB Output is correct
2 Correct 4 ms 6480 KB Output is correct
3 Correct 3 ms 6480 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 3 ms 6480 KB Output is correct
6 Correct 4 ms 6480 KB Output is correct
7 Correct 3 ms 6480 KB Output is correct
8 Correct 4 ms 6648 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 12888 KB Output is correct
2 Correct 16 ms 8016 KB Output is correct
3 Correct 43 ms 10576 KB Output is correct
4 Correct 40 ms 9152 KB Output is correct
5 Correct 47 ms 12020 KB Output is correct
6 Correct 35 ms 10316 KB Output is correct
7 Correct 12 ms 7760 KB Output is correct
8 Correct 30 ms 10320 KB Output is correct
9 Correct 107 ms 13896 KB Output is correct
10 Correct 56 ms 10080 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6736 KB Output is correct
2 Correct 3 ms 6480 KB Output is correct
3 Correct 5 ms 6736 KB Output is correct
4 Correct 5 ms 6736 KB Output is correct
5 Correct 6 ms 6736 KB Output is correct
6 Correct 4 ms 6736 KB Output is correct
7 Correct 4 ms 6736 KB Output is correct
8 Correct 4 ms 6736 KB Output is correct
9 Correct 4 ms 6736 KB Output is correct
10 Correct 4 ms 6480 KB Output is correct
11 Correct 3 ms 6736 KB Output is correct
12 Correct 3 ms 6736 KB Output is correct
13 Correct 7 ms 6688 KB Output is correct
14 Correct 6 ms 6736 KB Output is correct
15 Correct 6 ms 6736 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6736 KB Output is correct
2 Correct 3 ms 6480 KB Output is correct
3 Correct 5 ms 6736 KB Output is correct
4 Correct 5 ms 6736 KB Output is correct
5 Correct 6 ms 6736 KB Output is correct
6 Correct 4 ms 6736 KB Output is correct
7 Correct 4 ms 6736 KB Output is correct
8 Correct 4 ms 6736 KB Output is correct
9 Correct 4 ms 6736 KB Output is correct
10 Correct 4 ms 6480 KB Output is correct
11 Correct 3 ms 6736 KB Output is correct
12 Correct 3 ms 6736 KB Output is correct
13 Correct 7 ms 6688 KB Output is correct
14 Correct 6 ms 6736 KB Output is correct
15 Correct 6 ms 6736 KB Output is correct
16 Correct 36 ms 8544 KB Output is correct
17 Correct 36 ms 12112 KB Output is correct
18 Correct 71 ms 11088 KB Output is correct
19 Correct 390 ms 12224 KB Output is correct
20 Correct 485 ms 11848 KB Output is correct
21 Correct 39 ms 12492 KB Output is correct
22 Correct 9 ms 6736 KB Output is correct
23 Correct 92 ms 8720 KB Output is correct
24 Correct 66 ms 12192 KB Output is correct
25 Correct 18 ms 7248 KB Output is correct
26 Correct 41 ms 9100 KB Output is correct
27 Correct 84 ms 11888 KB Output is correct
28 Correct 65 ms 12444 KB Output is correct
29 Correct 17 ms 9040 KB Output is correct
30 Correct 6 ms 6736 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 12888 KB Output is correct
2 Correct 16 ms 8016 KB Output is correct
3 Correct 43 ms 10576 KB Output is correct
4 Correct 40 ms 9152 KB Output is correct
5 Correct 47 ms 12020 KB Output is correct
6 Correct 35 ms 10316 KB Output is correct
7 Correct 12 ms 7760 KB Output is correct
8 Correct 30 ms 10320 KB Output is correct
9 Correct 107 ms 13896 KB Output is correct
10 Correct 56 ms 10080 KB Output is correct
11 Correct 4 ms 6736 KB Output is correct
12 Correct 3 ms 6480 KB Output is correct
13 Correct 5 ms 6736 KB Output is correct
14 Correct 5 ms 6736 KB Output is correct
15 Correct 6 ms 6736 KB Output is correct
16 Correct 4 ms 6736 KB Output is correct
17 Correct 4 ms 6736 KB Output is correct
18 Correct 4 ms 6736 KB Output is correct
19 Correct 4 ms 6736 KB Output is correct
20 Correct 4 ms 6480 KB Output is correct
21 Correct 3 ms 6736 KB Output is correct
22 Correct 3 ms 6736 KB Output is correct
23 Correct 7 ms 6688 KB Output is correct
24 Correct 6 ms 6736 KB Output is correct
25 Correct 6 ms 6736 KB Output is correct
26 Correct 36 ms 8544 KB Output is correct
27 Correct 36 ms 12112 KB Output is correct
28 Correct 71 ms 11088 KB Output is correct
29 Correct 390 ms 12224 KB Output is correct
30 Correct 485 ms 11848 KB Output is correct
31 Correct 39 ms 12492 KB Output is correct
32 Correct 9 ms 6736 KB Output is correct
33 Correct 92 ms 8720 KB Output is correct
34 Correct 66 ms 12192 KB Output is correct
35 Correct 18 ms 7248 KB Output is correct
36 Correct 41 ms 9100 KB Output is correct
37 Correct 84 ms 11888 KB Output is correct
38 Correct 65 ms 12444 KB Output is correct
39 Correct 17 ms 9040 KB Output is correct
40 Correct 6 ms 6736 KB Output is correct
41 Correct 740 ms 15172 KB Output is correct
42 Correct 164 ms 15944 KB Output is correct
43 Correct 359 ms 15180 KB Output is correct
44 Correct 143 ms 13800 KB Output is correct
45 Correct 115 ms 15432 KB Output is correct
46 Correct 749 ms 15176 KB Output is correct
47 Correct 74 ms 15332 KB Output is correct
48 Correct 258 ms 14884 KB Output is correct
49 Correct 129 ms 14548 KB Output is correct
50 Execution timed out 2058 ms 15440 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6480 KB Output is correct
2 Correct 4 ms 6480 KB Output is correct
3 Correct 3 ms 6480 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 3 ms 6480 KB Output is correct
6 Correct 4 ms 6480 KB Output is correct
7 Correct 3 ms 6480 KB Output is correct
8 Correct 4 ms 6648 KB Output is correct
9 Correct 50 ms 12888 KB Output is correct
10 Correct 16 ms 8016 KB Output is correct
11 Correct 43 ms 10576 KB Output is correct
12 Correct 40 ms 9152 KB Output is correct
13 Correct 47 ms 12020 KB Output is correct
14 Correct 35 ms 10316 KB Output is correct
15 Correct 12 ms 7760 KB Output is correct
16 Correct 30 ms 10320 KB Output is correct
17 Correct 107 ms 13896 KB Output is correct
18 Correct 56 ms 10080 KB Output is correct
19 Correct 4 ms 6736 KB Output is correct
20 Correct 3 ms 6480 KB Output is correct
21 Correct 5 ms 6736 KB Output is correct
22 Correct 5 ms 6736 KB Output is correct
23 Correct 6 ms 6736 KB Output is correct
24 Correct 4 ms 6736 KB Output is correct
25 Correct 4 ms 6736 KB Output is correct
26 Correct 4 ms 6736 KB Output is correct
27 Correct 4 ms 6736 KB Output is correct
28 Correct 4 ms 6480 KB Output is correct
29 Correct 3 ms 6736 KB Output is correct
30 Correct 3 ms 6736 KB Output is correct
31 Correct 7 ms 6688 KB Output is correct
32 Correct 6 ms 6736 KB Output is correct
33 Correct 6 ms 6736 KB Output is correct
34 Correct 36 ms 8544 KB Output is correct
35 Correct 36 ms 12112 KB Output is correct
36 Correct 71 ms 11088 KB Output is correct
37 Correct 390 ms 12224 KB Output is correct
38 Correct 485 ms 11848 KB Output is correct
39 Correct 39 ms 12492 KB Output is correct
40 Correct 9 ms 6736 KB Output is correct
41 Correct 92 ms 8720 KB Output is correct
42 Correct 66 ms 12192 KB Output is correct
43 Correct 18 ms 7248 KB Output is correct
44 Correct 41 ms 9100 KB Output is correct
45 Correct 84 ms 11888 KB Output is correct
46 Correct 65 ms 12444 KB Output is correct
47 Correct 17 ms 9040 KB Output is correct
48 Correct 6 ms 6736 KB Output is correct
49 Correct 740 ms 15172 KB Output is correct
50 Correct 164 ms 15944 KB Output is correct
51 Correct 359 ms 15180 KB Output is correct
52 Correct 143 ms 13800 KB Output is correct
53 Correct 115 ms 15432 KB Output is correct
54 Correct 749 ms 15176 KB Output is correct
55 Correct 74 ms 15332 KB Output is correct
56 Correct 258 ms 14884 KB Output is correct
57 Correct 129 ms 14548 KB Output is correct
58 Execution timed out 2058 ms 15440 KB Time limit exceeded
59 Halted 0 ms 0 KB -