Submission #3789848


Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, k; cin >> n >> k;
  if (n < k) return 0;
  vector<pair<int, int>> vec(0);
  REP(i, k) {
    int x; cin >> x;
    vec.push_back(make_pair(x, i + 1));
  }
  sort(ALL(vec));
  cout << vec.back().second << '\n';
  FOR(i, k, n) {
    int x; cin >> x;
    int index = lower_bound(ALL(vec), make_pair(x, 0)) - vec.begin();
    if (index != k) {
      for (int j = k - 2; j >= index; --j) vec[j + 1] = vec[j];
      vec[index] = make_pair(x, i + 1);
    }
    cout << vec.back().second << '\n';
  }
  return 0;
}

Submission Info

Submission Time
Task B - 特別賞
User emthrm
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1219 Byte
Status AC
Exec Time 1947 ms
Memory 1400 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 2
AC × 13
AC × 22
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 2 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 2 ms 256 KB
subtask2_01.txt AC 13 ms 384 KB
subtask2_02.txt AC 2 ms 256 KB
subtask2_03.txt AC 571 ms 1016 KB
subtask2_04.txt AC 17 ms 768 KB
subtask2_05.txt AC 17 ms 1400 KB
subtask2_06.txt AC 16 ms 1016 KB
subtask2_07.txt AC 1947 ms 1016 KB
subtask2_08.txt AC 20 ms 1016 KB
subtask2_09.txt AC 1839 ms 1016 KB