QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#717159#5141. Identical ParityMLK2WA 9ms3640kbC++141.2kb2024-11-06 17:05:162024-11-06 17:05:16

Judging History

你现在查看的是最新测评结果

  • [2024-11-06 17:05:16]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3640kb
  • [2024-11-06 17:05:16]
  • 提交

answer

#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

auto solve(){
	
	LL n,k;
	cin >> n >> k;
	
	if(k == n){
		cout << "Yes\n";
	}else{
		if(k == 1){
			if(n == 1) cout << "Yes\n";
			else cout << "No\n";
		}else{
			LL s = (n + k - 1) / k,cnt = (n - n % s) / s;
			//cout << s << ' ' << cnt << ' ' << (n % s) << "\n";
			if(k % 2 == 0){
				LL v = abs(cnt / 2 * s + n % s - (cnt + 1) / 2 * s);
				cout << (v <= 1 ? "Yes\n" : "No\n");
			}else{
				LL t = (n % s);
				if(t == 0) t = s;
				cout << (abs(t) <= 1 ? "Yes\n" : "No\n");
			}
		}
	}
	
}

signed main(){
	IOS
	int T = 1;
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3640kb

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: 9ms
memory: 3636kb

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:

Yes
No
Yes
No
Yes
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
Yes
No
Yes
No
No
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
No
Yes
Yes
Yes
Yes
Yes
No
Yes
No
No
No
No
No
No
No
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
Yes
No
No
Yes
Yes
Y...

result:

wrong answer expected YES, found NO [9th token]