제출 #1154353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1154353		modwwe	가장 긴 여행 (IOI23_longesttrip)	C++20	100 / 100	6 ms	440 KiB

longesttrip

//#include "gap.h"
//#include "mushrooms.h"
#include "longesttrip.h"
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int t;
int el = 19;/*
main()
{
    if(fopen(task2".inp","r"))
    {
        fin(task2);
        fou(task2);
    }
    if(fopen(task".inp","r"))
    {
      //  fin(task);
     //   fou(task);
    }
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    /// cin>>s1;
//int t;cin>>t; while(t--)
    phongbeo();
    // checktime
}*/
vector<int> v,v2;
vector<int> cvc(vector<int>&v,int l,int r)
{
    vector<int> haha(v.begin()+l,v.begin()+r+1);
    return haha;
}/*
bool are_connected(vector<int> a,vector<int> b)
{
    for(auto x:a)
        cout<<x<<" ";
    cout<<"\n";
        for(auto x:b)
            cout<<x<<" ";
    cout<<endl;
    cin>>s9;
    return s9;
}*/
vector<int> longest_trip(int N,int D)
{
    n=N;
    m=D;
    v.clear();
    v2.clear();
    v.pb(0);
    v2.pb(1);
    bool de=0;
    for(int i=2; i<n; i++)
    {
        if(are_connected({v.back()}, {i}))
        {
            v.pb(i),de=0;
        }
        else if(de||are_connected({v2.back()}, {i}))
        {
            v2.pb(i);
            de=1;
        }
        else
        {
            reverse(v2.begin(),v2.end());
            for(auto x:v2)v.pb(x);
            v2.clear();
            v2.pb(i);
            de=0;
        }
    }
    if(are_connected(v,v2))
    {
        l=1;
        r=v.size()-1;
        while(l<=r)
        {
            int mid=l+r>>1;
            vector<int> haha=cvc(v,mid,v.size()-1);
            if(are_connected(v2,haha))l=mid+1;
            else r=mid-1;
        }
        s2=l-1;
        l=1;
        r=v2.size()-1;
        while(l<=r)
        {
            int mid=l+r>>1;
            vector<int> haha=cvc(v2,mid,v2.size()-1);
            if(are_connected({v[s2]},haha))l=mid+1;
            else r=mid-1;
        }
        s3=l-1;
        if(are_connected({v[0]}, {v2[0]}))
        {
            reverse(v.begin(),v.end());
            for(auto x:v2)v.pb(x);
            return v;
        }
        if(are_connected({v[0]}, {v2.back()}))
        {
            reverse(v.begin(),v.end());
            reverse(v2.begin(),v2.end());
            for(auto x:v2)v.pb(x);
            return v;
        }
        if(are_connected({v.back()}, {v2.back()}))
        {
            ///reverse(v.begin(),v.end());
            reverse(v2.begin(),v2.end());
            for(auto x:v2)v.pb(x);
            return v;
        }
        if(are_connected({v.back()}, {v2[0]}))
        {
            ///reverse(v.begin(),v.end());
            ///  reverse(v2.begin(),v2.end());
            for(auto x:v2)v.pb(x);
            return v;
        }
        if(are_connected({v[s2]}, {v2[0]}))
        {
            vector<int> ans;
            for(int i=s2+1; i<v.size(); i++)ans.pb(v[i]);
            for(int i=0; i<=s2; i++)ans.pb(v[i]);
            for(auto x:v2)ans.pb(x);
            return ans;
        }
        if(are_connected({v[0]}, {v2[s3]}))
        {
            reverse(v.begin(),v.end());
            for(int i=s3; i<v2.size(); i++)v.pb(v2[i]);
            for(int i=0; i<s3; i++)v.pb(v2[i]);
            return v;
        }
        vector<int> ans;
        for(int i=s2+1; i<v.size(); i++)ans.pb(v[i]);
        for(int i=0; i<=s2; i++)ans.pb(v[i]);
        for(int i=s3; i<v2.size(); i++)ans.pb(v2[i]);
        for(int i=0; i<s3; i++)ans.pb(v2[i]);
        return ans;
    }
    else
    {
        if(v.size()>v2.size()) return v;
        return v2;
    }
}/*
void phongbeo()
{

  vector<int>kiki=longest_trip(4,1);
  debug
  for(auto x:kiki)
    cout<<x<<" ";
}
*/

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

longesttrip.cpp:27:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+16' to '2147483647' [-Woverflow]
   27 | const int inf = 1e16;
      |                 ^~~~

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