oj.uz

답안 #988602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988602 2024-05-25T09:17:56 Z Gray 가장 긴 여행 (IOI23_longesttrip) C++17
5 / 100
 858 ms 2372 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
#include <cassert>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define ln endl
vector<vector<ll>> A;
ll n, d;
std::vector<int> longest_trip(int N, int D)
{
    n=N; d=D;
    A.clear();
    A.resize(N);
    for (ll i=0; i<n; i++){
        for (ll j=i+1; j<n; j++){
            if (are_connected({(int)i}, {(int)j})){
                A[i].push_back(j);
                A[j].push_back(i);
            }
        }
    }
    vector<ll> semi;
    for (ll i=0; i<n; i++){
        if (A[i].size()<n-1){
            semi.push_back(i);
        }
    }
    assert(semi.size()==0 or semi.size()==2);
    vector<int> ans;
    if (semi.size()==0){
        for (ll i=0; i<n; i++) ans.push_back(i);
    }else{
        ans.push_back(semi[0]);
        for (ll i=0; i<n; i++){
            if (i!=semi[0] and i!=semi[1]){
                ans.push_back(i);
            }
        }
        ans.push_back(semi[1]);
    }
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:26:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   26 |         if (A[i].size()<n-1){
      |             ~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 20 ms 600 KB Output is correct
3 Correct 108 ms 864 KB Output is correct
4 Correct 352 ms 1360 KB Output is correct
5 Correct 701 ms 2084 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Correct 107 ms 620 KB Output is correct
4 Correct 330 ms 1360 KB Output is correct
5 Correct 727 ms 2248 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Runtime error 1 ms 600 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 600 KB Output is correct
3 Correct 129 ms 968 KB Output is correct
4 Correct 365 ms 1112 KB Output is correct
5 Correct 732 ms 1980 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Runtime error 1 ms 600 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 20 ms 344 KB Output is correct
3 Partially correct 116 ms 856 KB Output is partially correct
4 Partially correct 338 ms 1368 KB Output is partially correct
5 Partially correct 858 ms 2372 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Runtime error 1 ms 600 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -