oj.uz

답안 #1069040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069040 2024-08-21T15:06:07 Z Malix 가장 긴 여행 (IOI23_longesttrip) C++17
100 / 100
 14 ms 600 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-1){
        a.clear();b.clear();
        a.PB(x.back());b.PB(pos);
        if(are_connected(a,b)){
            a.clear();b.clear();
            a.PB(y.back());b.PB(pos+1);
            if(are_connected(a,b)){
                x.PB(pos);
                y.PB(pos+1);
                a.clear();b.clear();
                a.PB(pos);b.PB(pos+1);
                if(are_connected(a,b)){
                    reverse(y.begin(),y.end());
                    for(auto u:y)x.PB(u);
                    y.clear();
                    int tmp=solve(x.back(),pos+2,n);
                    REP(i,pos+2,tmp)x.PB(i);
                    if(tmp==n)return x;
                    y.PB(tmp);
                    pos=tmp+1;
                }
                else pos+=2;
            }
            else{
                a.clear();b.clear();
                a.PB(pos);b.PB(pos+1);
                if(are_connected(a,b)){
                    x.PB(pos);
                    x.PB(pos+1);
                    pos+=2;
                }
                else{
                    x.PB(pos+1);
                    y.PB(pos);
                    pos+=2;
                } 
            }
        }
        else{
            y.PB(pos);pos++;
        } 
    }
    if(pos<n){
        a.clear();b.clear();
        a.PB(pos);b.PB(x.back());
        if(are_connected(a,b))x.PB(pos);
        else y.PB(pos);
    }
    if((int)x.size()==n)return x;
    if(!are_connected(x,y)){
        if(x.size()>=y.size())return x;
        else return y;
    }
    a.clear();b.clear();
    a.PB(x.front());b.PB(y.front());
    if(x.size()!=1)a.PB(x.back());
    if(y.size()!=1)b.PB(y.back());
if(are_connected(a,b)){
    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;
    }
}
    int s1=x.size(),s2=y.size();
    pi arr=BS(0,s1-1,0,s2-1,x,y);
    vi ans;
    REP(k,arr.F+1,s1)ans.PB(x[k]);
    REP(k,0,arr.F+1)ans.PB(x[k]);
    REP(k,arr.S,s2)ans.PB(y[k]);
    REP(k,0,arr.S)ans.PB(y[k]);
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 8 ms 432 KB Output is correct
20 Correct 9 ms 436 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 6 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 6 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 5 ms 344 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 9 ms 344 KB Output is correct
34 Correct 6 ms 344 KB Output is correct
35 Correct 8 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 6 ms 344 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 6 ms 344 KB Output is correct
40 Correct 7 ms 344 KB Output is correct
41 Correct 9 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 7 ms 348 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 12 ms 344 KB Output is correct
46 Correct 13 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 8 ms 344 KB Output is correct
50 Correct 7 ms 352 KB Output is correct
51 Correct 8 ms 600 KB Output is correct
52 Correct 7 ms 352 KB Output is correct
53 Correct 7 ms 436 KB Output is correct
54 Correct 11 ms 344 KB Output is correct
55 Correct 10 ms 344 KB Output is correct
56 Correct 7 ms 344 KB Output is correct
57 Correct 9 ms 344 KB Output is correct
58 Correct 8 ms 440 KB Output is correct
59 Correct 10 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 5 ms 344 KB Output is correct
62 Correct 7 ms 344 KB Output is correct
63 Correct 7 ms 600 KB Output is correct
64 Correct 10 ms 444 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 356 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 8 ms 444 KB Output is correct
19 Correct 6 ms 436 KB Output is correct
20 Correct 9 ms 432 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 4 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 9 ms 344 KB Output is correct
31 Correct 10 ms 344 KB Output is correct
32 Correct 10 ms 344 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 8 ms 344 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 8 ms 344 KB Output is correct
39 Correct 5 ms 344 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 7 ms 344 KB Output is correct
42 Correct 7 ms 344 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 8 ms 344 KB Output is correct
45 Correct 8 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 8 ms 344 KB Output is correct
49 Correct 7 ms 436 KB Output is correct
50 Correct 7 ms 344 KB Output is correct
51 Correct 8 ms 344 KB Output is correct
52 Correct 8 ms 344 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 6 ms 344 KB Output is correct
55 Correct 9 ms 344 KB Output is correct
56 Correct 6 ms 344 KB Output is correct
57 Correct 9 ms 344 KB Output is correct
58 Correct 6 ms 344 KB Output is correct
59 Correct 10 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 9 ms 344 KB Output is correct
62 Correct 5 ms 344 KB Output is correct
63 Correct 7 ms 344 KB Output is correct
64 Correct 8 ms 344 KB Output is correct
65 Correct 10 ms 440 KB Output is correct
66 Correct 12 ms 344 KB Output is correct
67 Correct 8 ms 600 KB Output is correct
68 Correct 7 ms 344 KB Output is correct
69 Correct 7 ms 344 KB Output is correct
70 Correct 8 ms 444 KB Output is correct
71 Correct 14 ms 600 KB Output is correct
72 Correct 8 ms 344 KB Output is correct
73 Correct 6 ms 344 KB Output is correct
74 Correct 6 ms 344 KB Output is correct
75 Correct 9 ms 344 KB Output is correct
76 Correct 6 ms 344 KB Output is correct
77 Correct 6 ms 344 KB Output is correct
78 Correct 11 ms 344 KB Output is correct
79 Correct 7 ms 344 KB Output is correct
80 Correct 8 ms 600 KB Output is correct
81 Correct 7 ms 344 KB Output is correct
82 Correct 8 ms 344 KB Output is correct