Submission #1148166


Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

int x[100010];
signed main(void)
{
  int n, k;
  cin >> n >> k;
  REP(i, n) cin >> x[i];

  priority_queue<PII> q;
  REP(i, n) {
    if(i < k-1) {
      //cout << "b" << endl;
      q.push({x[i], i+1});
      //cout <<  q.size() << endl;
    } else if(i == k-1){
      q.push({x[i], i+1});
      cout << q.top().second << endl;
    } else {
      if(q.top().first > x[i]) {
        //cout << "a" << endl;
        q.push({x[i], i+1});
        q.pop();
      }
      cout << q.top().second << endl;
    }
  }

  return 0;
}

Submission Info

Submission Time
Task B - 特別賞
User ferin_tech
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1004 Byte
Status AC
Exec Time 178 ms
Memory 1784 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 6 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 2 ms 256 KB
subtask1_06.txt AC 3 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 2 ms 256 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt AC 2 ms 256 KB
subtask2_01.txt AC 21 ms 512 KB
subtask2_02.txt AC 2 ms 256 KB
subtask2_03.txt AC 128 ms 1400 KB
subtask2_04.txt AC 178 ms 1152 KB
subtask2_05.txt AC 31 ms 1784 KB
subtask2_06.txt AC 105 ms 1400 KB
subtask2_07.txt AC 122 ms 1400 KB
subtask2_08.txt AC 123 ms 1400 KB
subtask2_09.txt AC 128 ms 1400 KB