oj.uz

답안 #1022826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022826 2024-07-14T05:55:36 Z thinknoexit 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 9 ms 436 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
using ll = long long;
int n;
vector<int> longest_trip(int N, int D) {
    n = N;
    vector<int> p1, p2;
    p1.push_back(0);
    int st = 0;
    for (int i = 1;i < n;i++) {
        if (p2.empty()) {
            if (are_connected({ p1.back() }, { i })) p1.push_back(i);
            else p2.push_back(i), st = 0;
        }
        else {
            if (st == 0) {
                if (!are_connected({ p1.back(), i }, { p2.back() })) p1.push_back(i);
                else p2.push_back(i), st = 1;
            }
            else if (st == 1) {
                if (are_connected({ p2.back() }, { i })) p2.push_back(i);
                else {
                    if (are_connected({ p1.back() }, { i })) {
                        p1.push_back(i), st = 0;
                        reverse(p2.begin(), p2.end());
                    }
                    else {
                        reverse(p2.begin(), p2.end());
                        for (auto& x : p2) p1.push_back(x);
                        p1.push_back(i);
                        p2.clear();
                    }
                }
            }
        }
    }
    if (p1.size() > p2.size()) swap(p1, p2);
    if ((int)p2.size() == n) return p2;
    int l = 0, r = p1.size();
    while (l < r) {
        int mid = (l + r) / 2;
        vector<int> t;
        for (int j = 0;j <= mid;j++) t.push_back(p1[j]);
        if (are_connected(t, p2)) r = mid;
        else l = mid + 1;
    }
    if (l == (int)p1.size()) return p2;
    if (are_connected({ p1.back() }, p2)) {
        reverse(p1.begin(), p1.end());
    }
    else {
        vector<int> p3;
        for (int i = 0;i < (int)p1.size();i++) {
            p3.push_back(p1[(i + l) % ((int)p1.size())]);
        }
        swap(p1, p3);
    }
    l = 0, r = p2.size() - 2;
    while (l < r) {
        int mid = (l + r) / 2;
        vector<int> t;
        for (int j = 0;j <= mid;j++) t.push_back(p2[j]);
        if (are_connected(t, { p1.front() })) r = mid;
        else l = mid + 1;
    }
    if (are_connected({ p1.front() }, { p2.back() })) {
        vector<int> ans;
        for (auto& x : p2) ans.push_back(x);
        for (auto& x : p1) ans.push_back(x);
        return ans;
    }
    else {
        vector<int> p3;
        for (int i = 0;i < (int)p2.size();i++) {
            p3.push_back(p2[(i + l) % ((int)p2.size())]);
        }
        swap(p2, p3);
    }
    reverse(p2.begin(), p2.end());
    vector<int> ans;
    for (auto& x : p2) ans.push_back(x);
    for (auto& x : p1) ans.push_back(x);
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 348 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 6 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct

Subtask #3
0.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 6 ms 356 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 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 340 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 436 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Incorrect 2 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -