답안 #881308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
881308 2023-12-01T05:12:16 Z irmuun 가장 긴 여행 (IOI23_longesttrip) C++17
40 / 100
9 ms 852 KB
#include<bits/stdc++.h>
#include "longesttrip.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
 
vector<int>longest_trip(int N, int D){
    vector<int>ans;
    if(D==3){
        vector<int>ans(N);
        iota(all(ans),0);
        return ans;
    }
    if(D==2){
        vector<int>ans;
        ans.pb(0);
        int l=0,r=0;
        int x;
        for(int i=1;i<N;i++){
            if(are_connected({0},{i})==true){
                ans.pb(i);
                x=i;
                r=i;
                break;
            }
        }
        for(int i=1;i<N;i++){
            if(i!=x){
                if(are_connected({l},{i})){
                    ans.insert(ans.begin(),i);
                    l=i;
                }
                else{
                    ans.pb(i);
                    r=i;
                }
            }
        }
        return ans;
    }
    vector<int>v,u;
    int l0=0,r0=0,l1=1,r1=1;
    v.pb(0);
    u.pb(1);
    for(int i=2;i<N;i++){
        if(are_connected({v.back()},{i})==true){
            v.pb(i);
        }
        else if(are_connected({u.back()},{i})==true){
            u.pb(i);
        }
        else{
            reverse(all(u));
            v.insert(v.end(),all(u));
            u={i};
        }
    }
    if(v.size()>=u.size()){
        return v;
    }
    return u;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:23:17: warning: variable 'r' set but not used [-Wunused-but-set-variable]
   23 |         int l=0,r=0;
      |                 ^
longesttrip.cpp:48:9: warning: unused variable 'l0' [-Wunused-variable]
   48 |     int l0=0,r0=0,l1=1,r1=1;
      |         ^~
longesttrip.cpp:48:14: warning: unused variable 'r0' [-Wunused-variable]
   48 |     int l0=0,r0=0,l1=1,r1=1;
      |              ^~
longesttrip.cpp:48:19: warning: unused variable 'l1' [-Wunused-variable]
   48 |     int l0=0,r0=0,l1=1,r1=1;
      |                   ^~
longesttrip.cpp:48:24: warning: unused variable 'r1' [-Wunused-variable]
   48 |     int l0=0,r0=0,l1=1,r1=1;
      |                        ^~
longesttrip.cpp:34:13: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |             if(i!=x){
      |             ^~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 6 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 5 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 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 600 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 4 ms 540 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 6 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 440 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 5 ms 344 KB Output is correct
28 Correct 5 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 5 ms 344 KB Output is correct
34 Correct 5 ms 344 KB Output is correct
35 Correct 5 ms 344 KB Output is correct
36 Correct 5 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 6 ms 344 KB Output is correct
39 Correct 7 ms 440 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 8 ms 600 KB Output is correct
42 Correct 7 ms 436 KB Output is correct
43 Correct 7 ms 600 KB Output is correct
44 Correct 8 ms 600 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 5 ms 344 KB Output is correct
48 Correct 5 ms 344 KB Output is correct
49 Correct 5 ms 344 KB Output is correct
50 Correct 4 ms 344 KB Output is correct
51 Correct 7 ms 344 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 4 ms 344 KB Output is correct
54 Correct 5 ms 344 KB Output is correct
55 Correct 6 ms 344 KB Output is correct
56 Correct 4 ms 344 KB Output is correct
57 Correct 5 ms 344 KB Output is correct
58 Correct 6 ms 600 KB Output is correct
59 Correct 6 ms 344 KB Output is correct
60 Correct 6 ms 344 KB Output is correct
61 Correct 9 ms 852 KB Output is correct
62 Correct 6 ms 344 KB Output is correct
63 Correct 7 ms 608 KB Output is correct
64 Correct 7 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -