oj.uz

Submission #1068978

# Submission time Handle Problem Language Result Execution time Memory
1068978 2024-08-21T14:01:38 Z Malix Longest Trip (IOI23_longesttrip) C++17
60 / 100
 438 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;
}

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;
    }
    int s1=x.size(),s2=y.size();
    REP(i,0,s1)REP(j,0,s2){
        a.clear();b.clear();
        a.PB(x[i]);b.PB(y[j]);
        if(are_connected(a,b)){
            vi ans;
            REP(k,i+1,s1)ans.PB(x[k]);
            REP(k,0,i+1)ans.PB(x[k]);
            REP(k,j,s2)ans.PB(y[k]);
            REP(k,0,j)ans.PB(y[k]);
            return ans;
        }
    }
    if(x.size()>=y.size())return x;
    else return y;
}

Compilation message

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

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 9 ms 600 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 7 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 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 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 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 432 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 7 ms 344 KB Output is correct
14 Correct 14 ms 344 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 10 ms 344 KB Output is correct
17 Correct 10 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 6 ms 344 KB Output is correct
22 Correct 8 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 14 ms 344 KB Output is correct
26 Correct 16 ms 344 KB Output is correct
27 Correct 13 ms 344 KB Output is correct
28 Correct 14 ms 344 KB Output is correct
29 Correct 14 ms 344 KB Output is correct
30 Correct 13 ms 344 KB Output is correct
31 Correct 84 ms 344 KB Output is correct
32 Correct 120 ms 344 KB Output is correct
33 Correct 14 ms 344 KB Output is correct
34 Correct 25 ms 344 KB Output is correct
35 Correct 39 ms 344 KB Output is correct
36 Correct 10 ms 344 KB Output is correct
37 Correct 65 ms 344 KB Output is correct
38 Correct 219 ms 340 KB Output is correct
39 Correct 395 ms 600 KB Output is correct
40 Correct 436 ms 344 KB Output is correct
41 Correct 438 ms 344 KB Output is correct
42 Correct 396 ms 344 KB Output is correct
43 Correct 418 ms 344 KB Output is correct
44 Correct 416 ms 344 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 8 ms 344 KB Output is correct
47 Correct 9 ms 344 KB Output is correct
48 Correct 8 ms 344 KB Output is correct
49 Correct 11 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 46 ms 344 KB Output is correct
52 Correct 60 ms 344 KB Output is correct
53 Correct 8 ms 344 KB Output is correct
54 Correct 17 ms 344 KB Output is correct
55 Correct 17 ms 344 KB Output is correct
56 Correct 8 ms 344 KB Output is correct
57 Correct 30 ms 344 KB Output is correct
58 Correct 132 ms 344 KB Output is correct
59 Correct 253 ms 344 KB Output is correct
60 Correct 300 ms 344 KB Output is correct
61 Correct 69 ms 344 KB Output is correct
62 Correct 201 ms 344 KB Output is correct
63 Correct 171 ms 344 KB Output is correct
64 Correct 243 ms 344 KB Output is correct

Subtask #4
19.999999998 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 4 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 5 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 4 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 22 ms 344 KB Output is correct
15 Correct 14 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 8 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 15 ms 344 KB Output is correct
22 Correct 15 ms 344 KB Output is correct
23 Correct 13 ms 344 KB Output is correct
24 Correct 18 ms 344 KB Output is correct
25 Correct 10 ms 344 KB Output is correct
26 Correct 16 ms 344 KB Output is correct
27 Partially correct 86 ms 344 KB Output is partially correct
28 Partially correct 117 ms 344 KB Output is partially correct
29 Correct 14 ms 344 KB Output is correct
30 Partially correct 24 ms 344 KB Output is partially correct
31 Partially correct 50 ms 344 KB Output is partially correct
32 Correct 6 ms 344 KB Output is correct
33 Correct 8 ms 344 KB Output is correct
34 Correct 7 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 7 ms 344 KB Output is correct
38 Partially correct 44 ms 344 KB Output is partially correct
39 Partially correct 69 ms 344 KB Output is partially correct
40 Correct 7 ms 344 KB Output is correct
41 Partially correct 14 ms 344 KB Output is partially correct
42 Partially correct 15 ms 432 KB Output is partially correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 7 ms 340 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Partially correct 14 ms 600 KB Output is partially correct
48 Partially correct 56 ms 344 KB Output is partially correct
49 Partially correct 250 ms 344 KB Output is partially correct
50 Partially correct 347 ms 344 KB Output is partially correct
51 Partially correct 413 ms 344 KB Output is partially correct
52 Partially correct 420 ms 344 KB Output is partially correct
53 Partially correct 436 ms 344 KB Output is partially correct
54 Partially correct 436 ms 344 KB Output is partially correct
55 Partially correct 416 ms 344 KB Output is partially correct
56 Partially correct 71 ms 344 KB Output is partially correct
57 Partially correct 227 ms 344 KB Output is partially correct
58 Partially correct 322 ms 600 KB Output is partially correct
59 Partially correct 437 ms 344 KB Output is partially correct
60 Partially correct 435 ms 344 KB Output is partially correct
61 Partially correct 418 ms 344 KB Output is partially correct
62 Partially correct 12 ms 340 KB Output is partially correct
63 Partially correct 33 ms 344 KB Output is partially correct
64 Partially correct 162 ms 600 KB Output is partially correct
65 Partially correct 268 ms 344 KB Output is partially correct
66 Partially correct 321 ms 344 KB Output is partially correct
67 Partially correct 90 ms 344 KB Output is partially correct
68 Partially correct 242 ms 344 KB Output is partially correct
69 Partially correct 205 ms 344 KB Output is partially correct
70 Partially correct 254 ms 344 KB Output is partially correct
71 Partially correct 36 ms 344 KB Output is partially correct
72 Partially correct 94 ms 344 KB Output is partially correct
73 Partially correct 110 ms 344 KB Output is partially correct
74 Partially correct 210 ms 344 KB Output is partially correct
75 Partially correct 198 ms 344 KB Output is partially correct
76 Partially correct 219 ms 344 KB Output is partially correct
77 Partially correct 42 ms 596 KB Output is partially correct
78 Partially correct 111 ms 344 KB Output is partially correct
79 Partially correct 130 ms 344 KB Output is partially correct
80 Partially correct 91 ms 344 KB Output is partially correct
81 Partially correct 197 ms 344 KB Output is partially correct
82 Partially correct 144 ms 600 KB Output is partially correct