oj.uz

답안 #839922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839922 2023-08-30T21:08:50 Z emeraldblock 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 16 ms 300 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

using namespace std;

std::vector<int> longest_trip(int N, int D)
{
    vector<int> s1({0}),s2({1});
    for (int i = 2; i < N; ++i) {
        if (are_connected({s1.back()}, {i})) {
            s1.push_back(i);
        } else if (are_connected({s2.back()}, {i})) {
            s2.push_back(i);
        } else {
            while (!s2.empty()) {
                s1.push_back(s2.back());
                s2.pop_back();
            }
            s2.push_back(i);
        }
    }
    if (!are_connected(s1, s2)) {
        return (s1.size() >= s2.size() ? s1 : s2);
    }
    if (are_connected(s1,{s2.front()})) {
            reverse(s2.begin(),s2.end());
    } else {
        int lo = 0, hi = s2.size();
        while (hi-lo>1) {
            int mid = (lo+hi)/2;
            vector<int> v;
            for (int i = lo; i < mid; ++i) {
                v.push_back(s2[i]);
            }
            if (are_connected(s1, v)) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(s2.begin(),s2.begin()+hi,s2.end());
    }
    if (are_connected({s1.front()},{s2.back()})) {
        reverse(s1.begin(),s1.end());
    } else {
        int lo = 0, hi = s1.size();
        while (hi-lo>1) {
            int mid = (lo+hi)/2;
            vector<int> v;
            for (int i = lo; i < mid; ++i) {
                v.push_back(s1[i]);
            }
            if (are_connected(v, {s2.back()})) {
                hi = mid;
            } else {
                lo = mid;
            }
        }
        rotate(s1.begin(),s1.begin()+hi,s1.end());
    }
    while (!s2.empty()) {
        s1.push_back(s2.back());
        s2.pop_back();
    }
    return s1;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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