QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#707875#8835. Goodmansenak#WA 0ms3668kbC++20511b2024-11-03 17:56:072024-11-03 17:56:12

Judging History

This is the latest submission verdict.

  • [2024-11-03 17:56:12]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3668kb
  • [2024-11-03 17:56:07]
  • Submitted

answer

#include <iostream>
#include <vector>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;

        vector<int> p(n);
        for (int i = 0; i < n; ++i) {
            cin >> p[i];
        }

        // Output the permutation p itself as q
        for (int i = 0; i < n; ++i) {
            cout << p[i] << (i == n - 1 ? '\n' : ' ');
        }
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3668kb

input:

2
4
1 2 3 4
6
6 5 4 3 2 1

output:

1 2 3 4
6 5 4 3 2 1

result:

wrong answer Jury found better answer than participant (test case 2)