oj.uz

답안 #1112586

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112586 2024-11-14T11:07:58 Z dosts Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 13904 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;
        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;j++) {
            for (auto it : upds[j]) st1.update(1,1,n,it.ff,it.ss);
            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 3 ms 6480 KB Output is correct
2 Correct 3 ms 6544 KB Output is correct
3 Correct 3 ms 6480 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 2 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 3 ms 6492 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 11344 KB Output is correct
2 Correct 14 ms 7760 KB Output is correct
3 Correct 38 ms 10576 KB Output is correct
4 Correct 22 ms 9296 KB Output is correct
5 Correct 45 ms 10832 KB Output is correct
6 Correct 37 ms 9576 KB Output is correct
7 Correct 9 ms 7504 KB Output is correct
8 Correct 32 ms 9476 KB Output is correct
9 Correct 64 ms 11876 KB Output is correct
10 Correct 38 ms 10064 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6736 KB Output is correct
2 Correct 4 ms 6480 KB Output is correct
3 Correct 5 ms 6580 KB Output is correct
4 Correct 5 ms 6748 KB Output is correct
5 Correct 4 ms 6736 KB Output is correct
6 Correct 3 ms 6736 KB Output is correct
7 Correct 3 ms 6736 KB Output is correct
8 Correct 5 ms 6736 KB Output is correct
9 Correct 3 ms 6736 KB Output is correct
10 Correct 3 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 4 ms 6736 KB Output is correct
14 Correct 4 ms 6780 KB Output is correct
15 Correct 3 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 4 ms 6480 KB Output is correct
3 Correct 5 ms 6580 KB Output is correct
4 Correct 5 ms 6748 KB Output is correct
5 Correct 4 ms 6736 KB Output is correct
6 Correct 3 ms 6736 KB Output is correct
7 Correct 3 ms 6736 KB Output is correct
8 Correct 5 ms 6736 KB Output is correct
9 Correct 3 ms 6736 KB Output is correct
10 Correct 3 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 4 ms 6736 KB Output is correct
14 Correct 4 ms 6780 KB Output is correct
15 Correct 3 ms 6736 KB Output is correct
16 Correct 30 ms 8016 KB Output is correct
17 Correct 31 ms 11088 KB Output is correct
18 Correct 67 ms 11080 KB Output is correct
19 Correct 361 ms 10844 KB Output is correct
20 Correct 411 ms 10760 KB Output is correct
21 Correct 34 ms 11088 KB Output is correct
22 Correct 6 ms 6736 KB Output is correct
23 Correct 57 ms 8928 KB Output is correct
24 Correct 66 ms 11256 KB Output is correct
25 Correct 15 ms 6992 KB Output is correct
26 Correct 39 ms 9296 KB Output is correct
27 Correct 75 ms 10576 KB Output is correct
28 Correct 66 ms 10832 KB Output is correct
29 Correct 16 ms 8528 KB Output is correct
30 Correct 6 ms 6736 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 11344 KB Output is correct
2 Correct 14 ms 7760 KB Output is correct
3 Correct 38 ms 10576 KB Output is correct
4 Correct 22 ms 9296 KB Output is correct
5 Correct 45 ms 10832 KB Output is correct
6 Correct 37 ms 9576 KB Output is correct
7 Correct 9 ms 7504 KB Output is correct
8 Correct 32 ms 9476 KB Output is correct
9 Correct 64 ms 11876 KB Output is correct
10 Correct 38 ms 10064 KB Output is correct
11 Correct 4 ms 6736 KB Output is correct
12 Correct 4 ms 6480 KB Output is correct
13 Correct 5 ms 6580 KB Output is correct
14 Correct 5 ms 6748 KB Output is correct
15 Correct 4 ms 6736 KB Output is correct
16 Correct 3 ms 6736 KB Output is correct
17 Correct 3 ms 6736 KB Output is correct
18 Correct 5 ms 6736 KB Output is correct
19 Correct 3 ms 6736 KB Output is correct
20 Correct 3 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 4 ms 6736 KB Output is correct
24 Correct 4 ms 6780 KB Output is correct
25 Correct 3 ms 6736 KB Output is correct
26 Correct 30 ms 8016 KB Output is correct
27 Correct 31 ms 11088 KB Output is correct
28 Correct 67 ms 11080 KB Output is correct
29 Correct 361 ms 10844 KB Output is correct
30 Correct 411 ms 10760 KB Output is correct
31 Correct 34 ms 11088 KB Output is correct
32 Correct 6 ms 6736 KB Output is correct
33 Correct 57 ms 8928 KB Output is correct
34 Correct 66 ms 11256 KB Output is correct
35 Correct 15 ms 6992 KB Output is correct
36 Correct 39 ms 9296 KB Output is correct
37 Correct 75 ms 10576 KB Output is correct
38 Correct 66 ms 10832 KB Output is correct
39 Correct 16 ms 8528 KB Output is correct
40 Correct 6 ms 6736 KB Output is correct
41 Correct 720 ms 13392 KB Output is correct
42 Correct 143 ms 13880 KB Output is correct
43 Correct 347 ms 13396 KB Output is correct
44 Correct 140 ms 13648 KB Output is correct
45 Correct 70 ms 13896 KB Output is correct
46 Correct 770 ms 13904 KB Output is correct
47 Correct 65 ms 13384 KB Output is correct
48 Correct 225 ms 13596 KB Output is correct
49 Correct 118 ms 13384 KB Output is correct
50 Execution timed out 2069 ms 13384 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6480 KB Output is correct
2 Correct 3 ms 6544 KB Output is correct
3 Correct 3 ms 6480 KB Output is correct
4 Correct 3 ms 6480 KB Output is correct
5 Correct 2 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 3 ms 6492 KB Output is correct
9 Correct 52 ms 11344 KB Output is correct
10 Correct 14 ms 7760 KB Output is correct
11 Correct 38 ms 10576 KB Output is correct
12 Correct 22 ms 9296 KB Output is correct
13 Correct 45 ms 10832 KB Output is correct
14 Correct 37 ms 9576 KB Output is correct
15 Correct 9 ms 7504 KB Output is correct
16 Correct 32 ms 9476 KB Output is correct
17 Correct 64 ms 11876 KB Output is correct
18 Correct 38 ms 10064 KB Output is correct
19 Correct 4 ms 6736 KB Output is correct
20 Correct 4 ms 6480 KB Output is correct
21 Correct 5 ms 6580 KB Output is correct
22 Correct 5 ms 6748 KB Output is correct
23 Correct 4 ms 6736 KB Output is correct
24 Correct 3 ms 6736 KB Output is correct
25 Correct 3 ms 6736 KB Output is correct
26 Correct 5 ms 6736 KB Output is correct
27 Correct 3 ms 6736 KB Output is correct
28 Correct 3 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 4 ms 6736 KB Output is correct
32 Correct 4 ms 6780 KB Output is correct
33 Correct 3 ms 6736 KB Output is correct
34 Correct 30 ms 8016 KB Output is correct
35 Correct 31 ms 11088 KB Output is correct
36 Correct 67 ms 11080 KB Output is correct
37 Correct 361 ms 10844 KB Output is correct
38 Correct 411 ms 10760 KB Output is correct
39 Correct 34 ms 11088 KB Output is correct
40 Correct 6 ms 6736 KB Output is correct
41 Correct 57 ms 8928 KB Output is correct
42 Correct 66 ms 11256 KB Output is correct
43 Correct 15 ms 6992 KB Output is correct
44 Correct 39 ms 9296 KB Output is correct
45 Correct 75 ms 10576 KB Output is correct
46 Correct 66 ms 10832 KB Output is correct
47 Correct 16 ms 8528 KB Output is correct
48 Correct 6 ms 6736 KB Output is correct
49 Correct 720 ms 13392 KB Output is correct
50 Correct 143 ms 13880 KB Output is correct
51 Correct 347 ms 13396 KB Output is correct
52 Correct 140 ms 13648 KB Output is correct
53 Correct 70 ms 13896 KB Output is correct
54 Correct 770 ms 13904 KB Output is correct
55 Correct 65 ms 13384 KB Output is correct
56 Correct 225 ms 13596 KB Output is correct
57 Correct 118 ms 13384 KB Output is correct
58 Execution timed out 2069 ms 13384 KB Time limit exceeded
59 Halted 0 ms 0 KB -