oj.uz

답안 #792792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792792 2023-07-25T08:49:58 Z 이동현(#10054) Binaria (CCO23_day1problem1) C++17
10 / 25
 1000 ms 81512 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

const int NS = (int)1e6 + 4, mod = (int)1e6 + 3;
int n, k;
int a[NS];
int r[NS], l[NS], chk[NS], isin[NS];
vector<int> ran[NS];

long long pw(int x, int y){
    if(!y) return 1;
    if(y == 1) return x;
    int v = pw(x, y / 2);
    return (long long)v * v % mod * (y % 2 ? x : 1) % mod;
}

int fdr(int x){
    return (x == r[x] ? x : r[x] = fdr(r[x]));
}

int fdl(int x){
    return (x == l[x] || x == -1 ? x : l[x] = fdl(l[x]));
}

int tr[NS + 24];

struct Fenwick{
    Fenwick(){}

    void push(int pos, int val){
        pos += 5;
        for(int i = pos; i < n + 30; i += (i & -i)){
            tr[i] += val;
        }
    }

    int get(int pos){
        int rv = 0;
        pos += 5;
        for(int i = pos; i > 0; i -= (i & -i)){
            rv += tr[i];
        }

        return rv;
    }

    int get(int l, int r){
        return get(r) - get(l - 1);
    }
};

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    iota(r, r + NS, 0);
    iota(l, l + NS, 0);
    memset(chk, -1, sizeof(chk));

    cin >> n >> k;
    vector<int> a(n - k + 1);
    for(int i = 0; i < n - k + 1; ++i){
        cin >> a[i];
    }
    Fenwick tr;

    auto cant = [&]{
        cout << "0\n";
        exit(0);
    };

    auto nor = [&](vector<int>&x){
        if(x[0] > x[1]) return;
        int nl = fdr(x[0]);
        int nr = fdl(x[1]);
        if(nl > nr){
            int nv = x[2] - tr.get(x[0], x[1]);
            if(nv) cant();
            x[0] = nl, x[1] = nr, x[2] = 0;
        }
        int nv = x[2] - tr.get(x[0], nl - 1) - tr.get(nr + 1, x[1]);
        x[0] = nl, x[1] = nr, x[2] = nv;
    };

    queue<int> que;

    for(int i = 0; i < n - k + 1; ++i){
        ran[i] = {i, i + k - 1, a[i]};
        que.push(i);
        ++isin[i];
    }

    auto upd = [&](int pos, int val, int id){
        if(val < 0 || val > 1) cant();

        int low = 0, high = id - 1, mid;
        while(low < high){
            mid = low + high + 1 >> 1;
            nor(ran[mid]);
            if(ran[mid][1] < pos){
                low = mid;
            }
            else{
                high = mid - 1;
            }
        }
        if(low >= 0 && !isin[low]) que.push(low), ++isin[low];

        low = id + 1, high = n - k - 1;
        while(low < high){
            mid = low + high >> 1;
            nor(ran[mid]);
            if(ran[mid][0] > pos){
                high = mid;
            }
            else{
                low = mid + 1;
            }
        }
        if(low < n - k && !isin[low]) que.push(low), ++isin[low];

        chk[pos] = val;
        tr.push(pos, val);
        l[pos] = pos - 1;
        r[pos] = pos + 1;
    };

    int rep = 0;
    while(!que.empty()){
        ++rep;
        assert(rep <= n * 6);
        int i = que.front();
        --isin[i];
        que.pop();
        if(i < 0 || i >= n - k || ran[i][0] > ran[i][1] || ran[i + 1][0] > ran[i + 1][1]) continue;
        nor(ran[i]);
        nor(ran[i + 1]);
        if(ran[i][0] > ran[i][1] || ran[i + 1][0] > ran[i + 1][1]) continue;
        int sval = ran[i][2] - tr.get(ran[i][0], ran[i][1]);
        int nval = ran[i + 1][2] - tr.get(ran[i + 1][0], ran[i + 1][1]);
        if(ran[i][0] == ran[i + 1][0] && ran[i][1] == ran[i + 1][1]){
            if(sval != nval) cant();
            continue;
        }
        if(ran[i][0] < ran[i + 1][0] && ran[i][1] < ran[i + 1][1] && sval == nval){
            continue;
        }

        if(ran[i][0] == ran[i + 1][0]){
            upd(ran[i + 1][1], nval - sval, i);
        }
        else if(ran[i][1] == ran[i + 1][1]){
            upd(ran[i][0], sval - nval, i);
        }
        else{
            if(sval > nval){
                upd(ran[i][0], sval - nval, i);
                upd(ran[i + 1][1], 0, i);
            }
            else{
                upd(ran[i + 1][1], nval - sval, i);
                upd(ran[i][0], 0, i);
            }
        }
    }

    int stval = 0;
    while(stval < n - k + 1){
        nor(ran[stval]);
        if(ran[stval][0] <= ran[stval][1]) break;
        ++stval;
    }
    if(stval == n - k + 1){
        cout << "1\n";
        return 0;
    }
    int ac = 0, oc = a[stval];
    assert(stval + k <= n);
    for(int i = stval; i < stval + k; ++i){
        ac += (chk[i] == -1);
        oc -= (chk[i] == 1);
    }

    long long ans = 1;
    for(int i = oc + 1; i <= ac; ++i){
        (ans *= i) %= mod;
    }
    for(int i = 2; i <= ac - oc; ++i){
        (ans *= pw(i, mod - 2)) %= mod;
    }

    cout << ans << '\n';
    
    return 0;
}

