oj.uz

답안 #1065275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1065275 2024-08-19T05:41:25 Z deera 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 7 ms 596 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
 
vector<int> solve_d3(int N, int D) {
    vector<int> res(N);
    iota(res.begin(), res.end(), 0);
    return res;
}
 
vector<int> solve_d2(int N, int D) {
    queue<int> stops;
    for (int i = 1; i < N; i++) stops.push(i);
 
    deque<int> trip = {0};
    while (stops.size() > 1) {
        int next = stops.front(); stops.pop();
        int last = trip.back();
        
        if (are_connected({next}, {last})) {
            trip.push_back(next);
        } else {
            trip.push_back(stops.front()); stops.pop();
            trip.push_back(next);
        }
    }
 
    if (stops.size() == 1) {
        int next = stops.front();
        int last = trip.back();
        if (are_connected({next}, {last})) {
            trip.push_back(next);
        } else {
            trip.push_front(stops.front()); stops.pop();
        }
    }
 
    vector<int> res;
    for (int x : trip) res.push_back(x);
    return res;
}
 
vector<int> longest_trip(int N, int D) {
    if (D == 3) return solve_d3(N, D);
    if (D == 2) return solve_d2(N, D);
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:46:1: warning: control reaches end of non-void function [-Wreturn-type]
   46 | }
      | ^

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.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 7 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 5 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 7 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 7 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 4 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Incorrect 0 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -

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 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
6 Correct 4 ms 340 KB Output is correct
7 Correct 6 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 6 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 Incorrect 0 ms 344 KB Incorrect
15 Halted 0 ms 0 KB -