oj.uz

Submission #1037908

# Submission time Handle Problem Language Result Execution time Memory
1037908 2024-07-29T10:00:03 Z erray Longest Trip (IOI23_longesttrip) C++17
15 / 100
 19 ms 600 KB 
#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;
}


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

std::vector<int> longest_trip(int N, int D) {
  array<vector<int>, 2> l{};
  vector<int> ord(N);
  iota(ord.begin(), ord.end(), 0);
  shuffle(ord.begin(), ord.end(), rng);
  l[0] = {ord.back()};
  ord.pop_back();
  for (auto i : ord) {
    if (l[1].empty()) {
      l[1].push_back(i);
    } else if (are_connected({i}, {l[0].back()})) {
      l[0].push_back(i);
    } else if (are_connected({i}, {l[1].back()})) {
      l[1].push_back(i);
    } else {
      l[0] = m(l[0], l[1]);
      l[1] = {i};
    }
  }
  if (l[1].empty()) return l[0];
  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());
    }
    swap(l[0], l[1]);
  }
  if (ans.empty()) {
    if (!are_connected(l[0], l[1])) {
      ans = int(l[0].size()) > int(l[1].size()) ? l[0] : l[1];
    } else {
      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());
      ans = m(l[0], l[1]);
    }
  } 
  for (int i = 0; i < int(ans.size()) - 1; ++i) {
    assert(are_connected({ans[i]}, {ans[i + 1]}));
  }
  return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 344 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 12 ms 344 KB Output is correct
5 Correct 12 ms 440 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 13 ms 344 KB Output is correct
4 Correct 13 ms 344 KB Output is correct
5 Correct 12 ms 444 KB Output is correct
6 Correct 14 ms 344 KB Output is correct
7 Correct 16 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 10 ms 344 KB Output is correct
11 Correct 10 ms 344 KB Output is correct
12 Correct 10 ms 344 KB Output is correct
13 Correct 13 ms 444 KB Output is correct
14 Correct 19 ms 344 KB Output is correct
15 Runtime error 7 ms 600 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 344 KB Output is correct
2 Correct 15 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 11 ms 600 KB Output is correct
5 Partially correct 14 ms 344 KB Output is partially correct
6 Correct 15 ms 344 KB Output is correct
7 Correct 12 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Partially correct 13 ms 448 KB Output is partially correct
11 Partially correct 10 ms 440 KB Output is partially correct
12 Partially correct 8 ms 596 KB Output is partially correct
13 Partially correct 10 ms 448 KB Output is partially correct
14 Correct 14 ms 344 KB Output is correct
15 Runtime error 4 ms 600 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -