# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078459 | vjudge1 | Longest Trip (IOI23_longesttrip) | C++17 | 9 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>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define vi vector<int>
#define ll long long
#define ff first
#define ss second
using namespace std;
const int MAX=3e3+5;
vector<int> longest_trip(int n,int d){
vector<int>a;
a.push_back(0);
vector<int>b;
b.push_back(1);
int x=0;
int y=0;
deque<int>ans;
if(are_connected(a,b)){
x=0;
y=1;
ans.push_back(0);
ans.push_back(1);
}
else{
x=0;
y=1;
ans.push_back(0);
ans.push_back(2);
ans.push_back(1);
}
for(int i=2;i<n;i++){
if(ans.size()==3 and i==2) continue;
a.pop_back(); b.pop_back();
a.push_back(y); b.push_back(i);
if(are_connected(a,b)){
y=i;
ans.push_back(i);
}
else{
ans.push_front(i);
}
}
vector<int>v;
for(auto it:ans){
v.push_back(it);
}
return v;
}
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... |