QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#780013#9799. Magical PaletteiliyianWA 36ms3708kbC++23885b2024-11-24 23:33:172024-11-24 23:33:18

Judging History

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

  • [2024-11-24 23:33:18]
  • 评测
  • 测评结果:WA
  • 用时:36ms
  • 内存:3708kb
  • [2024-11-24 23:33:17]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long

void solve() {
  int n, m;
  std::cin >> n >> m;
  if (std::gcd(n, m) != 1) {
    std::cout << "No\n";
    return;
  }
  std::cout << "Yes\n";
  if (n < m) {
    for (int i = 1; i <= n; i++) {
      std::cout << (n - i + 1) % (n * m) << ' ';
    }
    std::cout << '\n';
    for (int i = 1; i <= m; i++) {
      std::cout << (m - (i - 1) * n + m * n) % (m * n) << ' ';
    }
    std::cout << '\n';
  } else {
    for (int i = 1; i <= n; i++) {
      std::cout << (n - (i - 1) * m + m * n) % (m * n) << ' ';
    }
    std::cout << '\n';
    for (int i = 1; i <= m; i++) {
      std::cout << (m - i + 1) % (n * m) << ' ';
    }
    std::cout << '\n';
  }
}

signed main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  int t = 1;
  std::cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3700kb

input:

2
2 3
2 2

output:

Yes
2 1 
3 1 5 
No

result:

ok 2 cases (2 test cases)

Test #2:

score: 0
Accepted
time: 33ms
memory: 3532kb

input:

1
1 1000000

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 9999...

result:

ok 1 cases (1 test case)

Test #3:

score: 0
Accepted
time: 36ms
memory: 3708kb

input:

1
1000000 1

output:

Yes
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 999958 ...

result:

ok 1 cases (1 test case)

Test #4:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

1
2 500000

output:

No

result:

ok 1 cases (1 test case)

Test #5:

score: 0
Accepted
time: 19ms
memory: 3644kb

input:

1
2 499999

output:

Yes
2 1 
499999 499997 499995 499993 499991 499989 499987 499985 499983 499981 499979 499977 499975 499973 499971 499969 499967 499965 499963 499961 499959 499957 499955 499953 499951 499949 499947 499945 499943 499941 499939 499937 499935 499933 499931 499929 499927 499925 499923 499921 499919 4999...

result:

ok 1 cases (1 test case)

Test #6:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

1
500000 2

output:

No

result:

ok 1 cases (1 test case)

Test #7:

score: 0
Accepted
time: 14ms
memory: 3580kb

input:

1
499999 2

output:

Yes
499999 499997 499995 499993 499991 499989 499987 499985 499983 499981 499979 499977 499975 499973 499971 499969 499967 499965 499963 499961 499959 499957 499955 499953 499951 499949 499947 499945 499943 499941 499939 499937 499935 499933 499931 499929 499927 499925 499923 499921 499919 499917 49...

result:

ok 1 cases (1 test case)

Test #8:

score: 0
Accepted
time: 0ms
memory: 3620kb

input:

1
3 333333

output:

No

result:

ok 1 cases (1 test case)

Test #9:

score: -100
Wrong Answer
time: 9ms
memory: 3636kb

input:

1
3 333332

output:

Yes
3 2 1 
333332 333329 333326 333323 333320 333317 333314 333311 333308 333305 333302 333299 333296 333293 333290 333287 333284 333281 333278 333275 333272 333269 333266 333263 333260 333257 333254 333251 333248 333245 333242 333239 333236 333233 333230 333227 333224 333221 333218 333215 333212 33...

result:

wrong answer Duplicated Color 666664 (test case 1)