Submission #1269824

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269824		glupan	Zalmoxis (BOI18_zalmoxis)	C++20	30 / 100	82 ms	10592 KiB

zalmoxis

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MAX_N = 1e5 + 5;

queue<int>occ[31];
int N,ans;

int dfs(int s) {
    if(!occ[s].empty()) {
        int cur = occ[s].front();
        occ[s].pop();
        N--;
        return cur;
    }
    else if(!N) {
        ans = s;
        return -1;
    }
    int a=dfs(s-1),b=dfs(s-1);
    return max(a,b);
}

void solve() {
    int n,k;
    cin >> n >> k;
    N=n;
    vector<int>v;
    for(int i=0; i<n; i++) {
        int x; cin >> x;
        v.push_back(x);
        occ[x].push(i);
    }
    int x = dfs(30);
    for(int i=0; i<n; i++) {
        cout << v[i] << " ";
        if(i == x) cout << ans << " ";
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int t=1;
    while(t--)
        solve();
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70