Submission #223834
Source Code Expand
#include <iostream> #include <map> #include <iterator> using namespace std; long X[1000001]; int main(){ long N,K; cin >> N >> K ; for(long i=1;i<=N;++i) cin >> X[i] ; map<long,long> m; map<long,long>::iterator mp; for(long i=1;i<=K-1;++i) m.insert(pair<long,long>(X[i],i)); for(long i=K;i<=N;++i){ m.insert(pair<long,long>(X[i],i)); mp=m.begin(); advance(mp,K-1); cout << mp->second << '\n' ; } }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | puyokawa |
Language | C++ (G++ 4.6.4) |
Score | 40 |
Code Size | 426 Byte |
Status | TLE |
Exec Time | 2033 ms |
Memory | 8220 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 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 | 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 | 23 ms | 796 KB |
sample_02.txt | AC | 25 ms | 928 KB |
subtask1_01.txt | AC | 24 ms | 924 KB |
subtask1_02.txt | AC | 23 ms | 924 KB |
subtask1_03.txt | AC | 23 ms | 808 KB |
subtask1_04.txt | AC | 22 ms | 928 KB |
subtask1_05.txt | AC | 25 ms | 796 KB |
subtask1_06.txt | AC | 23 ms | 800 KB |
subtask1_07.txt | AC | 23 ms | 796 KB |
subtask1_08.txt | AC | 25 ms | 924 KB |
subtask1_09.txt | AC | 25 ms | 924 KB |
subtask1_10.txt | AC | 26 ms | 796 KB |
subtask1_11.txt | AC | 26 ms | 924 KB |
subtask2_01.txt | AC | 1352 ms | 1824 KB |
subtask2_02.txt | AC | 31 ms | 800 KB |
subtask2_03.txt | TLE | 2031 ms | 4128 KB |
subtask2_04.txt | AC | 157 ms | 8220 KB |
subtask2_05.txt | AC | 145 ms | 7716 KB |
subtask2_06.txt | TLE | 2032 ms | 4900 KB |
subtask2_07.txt | TLE | 2031 ms | 4392 KB |
subtask2_08.txt | TLE | 2033 ms | 4132 KB |
subtask2_09.txt | TLE | 2032 ms | 4100 KB |