제출 #842571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
842571		irmuun	가장 긴 여행 (IOI23_longesttrip)	C++17	15 / 100	6 ms	600 KiB

longesttrip

#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);
    for(int i=1;i<N;i++){
        if(are_connected({i-1},{i})==true){
            v.pb(i);
        }
        else{
            l1=i;
            r1=i;
            u.pb(i);
            break;
        }
    }
    for(int i=l1+1;i<N;i++){
        if(are_connected({l0,r0},{i})==false){
            if(are_connected({l0},{i})==true){
                l0=i;
                v.insert(v.begin(),i);
            }
            else{
                v.pb(i);
                r0=i;
            }
        }
        else{
            if(are_connected({r0},{r1})==true){
                reverse(all(u));
                v.insert(v.end(),all(u));
                u.clear();
                u.pb(i);
                r0=v.back();
                l1=i;
                r1=i;
            }
            else{
                r1=i;
                u.pb(i);
            }
        }
    }
    if(v.size()>=u.size()){
        return v;
    }
    return u;
}

컴파일 시 표준 에러 (stderr) 메시지

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:34:13: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |             if(i!=x){
      |             ^~

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60