oj.uz

답안 #958913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958913 2024-04-07T04:22:15 Z nguyentunglam 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 14 ms 1116 KB 
#include "longesttrip.h"
#ifdef ngu
#include "grader.cpp"
#endif // ngu
#include<bits/stdc++.h>
using namespace std;

pair<int, int> Find (vector<int> a, vector<int> b) {
  if (!are_connected(a, b)) return make_pair(-1, -1);
  int l = 0, r = a.size() - 1, lastx = -1, lasty = -1;
  while (l <= r) {
    int mid = l + r >> 1;
    vector<int> ask;
    for(int i = 0; i <= mid; i++) ask.push_back(a[i]);
    if (are_connected(ask, b)) {
      lastx = mid;
      r = mid - 1;
    } else l = mid + 1;
  }
  l = 0, r = b.size() - 1;
  while (l <= r) {
    int mid = l + r >> 1;
    vector<int> ask;
    for(int i = 0; i <= mid; i++) ask.push_back(b[i]);
    if (are_connected(ask, {a[lastx]})) {
      lasty = mid;
      r = mid - 1;
    } else l = mid + 1;
  }
  assert(are_connected({a[lastx]}, {b[lasty]}));
  return make_pair(lastx, lasty);
}

vector<int> rev (vector<int> a) {
  reverse(a.begin(), a.end());
  return a;
}

vector<int> sum (vector<int> a, vector<int> b) {
  for(int &j : b) a.push_back(j);
  return a;
}

std::vector<int> longest_trip(int n, int d)
{
    vector<int> a, b;
    a.push_back(0);
    b.push_back(1);

    auto one = [&] (int i) {
      if (are_connected({a.back()}, {i})) a.push_back(i);
      else if (are_connected({b.back()}, {i})) b.push_back(i);
      else {
        reverse(b.begin(), b.end());
        for(int &j : b) a.push_back(j);
        b = {i};
      }
    };

    auto two = [&] (int i) {
      if (are_connected({i}, {i + 1})) {
        if (are_connected({a.back()}, {i})) {
          a.push_back(i);
          a.push_back(i + 1);
        }
        else if (are_connected({b.back()}, {i})) {
          b.push_back(i);
          b.push_back(i + 1);
        }
        else {
          a = sum(a, rev(b));
          b = {i, i + 1};
        }
      }
      else {
        if (are_connected({a.back()}, {i})) {
          if (are_connected({b.back()}, {i + 1})) {
            a.push_back(i);
            b.push_back(i + 1);
          }
          else {
            a.push_back(i);
            a = sum(a, rev(b));
            b = {i + 1};
          }
        }
        else {
          if (are_connected({b.back()}, {i})) {
            a.push_back(i + 1);
            b.push_back(i);
          }
          else {
            a.push_back(i + 1);
            a = sum(a, rev(b));
            b = {i};
          }
        }
      }
    };

    for(int i = 2; i < n; i += 2) {
      if (i + 1 < n) two(i);
      else one(i);
    }

    if (a.size() > b.size()) swap(a, b);

    if (a.size() > 2 && !are_connected({a[0]}, {a.back()})) {
      if (are_connected({a[0]}, {b[0]})) return sum(rev(a), b);
      else return sum(a, b);
    }
    if (b.size() > 2 && !are_connected({b[0]}, {b.back()})) {
      if (are_connected({a[0]}, {b[0]})) return sum(rev(a), b);
      else return sum(b, a);
    }

    auto [x, y] = Find(a, b);
    if (x < 0) return b;
    vector<int> ans;
    for(int j = x + 1; j < a.size(); j++) ans.push_back(a[j]);
    for(int j = 0; j <= x; j++) ans.push_back(a[j]);
    for(int j = y; j < b.size(); j++) ans.push_back(b[j]);
    for(int j = 0; j < y; j++) ans.push_back(b[j]);
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::pair<int, int> Find(std::vector<int>, std::vector<int>)':
longesttrip.cpp:12:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   12 |     int mid = l + r >> 1;
      |               ~~^~~
longesttrip.cpp:22:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |     int mid = l + r >> 1;
      |               ~~^~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:120:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for(int j = x + 1; j < a.size(); j++) ans.push_back(a[j]);
      |                        ~~^~~~~~~~~~
longesttrip.cpp:122:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int j = y; j < b.size(); j++) ans.push_back(b[j]);
      |                    ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 604 KB Output is correct
11 Correct 5 ms 440 KB Output is correct
12 Correct 5 ms 444 KB Output is correct
13 Correct 5 ms 696 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 6 ms 444 KB Output is correct
21 Correct 6 ms 1116 KB Output is correct
22 Correct 5 ms 452 KB Output is correct
23 Correct 5 ms 444 KB Output is correct
24 Correct 6 ms 960 KB Output is correct
25 Correct 8 ms 344 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 5 ms 436 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 5 ms 600 KB Output is correct
34 Correct 5 ms 596 KB Output is correct
35 Correct 6 ms 344 KB Output is correct
36 Correct 5 ms 344 KB Output is correct
37 Correct 5 ms 444 KB Output is correct
38 Correct 5 ms 436 KB Output is correct
39 Correct 5 ms 344 KB Output is correct
40 Correct 7 ms 596 KB Output is correct
41 Correct 6 ms 344 KB Output is correct
42 Correct 7 ms 600 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 7 ms 600 KB Output is correct
45 Correct 14 ms 344 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 9 ms 596 KB Output is correct
48 Correct 9 ms 344 KB Output is correct
49 Correct 14 ms 344 KB Output is correct
50 Correct 6 ms 432 KB Output is correct
51 Correct 8 ms 436 KB Output is correct
52 Correct 8 ms 440 KB Output is correct
53 Correct 5 ms 856 KB Output is correct
54 Correct 6 ms 440 KB Output is correct
55 Correct 6 ms 440 KB Output is correct
56 Correct 5 ms 696 KB Output is correct
57 Correct 6 ms 692 KB Output is correct
58 Correct 8 ms 700 KB Output is correct
59 Correct 8 ms 604 KB Output is correct
60 Correct 7 ms 700 KB Output is correct
61 Correct 6 ms 856 KB Output is correct
62 Correct 8 ms 688 KB Output is correct
63 Correct 8 ms 608 KB Output is correct
64 Correct 7 ms 604 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 13 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 5 ms 436 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 7 ms 596 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 600 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 5 ms 436 KB Output is correct
20 Correct 7 ms 700 KB Output is correct
21 Correct 10 ms 504 KB Output is correct
22 Correct 6 ms 344 KB Output is correct
23 Correct 8 ms 596 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 4 ms 436 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 6 ms 600 KB Output is correct
30 Correct 6 ms 600 KB Output is correct
31 Correct 6 ms 544 KB Output is correct
32 Correct 13 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 9 ms 344 KB Output is correct
35 Correct 10 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 5 ms 692 KB Output is correct
38 Correct 7 ms 436 KB Output is correct
39 Correct 7 ms 432 KB Output is correct
40 Correct 5 ms 440 KB Output is correct
41 Correct 5 ms 600 KB Output is correct
42 Correct 6 ms 600 KB Output is correct
43 Correct 6 ms 756 KB Output is correct
44 Correct 6 ms 608 KB Output is correct
45 Correct 6 ms 868 KB Output is correct
46 Correct 8 ms 600 KB Output is correct
47 Correct 6 ms 600 KB Output is correct
48 Correct 6 ms 756 KB Output is correct
49 Correct 5 ms 604 KB Output is correct
50 Correct 5 ms 600 KB Output is correct
51 Correct 6 ms 344 KB Output is correct
52 Correct 7 ms 344 KB Output is correct
53 Correct 6 ms 344 KB Output is correct
54 Correct 7 ms 344 KB Output is correct
55 Correct 6 ms 600 KB Output is correct
56 Correct 5 ms 604 KB Output is correct
57 Correct 6 ms 612 KB Output is correct
58 Correct 7 ms 600 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 6 ms 344 KB Output is correct
62 Correct 5 ms 600 KB Output is correct
63 Correct 6 ms 608 KB Output is correct
64 Correct 6 ms 860 KB Output is correct
65 Correct 7 ms 440 KB Output is correct
66 Correct 9 ms 608 KB Output is correct
67 Correct 9 ms 696 KB Output is correct
68 Correct 6 ms 848 KB Output is correct
69 Correct 7 ms 444 KB Output is correct
70 Correct 7 ms 444 KB Output is correct
71 Correct 5 ms 696 KB Output is correct
72 Correct 6 ms 444 KB Output is correct
73 Correct 8 ms 700 KB Output is correct
74 Correct 6 ms 612 KB Output is correct
75 Correct 7 ms 684 KB Output is correct
76 Correct 10 ms 604 KB Output is correct
77 Correct 6 ms 956 KB Output is correct
78 Correct 7 ms 696 KB Output is correct
79 Correct 7 ms 604 KB Output is correct
80 Correct 9 ms 852 KB Output is correct
81 Correct 7 ms 600 KB Output is correct
82 Correct 7 ms 600 KB Output is correct