oj.uz

Submission #839184

# Submission time Handle Problem Language Result Execution time Memory
839184 2023-08-29T02:46:35 Z anha3k25cvp Zalmoxis (BOI18_zalmoxis) C++14
55 / 100
 476 ms 69000 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const int inf = 7 + 1e9;

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n, k;
    cin >> n >> k;
    vector <int> a(n + k + 1, 0), nex(n + 1, 0), last(n + 1, 0);
    set <II> q;
    int mi = inf;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
        mi = min(mi, a[i]);
        q.insert({a[i], i});
        last[i] = i;
        if (i < n)
            nex[i] = i + 1;
    }
    int cnt = n;
    vector <int> c(n + k + 1, 0), b = a;
    while (!q.empty()) {
        int val = q.begin() -> st, u = q.begin() -> nd;
        q.erase(q.begin());
        if (val == 30)
            break;
        int v = nex[u];
        if (v && b[v] == b[u]) {
            q.erase(q.begin());
            c[last[u]] = v;
            last[u] = last[v];
            nex[u] = nex[v];
            q.insert({b[u] = val + 1, u});
        }
        else {
            a[++ cnt] = val;
            c[last[u]] = cnt;
            last[u] = cnt;
            q.insert({b[u] = val + 1, u});
        }
    }
    int pos = 1;
    n += k;
    for (int i = 1; i <= cnt; i ++) {
        if (a[pos] == mi) {
            int x = n - cnt + 1, k = 0;
            for (; (1 << k) < x; k ++);
            a[pos] -= k;
            int y = (1 << k) - x;
            for (int j = 1; j <= x; j ++)
                if (j <= y)
                    cout << a[pos] + 1 << ' ';
                else
                    cout << a[pos] << ' ';
            n = cnt;
        }
        else
            cout << a[pos] << ' ';
        pos = c[pos];
    }
    return 0;
}

Compilation message

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 68908 KB Output is correct
2 Correct 468 ms 69000 KB Output is correct
3 Correct 464 ms 68908 KB Output is correct
4 Correct 462 ms 68920 KB Output is correct
5 Correct 470 ms 68852 KB Output is correct
6 Correct 459 ms 68928 KB Output is correct

Subtask #2
25.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 466 ms 68896 KB doesn't contain S as a subsequence
2 Correct 452 ms 68800 KB Output is correct
3 Incorrect 449 ms 68856 KB doesn't contain S as a subsequence
4 Incorrect 476 ms 68860 KB doesn't contain S as a subsequence
5 Incorrect 468 ms 68908 KB doesn't contain S as a subsequence
6 Incorrect 465 ms 68928 KB doesn't contain S as a subsequence
7 Incorrect 476 ms 68904 KB doesn't contain S as a subsequence
8 Incorrect 467 ms 68884 KB doesn't contain S as a subsequence
9 Correct 405 ms 58104 KB Output is correct
10 Incorrect 183 ms 31652 KB doesn't contain S as a subsequence
11 Incorrect 276 ms 42188 KB doesn't contain S as a subsequence
12 Correct 55 ms 15988 KB Output is correct
13 Correct 55 ms 16064 KB Output is correct
14 Correct 53 ms 16056 KB Output is correct