# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846644 | ttamx | Longest Trip (IOI23_longesttrip) | C++17 | 10 ms | 860 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;
int bsearch(vector<int> vec,vector<int> fixed){
int l=0,r=vec.size()-1;
while(l<r){
int m=(l+r)/2;
vector<int> res;
for(int i=l;i<=m;i++)res.emplace_back(vec[i]);
if(are_connected(res,fixed))r=m;
else l=m+1;
}
return l;
}
vector<int> longest_trip(int N, int D){
vector<int> path[2];
for(int i=0;i<2;i++)path[i].emplace_back(i);
bool ok=true;
for(int i=2;i<N;i++){
if(are_connected({i},{path[0].back()})){
path[0].emplace_back(i);
ok=true;
continue;
}
if(!ok||are_connected({i},{path[1].back()})){
path[1].emplace_back(i);
ok=false;
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... |