QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#576377	#8934. Challenge NPC	lonlyness	AC ✓	20ms	3744kb	C++23	1.1kb	2024-09-19 20:08:34	2024-09-19 20:08:34

Judging History

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

[2024-09-19 20:08:34]
评测

测评结果：AC
用时：20ms
内存：3744kb

查看

[2024-09-19 20:08:34]
提交

answer

//  _                          _   _
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>

using namespace std;
#define int long long
#define endl "\n"
const int N = 1e5 + 10;
typedef pair<int, int> PII;

//int n,m,k;
void solve() {
    int k;
    cin >> k;
    int n = (k + 2) * 2, m = n * (n - 2) / 4, c = 2;
    cout<<n<<' '<<m<<' '<<c<<endl;
    for(int i= 0;i < n;i ++){
        cout<<(i %2 ? 1: 2)<<' ';
    }
    for(int i = 1;i <= n;i ++){
        int t = i +2;
        if(t%2)t++;
        else t--;
        for(;t<=n;t+=2)cout<<i<<' '<<t<<endl;

    }
}

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

Source code, Language: C++23

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3620kb

input:

output:

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

result:

ok ok

Test #2:

score: 0

Accepted

time: 0ms

memory: 3672kb

input:

output:

8 12 2
2 1 2 1 2 1 2 1 1 4
1 6
1 8
2 3
2 5
2 7
3 6
3 8
4 5
4 7
5 8
6 7

result:

ok ok

Test #3:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

output:

10 20 2
2 1 2 1 2 1 2 1 2 1 1 4
1 6
1 8
1 10
2 3
2 5
2 7
2 9
3 6
3 8
3 10
4 5
4 7
4 9
5 8
5 10
6 7
6 9
7 10
8 9

result:

ok ok

Test #4:

score: 0

Accepted

time: 0ms

memory: 3736kb

input:

output:

12 30 2
2 1 2 1 2 1 2 1 2 1 2 1 1 4
1 6
1 8
1 10
1 12
2 3
2 5
2 7
2 9
2 11
3 6
3 8
3 10
3 12
4 5
4 7
4 9
4 11
5 8
5 10
5 12
6 7
6 9
6 11
7 10
7 12
8 9
8 11
9 12
10 11

result:

ok ok

Test #5:

score: 0

Accepted

time: 0ms

memory: 3684kb

input:

output:

14 42 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 4
1 6
1 8
1 10
1 12
1 14
2 3
2 5
2 7
2 9
2 11
2 13
3 6
3 8
3 10
3 12
3 14
4 5
4 7
4 9
4 11
4 13
5 8
5 10
5 12
5 14
6 7
6 9
6 11
6 13
7 10
7 12
7 14
8 9
8 11
8 13
9 12
9 14
10 11
10 13
11 14
12 13

result:

ok ok

Test #6:

score: 0

Accepted

time: 14ms

memory: 3692kb

input:

output:

870 188790 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...

result:

ok ok

Test #7:

score: 0

Accepted

time: 20ms

memory: 3696kb

input:

output:

1004 251502 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ...

result:

ok ok

Test #8:

score: 0

Accepted

time: 9ms

memory: 3612kb

input:

output:

1002 250500 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ...

result:

ok ok

Test #9:

score: 0

Accepted

time: 12ms

memory: 3668kb

input:

output:

918 210222 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...

result:

ok ok

Test #10:

score: 0

Accepted

time: 14ms

memory: 3744kb

input:

output:

998 248502 2
2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1...

result:

ok ok

Extra Test:

score: 0

Extra Test Passed