QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#784493#9799. Magical PaletteEmpty_DustWA 32ms3704kbC++231.0kb2024-11-26 15:09:432024-11-26 15:09:57

Judging History

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

  • [2024-11-26 15:09:57]
  • 评测
  • 测评结果:WA
  • 用时:32ms
  • 内存:3704kb
  • [2024-11-26 15:09:43]
  • 提交

answer

#include <bits/stdc++.h>

#define ranges std::ranges
#define views std::views

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

using pii = std::pair<int, int>;
using a3 = std::array<int, 3>;
using a4 = std::array<int, 4>;

const int N = 1e6;
const int MAXN = 1e6 + 10;
const int inf = 1e9;
// const int mod = 1e9 + 7;
const int mod = 998244353;

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 == 1 && m == 1) {
        std::cout << "0\n";
        return;
    }
    for (int i = 0, j = 1;i < n;++i, j += m) {
        std::cout << j << ' ';
    }
    std::cout << '\n';
    for (int i = 0, j = 1;i < m;++i, j += n) {
        std::cout << j << ' ';
    }
    std::cout << '\n';
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0), std::cout.tie(0);
    int t;std::cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3692kb

input:

2
2 3
2 2

output:

Yes
1 4 
1 3 5 
No

result:

ok 2 cases (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 32ms
memory: 3704kb

input:

1
1 1000000

output:

Yes
1 
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...

result:

wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)