// incorrect/sol_birka0_D1Half_bigQ.cpp
#include "longesttrip.h"
#include <set>
#include <algorithm>
using namespace std;
vector<int> longest_trip(int N, int /*D*/)
{
vector<int> t = {0};
set<int> s;
for (int i = 1; i < N; ++i)
{
s.insert(i);
}
for (int l = 1; l < N; ++l)
{
bool succ = false;
for (int x : s)
{
if (are_connected({t.back()}, {x}))
{
t.push_back(x);
s.erase(x);
succ = true;
break;
}
}
if (!succ)
{
break;
}
}
if (s.size() > t.size())
{
return vector<int>(s.begin(), s.end());
}
return t;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
3 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
208 KB |
Output is correct |
2 |
Correct |
9 ms |
256 KB |
Output is correct |
3 |
Correct |
9 ms |
208 KB |
Output is correct |
4 |
Correct |
10 ms |
208 KB |
Output is correct |
5 |
Correct |
10 ms |
300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
208 KB |
Output is correct |
2 |
Correct |
9 ms |
208 KB |
Output is correct |
3 |
Correct |
7 ms |
208 KB |
Output is correct |
4 |
Correct |
9 ms |
292 KB |
Output is correct |
5 |
Correct |
9 ms |
308 KB |
Output is correct |
6 |
Incorrect |
0 ms |
208 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
208 KB |
Output is correct |
2 |
Correct |
8 ms |
208 KB |
Output is correct |
3 |
Correct |
9 ms |
208 KB |
Output is correct |
4 |
Correct |
6 ms |
208 KB |
Output is correct |
5 |
Correct |
8 ms |
208 KB |
Output is correct |
6 |
Correct |
5 ms |
208 KB |
Output is correct |
7 |
Correct |
6 ms |
208 KB |
Output is correct |
8 |
Correct |
6 ms |
208 KB |
Output is correct |
9 |
Correct |
9 ms |
208 KB |
Output is correct |
10 |
Correct |
7 ms |
300 KB |
Output is correct |
11 |
Correct |
10 ms |
208 KB |
Output is correct |
12 |
Correct |
4 ms |
296 KB |
Output is correct |
13 |
Correct |
9 ms |
296 KB |
Output is correct |
14 |
Correct |
7 ms |
208 KB |
Output is correct |
15 |
Correct |
12 ms |
208 KB |
Output is correct |
16 |
Correct |
13 ms |
208 KB |
Output is correct |
17 |
Correct |
10 ms |
208 KB |
Output is correct |
18 |
Correct |
6 ms |
208 KB |
Output is correct |
19 |
Correct |
7 ms |
208 KB |
Output is correct |
20 |
Correct |
8 ms |
208 KB |
Output is correct |
21 |
Correct |
12 ms |
304 KB |
Output is correct |
22 |
Correct |
10 ms |
208 KB |
Output is correct |
23 |
Correct |
8 ms |
300 KB |
Output is correct |
24 |
Correct |
9 ms |
296 KB |
Output is correct |
25 |
Correct |
9 ms |
208 KB |
Output is correct |
26 |
Correct |
8 ms |
208 KB |
Output is correct |
27 |
Correct |
12 ms |
212 KB |
Output is correct |
28 |
Correct |
12 ms |
212 KB |
Output is correct |
29 |
Correct |
10 ms |
336 KB |
Output is correct |
30 |
Correct |
15 ms |
208 KB |
Output is correct |
31 |
Correct |
43 ms |
208 KB |
Output is correct |
32 |
Correct |
71 ms |
208 KB |
Output is correct |
33 |
Correct |
8 ms |
208 KB |
Output is correct |
34 |
Correct |
19 ms |
208 KB |
Output is correct |
35 |
Correct |
33 ms |
288 KB |
Output is correct |
36 |
Correct |
14 ms |
296 KB |
Output is correct |
37 |
Correct |
55 ms |
328 KB |
Output is correct |
38 |
Correct |
114 ms |
284 KB |
Output is correct |
39 |
Correct |
181 ms |
288 KB |
Output is correct |
40 |
Correct |
236 ms |
288 KB |
Output is correct |
41 |
Correct |
260 ms |
208 KB |
Output is correct |
42 |
Correct |
233 ms |
208 KB |
Output is correct |
43 |
Correct |
236 ms |
284 KB |
Output is correct |
44 |
Correct |
290 ms |
280 KB |
Output is correct |
45 |
Correct |
7 ms |
208 KB |
Output is correct |
46 |
Correct |
6 ms |
208 KB |
Output is correct |
47 |
Correct |
7 ms |
208 KB |
Output is correct |
48 |
Correct |
13 ms |
208 KB |
Output is correct |
49 |
Correct |
6 ms |
208 KB |
Output is correct |
50 |
Correct |
12 ms |
224 KB |
Output is correct |
51 |
Correct |
25 ms |
208 KB |
Output is correct |
52 |
Correct |
54 ms |
208 KB |
Output is correct |
53 |
Correct |
10 ms |
208 KB |
Output is correct |
54 |
Correct |
12 ms |
292 KB |
Output is correct |
55 |
Correct |
11 ms |
208 KB |
Output is correct |
56 |
Correct |
13 ms |
300 KB |
Output is correct |
57 |
Correct |
40 ms |
300 KB |
Output is correct |
58 |
Correct |
138 ms |
276 KB |
Output is correct |
59 |
Correct |
179 ms |
280 KB |
Output is correct |
60 |
Correct |
256 ms |
276 KB |
Output is correct |
61 |
Correct |
243 ms |
280 KB |
Output is correct |
62 |
Correct |
155 ms |
284 KB |
Output is correct |
63 |
Correct |
190 ms |
280 KB |
Output is correct |
64 |
Correct |
222 ms |
280 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
208 KB |
Output is correct |
2 |
Correct |
8 ms |
208 KB |
Output is correct |
3 |
Correct |
6 ms |
208 KB |
Output is correct |
4 |
Correct |
8 ms |
208 KB |
Output is correct |
5 |
Correct |
7 ms |
304 KB |
Output is correct |
6 |
Incorrect |
0 ms |
208 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |