oj.uz

답안 #891784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891784 2023-12-24T03:58:28 Z RiverFlow Binaria (CCO23_day1problem1) C++14
10 / 25
 3 ms 4444 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)2e5 + 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() {};

int n, k;

namespace SUB1 {
    int a[20], s[20];
    void sol() {
        FOR(i, 0, n - k) cin >> a[i];

        int ans = 0;
        FOR(mask, 0, (1 << n) - 1) {
            FOR(i, 0, n - k) s[i] = 0;
            FOR(i, 0, k - 1) s[0] += 1 & mask >> i;
            FOR(j, 1, n - k) {
                s[j] = s[j - 1] - (1 & (mask >> (j - 1))) + (1 & (mask >> (j + k - 1)));
            }
            bool ok = 1;
            FOR(i, 0, n - k) ok &= a[i] == s[i];
            if (ok) ++ans;
        }

        cout << ans;
    }
};

#define ON(mask, i) (1 & (mask >> i))

namespace SUB2 {
    const int N = 1007, K = 1 << 10;
    int dp[N][K], a[N];
    void add(int &a, int b) {
        a += b; if (a >= mod) a -= mod;
    }
    void sol() {
        FOR(i, 1, n - k + 1) cin >> a[i + k - 1];

        FOR(i, k, n - 1) if ( abs(a[i] - a[i + 1]) > 1 ) evoid(0);

        FOR(mask, 0, (1 << k) - 1) {
            if (__builtin_popcount(mask) == a[k])
                ++dp[k][mask];
        }

        FOR(i, k, n - 1) FOR(mask, 0, (1 << k) - 1) if (dp[i][mask]) {
            if (a[i] == a[i + 1]) {
                int new_mask = (mask >> 1);
                if (ON(mask, 0)) {
                    new_mask |= (1 << (k - 1));
                }
                add(dp[i + 1][new_mask], dp[i][mask]);
            } else {
                int new_mask = (mask >> 1);
                if (a[i] < a[i + 1]) {
                    if (!ON(mask, 0)) {
                        new_mask |= (1 << (k - 1));
                        add(dp[i + 1][new_mask], dp[i][mask]);
                    }
                } else {
                    if (ON(mask, 0)) {
                        add(dp[i + 1][new_mask], dp[i][mask]);
                    }
                }
            }
        }

        int res = 0;

        FOR(mask, 0, (1 << k) - 1) add(res, dp[n][mask]);

        cout << res;
    }
};

void main_code() {
    cin >> n >> k;

  	if (n <= 10) return SUB1::sol(), void();

    if (n <= 1000 and k <= 10) return SUB2::sol(), void();


}


/*     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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 3 ms 3420 KB Output is correct
24 Correct 3 ms 4188 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4276 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 3 ms 4188 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 3 ms 4188 KB Output is correct
31 Correct 3 ms 4300 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 3 ms 4444 KB Output is correct
34 Correct 3 ms 4444 KB Output is correct

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 3 ms 3420 KB Output is correct
24 Correct 3 ms 4188 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4276 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 3 ms 4188 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 3 ms 4188 KB Output is correct
31 Correct 3 ms 4300 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 3 ms 4444 KB Output is correct
34 Correct 3 ms 4444 KB Output is correct
35 Incorrect 0 ms 344 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 3 ms 3420 KB Output is correct
24 Correct 3 ms 4188 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4276 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 3 ms 4188 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 3 ms 4188 KB Output is correct
31 Correct 3 ms 4300 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 3 ms 4444 KB Output is correct
34 Correct 3 ms 4444 KB Output is correct
35 Incorrect 0 ms 344 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 720 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 3 ms 4188 KB Output is correct
23 Correct 3 ms 3420 KB Output is correct
24 Correct 3 ms 4188 KB Output is correct
25 Correct 3 ms 4300 KB Output is correct
26 Correct 3 ms 4276 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 3 ms 4188 KB Output is correct
29 Correct 3 ms 4444 KB Output is correct
30 Correct 3 ms 4188 KB Output is correct
31 Correct 3 ms 4300 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 3 ms 4444 KB Output is correct
34 Correct 3 ms 4444 KB Output is correct
35 Incorrect 0 ms 344 KB Output isn't correct
36 Halted 0 ms 0 KB -