oj.uz

답안 #1112610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112610 2024-11-14T12:12:29 Z vjudge1 Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 10568 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; 
 

int32_t 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 504 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 49 ms 5860 KB Output is correct
2 Correct 12 ms 1872 KB Output is correct
3 Correct 38 ms 6224 KB Output is correct
4 Correct 20 ms 3152 KB Output is correct
5 Correct 44 ms 5456 KB Output is correct
6 Correct 32 ms 4176 KB Output is correct
7 Correct 8 ms 1616 KB Output is correct
8 Correct 29 ms 4352 KB Output is correct
9 Correct 56 ms 6396 KB Output is correct
10 Correct 35 ms 4680 KB Output is correct

Subtask #3
15.0 / 15.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 2 ms 504 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 1 ms 492 KB Output is correct
14 Correct 1 ms 336 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 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 2 ms 504 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 1 ms 492 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 17 ms 1872 KB Output is correct
17 Correct 29 ms 4780 KB Output is correct
18 Correct 59 ms 4988 KB Output is correct
19 Correct 327 ms 5692 KB Output is correct
20 Correct 372 ms 5456 KB Output is correct
21 Correct 28 ms 4944 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 47 ms 2640 KB Output is correct
24 Correct 68 ms 5448 KB Output is correct
25 Correct 11 ms 848 KB Output is correct
26 Correct 36 ms 2916 KB Output is correct
27 Correct 60 ms 5200 KB Output is correct
28 Correct 58 ms 5708 KB Output is correct
29 Correct 14 ms 3068 KB Output is correct
30 Correct 3 ms 764 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 5860 KB Output is correct
2 Correct 12 ms 1872 KB Output is correct
3 Correct 38 ms 6224 KB Output is correct
4 Correct 20 ms 3152 KB Output is correct
5 Correct 44 ms 5456 KB Output is correct
6 Correct 32 ms 4176 KB Output is correct
7 Correct 8 ms 1616 KB Output is correct
8 Correct 29 ms 4352 KB Output is correct
9 Correct 56 ms 6396 KB Output is correct
10 Correct 35 ms 4680 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 2 ms 504 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 1 ms 492 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 17 ms 1872 KB Output is correct
27 Correct 29 ms 4780 KB Output is correct
28 Correct 59 ms 4988 KB Output is correct
29 Correct 327 ms 5692 KB Output is correct
30 Correct 372 ms 5456 KB Output is correct
31 Correct 28 ms 4944 KB Output is correct
32 Correct 2 ms 336 KB Output is correct
33 Correct 47 ms 2640 KB Output is correct
34 Correct 68 ms 5448 KB Output is correct
35 Correct 11 ms 848 KB Output is correct
36 Correct 36 ms 2916 KB Output is correct
37 Correct 60 ms 5200 KB Output is correct
38 Correct 58 ms 5708 KB Output is correct
39 Correct 14 ms 3068 KB Output is correct
40 Correct 3 ms 764 KB Output is correct
41 Correct 644 ms 9288 KB Output is correct
42 Correct 140 ms 9544 KB Output is correct
43 Correct 302 ms 10112 KB Output is correct
44 Correct 144 ms 9548 KB Output is correct
45 Correct 76 ms 10568 KB Output is correct
46 Correct 642 ms 9544 KB Output is correct
47 Correct 63 ms 9032 KB Output is correct
48 Correct 217 ms 9288 KB Output is correct
49 Correct 118 ms 9096 KB Output is correct
50 Execution timed out 2032 ms 10568 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 504 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 49 ms 5860 KB Output is correct
10 Correct 12 ms 1872 KB Output is correct
11 Correct 38 ms 6224 KB Output is correct
12 Correct 20 ms 3152 KB Output is correct
13 Correct 44 ms 5456 KB Output is correct
14 Correct 32 ms 4176 KB Output is correct
15 Correct 8 ms 1616 KB Output is correct
16 Correct 29 ms 4352 KB Output is correct
17 Correct 56 ms 6396 KB Output is correct
18 Correct 35 ms 4680 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 2 ms 504 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 1 ms 492 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 17 ms 1872 KB Output is correct
35 Correct 29 ms 4780 KB Output is correct
36 Correct 59 ms 4988 KB Output is correct
37 Correct 327 ms 5692 KB Output is correct
38 Correct 372 ms 5456 KB Output is correct
39 Correct 28 ms 4944 KB Output is correct
40 Correct 2 ms 336 KB Output is correct
41 Correct 47 ms 2640 KB Output is correct
42 Correct 68 ms 5448 KB Output is correct
43 Correct 11 ms 848 KB Output is correct
44 Correct 36 ms 2916 KB Output is correct
45 Correct 60 ms 5200 KB Output is correct
46 Correct 58 ms 5708 KB Output is correct
47 Correct 14 ms 3068 KB Output is correct
48 Correct 3 ms 764 KB Output is correct
49 Correct 644 ms 9288 KB Output is correct
50 Correct 140 ms 9544 KB Output is correct
51 Correct 302 ms 10112 KB Output is correct
52 Correct 144 ms 9548 KB Output is correct
53 Correct 76 ms 10568 KB Output is correct
54 Correct 642 ms 9544 KB Output is correct
55 Correct 63 ms 9032 KB Output is correct
56 Correct 217 ms 9288 KB Output is correct
57 Correct 118 ms 9096 KB Output is correct
58 Execution timed out 2032 ms 10568 KB Time limit exceeded
59 Halted 0 ms 0 KB -