답안 #1038496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038496	2024-07-29T21:20:35 Z	erray	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	16 ms	856 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/ioi/egoi2024/d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

vector<int> m(vector<int> x, vector<int> y) {
  vector<int> res;
  res = x;
  res.insert(res.end(), y.begin(), y.end());
  return res;
}

std::vector<int> longest_trip(int N, int D) {
  array<vector<int>, 2> l;
  l[0] = {0}; l[1] = {1};
  bool dis = false;
  for (int i = 2; i < N; ++i) {
    if (are_connected({i}, {l[0].back()})) {
      l[0].push_back(i);
      dis = false;
    } else if (dis) {
      l[1].push_back(i);
      dis = false;
    } else if (are_connected({i}, {l[1].back()})) {
      l[1].push_back(i);
      dis = true;
    } else {
      dis = int(l[1].size()) == 1;
      l[0] = m(l[0], vector<int>(l[1].rbegin(), l[1].rend()));
      l[1] = {i};
    }
  } 
  debug(l);
  if (!are_connected(l[0], l[1])) {
    return  int(l[0].size()) > int(l[1].size()) ? l[0] : l[1];
  }
  vector<int> fe0, fe1;
  int l0 = int(l[0].size());
  int l1 = int(l[1].size());
  for (int i = 0; i < l0; ++i) {
    if (i == 0 || i == l0 - 1) fe0.push_back(l[0][i]);
  }
  for (int i = 0; i < l1; ++i) {
    if (i == 0 || i == l1 - 1) fe1.push_back(l[1][i]);
  }
  if (!are_connected(fe0, fe1)) {
    int s = -1;
    {
      int low = 0, high = int(l[1].size()) - 1;
      while (low < high) {
        int mid = (low + high) >> 1;
        if (are_connected(l[0], vector<int>(l[1].begin(), l[1].begin() + mid + 1))) {
          high = mid;
        } else {
          low = mid + 1;
        }
      }
      s = low;
    }
    int f = -1;
    {
      int low = 0, high = int(l[0].size()) - 1;
      while (low < high) {
        int mid = (low + high) >> 1;
        if (are_connected({l[1][s]}, vector<int>(l[0].begin(), l[0].begin() + mid + 1))) {
          high = mid;
        } else {
          low = mid + 1;
        }
      }
      f = low;
    }
    rotate(l[1].begin(), l[1].begin() + s, l[1].end());
    if (f != int(l[0].size()) - 1) rotate(l[0].begin(), l[0].begin() + f + 1, l[0].end());
    vector<int> ans = m(l[0], l[1]);
    return ans;
  }
  vector<int> ans;
  for (int it = 0; it < 2; ++it) {
    for (int it1 = 0; it1 < 2; it1++) {
      if (are_connected({l[0].back()}, {l[1][0]})) {
        ans = m(l[0], l[1]);
      }
      reverse(l[1].begin(), l[1].end());
    }
    reverse(l[0].begin(), l[0].end());
  }
  return ans;
}

Subtask #0

0.0 / 0.0

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

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	6 ms	436 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	16 ms	344 KB	Output is correct
7	Correct	8 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	6 ms	444 KB	Output is correct
11	Correct	6 ms	444 KB	Output is correct
12	Correct	7 ms	344 KB	Output is correct
13	Correct	6 ms	344 KB	Output is correct

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 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	6 ms	344 KB	Output is correct
5	Correct	6 ms	344 KB	Output is correct
6	Correct	11 ms	340 KB	Output is correct
7	Correct	10 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	5 ms	440 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	5 ms	440 KB	Output is correct
12	Correct	6 ms	344 KB	Output is correct
13	Correct	6 ms	444 KB	Output is correct
14	Correct	6 ms	344 KB	Output is correct
15	Correct	9 ms	344 KB	Output is correct
16	Correct	9 ms	344 KB	Output is correct
17	Correct	7 ms	344 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	6 ms	444 KB	Output is correct
20	Correct	6 ms	436 KB	Output is correct
21	Correct	6 ms	460 KB	Output is correct
22	Correct	6 ms	456 KB	Output is correct
23	Correct	6 ms	460 KB	Output is correct
24	Correct	7 ms	456 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	344 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Correct	8 ms	344 KB	Output is correct
29	Correct	8 ms	344 KB	Output is correct
30	Correct	6 ms	600 KB	Output is correct
31	Correct	8 ms	600 KB	Output is correct
32	Correct	9 ms	344 KB	Output is correct
33	Correct	6 ms	440 KB	Output is correct
34	Correct	5 ms	344 KB	Output is correct
35	Correct	6 ms	432 KB	Output is correct
36	Correct	5 ms	436 KB	Output is correct
37	Correct	6 ms	440 KB	Output is correct
38	Correct	6 ms	380 KB	Output is correct
39	Correct	8 ms	440 KB	Output is correct
40	Correct	8 ms	344 KB	Output is correct
41	Correct	7 ms	440 KB	Output is correct
42	Correct	7 ms	344 KB	Output is correct
43	Correct	8 ms	344 KB	Output is correct
44	Correct	7 ms	344 KB	Output is correct
45	Correct	16 ms	344 KB	Output is correct
46	Correct	13 ms	344 KB	Output is correct
47	Correct	8 ms	344 KB	Output is correct
48	Correct	10 ms	348 KB	Output is correct
49	Correct	9 ms	344 KB	Output is correct
50	Correct	7 ms	444 KB	Output is correct
51	Correct	8 ms	440 KB	Output is correct
52	Correct	11 ms	436 KB	Output is correct
53	Correct	7 ms	448 KB	Output is correct
54	Correct	7 ms	452 KB	Output is correct
55	Correct	5 ms	456 KB	Output is correct
56	Correct	8 ms	448 KB	Output is correct
57	Correct	7 ms	460 KB	Output is correct
58	Correct	9 ms	452 KB	Output is correct
59	Correct	7 ms	356 KB	Output is correct
60	Correct	9 ms	452 KB	Output is correct
61	Correct	8 ms	612 KB	Output is correct
62	Correct	7 ms	452 KB	Output is correct
63	Correct	9 ms	452 KB	Output is correct
64	Correct	9 ms	612 KB	Output is correct

Subtask #4

60.0 / 60.0

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