QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#683125#8934. Challenge NPClqh2024#AC ✓20ms8868kbC++20891b2024-10-27 18:53:312024-10-27 18:53:32

Judging History

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

  • [2024-10-27 18:53:32]
  • 评测
  • 测评结果:AC
  • 用时:20ms
  • 内存:8868kb
  • [2024-10-27 18:53:31]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
int id ;
struct node{
    int u,v ;
};
vector<node>edge ;
vector<int>g[2] ;
void create(int k){
    int nx1 , nx2 ;
    nx1 = ++id ; nx2 = ++id ;
    for(auto x:g[1])
        edge.push_back((node){nx1,x}) ;
    for(auto x:g[0])
        edge.push_back((node){nx2,x}) ;
    g[0].push_back(nx1) ;
    g[1].push_back(nx2) ;
}
int a[10000] ;
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    g[0].push_back(++id) ;
    g[1].push_back(++id) ;
    int k ; cin >> k ;
    for(int i = 2 ; i <= k+2 ; i++)
        create(i) ;
    cout<<id<<" "<<edge.size()<<" "<<2<<"\n" ;
    for(auto x:g[1])
        a[x] = 1 ;
    for(int i = 1 ; i <= id ; i++)
        cout<<a[i]+1<<" " ;
    cout<<"\n" ;
    for(auto [x,y] : edge)
        cout<<x<<" "<<y<<"\n" ;
        
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3624kb

input:

1

output:

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

result:

ok ok

Test #2:

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

input:

2

output:

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

result:

ok ok

Test #3:

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

input:

3

output:

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

result:

ok ok

Test #4:

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

input:

4

output:

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

result:

ok ok

Test #5:

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

input:

5

output:

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

result:

ok ok

Test #6:

score: 0
Accepted
time: 15ms
memory: 8328kb

input:

433

output:

870 188790 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 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 #7:

score: 0
Accepted
time: 20ms
memory: 8868kb

input:

500

output:

1004 251502 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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 #8:

score: 0
Accepted
time: 20ms
memory: 8792kb

input:

499

output:

1002 250500 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 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 #9:

score: 0
Accepted
time: 20ms
memory: 8540kb

input:

457

output:

918 210222 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 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 #10:

score: 0
Accepted
time: 19ms
memory: 7540kb

input:

497

output:

998 248502 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 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

Extra Test:

score: 0
Extra Test Passed