QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#499687#6728. To the ParkssmyWA 140ms9488kbC++20917b2024-07-31 17:04:252024-07-31 17:04:27

Judging History

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

  • [2024-07-31 17:04:27]
  • 评测
  • 测评结果:WA
  • 用时:140ms
  • 内存:9488kb
  • [2024-07-31 17:04:25]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
void solve()
{
    int n;
    std:: cin >> n;
    set <int> s;
    for(int i = 2; i <= n; i ++ )
    {
        s.insert(i);
    }

    vector<PII> l;
    while(1)
    {
        int x;
        for(auto p : s)
        {
            x = p;
            break;
        }
        int y = 2 * x;
        if(s.find(y) != s.end())
        {
            l.push_back({x, y});
            s.erase(y);
            s.erase(x);
        }
        else
        {
            break;
        }
    }

    std:: cout << l.size();
    for(auto p : l)
    {
        std:: cout << " " << p.first << " " << p.second;
    }
    std:: cout << endl;
}   
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
    int T;
    std:: cin >> T;
    while(T -- )
	solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3816kb

input:

3
1
4
6

output:

0
1 2 4
2 2 4 3 6

result:

ok 4 cases

Test #2:

score: -100
Wrong Answer
time: 140ms
memory: 9488kb

input:

1007
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101...

output:

0
0
0
1 2 4
1 2 4
2 2 4 3 6
2 2 4 3 6
2 2 4 3 6
2 2 4 3 6
3 2 4 3 6 5 10
3 2 4 3 6 5 10
3 2 4 3 6 5 10
3 2 4 3 6 5 10
4 2 4 3 6 5 10 7 14
4 2 4 3 6 5 10 7 14
5 2 4 3 6 5 10 7 14 8 16
5 2 4 3 6 5 10 7 14 8 16
6 2 4 3 6 5 10 7 14 8 16 9 18
6 2 4 3 6 5 10 7 14 8 16 9 18
6 2 4 3 6 5 10 7 14 8 16 9 18
6 ...

result:

wrong answer Case #9: Participant has a worse answer