QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#840388 | #9799. Magical Palette | frankly6# | TL | 270ms | 13856kb | C++17 | 1.8kb | 2025-01-02 17:58:58 | 2025-01-02 17:58:58 |
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;
}
int gcd(int a, int b){return b==0?a:gcd(b,a%b);}
signed main()
{
// freopen("testdata.in","r",stdin);
T=read();
while(T--)
{
N=read(); M=read();
int p=N*M;
bool ck=0;
if(gcd(N,M)!=1) {cout << "No\n"; continue;}
for(int a=N;a>=1;a--)
{
if(gcd(a,N)!=1) continue;
for(int b=M;b>=1;b--)
{
if(gcd(b,M)!=1) continue;
// if(gcd(a,b)!=1) continue;
// cout << "a=" << a << ", b=" << b << '\n';
for(int i=1;i<=N;i++) ar[i]=(1+(i-1)*a)%p;
for(int i=1;i<=M;i++) br[i]=(1+(i-1)*b)%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;
if(vis[now]) {tag=1; break;}
vis[now]=1;
}
if(tag) break;
}
if(!tag) {ck=1; break;}
for(int i=0;i<=N*M;i++) vis[i]=0;
}
if(ck) break;
}
if(ck)
{
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';
}
else cout << "No\n";
for(int i=0;i<=N*M;i++) vis[i]=0;
}
return (0-0);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 5620kb
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: 49ms
memory: 12748kb
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: 54ms
memory: 13856kb
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: 3536kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 27ms
memory: 10904kb
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: 3688kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 19ms
memory: 10812kb
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: 3628kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: 0
Accepted
time: 27ms
memory: 10816kb
input:
1 3 333332
output:
Yes 1 3 5 1 333328 666655 999982 333313 666640 999967 333298 666625 999952 333283 666610 999937 333268 666595 999922 333253 666580 999907 333238 666565 999892 333223 666550 999877 333208 666535 999862 333193 666520 999847 333178 666505 999832 333163 666490 999817 333148 666475 999802 333133 666460 ...
result:
ok 1 cases (1 test case)
Test #10:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
1 333333 3
output:
No
result:
ok 1 cases (1 test case)
Test #11:
score: 0
Accepted
time: 18ms
memory: 8756kb
input:
1 333332 3
output:
Yes 1 333328 666655 999982 333313 666640 999967 333298 666625 999952 333283 666610 999937 333268 666595 999922 333253 666580 999907 333238 666565 999892 333223 666550 999877 333208 666535 999862 333193 666520 999847 333178 666505 999832 333163 666490 999817 333148 666475 999802 333133 666460 999787 ...
result:
ok 1 cases (1 test case)
Test #12:
score: 0
Accepted
time: 26ms
memory: 9080kb
input:
1 4 249999
output:
Yes 1 4 7 10 1 249993 499985 749977 999969 249965 499957 749949 999941 249937 499929 749921 999913 249909 499901 749893 999885 249881 499873 749865 999857 249853 499845 749837 999829 249825 499817 749809 999801 249797 499789 749781 999773 249769 499761 749753 999745 249741 499733 749725 999717 2497...
result:
ok 1 cases (1 test case)
Test #13:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
1 249998 4
output:
No
result:
ok 1 cases (1 test case)
Test #14:
score: 0
Accepted
time: 270ms
memory: 8456kb
input:
1 14925 67
output:
Yes 1 14808 29615 44422 59229 74036 88843 103650 118457 133264 148071 162878 177685 192492 207299 222106 236913 251720 266527 281334 296141 310948 325755 340562 355369 370176 384983 399790 414597 429404 444211 459018 473825 488632 503439 518246 533053 547860 562667 577474 592281 607088 621895 636702...
result:
ok 1 cases (1 test case)
Test #15:
score: -100
Time Limit Exceeded
input:
1 1526 655