oj.uz

답안 #1058733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058733 2024-08-14T13:04:50 Z hasan2006 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 7 ms 600 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , dp[N] , c[N] , d[N];


vector<int> longest_trip(int n , int k) {
    ll  i , j , l ,r , m , s , f , x , y;
    deque<int>v;
    if(are_connected({0} , {1}) and are_connected({0} , {2}))
        v.pb(1) , v.pb(0) , v.pb(2);
    else if(are_connected({1} , {0}) and are_connected({1} , {2}))
        v.pb(0) , v.pb(1) , v.pb(2);
    else
        v.pb(1) , v.pb(2) , v.pb(0);
    for(i = 3; i < n; i++) {
        if(are_connected({i} , {v.front()}))
            v.push_front(i);
        else
            v.pb(i);
    }
    vector<int>vc;
    for(auto to : v)
        vc.pb(to);
    return vc;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:35:27: warning: narrowing conversion of 'i' from 'long long int' to 'int' [-Wnarrowing]
   35 |         if(are_connected({i} , {v.front()}))
      |                           ^
longesttrip.cpp:35:27: warning: narrowing conversion of 'i' from 'long long int' to 'int' [-Wnarrowing]
longesttrip.cpp:26:13: warning: unused variable 'j' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |             ^
longesttrip.cpp:26:17: warning: unused variable 'l' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                 ^
longesttrip.cpp:26:20: warning: unused variable 'r' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                    ^
longesttrip.cpp:26:24: warning: unused variable 'm' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                        ^
longesttrip.cpp:26:28: warning: unused variable 's' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                            ^
longesttrip.cpp:26:32: warning: unused variable 'f' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                                ^
longesttrip.cpp:26:36: warning: unused variable 'x' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                                    ^
longesttrip.cpp:26:40: warning: unused variable 'y' [-Wunused-variable]
   26 |     ll  i , j , l ,r , m , s , f , x , y;
      |                                        ^

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 4 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 6 ms 344 KB Output is correct
5 Correct 5 ms 600 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 4 ms 344 KB Output is correct
4 Correct 4 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 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 4 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 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

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