oj.uz

Submission #855984

# Submission time Handle Problem Language Result Execution time Memory
855984 2023-10-02T13:28:05 Z RiverFlow Martian DNA (BOI18_dna) C++14
16 / 100
 100 ms 142420 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)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() {};

int a[N], cnt[12][N], b[N], q[N], ind[N];

int n, k, r;

bool check(int x, int y) {
    FOR(i, 1, r)
        if (cnt[i][y] - cnt[i][x - 1] < q[i]) return 0;
    return 1;
}

void subtask3() {
    FOR(j, 1, r) {
        FOR(i, 1, n) cnt[j][i] = cnt[j][i - 1] + (a[i] == j);
    }
    int res = n + 1, j = 1;
    FOR(i, 1, n) {
        while (j <= i and check(j, i)) {
            res = min(res, i - j + 1); ++j;
        }
    }
    if (res == n + 1)
        evoid("impossible");
    cout << res;
}

int c[N];

queue<int> pos[N];

bool ok[N];

void main_code() {
    cin >> n >> k >> r;
    FOR(i, 1, n) cin >> a[i], ++a[i];

    FOR(i, 1, r) cin >> b[i] >> q[i], ++b[i];

    FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;

    FOR(i, 1, n) a[i] = ind[ a[i] ];

//    if (r <= 10) return subtask3(), void();

    int j = 1, d = 0, ans = n + 1;

    FOR(i, 1, n) {
        int v = a[i]; if (v == 0) continue ;
        pos[v].push(i);
        d -= ok[v];
        ok[v] |= sz(pos[v]) == q[v];
        d += ok[v];
        while (j <= i and a[j] == 0) ++j;
        while (sz(pos[v]) > q[v] and pos[v].front() <= j) {
            pos[v].pop(); ++j;
            while (j <= i and a[j] == 0) ++j;
        }

        if (d == r) {
            ans = min(ans, i - j + 1);
        }
    }

    if (ans == n + 1)
        evoid("impossible");

    cout << ans;
}


/*     Let the river flows naturally     */

Compilation message

dna.cpp: In function 'void main_code()':
dna.cpp:15:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   15 | #define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
      |                      ^~~
dna.cpp:83:5: note: in expansion of macro 'FOR'
   83 |     FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;
      |     ^~~
dna.cpp:83:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   83 |     FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;
      |                                 ^~~
dna.cpp: In function 'int main()':
dna.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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dna.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
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 139892 KB Output is correct
2 Correct 68 ms 139860 KB Output is correct
3 Correct 70 ms 139948 KB Output is correct
4 Correct 67 ms 139860 KB Output is correct
5 Correct 71 ms 139940 KB Output is correct
6 Correct 67 ms 139856 KB Output is correct
7 Correct 67 ms 139940 KB Output is correct
8 Correct 68 ms 139856 KB Output is correct
9 Correct 67 ms 139888 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 139908 KB Output is correct
2 Correct 78 ms 139792 KB Output is correct
3 Correct 75 ms 139948 KB Output is correct
4 Correct 67 ms 139856 KB Output is correct
5 Incorrect 70 ms 139856 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 140612 KB Output is correct
2 Correct 87 ms 140328 KB Output is correct
3 Correct 82 ms 140156 KB Output is correct
4 Correct 83 ms 140456 KB Output is correct
5 Correct 88 ms 140304 KB Output is correct
6 Correct 87 ms 140884 KB Output is correct
7 Correct 90 ms 140048 KB Output is correct
8 Correct 80 ms 140040 KB Output is correct
9 Incorrect 78 ms 140112 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 140200 KB Output is correct
2 Correct 96 ms 140112 KB Output is correct
3 Correct 91 ms 140216 KB Output is correct
4 Correct 90 ms 140368 KB Output is correct
5 Correct 96 ms 142420 KB Output is correct
6 Incorrect 97 ms 142348 KB Output isn't correct
7 Halted 0 ms 0 KB -