QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #666969 | #9223. Data Determination | 11d10xy | WA | 27ms | 4580kb | C++14 | 585b | 2024-10-22 20:34:35 | 2024-10-22 20:34:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,K,m,a[200010];
void solve(){
scanf("%d%d%d",&n,&K,&m);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1);
if(K&1){
for(int i=1;i<=n;i++)if(a[i]==m&&i-1>=(K-1)/2&&n-i>=(K-1)/2)
return puts("TAK"),void();
puts("NIE");
}else{
for(int i=1,j=n;i<=n;i++){
while(j&&a[i]+a[j]>m*2)j--;
if(j&&j<i&&a[i]+a[j]==m*2&&j-1>=K/2-1&&n-i>=K/2-1)return puts("TAK"),void();
}puts("NIE");
}
}
int main(){
int T;for(scanf("%d",&T);T--;)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
3 6 4 42 41 43 41 57 41 42 4 2 4 1 2 5 8 7 5 57 101 2 42 5 57 7 13
output:
TAK NIE NIE
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 27ms
memory: 4580kb
input:
1 200000 2 482043846 410684388 380438852 309193412 468460689 586281084 680820569 266819813 639025900 488292166 503516930 532292185 618277661 728546481 628339224 673945619 471325257 372807753 325778059 372151033 548358519 276494019 336701079 320784795 377493322 385262271 621712987 349634764 668994576...
output:
NIE
result:
ok single line: 'NIE'
Test #3:
score: -100
Wrong Answer
time: 22ms
memory: 3832kb
input:
10 20000 3530 502140211 367996343 553577602 581694419 435810361 532394401 431613294 485360190 608191058 506969937 531905607 429252296 360241499 519031654 250454430 478548102 753825992 450326073 603766643 566036856 511634983 416622101 753825992 753825992 380511285 390746506 436237616 342529443 878920...
output:
NIE NIE TAK NIE TAK NIE NIE NIE NIE NIE
result:
wrong answer 2nd lines differ - expected: 'TAK', found: 'NIE'