# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960175 | tutis | Longest Trip (IOI23_longesttrip) | C++17 | 11 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(0);
std::vector<int> longest_trip(int N, int D)
{
vector<int>x, y;
x.push_back({0});
for(int i=1;i<N;i++){
if(y.size()==0){
if(are_connected({i}, {x[0]})){
x.insert(x.begin(),i);
continue;
}
if (are_connected({i}, {x.back()})){
x.push_back(i);
continue;
}
if(!are_connected({i}, x)){
y={i};
continue;
}
int lo=0;
int hi=x.size()-1;
while(lo<hi){
int m=(lo+hi)/2;
vector<int>z;
for(int i=lo;i<=m;i++){
z.push_back(x[i]);
}
if(are_connected(z, {i})){
hi=m;
} else{
lo=m+1;
}
}
vector<int>z;
for(int i=lo+1;i<x.size();i++){
z.push_back(x[i]);
}
for(int i=0;i<=lo;i++){
z.push_back(x[i]);
}
z.push_back(i);
x=z;
continue;
}
if(!are_connected(x,{i})){
y.push_back(i);
continue;
}
if(!are_connected(y,{i})){
x.push_back(i);
continue;
}
x.push_back(i);
for(int i:y){
x.push_back(i);
}
y={};
}
if(x.size()>y.size()){
return x;
} else{
return y;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |