oj.uz

Submission #996297

# Submission time Handle Problem Language Result Execution time Memory
996297 2024-06-10T12:11:08 Z kunzaZa183 Longest Trip (IOI23_longesttrip) C++17
30 / 100
 26 ms 600 KB 
#include "longesttrip.h"

#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N, int D) {
  vector<int> trip1(1, 0), trip2;
  for (int i = 1; i < N; i++) {
    bool b = are_connected(vector<int>(1, trip1.front()), vector<int>(1, i)),
         b2 = are_connected(vector<int>(1, trip1.back()), vector<int>(1, i));
    if (!b && !b2)
      trip2.push_back(i);
    else if (trip2.empty()) {
      if (b)
        trip1.insert(trip1.begin(), i);
      else
        trip2.push_back(i);
    } else if (b) {
      bool b3 = are_connected(vector<int>(1, trip2.front()), vector<int>(1, i)),
           b4 = are_connected(vector<int>(1, trip2.back()), vector<int>(1, i));
      if (b3) {
        trip1.insert(trip1.begin(), i);
        for (auto a : trip2) trip1.insert(trip1.begin(), a);
        trip2.clear();
      } else if (b4) {
        trip2.push_back(i);
        for (auto a : trip1) trip2.push_back(a);
        trip1 = trip2;
        trip2.clear();
      } else {
        trip1.insert(trip1.begin(), i);
      }
    } else if (b2) {
      bool b3 = are_connected(vector<int>(1, trip2.front()), vector<int>(1, i)),
           b4 = are_connected(vector<int>(1, trip2.back()), vector<int>(1, i));
      if (b3) {
        trip1.push_back(i);
        for (auto a : trip2) trip1.push_back(a);
        trip2.clear();
      } else if (b4) {
        reverse(trip2.begin(), trip2.end());
        trip1.push_back(i);
        for (auto a : trip2) trip1.push_back(a);
        trip2.clear();
      } else {
        trip1.push_back(i);
      }
    }
  }
  if (trip1.size() < trip2.size()) trip1.swap(trip2);
  return trip1;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 12 ms 344 KB Output is correct
3 Correct 12 ms 344 KB Output is correct
4 Correct 13 ms 344 KB Output is correct
5 Correct 11 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 12 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 Partially correct 10 ms 344 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -