Submission #3007803
Source Code Expand
#include <stdio.h> #include <string> #include <iostream> #include <map> using namespace std; int main(void){ int n,k; int rnk[100005]; int rvr[100005]; cin >> n >>k; for(int i=0; i<n; i++){ cin >> rnk[i]; rvr[rnk[i]]=i; } int count=0,now; for(int i=0; i<n; i++){ if(rnk[i]<=k)count++; if(count==k){ now=rvr[rnk[i]]; printf("%d\n",rnk[i]); break; } } for(int i=k+1; i<=n; i++){ if(rvr[i]<now){ now--; while(rnk[now]>i)now--; } printf("%d\n",rnk[now]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | Autumn_A |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 669 Byte |
Status | WA |
Exec Time | 44 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 | WA | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 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 | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 7 ms | 384 KB |
subtask2_02.txt | WA | 2 ms | 256 KB |
subtask2_03.txt | WA | 42 ms | 1408 KB |
subtask2_04.txt | WA | 44 ms | 1536 KB |
subtask2_05.txt | WA | 36 ms | 1024 KB |
subtask2_06.txt | AC | 40 ms | 1280 KB |
subtask2_07.txt | AC | 41 ms | 1408 KB |
subtask2_08.txt | AC | 41 ms | 1408 KB |
subtask2_09.txt | WA | 41 ms | 1408 KB |