oj.uz

답안 #792647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792647 2023-07-25T07:47:55 Z 이동현(#10054) Binaria (CCO23_day1problem1) C++17
10 / 25
 1000 ms 107800 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
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];

int pw(int x, int y){
    if(!y) return 1;
    if(y == 1) return x;
    int v = pw(x, y / 2);
    return 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]));
}

struct Fenwick{
    int n;
    vector<int> tr;
    Fenwick(int m){
        n = m + 4;
        tr.resize(n);
    }

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

    int get(int pos){
        int rv = 0;
        pos += 2;
        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));

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

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

    auto nor = [&](vector<int> x)->vector<int>{
        if(x[0] > x[1]) return x;
        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();
            return {nl, nr, 0};
        }
        int nv = x[2] - tr.get(x[0], nl - 1) - tr.get(nr + 1, x[1]);
        return {nl, nr, nv};
    };

    queue<int> que;

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

    auto upd = [&](int pos, int val){
        // cout << "UPD " << pos << ' ' << val << endl;
        if(val < 0 || val > 1) cant();

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

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

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

    while(!que.empty()){
        int i = que.front();
        que.pop();
        if(i < 0 || i >= n - k) continue;
        ran[i] = nor(ran[i]);
        // cout << i << ' ' << ran[i + 1][0] << ' ' << ran[i + 1][1] << ' ' << ran[i + 1][2] << endl;
        ran[i + 1] = nor(ran[i + 1]);
        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] || ran[i + 1][0] > ran[i + 1][1]) continue;
        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;
        }
        
        que.push(i + 1);
        que.push(i - 1);

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

    // cout << "HI" << endl;

    int stval = 0;
    while(stval < n - k + 1){
        ran[stval] = 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];
    for(int i = stval; i < stval + k; ++i){
        ac += (chk[i] == -1);
        oc -= (chk[i] == 1);
    }

    int 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:106:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  106 |             mid = low + high + 1 >> 1;
      |                   ~~~~~~~~~~~^~~
Main.cpp:118:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  118 |             mid = low + high >> 1;
      |                   ~~~~^~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct
