oj.uz

Submission #1037521

# Submission time Handle Problem Language Result Execution time Memory
1037521 2024-07-29T02:54:01 Z RiverFlow Binaria (CCO23_day1problem1) C++14
10 / 25
 95 ms 65592 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)1e9 + 7;

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;
}

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);
    }
    if (!(k <= 20 and 1LL * (1 << k) * n <= (long long)1e8))
        return ;
    vector<int> p;
    for(int i = 1; i <= k; ++i) {
        if (id[i] == -1) {
            p.push_back(i);
        }
    }
    int ans = 0;
    for(int mask = 0; mask < (1 << sz(p)); ++mask) {
        for(int i = 0; i < sz(p); ++i) {
            int X = 1 & mask >> i;
            for(int j = p[i]; j <= n; j += k)
                id[j] = X;
        }
        bool check = 1;
        int sum = 0;
        FOR(i, 1, k) sum += id[i];
        if (sum != a[k]) continue;
        FOR(i, k + 1, n) {
            sum -= id[i-k], sum += id[i];
            if (sum != a[k]) continue;
        }
        ++ans;
    }
    cout << ans;
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'void main_code()':
Main.cpp:100:14: warning: unused variable 'check' [-Wunused-variable]
  100 |         bool check = 1;
      |              ^~~~~
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 6 ms 30556 KB Output is correct
2 Correct 5 ms 30296 KB Output is correct
3 Correct 5 ms 30508 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30300 KB Output is correct
6 Correct 4 ms 30300 KB Output is correct
7 Correct 4 ms 30300 KB Output is correct
8 Correct 6 ms 30296 KB Output is correct
9 Correct 5 ms 30296 KB Output is correct
10 Correct 6 ms 30300 KB Output is correct
11 Correct 6 ms 30516 KB Output is correct
12 Correct 4 ms 30504 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 30556 KB Output is correct
2 Correct 5 ms 30296 KB Output is correct
3 Correct 5 ms 30508 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30300 KB Output is correct
6 Correct 4 ms 30300 KB Output is correct
7 Correct 4 ms 30300 KB Output is correct
8 Correct 6 ms 30296 KB Output is correct
9 Correct 5 ms 30296 KB Output is correct
10 Correct 6 ms 30300 KB Output is correct
11 Correct 6 ms 30516 KB Output is correct
12 Correct 4 ms 30504 KB Output is correct
13 Correct 5 ms 30296 KB Output is correct
14 Correct 5 ms 30300 KB Output is correct
15 Correct 5 ms 30300 KB Output is correct
16 Correct 5 ms 30300 KB Output is correct
17 Correct 5 ms 30300 KB Output is correct
18 Correct 5 ms 30300 KB Output is correct
19 Correct 5 ms 30508 KB Output is correct
20 Correct 5 ms 30356 KB Output is correct
21 Correct 5 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 5 ms 30504 KB Output is correct
24 Correct 6 ms 30552 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 6 ms 30556 KB Output is correct
27 Correct 6 ms 30300 KB Output is correct
28 Correct 5 ms 30552 KB Output is correct
29 Correct 5 ms 30396 KB Output is correct
30 Correct 5 ms 30552 KB Output is correct
31 Correct 5 ms 30300 KB Output is correct
32 Correct 5 ms 30300 KB Output is correct
33 Correct 5 ms 30300 KB Output is correct
34 Correct 6 ms 30552 KB Output is correct
35 Incorrect 95 ms 65592 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 30556 KB Output is correct
2 Correct 5 ms 30296 KB Output is correct
3 Correct 5 ms 30508 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30300 KB Output is correct
6 Correct 4 ms 30300 KB Output is correct
7 Correct 4 ms 30300 KB Output is correct
8 Correct 6 ms 30296 KB Output is correct
9 Correct 5 ms 30296 KB Output is correct
10 Correct 6 ms 30300 KB Output is correct
11 Correct 6 ms 30516 KB Output is correct
12 Correct 4 ms 30504 KB Output is correct
13 Correct 5 ms 30296 KB Output is correct
14 Correct 5 ms 30300 KB Output is correct
15 Correct 5 ms 30300 KB Output is correct
16 Correct 5 ms 30300 KB Output is correct
17 Correct 5 ms 30300 KB Output is correct
18 Correct 5 ms 30300 KB Output is correct
19 Correct 5 ms 30508 KB Output is correct
20 Correct 5 ms 30356 KB Output is correct
21 Correct 5 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 5 ms 30504 KB Output is correct
24 Correct 6 ms 30552 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 6 ms 30556 KB Output is correct
27 Correct 6 ms 30300 KB Output is correct
28 Correct 5 ms 30552 KB Output is correct
29 Correct 5 ms 30396 KB Output is correct
30 Correct 5 ms 30552 KB Output is correct
31 Correct 5 ms 30300 KB Output is correct
32 Correct 5 ms 30300 KB Output is correct
33 Correct 5 ms 30300 KB Output is correct
34 Correct 6 ms 30552 KB Output is correct
35 Incorrect 95 ms 65592 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 30556 KB Output is correct
2 Correct 5 ms 30296 KB Output is correct
3 Correct 5 ms 30508 KB Output is correct
4 Correct 5 ms 30300 KB Output is correct
5 Correct 5 ms 30300 KB Output is correct
6 Correct 4 ms 30300 KB Output is correct
7 Correct 4 ms 30300 KB Output is correct
8 Correct 6 ms 30296 KB Output is correct
9 Correct 5 ms 30296 KB Output is correct
10 Correct 6 ms 30300 KB Output is correct
11 Correct 6 ms 30516 KB Output is correct
12 Correct 4 ms 30504 KB Output is correct
13 Correct 5 ms 30296 KB Output is correct
14 Correct 5 ms 30300 KB Output is correct
15 Correct 5 ms 30300 KB Output is correct
16 Correct 5 ms 30300 KB Output is correct
17 Correct 5 ms 30300 KB Output is correct
18 Correct 5 ms 30300 KB Output is correct
19 Correct 5 ms 30508 KB Output is correct
20 Correct 5 ms 30356 KB Output is correct
21 Correct 5 ms 30300 KB Output is correct
22 Correct 5 ms 30300 KB Output is correct
23 Correct 5 ms 30504 KB Output is correct
24 Correct 6 ms 30552 KB Output is correct
25 Correct 5 ms 30300 KB Output is correct
26 Correct 6 ms 30556 KB Output is correct
27 Correct 6 ms 30300 KB Output is correct
28 Correct 5 ms 30552 KB Output is correct
29 Correct 5 ms 30396 KB Output is correct
30 Correct 5 ms 30552 KB Output is correct
31 Correct 5 ms 30300 KB Output is correct
32 Correct 5 ms 30300 KB Output is correct
33 Correct 5 ms 30300 KB Output is correct
34 Correct 6 ms 30552 KB Output is correct
35 Incorrect 95 ms 65592 KB Output isn't correct
36 Halted 0 ms 0 KB -