Submission #223831


Source Code Expand

#include <iostream>
#include <set>
#include <tuple>
using namespace std;

typedef long long Int;
typedef tuple<Int, Int> Node;
typedef set<Node, less<Node>> NodeSet;

const int N_MAX = 100000 + 11;

Int N;
Int K;
Int A[N_MAX];

bool input() {
  if ( cin >> N >> K ) {
    for ( int i = 0; i < N; ++ i ) cin >> A[i];
    return true;
  }
  return false;
}

int main() {
  while ( input() ) {
    NodeSet s;
    for ( int i = 0; i < K; ++ i ) {
      s.emplace(A[i], i + 1);
    }
    cout << get<1>(*next(s.begin(), K - 1)) << endl;
    for ( int i = K; i < N; ++ i ) {
      s.emplace(A[i], i + 1);
      cout << get<1>(*next(s.begin(), K - 1)) << endl;
    }
  }
  return 0;
}

Submission Info

Submission Time
Task B - 特別賞
User sh19910711
Language C++11 (GCC 4.8.1)
Score 40
Code Size 715 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
AC × 2
AC × 13
AC × 15
TLE × 5
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 800 KB
sample_02.txt AC 25 ms 928 KB
subtask1_01.txt AC 24 ms 932 KB
subtask1_02.txt AC 24 ms 812 KB
subtask1_03.txt AC 23 ms 924 KB
subtask1_04.txt AC 24 ms 928 KB
subtask1_05.txt AC 31 ms 924 KB
subtask1_06.txt AC 30 ms 808 KB
subtask1_07.txt AC 24 ms 796 KB
subtask1_08.txt AC 29 ms 800 KB
subtask1_09.txt AC 29 ms 796 KB
subtask1_10.txt AC 29 ms 844 KB
subtask1_11.txt AC 29 ms 928 KB
subtask2_01.txt AC 1520 ms 1828 KB
subtask2_02.txt AC 35 ms 800 KB
subtask2_03.txt TLE 2033 ms 4124 KB
subtask2_04.txt AC 651 ms 8220 KB
subtask2_05.txt AC 140 ms 7704 KB
subtask2_06.txt TLE 2032 ms 4892 KB
subtask2_07.txt TLE 2031 ms 4388 KB
subtask2_08.txt TLE 2033 ms 4192 KB
subtask2_09.txt TLE 2033 ms 4128 KB