# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849762 | MuntherCarrot | Longest Trip (IOI23_longesttrip) | C++17 | 14 ms | 852 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.
// by me
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()
bool are_connected(std::vector<int> A, std::vector<int> B);
bool con(vector<int> a, vector<int> b){
return are_connected(a, b);
}
std::vector<int> longest_trip(int N, int D)
{
vector<int> v1 = {0}, v2 = {1};
for(int i = 2; i < N; i++){
if(i == N - 1){
// con?(a, b) -> mrg(a, b)
if(con({v1.back()}, {N - 1})){
v1.push_back(N - 1);
}
// con?(c, b) -> mrg(c, b)
else if(con({v2.back()}, {N - 1})){
v2.push_back(N - 1);
}
// mrg(a, c)
else{
for(int i = v2.size() - 1; i >= 0; i--){
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... |