oj.uz

답안 #1069001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069001 2024-08-21T14:15:08 Z Malix 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 19 ms 596 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int solve(int bk,int p,int n){
    vi a,b,x;
    x.PB(bk);
    REP(i,p,n){
        a.clear();
        a.PB(x.back());
        b.clear();
        b.PB(i);
        if(are_connected(a,b))x.PB(i);
        else return i;
    }
    return n;
}

pi BS(int l,int r,int x,int y,vi &arr,vi &brr){
    if(l==r&&x==y)return {l,x};
    int m=(l+r)/2;
    int z=(x+y)/2;
    vi a,b;
    REP(i,l,m+1)a.PB(arr[i]);
    REP(i,x,y+1)b.PB(brr[i]);
    if(are_connected(a,b))r=m;
    else l=m+1;
    a.clear();b.clear();
    REP(i,l,r+1)a.PB(arr[i]);
    REP(i,x,z+1)b.PB(brr[i]);
    if(are_connected(a,b))y=z;
    else x=z+1;
    return BS(l,r,x,y,arr,brr);
}

std::vector<int> longest_trip(int n, int d)
{
    if(d==3){
        vi ans;
        REP(i,0,n)ans.PB(i);
        return ans;
    }
    if(d==2){
        deque<int> dq;
        vi a,b;
        a.PB(0);b.PB(1);
        if(are_connected(a,b)){
            dq.PB(0);
            dq.PB(1);
            b.pop_back();b.PB(2);
            if(are_connected(a,b))dq.push_front(2);
            else dq.push_back(2);
        }
        else{
            dq.PB(0);
            dq.PB(2);
            dq.PB(1);
        }
        REP(i,3,n){
            a.clear();b.clear();
            a.PB(dq.back());b.PB(i);
            if(are_connected(a,b))dq.push_back(i);
            else dq.push_front(i);
        }
        vi ans;
        REP(i,0,n){
            ans.PB(dq.front());
            dq.pop_front();
        }
        return ans;
    }
    vi a,b,x,y;
    x.PB(0);
    int tm=solve(0,1,n);
    REP(i,1,tm)x.PB(i);
    if(tm!=n)y.PB(tm);
    if(y.empty())return x;
    int pos=tm+1;
    while(pos<n){
        a.clear();b.clear();
        a.PB(x.back());b.PB(pos);
        bool f1=are_connected(a,b);
        a.clear();b.clear();
        a.PB(y.back());b.PB(pos);
        bool f2=are_connected(a,b);
        if(f1&&f2){
            x.PB(pos);
            reverse(y.begin(),y.end());
            for(auto u:y)x.PB(u);
            y.clear();
            int tmp=solve(x.back(),pos+1,n);
            REP(i,pos+1,tmp)x.PB(i);
            if(tmp==n)return x;
            y.PB(tmp);
            pos=tmp+1;
        }
        else if(f1){
            x.PB(pos);
            pos++;
        }
        else if(f2){
            y.PB(pos);
            pos++;
        }
        else{
            reverse(y.begin(),y.end());
            for(auto u:y)x.PB(u);
            y.clear();
            int tmp=solve(x.back(),pos,n);
            REP(i,pos,tmp)x.PB(i);
            if(tmp==n)return x;
            y.PB(tmp);
            pos=tmp+1;
        }
    }
    if(x.size()==n)return x;
    a.clear();b.clear();
    a.PB(x.front());b.PB(y.front());
    if(are_connected(a,b)){
        reverse(x.begin(),x.end());
        for(auto u:y)x.PB(u);
        return x;
    }
    a.clear();b.clear();
    a.PB(x.front());b.PB(y.back());
    if(are_connected(a,b)){
        reverse(x.begin(),x.end());
        reverse(y.begin(),y.end());
        for(auto u:y)x.PB(u);
        return x;
    }
    a.clear();b.clear();
    a.PB(x.back());b.PB(y.front());
    if(are_connected(a,b)){
        for(auto u:y)x.PB(u);
        return x;
    }
    a.clear();b.clear();
    a.PB(x.back());b.PB(y.back());
    if(are_connected(a,b)){
        reverse(y.begin(),y.end());
        for(auto u:y)x.PB(u);
        return x;
    }
    if(!are_connected(x,y)){
        if(x.size()>=y.size())return x;
        else return y;
    }
    int s1=x.size(),s2=y.size();
    pi arr=BS(0,s1-1,0,s2-1,x,y);
    vi ans;
    REP(k,arr.F,s1)ans.PB(x[k]);
    REP(k,0,arr.F)ans.PB(x[k]);
    REP(k,arr.S,s2)ans.PB(y[k]);
    REP(k,0,arr.S)ans.PB(y[k]);
    return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:136:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  136 |     if(x.size()==n)return x;
      |        ~~~~~~~~^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 5 ms 428 KB Output is correct

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 19 ms 344 KB Output is correct
15 Correct 13 ms 344 KB Output is correct
16 Incorrect 0 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -