oj.uz

답안 #1070914

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

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

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);
    }
}

bool try_add(vector<int> &v, vector<int> &u) {
    bool A = are_connected({v.back()}, {u[0]});
    bool B = are_connected({v.back()}, {u.back()});
    if (!A && !B) return false;
    if (A) reverse(u.begin(), u.end());
    while (u.size()) {
        v.push_back(u.back());
        u.pop_back();
    }
    return true;
}

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;
    while (r - l > 1) {
        m = (l + r) / 2;
        (query(x, l, m, v) ? r = m : l = m);
    }
    return l;
}

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

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

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:101:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for (int i = x + 1; i < a.size(); i++) u.push_back(a[i]);
      |                         ~~^~~~~~~~~~
longesttrip.cpp:103:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for (int i = y; i < b.size(); i++) u.push_back(b[i]);
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

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 8 ms 340 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 5 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 11 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 10 ms 344 KB Output is correct
13 Correct 9 ms 600 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 11 ms 344 KB Output is correct
20 Correct 8 ms 600 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 11 ms 344 KB Output is correct
23 Correct 8 ms 432 KB Output is correct
24 Correct 10 ms 344 KB Output is correct
25 Correct 4 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 8 ms 344 KB Output is correct
31 Correct 11 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 10 ms 344 KB Output is correct
35 Correct 7 ms 344 KB Output is correct
36 Correct 7 ms 344 KB Output is correct
37 Correct 9 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 9 ms 344 KB Output is correct
41 Correct 11 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 9 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 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 10 ms 344 KB Output is correct
51 Correct 10 ms 344 KB Output is correct
52 Correct 5 ms 344 KB Output is correct
53 Correct 7 ms 344 KB Output is correct
54 Correct 7 ms 344 KB Output is correct
55 Correct 8 ms 344 KB Output is correct
56 Correct 8 ms 344 KB Output is correct
57 Correct 8 ms 344 KB Output is correct
58 Correct 10 ms 344 KB Output is correct
59 Correct 8 ms 344 KB Output is correct
60 Correct 9 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 Correct 7 ms 344 KB Output is correct
64 Correct 5 ms 344 KB Output is correct

Subtask #4
0.0 / 60.0

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