QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#85633#2056. Buddy NumbersZuqa#WA 2ms3592kbC++171.1kb2023-03-07 23:28:112023-03-07 23:28:14

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-07 23:28:14]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3592kb
  • [2023-03-07 23:28:11]
  • 提交

answer

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int n;
    cin >> n;
    if(n == 1)
        cout << 1;
    else if(n == 2)
        cout << "1 2";
    else if(n == 3)
        cout << "3 1 2";
    else if(n == 4)
        cout << "3 1 2 4";
    else
        cout << -1;
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3416kb

input:

2

output:

1 2

result:

ok answer is OK

Test #2:

score: 0
Accepted
time: 2ms
memory: 3592kb

input:

3

output:

3 1 2

result:

ok answer is OK

Test #3:

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

input:

1

output:

1

result:

ok answer is OK

Test #4:

score: 0
Accepted
time: 2ms
memory: 3464kb

input:

4

output:

3 1 2 4

result:

ok answer is OK

Test #5:

score: 0
Accepted
time: 2ms
memory: 3496kb

input:

5

output:

-1

result:

ok answer is OK

Test #6:

score: -100
Wrong Answer
time: 2ms
memory: 3504kb

input:

6

output:

-1

result:

wrong answer answer is exist