oj.uz

Submission #858543

# Submission time Handle Problem Language Result Execution time Memory
858543 2023-10-08T17:25:38 Z ikura355 Longest Trip (IOI23_longesttrip) C++17
5 / 100
 5 ms 344 KB 
#include "longesttrip.h"

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

std::vector<int> longest_trip(int n, int density) {
  if (density == 3) {
    // Return list of 0 to N-1
    vector<int> ans(n);
    iota(ans.begin(), ans.end(), 0);
    return ans;
  } else if (density == 2) {
    vector<int> nxt(n);
    int head = 0, tail = 0;
    for (int i = 1; i < n; i++) {
      if (are_connected({head}, {i})) {
        nxt[i] = head;
        head = i;
      } else {
        nxt[tail] = i;
        tail = i;
      }
    }
    vector<int> ans;
    while (true) {
      ans.push_back(head);
      if (head == tail) break;
      head = nxt[head];
    }
    return ans;
  }
  return {};
}

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 2 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
0.0 / 10.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 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 1 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

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

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 -