oj.uz

답안 #993196

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
993196 2024-06-05T12:34:14 Z stdfloat 가장 긴 여행 (IOI23_longesttrip) C++17
0 / 100
 5 ms 440 KB 
#include "bits/stdc++.h"
#include "longesttrip.h"
using namespace std;

vector<int> longest_trip(int n, int D) {
    vector<int> v = {0};
    vector<bool> vis(n);
    while ((int)v.size() <= (n >> 1)) {
        bool tr = false;
        for (int i = 1; i < n && !tr; i++) {
            if (!vis[i] && are_connected({v.back()}, {i})) {
                v.push_back(i);
                tr = vis[i] = true;
            }
        }

        if (!tr) v.pop_back();
    }

    return v;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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