Submission #66739333

---

Source Code Expand

#include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define sz(c) ll(c.size())
#define ll long long
#define tr(a, it) for (auto it = a.begin(); it != a.end(); it++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define inf 1e9
#define infi 1e18
#define MOD 1000000007
#define MAXN 10000
#define madar 1e18
#define moda 998244353
#define loop(i, s, e) for (ll i = s; i < e; i++)
#define revloop(i, s, e) for (ll i = s; i >= e; i--)
#define newl cout << endl
#define pb push_back
#define f first
#define s second

using namespace std;

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

ll gcd(ll a, ll b){
    if(!(a%b)) return b;
    return gcd(b, a%b);
}

ll lcm(ll a, ll b) {
    return (a*b)/gcd(a,b);
}

ll MSB(ll n)
{
    ll ans = -1;
    while (n) {
        ans++;
        n /= 2;
    }
    return ans;
}

ll power(ll a, ll b, ll mod) { // to calculate (a^b)%mod
    ll p = 1;
    while (b > 0) {
        if (b & 1)
            p = (p * a) % mod;
        a = (a * a) % mod;
        b = b >> 1;
    }
    return p;
}

ll inv_mod(ll n, ll mod) {
    return power(n, mod - 2, mod); 
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// #ifdef LOCAL
// #include "debug.h"
// #endif

void solve(int tc) {
    ll n, q; cin >> n >> q;
    vll a(q); loop(i,0,q) cin >> a[i];

    set<pll> st;
    vll ct(n, 0);
    for(ll i = 0; i < n; i++){
        st.insert({0, i});
    }

    vll b(q);

    for(ll i = 0; i < q; i++){
        // debug(st);
        if(a[i]){
            ll idx = a[i] - 1;
            ll ff = ct[idx];
            st.erase({ff, idx});

            ct[idx]++;
            st.insert({ct[idx], idx});
            
            b[i] = idx;
        }else{
            auto tmp = *st.begin();
            st.erase(st.begin());

            ll idx = tmp.s;

            ct[idx]++;
            st.insert({ct[idx], idx});

            b[i] = idx;
        }
    }

    for(ll i = 0; i < q; i++){
        cout << b[i] + 1 << ' ';
    }
}   

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    // auto start = std::chrono::high_resolution_clock::now();

    // freopen("input.txt", "r", stdin);
    // freopen("output1.txt", "w", stdout);
    int t = 1;
    // cin >> t;
    int tc = 0;
    while (t--) {
        tc++;
        solve(tc);
    }

    // newl;
    // auto end = chrono::high_resolution_clock::now();
    // auto duration = chrono::duration_cast<chrono::milliseconds>(end - start);

    // cout << "Time taken: " << duration.count() << " milliseconds" << std::endl;

    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve(int)’:
Main.cpp:72:16: warning: unused parameter ‘tc’ [-Wunused-parameter]
   72 | void solve(int tc) {
      |            ~~~~^~

Judge Result