oj.uz

답안 #941911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941911 2024-03-09T16:43:29 Z benjaminkleyn 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 12 ms 860 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std; 
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define C are_connected
#define pb push_back
#define bk back
#define rev(x) reverse(all(x)) 
vi longest_trip(int N, int D){if (D == 3){vi r(N);iota(all(r), 0);return r;} if (D == 2){vi r;int t;if (C({0}, {1}))r = {0, 1}, t = 2;else r = {0, 2, 1}, t = 3; for (int i = t; i < N; i++){if (!C({r.bk()}, {i}))rev(r);r.pb(i);} return r;} vi A = {0}, B = {1};for (int i = 2; i + 1 < N; i += 2){if (C({i}, {i + 1})){if (C({i}, {A.bk(), B.bk()})){if (C({i}, {A.bk()})){A.pb(i);A.pb(i + 1);}else{B.pb(i);B.pb(i + 1);}}else{rev(B);for (int x : B) A.pb(x);B = {i, i + 1};}}else{if (C({A.bk()}, {i})){A.pb(i);if (C({B.bk()}, {i + 1}))B.pb(i + 1);else{rev(B);for (int x : B)A.pb(x);B = {i + 1};}}else{A.pb(i + 1);if (C({B.bk()}, {i}))B.pb(i);else{rev(B);for (int x : B)A.pb(x);B = {i};}}}}if (N % 2){if (C({N - 1}, {A.bk(), B.bk()})){if (C({N - 1}, {A.bk()}))A.pb(N - 1);else B.pb(N - 1);}else{rev(B);for (int x : B)A.pb(x);B = {N - 1};}}if (!C(A, B)){if (A.size() > B.size())return A;return B;}if (A.size() > 1 && !C({A[0]}, {A.bk()})){if (C({A.bk()}, {B.bk()}))rev(A);for (int x : A)B.pb(x);return B;}if (B.size() > 1 && !C({B[0]}, {B.bk()})){if (C({A.bk()}, {B.bk()}))rev(B);for (int x : B)A.pb(x);return A;}int a = 1, b = A.size();while (a < b){int m = (a + b) / 2;if (C(vi(A.begin(), A.begin() + m), B))b = m;else a = m + 1;}int x = a - 1;a = 1, b = B.size();while (a < b){int m = (a + b) / 2;if (C(vi(B.begin(), B.begin() + m), {A[x]}))b = m;else a = m + 1;}int y = a - 1;vi r;for (int i = x + 1; i < A.size(); i++)r.pb(A[i]);for (int i = 0; i <= x; i++)r.pb(A[i]);for (int i = y; i < B.size(); i++)r.pb(B[i]);for (int i = 0; i < y; i++)r.pb(B[i]);return r;}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:10:1399: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | vi longest_trip(int N, int D){if (D == 3){vi r(N);iota(all(r), 0);return r;} if (D == 2){vi r;int t;if (C({0}, {1}))r = {0, 1}, t = 2;else r = {0, 2, 1}, t = 3; for (int i = t; i < N; i++){if (!C({r.bk()}, {i}))rev(r);r.pb(i);} return r;} vi A = {0}, B = {1};for (int i = 2; i + 1 < N; i += 2){if (C({i}, {i + 1})){if (C({i}, {A.bk(), B.bk()})){if (C({i}, {A.bk()})){A.pb(i);A.pb(i + 1);}else{B.pb(i);B.pb(i + 1);}}else{rev(B);for (int x : B) A.pb(x);B = {i, i + 1};}}else{if (C({A.bk()}, {i})){A.pb(i);if (C({B.bk()}, {i + 1}))B.pb(i + 1);else{rev(B);for (int x : B)A.pb(x);B = {i + 1};}}else{A.pb(i + 1);if (C({B.bk()}, {i}))B.pb(i);else{rev(B);for (int x : B)A.pb(x);B = {i};}}}}if (N % 2){if (C({N - 1}, {A.bk(), B.bk()})){if (C({N - 1}, {A.bk()}))A.pb(N - 1);else B.pb(N - 1);}else{rev(B);for (int x : B)A.pb(x);B = {N - 1};}}if (!C(A, B)){if (A.size() > B.size())return A;return B;}if (A.size() > 1 && !C({A[0]}, {A.bk()})){if (C({A.bk()}, {B.bk()}))rev(A);for (int x : A)B.pb(x);return B;}if (B.size() > 1 && !C({B[0]}, {B.bk()})){if (C({A.bk()}, {B.bk()}))rev(B);for (int x : B)A.pb(x);return A;}int a = 1, b = A.size();while (a < b){int m = (a + b) / 2;if (C(vi(A.begin(), A.begin() + m), B))b = m;else a = m + 1;}int x = a - 1;a = 1, b = B.size();while (a < b){int m = (a + b) / 2;if (C(vi(B.begin(), B.begin() + m), {A[x]}))b = m;else a = m + 1;}int y = a - 1;vi r;for (int i = x + 1; i < A.size(); i++)r.pb(A[i]);for (int i = 0; i <= x; i++)r.pb(A[i]);for (int i = y; i < B.size(); i++)r.pb(B[i]);for (int i = 0; i < y; i++)r.pb(B[i]);return r;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                     ~~^~~~~~~~~~
longesttrip.cpp:10:1483: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | vi longest_trip(int N, int D){if (D == 3){vi r(N);iota(all(r), 0);return r;} if (D == 2){vi r;int t;if (C({0}, {1}))r = {0, 1}, t = 2;else r = {0, 2, 1}, t = 3; for (int i = t; i < N; i++){if (!C({r.bk()}, {i}))rev(r);r.pb(i);} return r;} vi A = {0}, B = {1};for (int i = 2; i + 1 < N; i += 2){if (C({i}, {i + 1})){if (C({i}, {A.bk(), B.bk()})){if (C({i}, {A.bk()})){A.pb(i);A.pb(i + 1);}else{B.pb(i);B.pb(i + 1);}}else{rev(B);for (int x : B) A.pb(x);B = {i, i + 1};}}else{if (C({A.bk()}, {i})){A.pb(i);if (C({B.bk()}, {i + 1}))B.pb(i + 1);else{rev(B);for (int x : B)A.pb(x);B = {i + 1};}}else{A.pb(i + 1);if (C({B.bk()}, {i}))B.pb(i);else{rev(B);for (int x : B)A.pb(x);B = {i};}}}}if (N % 2){if (C({N - 1}, {A.bk(), B.bk()})){if (C({N - 1}, {A.bk()}))A.pb(N - 1);else B.pb(N - 1);}else{rev(B);for (int x : B)A.pb(x);B = {N - 1};}}if (!C(A, B)){if (A.size() > B.size())return A;return B;}if (A.size() > 1 && !C({A[0]}, {A.bk()})){if (C({A.bk()}, {B.bk()}))rev(A);for (int x : A)B.pb(x);return B;}if (B.size() > 1 && !C({B[0]}, {B.bk()})){if (C({A.bk()}, {B.bk()}))rev(B);for (int x : B)A.pb(x);return A;}int a = 1, b = A.size();while (a < b){int m = (a + b) / 2;if (C(vi(A.begin(), A.begin() + m), B))b = m;else a = m + 1;}int x = a - 1;a = 1, b = B.size();while (a < b){int m = (a + b) / 2;if (C(vi(B.begin(), B.begin() + m), {A[x]}))b = m;else a = m + 1;}int y = a - 1;vi r;for (int i = x + 1; i < A.size(); i++)r.pb(A[i]);for (int i = 0; i <= x; i++)r.pb(A[i]);for (int i = y; i < B.size(); i++)r.pb(B[i]);for (int i = 0; i < y; i++)r.pb(B[i]);return r;}
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 436 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 7 ms 340 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 7 ms 436 KB Output is correct
22 Correct 7 ms 440 KB Output is correct
23 Correct 7 ms 600 KB Output is correct
24 Correct 6 ms 444 KB Output is correct
25 Correct 6 ms 588 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
31 Correct 7 ms 344 KB Output is correct
32 Correct 6 ms 552 KB Output is correct
33 Correct 6 ms 344 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 6 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 6 ms 608 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 596 KB Output is correct
44 Correct 7 ms 344 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 8 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 9 ms 344 KB Output is correct
50 Correct 8 ms 440 KB Output is correct
51 Correct 7 ms 428 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 7 ms 344 KB Output is correct
54 Correct 7 ms 344 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 7 ms 436 KB Output is correct
57 Correct 7 ms 600 KB Output is correct
58 Correct 9 ms 608 KB Output is correct
59 Correct 7 ms 604 KB Output is correct
60 Correct 7 ms 604 KB Output is correct
61 Correct 7 ms 440 KB Output is correct
62 Correct 7 ms 612 KB Output is correct
63 Correct 7 ms 604 KB Output is correct
64 Correct 7 ms 604 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 12 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 7 ms 544 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 12 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 7 ms 344 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 8 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 7 ms 596 KB Output is correct
32 Correct 9 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 7 ms 436 KB Output is correct
38 Correct 7 ms 436 KB Output is correct
39 Correct 7 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 7 ms 600 KB Output is correct
44 Correct 7 ms 688 KB Output is correct
45 Correct 7 ms 600 KB Output is correct
46 Correct 7 ms 600 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 7 ms 600 KB Output is correct
49 Correct 7 ms 344 KB Output is correct
50 Correct 8 ms 600 KB Output is correct
51 Correct 7 ms 344 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 6 ms 344 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 6 ms 600 KB Output is correct
56 Correct 7 ms 344 KB Output is correct
57 Correct 6 ms 344 KB Output is correct
58 Correct 7 ms 344 KB Output is correct
59 Correct 8 ms 600 KB Output is correct
60 Correct 6 ms 600 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 7 ms 604 KB Output is correct
63 Correct 7 ms 604 KB Output is correct
64 Correct 8 ms 860 KB Output is correct
65 Correct 8 ms 444 KB Output is correct
66 Correct 7 ms 600 KB Output is correct
67 Correct 7 ms 600 KB Output is correct
68 Correct 7 ms 696 KB Output is correct
69 Correct 8 ms 440 KB Output is correct
70 Correct 8 ms 604 KB Output is correct
71 Correct 8 ms 692 KB Output is correct
72 Correct 7 ms 600 KB Output is correct
73 Correct 7 ms 604 KB Output is correct
74 Correct 8 ms 444 KB Output is correct
75 Correct 7 ms 612 KB Output is correct
76 Correct 10 ms 600 KB Output is correct
77 Correct 7 ms 604 KB Output is correct
78 Correct 7 ms 444 KB Output is correct
79 Correct 7 ms 856 KB Output is correct
80 Correct 9 ms 600 KB Output is correct
81 Correct 7 ms 440 KB Output is correct
82 Correct 7 ms 436 KB Output is correct