Submission #847858

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
847858	2023-09-10T16:04:03 Z	Hydrolyzed	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	9 ms	1108 KB

longesttrip

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

using namespace std;

vector<int> res, line_1, line_2, qry;
deque<int> dq;

inline int search(vector<int> a, vector<int> b) {
  int l = 0, r = (int) a.size() - 1;
  while (l < r) {
    int mid = (l + r) >> 1;
    qry.clear();
    for (int i = l; i <= mid; ++i) {
      qry.emplace_back(a[i]);
    }
    if(are_connected(qry, b)) {
      r = mid;
    }
    else {
      l = mid + 1;
    }
  }
  return l;
}

std::vector<int> longest_trip(int N, int D) {
  res.clear();
  if (D == 3) {
    for (int i = 0; i <= N - 1; ++i) {
      res.emplace_back(i);
    }
  }
  else if(D == 2) {
    dq.clear();
    dq.emplace_back(0);
    dq.emplace_back(1);
    dq.emplace_back(2);
    for (int i = 0; i <= 1; ++i) {
      if(are_connected({i}, {i + 1})) {
        continue;
      }
      swap(dq[0], dq[i]);
      swap(dq[2], dq[i + 1]);
      break;
    }
    for (int i = 3; i <= N - 1; ++i) {
      if(are_connected({i}, {dq[0]})) {
        dq.emplace_front(i);
      }
      else {
        dq.emplace_back(i);
      }
    }
    while(!dq.empty()) {
      res.emplace_back(dq.front());
      dq.pop_front();
    }
  }
  else {
    line_1 = {0};
    line_2 = {1};
    bool connected = true;
    for (int i = 2; i <= N - 1; ++i) {
      if(are_connected({i}, {line_1.back()})) {
        // i connect with 1
        line_1.emplace_back(i);
        connected = true;
      }
      else if(!connected || are_connected({i}, {line_2.back()})) {
        // i connect with 2
        line_2.emplace_back(i);
        connected = false;
      }
      else {
        // i is not connect with 1 and 2
        // so 1 is connect with 2 -> pigeonhole principle
        while(!line_2.empty()) {
          line_1.emplace_back(line_2.back());
          line_2.pop_back();
        }
        line_2.emplace_back(i);
        connected = true;
      }
    }
    if(line_1.size() > line_2.size()) {
      swap(line_1, line_2);
    }
    if(are_connected(line_1, line_2) == false) {
      return line_2;
    }
    if(are_connected({line_1[0]}, {line_2[0]})) {
      reverse(line_2.begin(), line_2.end());
      for(auto x: line_1) {
        line_2.emplace_back(x);
      }
      return line_2;
    }
    if (are_connected({line_1[0]}, {line_2.back()})) {
      for(auto x: line_1) {
        line_2.emplace_back(x);
      }
      return line_2;
    }
    if(are_connected({line_1.back()}, {line_2[0]})) {
      // reverse(line_2.begin(), line_2.end());
      for(auto x : line_2) {
        line_1.emplace_back(x);
      }
      return line_1;
    }
    if(are_connected({line_1.back()}, {line_2.back()})) {
      reverse(line_1.begin(), line_1.end());
      for(auto x: line_1) {
        line_2.emplace_back(x);
      }
      return line_2;
    }
    int edge_1 = search(line_2, line_1);
    int edge_2 = search(line_1, {line_2[edge_1]});
    for (int i = 0; i < (int)line_2.size(); ++i) {
      res.emplace_back(line_2[(edge_1 + i + 1) % ((int)line_2.size())]);
    }
    for (int i = 0; i < (int)line_1.size(); ++i) {
      res.emplace_back(line_1[(edge_2 + i) % ((int)line_1.size())]);
    }
  }
  return res;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	596 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	4 ms	340 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	4 ms	600 KB	Output is correct
6	Correct	5 ms	344 KB	Output is correct
7	Correct	4 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	6 ms	344 KB	Output is correct
11	Correct	5 ms	600 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	5 ms	596 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	5 ms	600 KB	Output is correct
6	Correct	7 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	5 ms	600 KB	Output is correct
10	Correct	4 ms	600 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	4 ms	344 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct
14	Correct	7 ms	596 KB	Output is correct
15	Correct	6 ms	344 KB	Output is correct
16	Correct	9 ms	596 KB	Output is correct
17	Correct	8 ms	344 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	5 ms	344 KB	Output is correct
21	Correct	6 ms	1108 KB	Output is correct
22	Correct	5 ms	692 KB	Output is correct
23	Correct	5 ms	688 KB	Output is correct
24	Correct	5 ms	604 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	6 ms	344 KB	Output is correct
27	Correct	5 ms	344 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Correct	6 ms	344 KB	Output is correct
32	Correct	5 ms	344 KB	Output is correct
33	Correct	5 ms	600 KB	Output is correct
34	Correct	6 ms	344 KB	Output is correct
35	Correct	5 ms	596 KB	Output is correct
36	Correct	5 ms	344 KB	Output is correct
37	Correct	5 ms	344 KB	Output is correct
38	Correct	6 ms	608 KB	Output is correct
39	Correct	6 ms	600 KB	Output is correct
40	Correct	5 ms	600 KB	Output is correct
41	Correct	5 ms	344 KB	Output is correct
42	Correct	7 ms	600 KB	Output is correct
43	Correct	5 ms	344 KB	Output is correct
44	Correct	5 ms	596 KB	Output is correct
45	Correct	8 ms	344 KB	Output is correct
46	Correct	8 ms	344 KB	Output is correct
47	Correct	7 ms	344 KB	Output is correct
48	Correct	8 ms	344 KB	Output is correct
49	Correct	8 ms	344 KB	Output is correct
50	Correct	5 ms	600 KB	Output is correct
51	Correct	6 ms	432 KB	Output is correct
52	Correct	6 ms	440 KB	Output is correct
53	Correct	5 ms	344 KB	Output is correct
54	Correct	5 ms	344 KB	Output is correct
55	Correct	6 ms	600 KB	Output is correct
56	Correct	4 ms	444 KB	Output is correct
57	Correct	5 ms	444 KB	Output is correct
58	Correct	6 ms	440 KB	Output is correct
59	Correct	6 ms	440 KB	Output is correct
60	Correct	6 ms	440 KB	Output is correct
61	Correct	6 ms	612 KB	Output is correct
62	Correct	7 ms	604 KB	Output is correct
63	Correct	8 ms	600 KB	Output is correct
64	Correct	6 ms	600 KB	Output is correct

Subtask #4

60.0 / 60.0

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