oj.uz

Submission #1065471

# Submission time Handle Problem Language Result Execution time Memory
1065471 2024-08-19T08:02:28 Z vjudge1 Longest Trip (IOI23_longesttrip) C++17
5 / 100
 12 ms 600 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
int findit(vector<int>v,vector<int>vf){
    if(v.size()==1)return v[0];
    vector<int>v1,v2;
    for(auto i:v)
        v1.push_back(i),
        swap(v1,v2);
    if(are_connected(v1,vf))
        return findit(v1,vf);
    return findit(v2,vf);
}
mt19937 rng(0);
vector<int> longest_trip(int N, int D){
    vector<int>path1,path2,v(N);
    iota(v.begin(),v.end(),0);
    //shuffle(v.begin(),v.end(),rng);
    path1={v[0]},path2={v[1]};
    for(int i=1;i*2+1<N;i++){
        int U=v[i*2],V=v[i*2+1];
        int a=are_connected({U},{path1.back()});
        if(are_connected({U},{V})){
            int b=are_connected({U},{path2.back()});
            if(a) path1.push_back(U),
                path1.push_back(V);
            else if(b)
                path2.push_back(U),
                path2.push_back(V);
            else{ reverse(path2.begin(),path2.end());
                for(auto i:path2)
                    path1.push_back(i);
                path2 = {U,V};
            }
        } else {
            if(!a) swap(U,V);
            path1.push_back(U);
            if(are_connected({path2.back()},{V}))
                path2.push_back(V);
            else {reverse(path2.begin(),path2.end());
                for(auto i:path2)
                    path1.push_back(i);
                path2 = {V};
            }
        }
        //assert(path1.size());
        //assert(path2.size());
    }
    if(N%2){
        int X=v.back();
        int a=are_connected({X},{path1.back()});
        int b=are_connected({X},{path2.back()});
        if(a) path1.push_back(X);
        else if(b)path2.push_back(X);
        else{ reverse(path2.begin(),path2.end());
            for(auto i:path2)
                path1.push_back(i);
            path2 = {X};
        }
        //assert(path1.size());
        //assert(path2.size());
    }
    if(!are_connected(path1,path2))
        return path1.size()>path2.size()?path1:path2;
    vector<int>A(1,path1[0]),B(1,path2[0]);
    if(path1.size()>1)A.push_back(path1.back());
    if(path2.size()>1)B.push_back(path2.back());
    if(are_connected(A,B))
        for(int i=0;i<A.size();i++)
            for(int j=0;j<B.size();j++)
                if(are_connected({A[i]},{B[j]})) {
                    if(!i)reverse(path1.begin(),path1.end());
                    if(j) reverse(path2.begin(),path1.end());
                    for(auto i:path2) path1.push_back(i);
                    //assert(path1.size()==N);
                    return path1;
                }
    int X=findit(path1,path2);
    int Y=findit(path2,{X});
    while(path1.back()-X)
        path1.push_back(path1[0]),
        path1.erase(path1.begin());
    while(path2[0]-Y)
        path2.push_back(path2[0]),
        path2.erase(path2.begin());
    for(auto i:path2)
        path1.push_back(i);
    //assert(path1.size()==N);
    return path1;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i=0;i<A.size();i++)
      |                     ~^~~~~~~~~
longesttrip.cpp:70:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for(int j=0;j<B.size();j++)
      |                         ~^~~~~~~~~

Subtask #0
0.0 / 0.0

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

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 11 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 7 ms 440 KB Output is correct
5 Correct 8 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Runtime error 1 ms 600 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 11 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Runtime error 1 ms 344 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 7 ms 344 KB Output is correct
5 Correct 9 ms 344 KB Output is correct
6 Correct 11 ms 344 KB Output is correct
7 Runtime error 1 ms 344 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -