oj.uz

답안 #1070865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070865 2024-08-22T20:09:38 Z zsombor 가장 긴 여행 (IOI23_longesttrip) C++17
85 / 100
 19 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;
vector<int> b;

void pf(vector<int> &v, int x) {
    v.push_back(0);
    for (int i = v.size() - 1; i > 0; i--) v[i] = v[i - 1];
    v[0] = x;
}

void pb(vector<int> &v, int x) {
    v.push_back(x);
}

bool query(vector<int> x, int l, int r, vector<int> &v) {
    vector<int> u;
    for (int i = l; i < r; i++) u.push_back(v[i]);
    return are_connected({x}, u);
}

int bin(vector<int> x, vector<int> &v) {
    int l = 0, r = v.size(), m;
    if (!query(x, l, r, v)) return -1;
    while (r - l > 1) {
        m = (l + r) / 2;
        (query(x, l, m, v) ? r = m : l = m);
    }
    return l;
}

bool try_add(int x, vector<int> &v) {
    if (!v.size()) {
        pb(v, x);
        return true;
    }
    if (v.size() == 1) {
        if (are_connected({v[0]}, {x})) {
            pb(v, x);
            return true;
        }
        return false;
    }
    int y = v[0], z = v.back();
    if (are_connected({y}, {x})) {
        reverse(v.begin(), v.end());
        pb(v, x);
        return true;
    }
    if (are_connected({z}, {x})) {
        pb(v, x);
        return true;
    }
    int k = bin({x}, v);
    if (k == -1) return false;
    vector<int> u;
    for (int i = k + 1; i < v.size(); i++) pb(u, v[i]);
    for (int i = 0; i <= k; i++) pb(u, v[i]);
    v = u;
    v.push_back(x);
    return true;
}

void solve() {
    for (int i = 2; i < n - 1; i += 2) {
        int x = i, y = i + 1;
        bool A = are_connected({x}, {a.back()});
        bool B = are_connected({x}, {b.back()});
        if (are_connected({x}, {y})) {
            if (A) {
                a.push_back(x);
                a.push_back(y);
            }
            if (!A && B) {
                b.push_back(x);
                b.push_back(y);
            }
            if (!A && !B) {
                while (b.size()) {
                    a.push_back(b.back());
                    b.pop_back();
                }
                b.push_back(x);
                b.push_back(y);
            }
        } else {
            if (A == B) {
                if (!A) swap(x, y);
                a.push_back(x);
                while (b.size()) {
                    a.push_back(b.back());
                    b.pop_back();
                }
                b.push_back(y);
            } else {
                if (!A) swap(x, y);
                a.push_back(x);
                b.push_back(y);
            }
        }
    }
    if (n % 2) {
        if (are_connected({a.back()}, {b.back()})) {
            while (b.size()) {
                a.push_back(b.back());
                b.pop_back();
            }
        }
        if (are_connected({n - 1}, {a.back()})) a.push_back(n - 1);
        else b.push_back(n - 1);
    }
}

vector<int> longest_trip(int N, int D) {
    n = N;
    a = {0};
    b = {1};
    solve();
    if (a.size() < b.size()) swap(a, b);
    if (!b.size()) return a;

    for (int i = 0; i < 2; i++) {
        if (try_add(a.back(), b)) {
            b.pop_back();
            while (b.size()) {
                a.push_back(b.back());
                b.pop_back();
            }
            return a;
        }
        swap(a, b);
    }

    if (!are_connected(a, b)) return a;
    int y = bin(b, a);
    int z = bin({a[y]}, b);

    vector<int> u;
    for (int i = y + 1; i < a.size(); i++) pb(u, a[i]);
    for (int i = 0; i <= y; i++) pb(u, a[i]);
    for (int i = z; i < b.size(); i++) pb(u, b[i]);
    for (int i = 0; i < z; i++) pb(u, b[i]);
    return u;
}

Compilation message

longesttrip.cpp: In function 'bool try_add(int, std::vector<int>&)':
longesttrip.cpp:60:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (int i = k + 1; i < v.size(); i++) pb(u, v[i]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:142:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = y + 1; i < a.size(); i++) pb(u, a[i]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp:144:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |     for (int i = z; i < b.size(); i++) pb(u, b[i]);
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 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 8 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 7 ms 428 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 19 ms 344 KB Output is correct
15 Correct 15 ms 344 KB Output is correct
16 Correct 11 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 9 ms 344 KB Output is correct
22 Correct 10 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 16 ms 344 KB Output is correct
27 Correct 16 ms 344 KB Output is correct
28 Correct 10 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 11 ms 344 KB Output is correct
31 Correct 8 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 6 ms 344 KB Output is correct
34 Correct 11 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 8 ms 344 KB Output is correct
40 Correct 8 ms 440 KB Output is correct
41 Correct 8 ms 344 KB Output is correct
42 Correct 8 ms 344 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 9 ms 340 KB Output is correct
46 Correct 10 ms 344 KB Output is correct
47 Correct 10 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 8 ms 344 KB Output is correct
51 Correct 9 ms 344 KB Output is correct
52 Correct 9 ms 344 KB Output is correct
53 Correct 8 ms 344 KB Output is correct
54 Correct 9 ms 344 KB Output is correct
55 Correct 8 ms 344 KB Output is correct
56 Correct 7 ms 344 KB Output is correct
57 Correct 8 ms 440 KB Output is correct
58 Correct 8 ms 412 KB Output is correct
59 Correct 9 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 12 ms 432 KB Output is correct
62 Correct 8 ms 344 KB Output is correct
63 Correct 6 ms 344 KB Output is correct
64 Correct 7 ms 344 KB Output is correct

Subtask #4
45.0 / 60.0

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