oj.uz

Submission #847761

# Submission time Handle Problem Language Result Execution time Memory
847761 2023-09-10T10:39:55 Z Hydrolyzed Longest Trip (IOI23_longesttrip) C++17
40 / 100
 8 ms 852 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

using namespace std;

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

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};
    for (int i = 2; i <= N-1; ++i) {
      if(are_connected({i}, {line_1.back()})) {
        // i connect with 1
        line_1.emplace_back(i);
      }
      else if(are_connected({i}, {line_2.back()})) {
        // i connect with 2
        line_2.emplace_back(i);
      }
      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);
      }
    }
    if(line_1.size() > line_2.size()) {
      res = line_1;
    }
    else {
      res = line_2;
    }
  }
  return res;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -