oj.uz

답안 #1067611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067611 2024-08-20T21:29:19 Z golf 가장 긴 여행 (IOI23_longesttrip) C++17
30 / 100
 12 ms 600 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

int pop(queue<int> &q) {
    int x = q.front();
    q.pop();
    return x;
}

const bool maybe = true;

vector<int> longest_trip(int N, int D) {
    queue<int> nodes;
    for (int i = 0; i < N; i++) nodes.push(i);

    vector<int> a, b;
    a.push_back(pop(nodes));

    bool ends_connected = maybe;
    // false = a and b are not connected
    // true  = a and b are maybe connected
    while (!nodes.empty()) {
        if (b.empty()) {
            int n = pop(nodes);
            if (are_connected({a.back()}, {n})) {
                a.push_back(n);
            } else {
                // missed optimization
                // we could cache that a and b are not connected
                b.push_back(n);
                ends_connected = false;
            }
            continue;
        }

        // both a and b are non-empty
        int n = pop(nodes);

        if (are_connected({a.back()}, {n})) {
            a.push_back(n);
            ends_connected = maybe;
        } else if (are_connected({b.back()}, {n})) {
            b.push_back(n);
            ends_connected = false;
        } else {
            // ends of a and b are definitely connected
            while(!b.empty()) {
                a.push_back(b.back());
                b.pop_back();
            }

            assert(b.empty());
            b.push_back(n);
        }
    }

    if (b.empty()) {
        return a;
    }

    if (ends_connected == maybe && are_connected({a.back()}, {b.back()})) {
        while(!b.empty()) {
            a.push_back(b.back());
            b.pop_back();
        }

        return a;
    }

    if (!are_connected(a, b)) {
        if (a.size() > b.size()) {
            return a;
        } else {
            return b;
        }
    }

    // not finished
    if (a.size() > b.size()) {
        return a;
    } else {
        return b;
    }
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 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 5 ms 344 KB Output is correct

Subtask #2
0.0 / 10.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 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 5 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -