QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #697695 | #9223. Data Determination | ucup-team3160# | WA | 23ms | 4556kb | C++14 | 1.1kb | 2024-11-01 15:22:11 | 2024-11-01 15:22:16 |
Judging History
answer
# include <bits/stdc++.h>
using namespace std ;
int n , k , m ;
int a[200005] ;
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 ) == 1 )
{
bool ok = false ;
for ( int i = 1 ; i <= n ; i++ )
{
if ( a[i] == m )
{
if ( ( i - 1 ) >= ( k - 1 ) / 2 && ( n - i ) >= ( k - 1 ) / 2 ) ok = true ;
}
}
if ( ok ) puts("TAK") ;
else puts("NIE") ;
}
else
{
bool ok = false ;
int j = n ;
for ( int i = 1 ; i <= n ; i++ )
{
while ( j && a[i] + a[j] > 2 * m ) j-- ;
if ( i >= j ) break ;
if ( a[i] == a[j] )
{
if ( i - 1 >= k / 2 - 1 && n - i - 1 >= k / 2 - 1 ) ok = true ;
}
else
{
if ( a[i] + a[j] == 2 * m )
{
while ( j >= 1 && a[j - 1] == a[j] ) j-- ;
if ( i - 1 >= k / 2 - 1 && n - j >= k / 2 - 1 ) ok = true ;
}
}
}
if ( ok ) puts("TAK") ;
else puts("NIE") ;
}
}
int main()
{
int t ;
scanf("%d" , &t) ;
while ( t -- ) solve() ;
return 0 ;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3748kb
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: 22ms
memory: 4428kb
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: 0
Accepted
time: 18ms
memory: 3912kb
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 TAK TAK NIE TAK NIE NIE NIE NIE NIE
result:
ok 10 lines
Test #4:
score: 0
Accepted
time: 21ms
memory: 3820kb
input:
10 20000 6 569116309 533654855 569116308 512534907 569116310 500238175 562175605 569116308 569116310 489499020 543748669 569116309 526641247 511510060 504576222 569116309 569116310 569116308 569116310 569116309 569116308 569116309 569116310 569116308 569116310 569116309 569116308 465300463 569116308...
output:
TAK TAK NIE NIE NIE NIE NIE TAK NIE TAK
result:
ok 10 lines
Test #5:
score: 0
Accepted
time: 23ms
memory: 4556kb
input:
1 200000 99999 519401084 60561374 111262859 724696443 994449169 60561374 44352999 44352999 994449169 333890219 44352999 326562388 994449169 60561374 994449169 111262859 614556033 60561374 994449169 60561374 994449169 44352999 994449169 60561374 335786619 994449169 994449169 629087444 44352999 464308...
output:
TAK
result:
ok single line: 'TAK'
Test #6:
score: -100
Wrong Answer
time: 20ms
memory: 3788kb
input:
10000 20 4 803793916 803793916 803793916 829654242 823538042 845455104 810621895 828304843 832321738 852423770 843342850 807940523 803793916 852745476 848104693 805326240 842124638 854328280 846662656 851682131 821969928 20 6 500022430 627268122 349233632 48722 48722 85853795 617231525 67926484 2957...
output:
TAK NIE NIE NIE NIE TAK NIE TAK NIE NIE NIE TAK TAK NIE TAK NIE TAK TAK NIE NIE TAK NIE TAK NIE TAK NIE NIE NIE NIE TAK TAK TAK TAK TAK TAK NIE NIE TAK NIE NIE NIE TAK NIE TAK TAK TAK NIE NIE NIE NIE TAK NIE TAK NIE TAK NIE TAK TAK NIE TAK NIE NIE NIE TAK TAK NIE TAK TAK NIE NIE NIE TAK TAK TAK NIE ...
result:
wrong answer 8th lines differ - expected: 'NIE', found: 'TAK'