Submission #74767445


Source Code Expand

#include<stdio.h>

int min(int *box,int len){
  int min=0;
  for(int i=1;i<len;i++){
    if(box[min]>box[i]){
      min=i;
    }
  }
  return min;
}

int main(){
  int N,Q;
  scanf("%d %d",&N,&Q);
  int box[N];
  for(int i=0;i<N;i++){
    box[i]=0;
  }
  int B[Q];
  for(int i=0;i<Q;i++){
    int x;
    scanf("%d",&x);
    if(x==0){
      x=min(box,N);
    }else{
      x--;
    }
    box[x]++;
    B[i]=x+1;
  }
  for(int i=0;i<Q;i++){
    printf("%d ",B[i]);
  }
  return 0;
}

Submission Info

Submission Time
Task D - Reverse Proxy
User tsuke9
Language C23 (GCC 14.2.0)
Score 200
Code Size 514 Byte
Status AC
Exec Time 0 ms
Memory 1744 KiB

Compile Error

Main.c: In function ‘main’:
Main.c:15:3: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 |   scanf("%d %d",&N,&Q);
      |   ^~~~~~~~~~~~~~~~~~~~
Main.c:23:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   23 |     scanf("%d",&x);
      |     ^~~~~~~~~~~~~~

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 0 ms 1580 KiB
sample_02.txt AC 0 ms 1608 KiB
sample_03.txt AC 0 ms 1668 KiB
test_01.txt AC 0 ms 1636 KiB
test_02.txt AC 0 ms 1680 KiB
test_03.txt AC 0 ms 1632 KiB
test_04.txt AC 0 ms 1636 KiB
test_05.txt AC 0 ms 1632 KiB
test_06.txt AC 0 ms 1744 KiB
test_07.txt AC 0 ms 1600 KiB
test_08.txt AC 0 ms 1620 KiB
test_09.txt AC 0 ms 1580 KiB
test_10.txt AC 0 ms 1636 KiB
test_11.txt AC 0 ms 1744 KiB
test_12.txt AC 0 ms 1744 KiB
test_13.txt AC 0 ms 1692 KiB
test_14.txt AC 0 ms 1720 KiB
test_15.txt AC 0 ms 1580 KiB
test_16.txt AC 0 ms 1680 KiB
test_17.txt AC 0 ms 1572 KiB
test_18.txt AC 0 ms 1608 KiB
test_19.txt AC 0 ms 1620 KiB
test_20.txt AC 0 ms 1744 KiB
test_21.txt AC 0 ms 1620 KiB
test_22.txt AC 0 ms 1672 KiB
test_23.txt AC 0 ms 1608 KiB
test_24.txt AC 0 ms 1576 KiB
test_25.txt AC 0 ms 1580 KiB
test_26.txt AC 0 ms 1668 KiB
test_27.txt AC 0 ms 1580 KiB
test_28.txt AC 0 ms 1744 KiB
test_29.txt AC 0 ms 1576 KiB
test_30.txt AC 0 ms 1744 KiB
test_31.txt AC 0 ms 1600 KiB
test_32.txt AC 0 ms 1744 KiB
test_33.txt AC 0 ms 1600 KiB
test_34.txt AC 0 ms 1600 KiB
test_35.txt AC 0 ms 1576 KiB
test_36.txt AC 0 ms 1576 KiB
test_37.txt AC 0 ms 1672 KiB
test_38.txt AC 0 ms 1744 KiB
test_39.txt AC 0 ms 1608 KiB