Compilation message

Main.cpp: In lambda function:
Main.cpp:101:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |             mid = low + high + 1 >> 1;
      |                   ~~~~~~~~~~~^~~
Main.cpp:114:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  114 |             mid = low + high >> 1;
      |                   ~~~~^~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct
13 Correct 15 ms 35484 KB Output is correct
14 Correct 16 ms 35568 KB Output is correct
15 Correct 15 ms 35540 KB Output is correct
16 Correct 16 ms 35472 KB Output is correct
17 Correct 18 ms 35564 KB Output is correct
18 Correct 17 ms 35492 KB Output is correct
19 Correct 18 ms 35540 KB Output is correct
20 Correct 16 ms 35480 KB Output is correct
21 Correct 18 ms 35500 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct
13 Correct 15 ms 35484 KB Output is correct
14 Correct 16 ms 35568 KB Output is correct
15 Correct 15 ms 35540 KB Output is correct
16 Correct 16 ms 35472 KB Output is correct
17 Correct 18 ms 35564 KB Output is correct
18 Correct 17 ms 35492 KB Output is correct
19 Correct 18 ms 35540 KB Output is correct
20 Correct 16 ms 35480 KB Output is correct
21 Correct 18 ms 35500 KB Output is correct
22 Correct 16 ms 35612 KB Output is correct
23 Correct 17 ms 35612 KB Output is correct
24 Correct 17 ms 35576 KB Output is correct
25 Correct 17 ms 35540 KB Output is correct
26 Correct 17 ms 35536 KB Output is correct
27 Correct 16 ms 35572 KB Output is correct
28 Correct 16 ms 35608 KB Output is correct
29 Correct 17 ms 35500 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 17 ms 35524 KB Output is correct
32 Correct 17 ms 35552 KB Output is correct
33 Correct 17 ms 35504 KB Output is correct
34 Correct 17 ms 35540 KB Output is correct

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct
13 Correct 15 ms 35484 KB Output is correct
14 Correct 16 ms 35568 KB Output is correct
15 Correct 15 ms 35540 KB Output is correct
16 Correct 16 ms 35472 KB Output is correct
17 Correct 18 ms 35564 KB Output is correct
18 Correct 17 ms 35492 KB Output is correct
19 Correct 18 ms 35540 KB Output is correct
20 Correct 16 ms 35480 KB Output is correct
21 Correct 18 ms 35500 KB Output is correct
22 Correct 16 ms 35612 KB Output is correct
23 Correct 17 ms 35612 KB Output is correct
24 Correct 17 ms 35576 KB Output is correct
25 Correct 17 ms 35540 KB Output is correct
26 Correct 17 ms 35536 KB Output is correct
27 Correct 16 ms 35572 KB Output is correct
28 Correct 16 ms 35608 KB Output is correct
29 Correct 17 ms 35500 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 17 ms 35524 KB Output is correct
32 Correct 17 ms 35552 KB Output is correct
33 Correct 17 ms 35504 KB Output is correct
34 Correct 17 ms 35540 KB Output is correct
35 Correct 183 ms 78776 KB Output is correct
36 Execution timed out 1098 ms 81512 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct
13 Correct 15 ms 35484 KB Output is correct
14 Correct 16 ms 35568 KB Output is correct
15 Correct 15 ms 35540 KB Output is correct
16 Correct 16 ms 35472 KB Output is correct
17 Correct 18 ms 35564 KB Output is correct
18 Correct 17 ms 35492 KB Output is correct
19 Correct 18 ms 35540 KB Output is correct
20 Correct 16 ms 35480 KB Output is correct
21 Correct 18 ms 35500 KB Output is correct
22 Correct 16 ms 35612 KB Output is correct
23 Correct 17 ms 35612 KB Output is correct
24 Correct 17 ms 35576 KB Output is correct
25 Correct 17 ms 35540 KB Output is correct
26 Correct 17 ms 35536 KB Output is correct
27 Correct 16 ms 35572 KB Output is correct
28 Correct 16 ms 35608 KB Output is correct
29 Correct 17 ms 35500 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 17 ms 35524 KB Output is correct
32 Correct 17 ms 35552 KB Output is correct
33 Correct 17 ms 35504 KB Output is correct
34 Correct 17 ms 35540 KB Output is correct
35 Correct 183 ms 78776 KB Output is correct
36 Execution timed out 1098 ms 81512 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 19 ms 35540 KB Output is correct
3 Correct 17 ms 35448 KB Output is correct
4 Correct 17 ms 35528 KB Output is correct
5 Correct 17 ms 35564 KB Output is correct
6 Correct 17 ms 35540 KB Output is correct
7 Correct 16 ms 35444 KB Output is correct
8 Correct 16 ms 35540 KB Output is correct
9 Correct 16 ms 35568 KB Output is correct
10 Correct 15 ms 35540 KB Output is correct
11 Correct 16 ms 35520 KB Output is correct
12 Correct 16 ms 35476 KB Output is correct
13 Correct 15 ms 35484 KB Output is correct
14 Correct 16 ms 35568 KB Output is correct
15 Correct 15 ms 35540 KB Output is correct
16 Correct 16 ms 35472 KB Output is correct
17 Correct 18 ms 35564 KB Output is correct
18 Correct 17 ms 35492 KB Output is correct
19 Correct 18 ms 35540 KB Output is correct
20 Correct 16 ms 35480 KB Output is correct
21 Correct 18 ms 35500 KB Output is correct
22 Correct 16 ms 35612 KB Output is correct
23 Correct 17 ms 35612 KB Output is correct
24 Correct 17 ms 35576 KB Output is correct
25 Correct 17 ms 35540 KB Output is correct
26 Correct 17 ms 35536 KB Output is correct
27 Correct 16 ms 35572 KB Output is correct
28 Correct 16 ms 35608 KB Output is correct
29 Correct 17 ms 35500 KB Output is correct
30 Correct 17 ms 35540 KB Output is correct
31 Correct 17 ms 35524 KB Output is correct
32 Correct 17 ms 35552 KB Output is correct
33 Correct 17 ms 35504 KB Output is correct
34 Correct 17 ms 35540 KB Output is correct
35 Correct 183 ms 78776 KB Output is correct
36 Execution timed out 1098 ms 81512 KB Time limit exceeded
37 Halted 0 ms 0 KB -