| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312360 | eri16 | Longest Trip (IOI23_longesttrip) | C++20 | 4 ms | 408 KiB |
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> longest_trip(int n, int d){
vector <int> ans,a,b;
if (d==3){
for (int i=0; i<n; i++){
ans.push_back(i);
}
return ans;
}
if (d==2){
ans.push_back(0);
for (int i=1; i<n; i++){
a.clear();
b.clear();
a.push_back(i);
b.push_back(i-1);
bool found = are_connected(a,b);
if (found){ans.push_back(i);}
else if(i<n-1){
ans.push_back(i+1);
ans.push_back(i);
i++;
}
else{
vector <int> useless;
useless.push_back(ans[ans.size()-1]);
useless.push_back(ans[ans.size()-2]);
useless.push_back(ans[ans.size()-3]);
ans.pop_back();
ans.pop_back();
a.clear();
b.clear();
a.push_back(useless[0]);
b.push_back(useless[2]);
bool found = are_connected(a,b);
if (found){ans.push_back(useless[0]);ans.push_back(useless[1]);ans.push_back(i);}
else{ans.push_back(i);ans.push_back(useless[0]);ans.push_back(useless[1]);}
}
}
return ans;
}
}
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... | ||||
