Submission #66723354

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
//const int MOD = 1000000007;
const int MOD = 998244353;

int main(){
    //ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<int> X(n+1);
    while(q--){
        int x;
        cin >> x;
        int ans = -1;
        if(x >= 1){
            X[x]++;
            ans = x;
        }else{
            int mx = 1e9;
            for(int i = 1; i <= n; i++){
                mx = min(mx, X[i]);
            }

            for(int i = 1; i <= n; i++){
                if(X[i] == mx){
                    X[i]++;
                    ans = i;
                    break;
                }
            }
        }

        cout << ans << " ";
    }
    cout << endl;

  
}

Submission Info

Judge Result