oj.uz

Submission #1014369

# Submission time Handle Problem Language Result Execution time Memory
1014369 2024-07-04T19:10:04 Z JakobZorz Longest Trip (IOI23_longesttrip) C++17
25 / 100
 15 ms 600 KB 
#include"longesttrip.h"
#include<iostream>
#include<algorithm>
using namespace std;

int n;

pair<int,int>find_conn(vector<int>v1,vector<int>v2){
    for(int i:v1){
        if(are_connected({i},v2)){
            for(int j:v2){
                if(are_connected({i},{j}))
                    return{i,j};
            }
        }
    }
    // impossible
    exit(1);
}

vector<int>merge(vector<int>v1,vector<int>v2){
    while(v2.size()){
        v1.push_back(v2.back());
        v2.pop_back();
    }
    return v1;
}

pair<vector<int>,vector<int>>merge(vector<int>v1,vector<int>v2,vector<int>v3){
    if(are_connected({v1.back()},{v2.back()}))
        return{merge(v1,v2),v3};
    
    if(are_connected({v2.back()},{v3.back()}))
        return{merge(v2,v3),v1};
    
    return{merge(v1,v3),v2};
}

vector<int>cyclic_shift(vector<int>arr,int a){
    // it ends with a
    vector<int>res;
    bool b1=false;
    for(int i:arr){
        if(b1)
            res.push_back(i);
        if(i==a)
            b1=true;
    }
    
    bool b2=true;
    for(int i:arr){
        if(i==a)
            b2=false;
        if(b2)
            res.push_back(i);
    }
    return res;
}

vector<int>longest_trip(int N,int D){
    n=N;
    vector<vector<int>>arr;
    for(int i=0;i<n;i++)
        arr.push_back({i});
    
    while(arr.size()>2){
        vector<int>v1,v2,v3;
        v1=arr.back();
        arr.pop_back();
        v2=arr.back();
        arr.pop_back();
        v3=arr.back();
        arr.pop_back();
        auto res=merge(v1,v2,v3);
        arr.push_back(res.first);
        arr.push_back(res.second);
    }
    
    vector<int>res1=arr[0];
    vector<int>res2=arr[1];
    
    //if(!are_connected(res1,res2)){
        if(res1.size()>res2.size())
            return res1;
        else
            return res2;
    //}
    
    if(are_connected({res1.back()},{res2.back()}))
        return merge(res1,res2);
    reverse(res1.begin(),res1.end());
    if(are_connected({res1.back()},{res2.back()}))
        return merge(res1,res2);
    reverse(res2.begin(),res2.end());
    if(are_connected({res1.back()},{res2.back()}))
        return merge(res1,res2);
    reverse(res1.begin(),res1.end());
    if(are_connected({res1.back()},{res2.back()}))
        return merge(res1,res2);
    
    // both must be cyclical then
    auto pr=find_conn(res1,res2);
    vector<int>r1=cyclic_shift(res1,pr.first);
    vector<int>r2=cyclic_shift(res2,pr.second);
    return merge(r1,r2);
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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 6 ms 344 KB Output is correct
5 Correct 6 ms 556 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 6 ms 552 KB Output is correct
11 Correct 8 ms 344 KB Output is correct
12 Correct 5 ms 552 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 10 ms 344 KB Output is correct
19 Correct 8 ms 344 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 9 ms 548 KB Output is correct
23 Correct 6 ms 344 KB Output is correct
24 Correct 7 ms 516 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 7 ms 344 KB Output is correct
31 Correct 13 ms 344 KB Output is correct
32 Correct 10 ms 600 KB Output is correct
33 Correct 9 ms 468 KB Output is correct
34 Correct 12 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 10 ms 344 KB Output is correct
38 Correct 9 ms 344 KB Output is correct
39 Correct 9 ms 516 KB Output is correct
40 Correct 10 ms 516 KB Output is correct
41 Correct 8 ms 344 KB Output is correct
42 Correct 9 ms 344 KB Output is correct
43 Correct 10 ms 520 KB Output is correct
44 Correct 10 ms 344 KB Output is correct
45 Correct 5 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 7 ms 344 KB Output is correct
48 Correct 6 ms 344 KB Output is correct
49 Correct 6 ms 344 KB Output is correct
50 Correct 9 ms 600 KB Output is correct
51 Correct 15 ms 344 KB Output is correct
52 Correct 14 ms 444 KB Output is correct
53 Correct 8 ms 460 KB Output is correct
54 Correct 9 ms 344 KB Output is correct
55 Correct 11 ms 344 KB Output is correct
56 Correct 9 ms 548 KB Output is correct
57 Correct 10 ms 344 KB Output is correct
58 Correct 9 ms 344 KB Output is correct
59 Correct 10 ms 344 KB Output is correct
60 Correct 10 ms 344 KB Output is correct
61 Correct 9 ms 340 KB Output is correct
62 Correct 10 ms 596 KB Output is correct
63 Correct 9 ms 344 KB Output is correct
64 Correct 9 ms 344 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -