Submission #66732865


Source Code Expand

#include <bits/stdc++.h>
#define fs first
#define se second
using namespace std;
#define For(s,e) \
  for(int i=s;i<=e;++i)
#define ForR(s,e) \ 
  for(int i=s;i>=e;--i)
#define FOR(n) \
  for(int i=0;i<n;++i)
#define FORR(n) \ 
  for(int i=n-1;i>=0;--i)
#define IN(a,n) \
  FOR(n){\
    cin>>a[i];\
  }

int main(int /* argc */, char** /* argv */) {
  int n,q;
  cin>>n>>q;
  int a[q];
  for(int i=0;i<q;++i){
    cin>>a[i];
  }
  int b[n];
  int c[q];
  memset(b,0,sizeof(b));
  for(int i=0;i<q;++i){
    if(a[i]>0){
      c[i]=a[i];
    } else {
      int j=0;
      for(int i=0;i<n;++i){
        if(b[i]<b[j]){
          j=i;
        }
      }
      c[i]=j+1;
    }
    b[c[i]-1]+=1;
    cout<<c[i]<<" ";
  }
  cout<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - Reverse Proxy
User zz050201010
Language C++ 23 (Clang 16.0.6)
Score 200
Code Size 783 Byte
Status AC
Exec Time 1 ms
Memory 3684 KiB

Compile Error

./Main.cpp:7:20: warning: backslash and newline separated by space [-Wbackslash-newline-escape]
#define ForR(s,e) \ 
                   ^
./Main.cpp:11:18: warning: backslash and newline separated by space [-Wbackslash-newline-escape]
#define FORR(n) \ 
                 ^
2 warnings generated.

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 3552 KiB
sample_02.txt AC 1 ms 3472 KiB
sample_03.txt AC 1 ms 3440 KiB
test_01.txt AC 1 ms 3532 KiB
test_02.txt AC 1 ms 3416 KiB
test_03.txt AC 1 ms 3612 KiB
test_04.txt AC 1 ms 3536 KiB
test_05.txt AC 1 ms 3684 KiB
test_06.txt AC 1 ms 3492 KiB
test_07.txt AC 1 ms 3608 KiB
test_08.txt AC 1 ms 3560 KiB
test_09.txt AC 1 ms 3552 KiB
test_10.txt AC 1 ms 3556 KiB
test_11.txt AC 1 ms 3508 KiB
test_12.txt AC 1 ms 3436 KiB
test_13.txt AC 1 ms 3420 KiB
test_14.txt AC 1 ms 3616 KiB
test_15.txt AC 1 ms 3552 KiB
test_16.txt AC 1 ms 3680 KiB
test_17.txt AC 1 ms 3680 KiB
test_18.txt AC 1 ms 3472 KiB
test_19.txt AC 1 ms 3552 KiB
test_20.txt AC 1 ms 3472 KiB
test_21.txt AC 1 ms 3416 KiB
test_22.txt AC 1 ms 3512 KiB
test_23.txt AC 1 ms 3536 KiB
test_24.txt AC 1 ms 3508 KiB
test_25.txt AC 1 ms 3684 KiB
test_26.txt AC 1 ms 3468 KiB
test_27.txt AC 1 ms 3508 KiB
test_28.txt AC 1 ms 3616 KiB
test_29.txt AC 1 ms 3616 KiB
test_30.txt AC 1 ms 3532 KiB
test_31.txt AC 1 ms 3544 KiB
test_32.txt AC 1 ms 3412 KiB
test_33.txt AC 1 ms 3472 KiB
test_34.txt AC 1 ms 3444 KiB
test_35.txt AC 1 ms 3372 KiB
test_36.txt AC 1 ms 3560 KiB
test_37.txt AC 1 ms 3608 KiB
test_38.txt AC 1 ms 3480 KiB
test_39.txt AC 1 ms 3412 KiB