Submission #223827
Source Code Expand
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
#define tpl(...) make_tuple(__VA_ARGS__)
typedef long long LL;
typedef pair<int, int> P; typedef pair<int, P> IP; typedef pair<P, P> PP;
typedef vector<int> Array; typedef vector<vector<int> > Array2;
typedef vector<LL> LArray; typedef vector<P> PArray; typedef vector<string> SArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
inline int getInt() { int itiv; return (cin >> itiv, itiv); }
template <typename T> void readAll(vector<T>& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i]; }
template <typename T, typename U> void readAll(vector<pair<T, U> >& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i].first >> vec[i].second; }
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };
int dr[] = { 0, -1, 0, 1 }, dc[] = { -1, 0, 1, 0 };
int main(void)
{
ios::sync_with_stdio(false);
int n, k;
while(cin >> n >> k && n)
{
PArray arr;
for (int i = 0; i < k - 1; i++)
{
arr.emplace_back(getInt(), i);
}
for (int i = k - 1; i < n; i++)
{
arr.emplace_back(getInt(), i);
sort(ALL(arr));
cout << arr[k - 1].second + 1 << endl;
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 特別賞 |
User |
tnkt37 |
Language |
C++11 (GCC 4.8.1) |
Score |
40 |
Code Size |
1835 Byte |
Status |
TLE |
Exec Time |
2045 ms |
Memory |
1936 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 |
22 ms |
928 KB |
sample_02.txt |
AC |
23 ms |
804 KB |
subtask1_01.txt |
AC |
47 ms |
920 KB |
subtask1_02.txt |
AC |
23 ms |
736 KB |
subtask1_03.txt |
AC |
24 ms |
920 KB |
subtask1_04.txt |
AC |
61 ms |
924 KB |
subtask1_05.txt |
AC |
52 ms |
920 KB |
subtask1_06.txt |
AC |
58 ms |
932 KB |
subtask1_07.txt |
AC |
73 ms |
924 KB |
subtask1_08.txt |
AC |
32 ms |
932 KB |
subtask1_09.txt |
AC |
144 ms |
800 KB |
subtask1_10.txt |
AC |
60 ms |
804 KB |
subtask1_11.txt |
AC |
67 ms |
924 KB |
subtask2_01.txt |
TLE |
2037 ms |
1056 KB |
subtask2_02.txt |
AC |
74 ms |
792 KB |
subtask2_03.txt |
TLE |
2031 ms |
1436 KB |
subtask2_04.txt |
TLE |
2045 ms |
1060 KB |
subtask2_05.txt |
AC |
53 ms |
1936 KB |
subtask2_06.txt |
TLE |
2032 ms |
1436 KB |
subtask2_07.txt |
TLE |
2029 ms |
1444 KB |
subtask2_08.txt |
TLE |
2029 ms |
1444 KB |
subtask2_09.txt |
TLE |
2030 ms |
1564 KB |