oj.uz

Submission #1037542

# Submission time Handle Problem Language Result Execution time Memory
1037542 2024-07-29T03:40:28 Z RiverFlow Binaria (CCO23_day1problem1) C++14
25 / 25
 191 ms 114768 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)1e6 + 9;
const int mod = (int)1e6 + 3;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

vector<int> g[N];
int a[N], id[N];
bool vis[N];

bool dfs(int u) {
    vis[u] = 1;
    for(int v : g[u]) {
        if (id[v] == (id[u] ^ 1)) {
            return 1;
        }
        if (!vis[v]) {
            id[v] = id[u];
            if (dfs(v)) return 1;
        }
    }

    return 0;
}

int Pow(int a, long long b) {
    int res = 1;
    for(; b > 0; b >>= 1, a = 1ll * a * a % mod)
        if (b & 1) res = 1ll * res * a % mod;
    return res;
}
int add(int a, int b) { return a + b < mod ? a + b : a + b - mod; }
int sub(int a, int b) { return a >= b ? a - b : a - b + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void main_code() {
    int n, k; cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i + k - 1];
    memset(id, -1, sizeof id);
    for(int i = k + 1; i <= n; ++i) {
        if (abs(a[i] - a[i - 1]) > 1) evoid(0);
        if (a[i - 1] == a[i] - 1) {
            if (id[i - k] == 1) evoid(0);
            id[i - k] = 0, id[i] = 1;
        } else if (a[i - 1] == a[i] + 1) {
            if (id[i - k] == 0) evoid(0);
            id[i - k] = 1, id[i] = 0;
        } else {
            g[i].push_back(i - k);
            g[i - k].push_back(i);
        }
    }
    for(int i = 1; i <= n; ++i) if (!vis[i] and id[i] != -1) {
        if (dfs(i)) evoid(0);
    }
//    FOR(i, 1, n) cout << id[i] << ' ';

    int sum = 0;
    FOR(i, 1, k) {
        if (id[i] != -1) sum += id[i];
    }
    int f = a[k] - sum;
    if (f < 0) evoid(0);
    FOR(i, k + 1, n) {
        if (id[i-k]!=-1)
            sum-=id[i-k];
        if (id[i]!=-1)
            sum+=id[i];
        if (a[i]-sum != f)evoid(0);
    }
//    cout << f << nl;

    // dem so bit
    int t=0;
    FOR(i, 1, k) if (id[i]==-1)++t;
    // C(f, t)
    // t! / f! * (t-f)!
    vector<int> P(n+1,0);
    P[0]=1;
    FOR(i,1,n)P[i]=1LL*P[i-1]*i%mod;
    if (t<f)evoid(0);
    cout << mul(P[t], Pow(mul(P[f], P[t-f]) , mod-2));
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct
13 Correct 5 ms 30300 KB Output is correct
14 Correct 6 ms 30300 KB Output is correct
15 Correct 5 ms 30296 KB Output is correct
16 Correct 5 ms 30408 KB Output is correct
17 Correct 5 ms 30296 KB Output is correct
18 Correct 5 ms 30296 KB Output is correct
19 Correct 4 ms 30300 KB Output is correct
20 Correct 5 ms 30300 KB Output is correct
21 Correct 6 ms 30300 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct
13 Correct 5 ms 30300 KB Output is correct
14 Correct 6 ms 30300 KB Output is correct
15 Correct 5 ms 30296 KB Output is correct
16 Correct 5 ms 30408 KB Output is correct
17 Correct 5 ms 30296 KB Output is correct
18 Correct 5 ms 30296 KB Output is correct
19 Correct 4 ms 30300 KB Output is correct
20 Correct 5 ms 30300 KB Output is correct
21 Correct 6 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 4 ms 30300 KB Output is correct
24 Correct 4 ms 30300 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 5 ms 30556 KB Output is correct
27 Correct 5 ms 30300 KB Output is correct
28 Correct 6 ms 30300 KB Output is correct
29 Correct 5 ms 30300 KB Output is correct
30 Correct 5 ms 30548 KB Output is correct
31 Correct 5 ms 30556 KB Output is correct
32 Correct 6 ms 30300 KB Output is correct
33 Correct 7 ms 30408 KB Output is correct
34 Correct 5 ms 30552 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct
13 Correct 5 ms 30300 KB Output is correct
14 Correct 6 ms 30300 KB Output is correct
15 Correct 5 ms 30296 KB Output is correct
16 Correct 5 ms 30408 KB Output is correct
17 Correct 5 ms 30296 KB Output is correct
18 Correct 5 ms 30296 KB Output is correct
19 Correct 4 ms 30300 KB Output is correct
20 Correct 5 ms 30300 KB Output is correct
21 Correct 6 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 4 ms 30300 KB Output is correct
24 Correct 4 ms 30300 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 5 ms 30556 KB Output is correct
27 Correct 5 ms 30300 KB Output is correct
28 Correct 6 ms 30300 KB Output is correct
29 Correct 5 ms 30300 KB Output is correct
30 Correct 5 ms 30548 KB Output is correct
31 Correct 5 ms 30556 KB Output is correct
32 Correct 6 ms 30300 KB Output is correct
33 Correct 7 ms 30408 KB Output is correct
34 Correct 5 ms 30552 KB Output is correct
35 Correct 99 ms 67752 KB Output is correct
36 Correct 191 ms 67920 KB Output is correct
37 Correct 183 ms 68912 KB Output is correct
38 Correct 111 ms 69756 KB Output is correct
39 Correct 99 ms 67664 KB Output is correct
40 Correct 110 ms 67628 KB Output is correct
41 Correct 178 ms 69456 KB Output is correct
42 Correct 125 ms 70228 KB Output is correct
43 Correct 130 ms 69952 KB Output is correct
44 Correct 111 ms 67664 KB Output is correct
45 Correct 142 ms 114768 KB Output is correct
46 Correct 136 ms 67632 KB Output is correct
47 Correct 106 ms 67668 KB Output is correct
48 Correct 101 ms 67664 KB Output is correct
49 Correct 105 ms 70072 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct
13 Correct 5 ms 30300 KB Output is correct
14 Correct 6 ms 30300 KB Output is correct
15 Correct 5 ms 30296 KB Output is correct
16 Correct 5 ms 30408 KB Output is correct
17 Correct 5 ms 30296 KB Output is correct
18 Correct 5 ms 30296 KB Output is correct
19 Correct 4 ms 30300 KB Output is correct
20 Correct 5 ms 30300 KB Output is correct
21 Correct 6 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 4 ms 30300 KB Output is correct
24 Correct 4 ms 30300 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 5 ms 30556 KB Output is correct
27 Correct 5 ms 30300 KB Output is correct
28 Correct 6 ms 30300 KB Output is correct
29 Correct 5 ms 30300 KB Output is correct
30 Correct 5 ms 30548 KB Output is correct
31 Correct 5 ms 30556 KB Output is correct
32 Correct 6 ms 30300 KB Output is correct
33 Correct 7 ms 30408 KB Output is correct
34 Correct 5 ms 30552 KB Output is correct
35 Correct 99 ms 67752 KB Output is correct
36 Correct 191 ms 67920 KB Output is correct
37 Correct 183 ms 68912 KB Output is correct
38 Correct 111 ms 69756 KB Output is correct
39 Correct 99 ms 67664 KB Output is correct
40 Correct 110 ms 67628 KB Output is correct
41 Correct 178 ms 69456 KB Output is correct
42 Correct 125 ms 70228 KB Output is correct
43 Correct 130 ms 69952 KB Output is correct
44 Correct 111 ms 67664 KB Output is correct
45 Correct 142 ms 114768 KB Output is correct
46 Correct 136 ms 67632 KB Output is correct
47 Correct 106 ms 67668 KB Output is correct
48 Correct 101 ms 67664 KB Output is correct
49 Correct 105 ms 70072 KB Output is correct
50 Correct 110 ms 67664 KB Output is correct
51 Correct 129 ms 72528 KB Output is correct
52 Correct 137 ms 72568 KB Output is correct
53 Correct 191 ms 70484 KB Output is correct
54 Correct 153 ms 72560 KB Output is correct
55 Correct 112 ms 72788 KB Output is correct
56 Correct 129 ms 72528 KB Output is correct
57 Correct 164 ms 70556 KB Output is correct
58 Correct 116 ms 72792 KB Output is correct
59 Correct 149 ms 72272 KB Output is correct
60 Correct 157 ms 70484 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 30300 KB Output is correct
2 Correct 5 ms 30300 KB Output is correct
3 Correct 5 ms 30300 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30512 KB Output is correct
6 Correct 5 ms 30300 KB Output is correct
7 Correct 5 ms 30408 KB Output is correct
8 Correct 4 ms 30300 KB Output is correct
9 Correct 4 ms 30300 KB Output is correct
10 Correct 5 ms 30296 KB Output is correct
11 Correct 5 ms 30300 KB Output is correct
12 Correct 5 ms 30300 KB Output is correct
13 Correct 5 ms 30300 KB Output is correct
14 Correct 6 ms 30300 KB Output is correct
15 Correct 5 ms 30296 KB Output is correct
16 Correct 5 ms 30408 KB Output is correct
17 Correct 5 ms 30296 KB Output is correct
18 Correct 5 ms 30296 KB Output is correct
19 Correct 4 ms 30300 KB Output is correct
20 Correct 5 ms 30300 KB Output is correct
21 Correct 6 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 4 ms 30300 KB Output is correct
24 Correct 4 ms 30300 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 5 ms 30556 KB Output is correct
27 Correct 5 ms 30300 KB Output is correct
28 Correct 6 ms 30300 KB Output is correct
29 Correct 5 ms 30300 KB Output is correct
30 Correct 5 ms 30548 KB Output is correct
31 Correct 5 ms 30556 KB Output is correct
32 Correct 6 ms 30300 KB Output is correct
33 Correct 7 ms 30408 KB Output is correct
34 Correct 5 ms 30552 KB Output is correct
35 Correct 99 ms 67752 KB Output is correct
36 Correct 191 ms 67920 KB Output is correct
37 Correct 183 ms 68912 KB Output is correct
38 Correct 111 ms 69756 KB Output is correct
39 Correct 99 ms 67664 KB Output is correct
40 Correct 110 ms 67628 KB Output is correct
41 Correct 178 ms 69456 KB Output is correct
42 Correct 125 ms 70228 KB Output is correct
43 Correct 130 ms 69952 KB Output is correct
44 Correct 111 ms 67664 KB Output is correct
45 Correct 142 ms 114768 KB Output is correct
46 Correct 136 ms 67632 KB Output is correct
47 Correct 106 ms 67668 KB Output is correct
48 Correct 101 ms 67664 KB Output is correct
49 Correct 105 ms 70072 KB Output is correct
50 Correct 110 ms 67664 KB Output is correct
51 Correct 129 ms 72528 KB Output is correct
52 Correct 137 ms 72568 KB Output is correct
53 Correct 191 ms 70484 KB Output is correct
54 Correct 153 ms 72560 KB Output is correct
55 Correct 112 ms 72788 KB Output is correct
56 Correct 129 ms 72528 KB Output is correct
57 Correct 164 ms 70556 KB Output is correct
58 Correct 116 ms 72792 KB Output is correct
59 Correct 149 ms 72272 KB Output is correct
60 Correct 157 ms 70484 KB Output is correct
61 Correct 18 ms 34396 KB Output is correct
62 Correct 18 ms 34344 KB Output is correct
63 Correct 17 ms 34392 KB Output is correct
64 Correct 17 ms 34396 KB Output is correct
65 Correct 79 ms 69972 KB Output is correct
66 Correct 63 ms 56144 KB Output is correct
67 Correct 121 ms 69400 KB Output is correct
68 Correct 38 ms 40424 KB Output is correct
69 Correct 19 ms 34396 KB Output is correct
70 Correct 17 ms 34392 KB Output is correct
71 Correct 18 ms 34396 KB Output is correct