Submission #3792144


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define INF 1000000007
#define SMO -1000000007
#define P pair<int,int>
#define fi first
#define se second
using namespace std;
bool prime(int n){
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0)return false;
	}
	return n!=1;
}
int kaicnt;
int kai(int n,int x){
	kaicnt++;
	if(kaicnt==x){
		kaicnt=0;
		return n%INF;
	}
	return (kai(n-1,x)%INF*n)%INF;
}
int conbi(int n,int x){
	x=min(x,n-x+1);
	return kai(n,x)/kai(x,x);
}
int pow_mod(int n,int k,int m){
	if(k==0)return 1;
	else if(k%2==1)return pow_mod(n,k-1,m)*n%m;
	else {
		int t=pow_mod(n,k/2,m);
		return t*t%m;
	}
}
int n,k,a;
vector<P>vec;
signed main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a;
		vec.push_back({a,i});
		sort(vec.begin(),vec.end());
		if(i>=k)cout<<vec[k-1].se<<endl;
	}
}

Submission Info

Submission Time
Task B - 特別賞
User define
Language C++14 (GCC 5.4.1)
Score 40
Code Size 840 Byte
Status TLE
Exec Time 2103 ms
Memory 640 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 0 / 60
Status
AC × 2
AC × 13
AC × 14
TLE × 8
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 19 ms 256 KB
subtask1_06.txt AC 19 ms 256 KB
subtask1_07.txt AC 17 ms 256 KB
subtask1_08.txt AC 9 ms 256 KB
subtask1_09.txt AC 30 ms 256 KB
subtask1_10.txt AC 8 ms 256 KB
subtask1_11.txt AC 30 ms 256 KB
subtask2_01.txt TLE 2103 ms 640 KB
subtask2_02.txt AC 50 ms 256 KB
subtask2_03.txt TLE 2103 ms 640 KB
subtask2_04.txt TLE 2103 ms 640 KB
subtask2_05.txt TLE 2103 ms 640 KB
subtask2_06.txt TLE 2103 ms 640 KB
subtask2_07.txt TLE 2103 ms 512 KB
subtask2_08.txt TLE 2103 ms 640 KB
subtask2_09.txt TLE 2103 ms 512 KB