Submission #66741176

Source Code Expand

#include <stdio.h>

int main(){
    int N, Q;
    scanf("%d %d", &N, &Q);
    int X[Q];
    int BOX[N];
    for (int i = 0; i < Q; i++){
        scanf("%d", &X[i]);
    }
    for (int i = 0; i < N; i++){
        BOX[i] = 0;
    }

    // int min_idx = 0;
    for(int i = 0; i < Q; i++){
        if(X[i] == 0){
            //search for min
            // int tmp_idx = min_idx;
            // for(int j = min_idx + 1; j < N; j++){
            //     if(BOX[j] < BOX[tmp_idx]){
            //         tmp_idx = j;
            //     }
            // }
            // if(tmp_idx == min_idx){
            //     for(int j = 0; j < min_idx; j++){
            //         if(BOX[j] < BOX[tmp_idx]){
            //             tmp_idx = j;
            //         }
            //     }
            // }
            // BOX[tmp_idx] += 1;
            // printf("%d ", tmp_idx + 1);
            // min_idx = tmp_idx;
            int min_idx = 0;
            for(int j = 0; j < N; j++){
                if(BOX[j] < BOX[min_idx]){
                    min_idx = j;
                }
            }
            BOX[min_idx] += 1;
            printf("%d ", min_idx + 1);

        }else{
            BOX[X[i] - 1] += 1;
            printf("%d ", X[i]);
        }

        // //for debug 
        // printf("BOX: ");
        // for(int k = 0; k < N; k++){
        //     printf("%d ", BOX[k]);
        // }
        // printf("\n");

    }
    printf("\n");
}

Submission Info

Submission Time
Task B - Reverse Proxy
User oinucha
Language C (gcc 12.2.0)
Score 200
Code Size 1496 Byte
Status AC
Exec Time 1 ms
Memory 1736 KiB

Compile Error

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

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 1620 KiB
sample_02.txt AC 0 ms 1616 KiB
sample_03.txt AC 0 ms 1644 KiB
test_01.txt AC 0 ms 1584 KiB
test_02.txt AC 0 ms 1708 KiB
test_03.txt AC 0 ms 1572 KiB
test_04.txt AC 0 ms 1716 KiB
test_05.txt AC 0 ms 1556 KiB
test_06.txt AC 1 ms 1728 KiB
test_07.txt AC 0 ms 1692 KiB
test_08.txt AC 0 ms 1736 KiB
test_09.txt AC 1 ms 1616 KiB
test_10.txt AC 1 ms 1712 KiB
test_11.txt AC 0 ms 1636 KiB
test_12.txt AC 0 ms 1612 KiB
test_13.txt AC 0 ms 1624 KiB
test_14.txt AC 0 ms 1620 KiB
test_15.txt AC 0 ms 1720 KiB
test_16.txt AC 0 ms 1728 KiB
test_17.txt AC 0 ms 1708 KiB
test_18.txt AC 0 ms 1620 KiB
test_19.txt AC 1 ms 1728 KiB
test_20.txt AC 0 ms 1724 KiB
test_21.txt AC 0 ms 1712 KiB
test_22.txt AC 0 ms 1572 KiB
test_23.txt AC 0 ms 1728 KiB
test_24.txt AC 0 ms 1620 KiB
test_25.txt AC 1 ms 1620 KiB
test_26.txt AC 0 ms 1628 KiB
test_27.txt AC 0 ms 1624 KiB
test_28.txt AC 1 ms 1620 KiB
test_29.txt AC 1 ms 1640 KiB
test_30.txt AC 0 ms 1708 KiB
test_31.txt AC 0 ms 1640 KiB
test_32.txt AC 0 ms 1712 KiB
test_33.txt AC 0 ms 1620 KiB
test_34.txt AC 0 ms 1556 KiB
test_35.txt AC 0 ms 1632 KiB
test_36.txt AC 0 ms 1624 KiB
test_37.txt AC 0 ms 1616 KiB
test_38.txt AC 0 ms 1720 KiB
test_39.txt AC 0 ms 1612 KiB