QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#840358 | #9799. Magical Palette | frankly6# | WA | 61ms | 16188kb | C++17 | 1.2kb | 2025-01-02 17:37:45 | 2025-01-02 17:37:50 |
Judging History
answer
#include<iostream>
#include<cstdio>
#define int long long
using namespace std;
const int MX=1000010;
int T, N, M;
int ar[MX], br[MX];
bool vis[MX];
int read()
{
int r=0, f=1; char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
return r*f;
}
signed main()
{
// freopen("testdata.in","r",stdin);
T=read();
while(T--)
{
N=read(); M=read();
int p=N*M;
for(int i=1;i<=N;i++) ar[i]=(1+(i-1)*(N-1))%p;
for(int i=1;i<=M;i++) br[i]=(1+(i-1)*(M-1))%p;
bool tag=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=M;j++)
{
int now = (ar[i]*br[j]%p+p)%p;
if(vis[now]) {tag=1; break;}
vis[now]=1;
}
if(tag) break;
}
if(tag) cout << "No\n";
else
{
cout << "Yes\n";
for(int i=1;i<=N;i++) cout << ar[i] << " "; cout << '\n';
for(int i=1;i<=M;i++) cout << br[i] << " "; cout << '\n';
}
for(int i=0;i<=N*M;i++) vis[i]=0;
}
return (0-0);
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5736kb
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: 60ms
memory: 13660kb
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: 61ms
memory: 16188kb
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: 3ms
memory: 12300kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 33ms
memory: 11904kb
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: 3ms
memory: 10684kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 34ms
memory: 12556kb
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: 4ms
memory: 9816kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 0ms
memory: 10896kb
input:
1 3 333332
output:
No
result:
wrong answer Wrong Verdict (test case 1)