Submission #223821


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;
main(){
  int n,k;
  scanf("%d",&n);
  scanf("%d",&k);
  int x[n];
  int i;
  for(i=0;i<n;i++)
    scanf("%d",&x[i]);
  
  for(i=k-1;i<n;i++){
    int temp[i],j;
    for(j=0;j<=i;j++)
      temp[j]=x[j];
    sort(temp,temp+i+1);

    for(j=0;j<=i;j++){
      if(x[j]==temp[k-1]){
	cout<<(j+1)<<endl;
      }
    }
  }
  
  return 0;
}

Submission Info

Submission Time
Task B - 特別賞
User wakamoly
Language C++ (G++ 4.6.4)
Score 40
Code Size 442 Byte
Status TLE
Exec Time 2031 ms
Memory 1576 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:9:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:13:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 0 / 60
Status
AC × 2
AC × 13
AC × 13
TLE × 7
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 676 KB
sample_02.txt AC 22 ms 916 KB
subtask1_01.txt AC 22 ms 672 KB
subtask1_02.txt AC 22 ms 924 KB
subtask1_03.txt AC 22 ms 788 KB
subtask1_04.txt AC 23 ms 804 KB
subtask1_05.txt AC 53 ms 928 KB
subtask1_06.txt AC 58 ms 752 KB
subtask1_07.txt AC 24 ms 804 KB
subtask1_08.txt AC 32 ms 928 KB
subtask1_09.txt AC 63 ms 796 KB
subtask1_10.txt AC 50 ms 800 KB
subtask1_11.txt AC 63 ms 708 KB
subtask2_01.txt TLE 2031 ms 932 KB
subtask2_02.txt AC 73 ms 792 KB
subtask2_03.txt TLE 2030 ms 1472 KB
subtask2_04.txt TLE 2030 ms 1368 KB
subtask2_05.txt AC 49 ms 1576 KB
subtask2_06.txt TLE 2030 ms 1496 KB
subtask2_07.txt TLE 2031 ms 1444 KB
subtask2_08.txt TLE 2030 ms 1440 KB
subtask2_09.txt TLE 2030 ms 1428 KB