Submission #3008199
Source Code Expand
#include <stdio.h> #include <string> #include <iostream> #include <map> using namespace std; int main(void){ int n,k,count; int rnk[100005],old[100005]; cin >> n >> k; for(int i=1; i<=n; i++){ cin >> rnk[i]; old[rnk[i]]=i; } int ans[n+1],used[n+1],t=k; for(int i=n; i>=k; i--){ ans[i]=old[t]; used[rnk[i]]=1; if(rnk[i]<=t){ t++; while(used[t]==1)t++; } } for(int i=k; i<=n; i++){ printf("%d\n",ans[i]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | Autumn_A |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 568 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 2304 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 60 / 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 | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 7 ms | 512 KB |
subtask2_02.txt | AC | 2 ms | 256 KB |
subtask2_03.txt | AC | 42 ms | 2048 KB |
subtask2_04.txt | AC | 46 ms | 2304 KB |
subtask2_05.txt | AC | 36 ms | 1024 KB |
subtask2_06.txt | AC | 41 ms | 1664 KB |
subtask2_07.txt | AC | 41 ms | 1792 KB |
subtask2_08.txt | AC | 42 ms | 2048 KB |
subtask2_09.txt | AC | 41 ms | 2048 KB |