(cache)Submission #66749940 - AtCoder Beginner Contest 410

Contest Duration: 2025-06-14(Sat) 21:00 - 2025-06-14(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #66749940

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#ifndef _Alignof
#define _Alignof __alignof__
#endif
#include <bits/stdc++.h>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
#define yes "Yes"
#define no "No"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
const vector<char> alpha = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
int dx[4] = {0, 1, 0, -1};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#ifndef _Alignof
#define _Alignof __alignof__
#endif
#include <bits/stdc++.h>
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
#define yes "Yes"
#define no "No"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
const vector<char> alpha = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
const ll INF = 1000000007;
const ll MOD=10000;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
int main(){
    int N,Q;
    cin >> N >> Q;
    vector<int> X(Q),A(N,0);
    REP(i,Q) {
        cin >> X[i];
        if (X[i]>=1){
            A[X[i]-1]++;
            cout << X[i];
            if (i < Q-1) cout << ' ';
            continue;
        }
        int mn=1e9,id=0;
        REP(j,N) if (chmin(mn,A[j])) id=j;
        cout << id + 1;
        if (i < Q-1) cout << ' ';
        A[id]++;
    }
    cout << endl;
}

Submission Info

Submission Time	2025-06-14 21:36:25
Task	B - Reverse Proxy
User	una_o0
Language	C++ 17 (gcc 12.2)
Score	200
Code Size	1458 Byte
Status	AC
Exec Time	1 ms
Memory	3680 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 3

× 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	3476 KiB
sample_02.txt	AC	1 ms	3408 KiB
sample_03.txt	AC	1 ms	3476 KiB
test_01.txt	AC	1 ms	3488 KiB
test_02.txt	AC	1 ms	3488 KiB
test_03.txt	AC	1 ms	3532 KiB
test_04.txt	AC	1 ms	3488 KiB
test_05.txt	AC	1 ms	3612 KiB
test_06.txt	AC	1 ms	3488 KiB
test_07.txt	AC	1 ms	3496 KiB
test_08.txt	AC	1 ms	3476 KiB
test_09.txt	AC	1 ms	3488 KiB
test_10.txt	AC	1 ms	3488 KiB
test_11.txt	AC	1 ms	3472 KiB
test_12.txt	AC	1 ms	3396 KiB
test_13.txt	AC	1 ms	3444 KiB
test_14.txt	AC	1 ms	3412 KiB
test_15.txt	AC	1 ms	3496 KiB
test_16.txt	AC	1 ms	3476 KiB
test_17.txt	AC	1 ms	3548 KiB
test_18.txt	AC	1 ms	3616 KiB
test_19.txt	AC	1 ms	3492 KiB
test_20.txt	AC	1 ms	3544 KiB
test_21.txt	AC	1 ms	3492 KiB
test_22.txt	AC	1 ms	3536 KiB
test_23.txt	AC	1 ms	3544 KiB
test_24.txt	AC	1 ms	3492 KiB
test_25.txt	AC	1 ms	3496 KiB
test_26.txt	AC	1 ms	3480 KiB
test_27.txt	AC	1 ms	3496 KiB
test_28.txt	AC	1 ms	3496 KiB
test_29.txt	AC	1 ms	3496 KiB
test_30.txt	AC	1 ms	3544 KiB
test_31.txt	AC	1 ms	3472 KiB
test_32.txt	AC	1 ms	3532 KiB
test_33.txt	AC	1 ms	3544 KiB
test_34.txt	AC	1 ms	3680 KiB
test_35.txt	AC	1 ms	3536 KiB
test_36.txt	AC	1 ms	3488 KiB
test_37.txt	AC	1 ms	3492 KiB
test_38.txt	AC	1 ms	3540 KiB
test_39.txt	AC	1 ms	3488 KiB