oj.uz

답안 #979937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979937 2024-05-11T16:47:04 Z vjudge1 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 6 ms 600 KB 
#include "longesttrip.h"
using namespace std;
#define pb push_back
vector<int> longest_trip(int N, int D)
{
    vector<int> ans;
    vector<int> v1 (1);
    vector<int> v2(1);
    if(N==3){
        v1={0};
        v2={1};
        if(are_connected(v1,v2)){
            v1={1};
            v2={2};
            if(are_connected(v1,v2)){
                ans={0,1,2};
                return ans;
            }
            else{
                ans={1,0,2};
                return ans;
            }
        }
        else{
            ans={0,2,1};
            return ans;
        }
    }
    ans.pb(0);
    int last=0;
    for(int i=1; i<N-1; ++i){
        v1={last};
        v2={i};
        if(are_connected(v1,v2)){
            ans.pb(i);
            last=i;
        }
        else{
            i++;
            ans.pb(i);
            ans.pb(i-1);
            last=i;
        }
    }
    if(ans.size()!=N){
        int a=ans[ans.size()-1];
        ans.pop_back();
        int b=ans[ans.size()-1];
        ans.pop_back();
        ans.pb(N-1);
        ans.pb(b);
        ans.pb(a);
    }
    return ans;

}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:45:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |     if(ans.size()!=N){
      |        ~~~~~~~~~~^~~

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 5 ms 344 KB Output is correct
2 Correct 4 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

Subtask #2
0.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 4 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Incorrect 1 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 500 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Incorrect 1 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

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