QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#782216#9799. Magical Palette0x3ea#WA 238ms54092kbC++171.0kb2024-11-25 19:22:062024-11-25 19:22:30

Judging History

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

  • [2024-11-25 19:22:30]
  • 评测
  • 测评结果:WA
  • 用时:238ms
  • 内存:54092kb
  • [2024-11-25 19:22:06]
  • 提交

answer

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;
const int N = (1 << 16) + 10;
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1), b(m + 1);
    a[1] = b[1] = 1;
    for (int i = 2; i <= n; i++)
        a[i] = a[i - 1] + m;
    for (int i = 2; i <= m; i++)
        b[i] = b[i - 1] + n;
    set<int> s;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            s.insert((a[i] * b[j]) % (n * m));
    if (s.size() == n * m)
    {
        cout << "Yes" << endl;
        for (int i = 1; i <= n; i++)
            cout << a[i] << " ";
        cout << endl;
        for (int i = 1; i <= m; i++)
            cout << b[i] << " ";
        cout << endl;
    }
    else
        cout << "No" << endl;
}
int main()
{
#ifdef x3ea
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    for (; _; _--)
        solve();
    return 0;
}

詳細信息

Test #1:

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

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: 238ms
memory: 54092kb

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)