QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#783380 | #9799. Magical Palette | Kleaves | WA | 36ms | 3720kb | C++17 | 1.1kb | 2024-11-26 09:23:36 | 2024-11-26 09:23:37 |
Judging History
answer
#pragma GCC optimize(3)
#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define testin freopen("testin1.txt", "r", stdin)
#define testout freopen("testout1.txt", "w", stdout)
#define NO cout<<"No"<<endl
#define YES cout<<"Yes"<<endl
#define MAYBE cout<<"MAYBE"<<endl
#define endl '\n'
#define ALL(x) x.begin(),x.end()
#define INS(x)inserter(x,x.begin())
using namespace std;
const ll MAXN = 200010;
const ll INF = 0x3f3f3f3f;
const ll mod = 998244353;
void solve() {
ll n, m;
cin >> n >> m;
if (gcd(n, m) != 1) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
for (int i = 0; i < n; i++) {
cout << (1 + (n - 1) * i) % (n * m) << ' ';
}
cout << endl;
for (int i = 0; i < m; i++) {
cout << (1 + (m - 1) * i) % (n * m) << ' ';
}
cout << endl;
return;
}
int main() {
//testin;
//freopen("case1out.txt", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3720kb
input:
2 2 3 2 2
output:
Yes 1 2 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: 0
Accepted
time: 22ms
memory: 3652kb
input:
1 1 1000000
output:
Yes 1 1 0 999999 999998 999997 999996 999995 999994 999993 999992 999991 999990 999989 999988 999987 999986 999985 999984 999983 999982 999981 999980 999979 999978 999977 999976 999975 999974 999973 999972 999971 999970 999969 999968 999967 999966 999965 999964 999963 999962 999961 999960 999959 99...
result:
ok 1 cases (1 test case)
Test #3:
score: 0
Accepted
time: 36ms
memory: 3680kb
input:
1 1000000 1
output:
Yes 1 0 999999 999998 999997 999996 999995 999994 999993 999992 999991 999990 999989 999988 999987 999986 999985 999984 999983 999982 999981 999980 999979 999978 999977 999976 999975 999974 999973 999972 999971 999970 999969 999968 999967 999966 999965 999964 999963 999962 999961 999960 999959 99995...
result:
ok 1 cases (1 test case)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 15ms
memory: 3668kb
input:
1 2 499999
output:
Yes 1 2 1 499999 999997 499997 999995 499995 999993 499993 999991 499991 999989 499989 999987 499987 999985 499985 999983 499983 999981 499981 999979 499979 999977 499977 999975 499975 999973 499973 999971 499971 999969 499969 999967 499967 999965 499965 999963 499963 999961 499961 999959 499959 99...
result:
ok 1 cases (1 test case)
Test #6:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 14ms
memory: 3652kb
input:
1 499999 2
output:
Yes 1 499999 999997 499997 999995 499995 999993 499993 999991 499991 999989 499989 999987 499987 999985 499985 999983 499983 999981 499981 999979 499979 999977 499977 999975 499975 999973 499973 999971 499971 999969 499969 999967 499967 999965 499965 999963 499963 999961 499961 999959 499959 999957 ...
result:
ok 1 cases (1 test case)
Test #8:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 13ms
memory: 3672kb
input:
1 3 333332
output:
Yes 1 3 5 1 333332 666663 999994 333329 666660 999991 333326 666657 999988 333323 666654 999985 333320 666651 999982 333317 666648 999979 333314 666645 999976 333311 666642 999973 333308 666639 999970 333305 666636 999967 333302 666633 999964 333299 666630 999961 333296 666627 999958 333293 666624 ...
result:
wrong answer Duplicated Color 666663 (test case 1)