13 Correct 9 ms 23760 KB Output is correct
14 Correct 8 ms 23772 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct
16 Correct 9 ms 23756 KB Output is correct
17 Correct 10 ms 23764 KB Output is correct
18 Correct 9 ms 23764 KB Output is correct
19 Correct 10 ms 23800 KB Output is correct
20 Correct 9 ms 23764 KB Output is correct
21 Correct 10 ms 23764 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct
13 Correct 9 ms 23760 KB Output is correct
14 Correct 8 ms 23772 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct
16 Correct 9 ms 23756 KB Output is correct
17 Correct 10 ms 23764 KB Output is correct
18 Correct 9 ms 23764 KB Output is correct
19 Correct 10 ms 23800 KB Output is correct
20 Correct 9 ms 23764 KB Output is correct
21 Correct 10 ms 23764 KB Output is correct
22 Correct 10 ms 23840 KB Output is correct
23 Correct 14 ms 23992 KB Output is correct
24 Correct 9 ms 23872 KB Output is correct
25 Correct 11 ms 23892 KB Output is correct
26 Correct 10 ms 23892 KB Output is correct
27 Correct 10 ms 23888 KB Output is correct
28 Correct 10 ms 23892 KB Output is correct
29 Correct 9 ms 23764 KB Output is correct
30 Correct 10 ms 23764 KB Output is correct
31 Correct 10 ms 23892 KB Output is correct
32 Correct 10 ms 23888 KB Output is correct
33 Correct 10 ms 23764 KB Output is correct
34 Correct 9 ms 23888 KB Output is correct

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct
13 Correct 9 ms 23760 KB Output is correct
14 Correct 8 ms 23772 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct
16 Correct 9 ms 23756 KB Output is correct
17 Correct 10 ms 23764 KB Output is correct
18 Correct 9 ms 23764 KB Output is correct
19 Correct 10 ms 23800 KB Output is correct
20 Correct 9 ms 23764 KB Output is correct
21 Correct 10 ms 23764 KB Output is correct
22 Correct 10 ms 23840 KB Output is correct
23 Correct 14 ms 23992 KB Output is correct
24 Correct 9 ms 23872 KB Output is correct
25 Correct 11 ms 23892 KB Output is correct
26 Correct 10 ms 23892 KB Output is correct
27 Correct 10 ms 23888 KB Output is correct
28 Correct 10 ms 23892 KB Output is correct
29 Correct 9 ms 23764 KB Output is correct
30 Correct 10 ms 23764 KB Output is correct
31 Correct 10 ms 23892 KB Output is correct
32 Correct 10 ms 23888 KB Output is correct
33 Correct 10 ms 23764 KB Output is correct
34 Correct 9 ms 23888 KB Output is correct
35 Correct 262 ms 102452 KB Output is correct
36 Execution timed out 1084 ms 107800 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct
13 Correct 9 ms 23760 KB Output is correct
14 Correct 8 ms 23772 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct
16 Correct 9 ms 23756 KB Output is correct
17 Correct 10 ms 23764 KB Output is correct
18 Correct 9 ms 23764 KB Output is correct
19 Correct 10 ms 23800 KB Output is correct
20 Correct 9 ms 23764 KB Output is correct
21 Correct 10 ms 23764 KB Output is correct
22 Correct 10 ms 23840 KB Output is correct
23 Correct 14 ms 23992 KB Output is correct
24 Correct 9 ms 23872 KB Output is correct
25 Correct 11 ms 23892 KB Output is correct
26 Correct 10 ms 23892 KB Output is correct
27 Correct 10 ms 23888 KB Output is correct
28 Correct 10 ms 23892 KB Output is correct
29 Correct 9 ms 23764 KB Output is correct
30 Correct 10 ms 23764 KB Output is correct
31 Correct 10 ms 23892 KB Output is correct
32 Correct 10 ms 23888 KB Output is correct
33 Correct 10 ms 23764 KB Output is correct
34 Correct 9 ms 23888 KB Output is correct
35 Correct 262 ms 102452 KB Output is correct
36 Execution timed out 1084 ms 107800 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 23744 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 9 ms 23764 KB Output is correct
4 Correct 10 ms 23720 KB Output is correct
5 Correct 9 ms 23764 KB Output is correct
6 Correct 9 ms 23764 KB Output is correct
7 Correct 9 ms 23804 KB Output is correct
8 Correct 9 ms 23756 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 9 ms 23764 KB Output is correct
11 Correct 9 ms 23764 KB Output is correct
12 Correct 9 ms 23764 KB Output is correct
13 Correct 9 ms 23760 KB Output is correct
14 Correct 8 ms 23772 KB Output is correct
15 Correct 9 ms 23784 KB Output is correct
16 Correct 9 ms 23756 KB Output is correct
17 Correct 10 ms 23764 KB Output is correct
18 Correct 9 ms 23764 KB Output is correct
19 Correct 10 ms 23800 KB Output is correct
20 Correct 9 ms 23764 KB Output is correct
21 Correct 10 ms 23764 KB Output is correct
22 Correct 10 ms 23840 KB Output is correct
23 Correct 14 ms 23992 KB Output is correct
24 Correct 9 ms 23872 KB Output is correct
25 Correct 11 ms 23892 KB Output is correct
26 Correct 10 ms 23892 KB Output is correct
27 Correct 10 ms 23888 KB Output is correct
28 Correct 10 ms 23892 KB Output is correct
29 Correct 9 ms 23764 KB Output is correct
30 Correct 10 ms 23764 KB Output is correct
31 Correct 10 ms 23892 KB Output is correct
32 Correct 10 ms 23888 KB Output is correct
33 Correct 10 ms 23764 KB Output is correct
34 Correct 9 ms 23888 KB Output is correct
35 Correct 262 ms 102452 KB Output is correct
36 Execution timed out 1084 ms 107800 KB Time limit exceeded
37 Halted 0 ms 0 KB -