Submission #3007645
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; int N,K; bool used[100010] = {0}; int main(){ cin >> N >> K; // vector<pair<int,int>> v(N+1)+ int A[N+1],X[N+1]; for(int i=1;i<=N;i++){ cin >> X[i];//i位の人の若さ A[X[i]] = i;//X[i]番目の人の順位 // v[i] = {x,i}; } int ans[N+1],T = K; for(int i=N;i>=N-K-1;i--){ ans[i] = A[T]; used[X[i]] = 1; if(X[i]<=T){ T++; while(used[T]==1){ T++; } } // cout << T << endl; } for(int i=N-K-1;i<=N;i++){ cout << ans[i] << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | idsigma |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 581 Byte |
Status | RE |
Exec Time | 132 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 40 | 0 / 60 | ||||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | RE | 97 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 2 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 3 ms | 256 KB |
subtask1_08.txt | WA | 2 ms | 256 KB |
subtask1_09.txt | WA | 2 ms | 256 KB |
subtask1_10.txt | WA | 2 ms | 256 KB |
subtask1_11.txt | WA | 2 ms | 256 KB |
subtask2_01.txt | WA | 12 ms | 384 KB |
subtask2_02.txt | WA | 3 ms | 256 KB |
subtask2_03.txt | WA | 95 ms | 1536 KB |
subtask2_04.txt | WA | 37 ms | 1024 KB |
subtask2_05.txt | RE | 132 ms | 1152 KB |
subtask2_06.txt | WA | 115 ms | 1536 KB |
subtask2_07.txt | WA | 97 ms | 1408 KB |
subtask2_08.txt | WA | 93 ms | 1536 KB |
subtask2_09.txt | WA | 92 ms | 1408 KB |