Submission #66758363

Source Code Expand

//# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#include"atcoder/all"
using namespace atcoder;
typedef modint1000000007 mi;
using namespace std;
#define all(a) a.begin(),a.end()
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
constexpr ll mod=998244353;
constexpr ll inf=3e18;

int main(){
	int n,q;
	cin>>n>>q;
	vector<int>box(n);
	rep(Q,q){
		int x;
		cin>>x;
		if(x>=1){
			box[x-1]++;
			cout<<x<<endl;
		}
		else{
			int ans=-1;
			for(int i=0;i<=q;i++){
				for(int j=0;j<n;j++){
					if(box[j]==i){
						ans=j+1;
						box[j]++;
						break;
					}
				}
				if(ans!=-1){
					cout<<ans<<endl;
					break;
				}
			}
		}
	}
}

Submission Info

Submission Time
Task B - Reverse Proxy
User Rho17
Language C++ 20 (gcc 12.2)
Score 200
Code Size 852 Byte
Status AC
Exec Time 1 ms
Memory 3732 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 42
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3604 KiB
sample_02.txt AC 1 ms 3608 KiB
sample_03.txt AC 1 ms 3508 KiB
test_01.txt AC 1 ms 3556 KiB
test_02.txt AC 1 ms 3604 KiB
test_03.txt AC 1 ms 3556 KiB
test_04.txt AC 1 ms 3680 KiB
test_05.txt AC 1 ms 3732 KiB
test_06.txt AC 1 ms 3544 KiB
test_07.txt AC 1 ms 3540 KiB
test_08.txt AC 1 ms 3604 KiB
test_09.txt AC 1 ms 3556 KiB
test_10.txt AC 1 ms 3680 KiB
test_11.txt AC 1 ms 3672 KiB
test_12.txt AC 1 ms 3544 KiB
test_13.txt AC 1 ms 3588 KiB
test_14.txt AC 1 ms 3460 KiB
test_15.txt AC 1 ms 3680 KiB
test_16.txt AC 1 ms 3472 KiB
test_17.txt AC 1 ms 3596 KiB
test_18.txt AC 1 ms 3596 KiB
test_19.txt AC 1 ms 3516 KiB
test_20.txt AC 1 ms 3612 KiB
test_21.txt AC 1 ms 3536 KiB
test_22.txt AC 1 ms 3604 KiB
test_23.txt AC 1 ms 3608 KiB
test_24.txt AC 1 ms 3556 KiB
test_25.txt AC 1 ms 3560 KiB
test_26.txt AC 1 ms 3676 KiB
test_27.txt AC 1 ms 3560 KiB
test_28.txt AC 1 ms 3612 KiB
test_29.txt AC 1 ms 3516 KiB
test_30.txt AC 1 ms 3544 KiB
test_31.txt AC 1 ms 3604 KiB
test_32.txt AC 1 ms 3612 KiB
test_33.txt AC 1 ms 3516 KiB
test_34.txt AC 1 ms 3608 KiB
test_35.txt AC 1 ms 3612 KiB
test_36.txt AC 1 ms 3608 KiB
test_37.txt AC 1 ms 3676 KiB
test_38.txt AC 1 ms 3456 KiB
test_39.txt AC 1 ms 3532 KiB