Submission #223832
Source Code Expand
#include <iostream> #include <algorithm> #include <array> #include <climits> #include <cmath> #include <iterator> #include <list> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <string> #include <tuple> #include <vector> typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; using namespace std; int main() { int N; int K; cin >> N >> K; if (N > 1000) return 0; vector<pair<int, int>> X(N); for (int i = 0; i < N; i++) { int x; cin >> x; X[i] = make_pair(x, i + 1); } vector<pair<int, int>> v(X.begin(), X.begin() + K); sort(v.begin(), v.end()); auto cur = v[v.size() - 1]; std::cout << cur.second << std::endl; for (int i = K; i < N; i++) { if (X[i].first < cur.first) { v.push_back(X[i]); sort(v.begin(), v.end()); v.pop_back(); cur = v[v.size() - 1]; } std::cout << cur.second << std::endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - 特別賞 |
User | sekiye |
Language | C++11 (GCC 4.8.1) |
Score | 40 |
Code Size | 1011 Byte |
Status | WA |
Exec Time | 49 ms |
Memory | 928 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 | 24 ms | 908 KB |
sample_02.txt | AC | 22 ms | 800 KB |
subtask1_01.txt | AC | 23 ms | 736 KB |
subtask1_02.txt | AC | 22 ms | 928 KB |
subtask1_03.txt | AC | 23 ms | 796 KB |
subtask1_04.txt | AC | 24 ms | 916 KB |
subtask1_05.txt | AC | 32 ms | 744 KB |
subtask1_06.txt | AC | 27 ms | 800 KB |
subtask1_07.txt | AC | 24 ms | 804 KB |
subtask1_08.txt | AC | 25 ms | 812 KB |
subtask1_09.txt | AC | 49 ms | 800 KB |
subtask1_10.txt | AC | 26 ms | 752 KB |
subtask1_11.txt | AC | 49 ms | 796 KB |
subtask2_01.txt | WA | 22 ms | 800 KB |
subtask2_02.txt | WA | 23 ms | 804 KB |
subtask2_03.txt | WA | 22 ms | 796 KB |
subtask2_04.txt | WA | 23 ms | 912 KB |
subtask2_05.txt | WA | 21 ms | 796 KB |
subtask2_06.txt | WA | 22 ms | 792 KB |
subtask2_07.txt | WA | 22 ms | 800 KB |
subtask2_08.txt | WA | 23 ms | 804 KB |
subtask2_09.txt | WA | 22 ms | 788 KB |