QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#401171#5154. ETAucup-team1716#WA 32ms5168kbC++201.6kb2024-04-28 04:20:592024-04-28 04:21:00

Judging History

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

  • [2024-04-28 04:21:00]
  • 评测
  • 测评结果:WA
  • 用时:32ms
  • 内存:5168kb
  • [2024-04-28 04:20:59]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

int main()
{
    ll a, b;
    cin >> a;
    getchar();
    cin >> b;

    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

    if(a<=b)
    {
        if(a==b) cout << "3 2\n1 2\n2 3";
        else if(a+1==b)
        {
            cout << b << " " << a << '\n';
            for(int i=1; i<=a; i++) cout << 1 << " " << i + 1 << "\n";
        }
        else cout << "impossible";
    }
    else
    {
        if(a-b>1)
        {
            ll cnt = 1, n = 2*a-2*b-1;
            vector<int> ans;

            for(int i=1; i<=n; i++)
            {
                ans.pb(i);
                cnt++;
            }

            for(int i=1; i<=b*n-2*a; i++)
            {
                ans.pb(1);
                cnt++;
            }

            cout << cnt << " " << cnt - 1 << "\n";
            for(int i=1; i<=cnt-1; i++)
            {
                cout << ans[i-1] << " " << i + 1 << "\n";
            }
        }
        else
        {
            ll cnt = 1, n = 3;
            vector<int> ans;

            for(int i=1; i<=n; i++)
            {
                ans.pb(i);
                cnt++;
            }

            for(int i=1; i<=2*(b*n-2*a); i++)
            {
                ans.pb(1);
                cnt++;
            }

            cout << cnt << " " << cnt - 1 << "\n";
            for(int i=1; i<=cnt-1; i++)
            {
                cout << ans[i-1] << " " << i + 1 << "\n";
            }
        }
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1/2

output:

2 1
1 2

result:

ok 

Test #2:

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

input:

1/3

output:

impossible

result:

ok 

Test #3:

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

input:

7/4

output:

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

result:

ok 

Test #4:

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

input:

974/975

output:

975 974
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 61
...

result:

ok 

Test #5:

score: 0
Accepted
time: 32ms
memory: 5168kb

input:

943/346

output:

412086 412085
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 51
51 ...

result:

ok 

Test #6:

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

input:

912/7

output:

12649 12648
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 51
51 52...

result:

ok 

Test #7:

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

input:

1/1

output:

3 2
1 2
2 3

result:

ok 

Test #8:

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

input:

1/1000

output:

impossible

result:

ok 

Test #9:

score: 0
Accepted
time: 1ms
memory: 3644kb

input:

1000/999

output:

1998 1997
1 2
2 3
3 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 6...

result:

ok 

Test #10:

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

input:

999/1000

output:

1000 999
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
1 61...

result:

ok 

Test #11:

score: -100
Wrong Answer
time: 1ms
memory: 3884kb

input:

1000/1

output:

1998 1997
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 51
51 52
5...

result:

FAIL Wrong average distance, got 1995003/1998, wanted 1000/1