oj.uz

Submission #1001345

# Submission time Handle Problem Language Result Execution time Memory
1001345 2024-06-18T22:20:20 Z spacewalker Longest Trip (IOI23_longesttrip) C++17
85 / 100
 11 ms 700 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

using namespace std;

optional<int> find_edge_between(vector<int> s, int v) {
  if (!are_connected(s, {v})) return nullopt;
  vector<int> current = s;
  while (current.size() > 1) {
    int hs = current.size() / 2;
    vector<int> h1(begin(current), begin(current) + hs), h2(begin(current) + hs, end(current));
    if (are_connected(h1, {v})) current = h1;
    else current = h2;
  }
  return current[0];
}

optional<pair<int, int>> find_edge_between(vector<int> s1, vector<int> s2) {
  if (!are_connected(s1, s2)) return nullopt;
  vector<int> current = s1;
  while (current.size() > 1) {
    int hs = current.size() / 2;
    vector<int> h1(begin(current), begin(current) + hs), h2(begin(current) + hs, end(current));
    if (are_connected(h1, s2)) current = h1;
    else current = h2;
  }
  return make_pair(current[0], find_edge_between(s2, current[0]).value());
}

std::vector<int> longest_trip(int N, int D) {
  deque<int> p1{0}, p2;
  bool sure_ps_are_dced = true;
  for (int i = 1; i < N; ++i) {
    if (are_connected({p1.back()}, {i})) {
      p1.push_back(i);
      if (!p2.empty()) sure_ps_are_dced = false;
    } else if (p2.empty()) {
      p2.push_front(i);
      sure_ps_are_dced = true;
    } else {
      bool ps_are_dced = sure_ps_are_dced || !are_connected({p1.back()}, {p2.front()});
      if (ps_are_dced) {
        p2.push_front(i);
      } else {
        p1.insert(end(p1), begin(p2), end(p2));
        p2.clear();
        --i; // we will have to process this again
      }
    }
    /*
    cerr << "adding " << i << endl;
    for (int v : p1) cerr << v << " ";
    cerr << (sure_ps_are_dced ? " X " : " ? ");
    for (int v : p2) cerr << v << " ";
    cerr << endl;
    */
  }
  if (!sure_ps_are_dced && !p2.empty() && are_connected({p1.back()}, {p2.front()})) {
      p1.insert(end(p1), begin(p2), end(p2));
      return vector(begin(p1), end(p1)); 
  }
  vector<int> fp1(p1.begin(), p1.end()), fp2(p2.begin(), p2.end());
  if (fp1.size() == N) return fp1;
  if (fp2.size() > 1 && !are_connected({fp2.front()}, {fp2.back()})) {
    vector<int> ans = fp1;
    reverse(begin(fp2), end(fp2));
    ans.insert(end(ans), begin(fp2), end(fp2));
    return ans;
  }
  if (fp1.size() > 1 && !are_connected({fp1.front()}, {fp1.back()})) {
    reverse(begin(fp2), end(fp2));
    vector<int> ans = fp2;
    ans.insert(end(ans), begin(fp1), end(fp1));
    return ans;
  }

  auto bridge = find_edge_between(fp1, fp2);
  if (!bridge) {
    return fp1.size() > fp2.size() ? fp1 : fp2;
  }

  auto left_end_iter = find(begin(fp2), end(fp2), bridge->second);
  rotate(begin(fp2), left_end_iter, end(fp2));

  auto right_end_iter = find(begin(fp1), end(fp1), bridge->first);
  rotate(begin(fp1), right_end_iter, end(fp1));

  vector<int> ans = fp2;
  reverse(begin(ans), end(ans));
  ans.insert(end(ans), begin(fp1), end(fp1));
  return ans;

  
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:63:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |   if (fp1.size() == N) return fp1;
      |       ~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.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 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 432 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

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

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 5 ms 436 KB Output is correct
19 Correct 5 ms 340 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 6 ms 436 KB Output is correct
24 Correct 6 ms 432 KB Output is correct
25 Correct 6 ms 436 KB Output is correct
26 Correct 7 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 600 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
31 Correct 4 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 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 6 ms 436 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 5 ms 344 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 4 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 6 ms 344 KB Output is correct
48 Correct 6 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 6 ms 344 KB Output is correct
51 Partially correct 6 ms 344 KB Output is partially correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 6 ms 600 KB Output is correct
54 Correct 7 ms 344 KB Output is correct
55 Correct 7 ms 344 KB Output is correct
56 Correct 6 ms 344 KB Output is correct
57 Partially correct 8 ms 344 KB Output is partially correct
58 Partially correct 6 ms 344 KB Output is partially correct
59 Partially correct 6 ms 344 KB Output is partially correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 7 ms 356 KB Output is correct
62 Correct 5 ms 344 KB Output is correct
63 Partially correct 6 ms 600 KB Output is partially correct
64 Partially correct 8 ms 344 KB Output is partially correct
65 Partially correct 7 ms 436 KB Output is partially correct
66 Partially correct 8 ms 344 KB Output is partially correct
67 Partially correct 8 ms 344 KB Output is partially correct
68 Partially correct 7 ms 344 KB Output is partially correct
69 Partially correct 8 ms 344 KB Output is partially correct
70 Partially correct 10 ms 688 KB Output is partially correct
71 Correct 5 ms 344 KB Output is correct
72 Partially correct 5 ms 436 KB Output is partially correct
73 Partially correct 11 ms 700 KB Output is partially correct
74 Partially correct 6 ms 344 KB Output is partially correct
75 Partially correct 6 ms 344 KB Output is partially correct
76 Partially correct 8 ms 344 KB Output is partially correct
77 Correct 6 ms 344 KB Output is correct
78 Partially correct 7 ms 448 KB Output is partially correct
79 Correct 6 ms 344 KB Output is correct
80 Partially correct 8 ms 600 KB Output is partially correct
81 Partially correct 7 ms 344 KB Output is partially correct
82 Partially correct 8 ms 344 KB Output is partially correct