QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#785328 | #9799. Magical Palette | Grass_near_home# | WA | 7ms | 14428kb | C++14 | 1.3kb | 2024-11-26 17:32:48 | 2024-11-26 17:32:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
bool is_prime[MAXN];
int pre[MAXN];
int N,M;
int a[MAXN],b[MAXN];
int vis[MAXN];
void prepare(){
cin >> N >> M;
int flag = 0;
if(N > M) swap(N,M), flag = 1;
if(!(is_prime[N] && pre[M] > N)){
cout << "No\n";
return;
}
for(int i = 1; i <= N; i++){
a[i] = i;
}
for(int i = 1; i <= M; i++){
b[i] = 1 + (i - 1) * N;
}
cout << "Yes\n";
if(!flag){
for(int i = 1; i <= N; i++) cout << a[i] << " ";
cout << "\n";
for(int i = 1; i <= M; i++) cout << b[i] << " ";
cout << "\n";
}
else{
for(int i = 1; i <= M; i++) cout << b[i] << " ";
cout << "\n";
for(int i = 1; i <= N; i++) cout << a[i] << " ";
cout << "\n";
}
}
int main(){
for(int i = 2; i < MAXN; i++){
is_prime[i] = 1;
}
for(int i = 2; i < MAXN; i++){
if(!is_prime[i]) continue;
pre[i] = i;
for(int j = 2 * i; j < MAXN; j += i){
if(is_prime[j]){
is_prime[j] = 0;
pre[j] = i;
}
}
}
int T;
cin >> T;
while(T--){
prepare();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 7ms
memory: 14428kb
input:
2 2 3 2 2
output:
Yes 1 2 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 8468kb
input:
1 1 1000000
output:
No
result:
wrong answer Wrong Verdict (test case 1)