oj.uz

답안 #850145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850145 2023-09-15T21:24:19 Z Rifal 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 6 ms 600 KB 
#include "longesttrip.h"
using namespace std;
#include<bits/stdc++.h>
std::vector<int> longest_trip(int N, int D)
{
    vector<int> ans;
    if(D == 3) {
    for(int i = 0; i < N; i++) {
        ans.push_back(i);
    }
    }
    else if(D == 2) {
        set<int> st;
        deque<int> dq;
        for(int i = 1; i < N; i++) st.insert(i);
        dq.push_back(0);
        if(are_connected({dq.back()}, {1}) == true) {
            dq.push_back(1); st.erase(1);
        }
        else {
            dq.push_back(2); st.erase(2);
        }
        for(auto i : st) {
            if(are_connected({dq.back()}, {i}) == true) {
                dq.push_back(i);
            }
            else {
                dq.push_front(i);
            }
        }
        for(int i = 0; i < dq.size(); i++) {
            ans.push_back(dq[i]);
        }


    }
    else {

    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:31:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for(int i = 0; i < dq.size(); i++) {
      |                        ~~^~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 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 -