QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #661691 | #5141. Identical Parity | Yurily# | WA | 5ms | 3780kb | C++20 | 1.0kb | 2024-10-20 17:36:53 | 2024-10-20 17:36:53 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,k;
int div_c(int x,int y){
int res=x/y;
if(x%y)
res++;
return res;
}
// ¿ì¶Á
int read(){
int x = 0, f = 1;
char c = getchar();
while(c < '0' || c > '9'){
if(c == '-'){
f = -1;
}
c = getchar();
}
while(c >= '0' && c <= '9'){
x = x*10+c-'0';
c = getchar();
}
return x*f;
}
void solve(){
n=read(),k=read();
int t=n/k;
if(k%2==0){
if((n%k+n%2)%2==1){
printf("No\n");
return;
}
}
else{
if(t%2!=(n%k+n%2)%2){
printf("No\n");
return;
}
}
int gl=(n%k+n%2)/t,gr=(n%k-n%2)/t;
int rb;
if(n%k-n%2<0){
rb=-1;
}
else
rb=(gr+k)/2;
int lb=div_c(k-gl,2);
int lb2;
if(t*k-n%2<0)
lb2=0;
else
lb2=div_c(t*k-n%2,2*t+1);
int rb2;
if(t*k+k-n%2<0){
rb2=-1;
}
else
rb2=(t*k+k-n%2)/(2*t+1);
if(max(lb,lb2)<=min(rb,rb2)&&max(lb,lb2)>=1){
printf("Yes\n");
}
else{
printf("No\n");
}
}
signed main(){
int T;
cin>>T;
while(T--){
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
3 3 1 4 2 5 3
output:
No Yes Yes
result:
ok 3 token(s): yes count is 2, no count is 1
Test #2:
score: -100
Wrong Answer
time: 5ms
memory: 3780kb
input:
100000 1 1 2 1 2 2 3 1 3 2 3 3 4 1 4 2 4 3 4 4 5 1 5 2 5 3 5 4 5 5 6 1 6 2 6 3 6 4 6 5 6 6 7 1 7 2 7 3 7 4 7 5 7 6 7 7 8 1 8 2 8 3 8 4 8 5 8 6 8 7 8 8 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 9 9 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 11 11 12 1 ...
output:
No No Yes No Yes No No Yes Yes Yes No Yes Yes Yes No No Yes No Yes Yes Yes No Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes No No Yes No Yes No Yes Yes Yes Yes Yes No Yes No Yes Yes Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Ye...
result:
wrong answer expected YES, found NO [1st token]