oj.uz

답안 #858555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858555 2023-10-08T17:53:20 Z ikura355 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
 30 ms 1120 KB 
#include "longesttrip.h"

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

vector<int> solve3(int n) {
  vector<int> ans(n);
  iota(ans.begin(), ans.end(), 0);
  return ans;
}

vector<int> solve2(int n) {
  vector<int> nxt(n);
  int pair;
  for (int i = 1; i < n; i++)
    if (are_connected({0}, {i})) pair = i;
  int head = 0, tail = pair;
  nxt[head] = pair;
  for (int i = 0; i < n; i++) {
    if (i == 0 || i == pair) continue;
    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;
}

int get_connected(vector<int> x, vector<int> y) {
  if (x.empty() || y.empty()) return 0;
  return are_connected(x, y);
}

vector<int> solve1(int n) {
  vector<int> a({0}), b;
  for (int i = 1; i < n; i++) {
    int connect_a = get_connected(a, {i});
    int connect_b = get_connected(b, {i});
    if (!connect_a && !connect_b) {
      a.insert(a.end(), b.begin(), b.end());
      b = {i};
    } else {
      if (connect_b) swap(a, b);
      // head
      if (are_connected({a[0]}, {i})) a.insert(a.begin(), i);
      // tail
      else if (are_connected({a[a.size() - 1]}, {i}))
        a.push_back(i);
      else {
        for (int j = 0; j < (int)a.size(); j++) {
          if (are_connected({a[j]}, {i})) {
            // [i] + [j, ...] + [0, ..., j-1]
            vector<int> vec;
            vec.push_back(i);
            for (int k = j; k < (int)a.size(); k++) vec.push_back(a[k]);
            for (int k = 0; k < j; k++) vec.push_back(a[k]);
            a = vec;
            break;
          }
        }
      }
    }
  }
  if (a.size() > b.size()) return a;
  return b;
}

std::vector<int> longest_trip(int n, int density) {
  if (density == 3) return solve3(n);
  if (density == 2) return solve2(n);
  if (density == 1) return solve1(n);
  return {};
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> solve2(int)':
longesttrip.cpp:18:13: warning: 'pair' may be used uninitialized in this function [-Wmaybe-uninitialized]
   18 |   nxt[head] = pair;

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 5 ms 736 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 9 ms 788 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 10 ms 600 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 9 ms 600 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 15 ms 444 KB Output is correct
5 Correct 17 ms 496 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 10 ms 344 KB Output is correct
9 Correct 12 ms 608 KB Output is correct
10 Correct 17 ms 496 KB Output is correct
11 Correct 18 ms 492 KB Output is correct
12 Correct 18 ms 492 KB Output is correct
13 Correct 17 ms 744 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 15 ms 344 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 13 ms 344 KB Output is correct
19 Correct 15 ms 860 KB Output is correct
20 Correct 13 ms 444 KB Output is correct
21 Correct 20 ms 748 KB Output is correct
22 Correct 21 ms 692 KB Output is correct
23 Correct 20 ms 744 KB Output is correct
24 Correct 20 ms 756 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 11 ms 344 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 12 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 12 ms 432 KB Output is correct
31 Correct 14 ms 432 KB Output is correct
32 Correct 14 ms 436 KB Output is correct
33 Correct 15 ms 600 KB Output is correct
34 Correct 15 ms 604 KB Output is correct
35 Correct 16 ms 444 KB Output is correct
36 Correct 20 ms 740 KB Output is correct
37 Correct 22 ms 708 KB Output is correct
38 Correct 23 ms 956 KB Output is correct
39 Correct 21 ms 880 KB Output is correct
40 Correct 25 ms 616 KB Output is correct
41 Correct 23 ms 700 KB Output is correct
42 Correct 21 ms 956 KB Output is correct
43 Correct 21 ms 704 KB Output is correct
44 Correct 30 ms 1120 KB Output is correct
45 Correct 12 ms 596 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 11 ms 344 KB Output is correct
49 Correct 12 ms 344 KB Output is correct
50 Correct 12 ms 440 KB Output is correct
51 Correct 14 ms 432 KB Output is correct
52 Correct 14 ms 432 KB Output is correct
53 Correct 17 ms 608 KB Output is correct
54 Correct 15 ms 604 KB Output is correct
55 Correct 17 ms 444 KB Output is correct
56 Correct 19 ms 504 KB Output is correct
57 Correct 25 ms 744 KB Output is correct
58 Correct 22 ms 736 KB Output is correct
59 Correct 27 ms 860 KB Output is correct
60 Correct 24 ms 704 KB Output is correct
61 Correct 22 ms 668 KB Output is correct
62 Correct 26 ms 960 KB Output is correct
63 Correct 25 ms 452 KB Output is correct
64 Correct 24 ms 704 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 15 ms 956 KB Output is correct
5 Partially correct 16 ms 496 KB Output is partially correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -