# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980659 | oleh1421 | Longest Trip (IOI23_longesttrip) | C++17 | 14 ms | 1112 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;
bool connected(vector<int>A,vector<int>B){
if (A.empty() || B.empty()) return false;
sort(A.begin(),A.end());
sort(B.begin(),B.end());
A.erase(unique(A.begin(),A.end()),A.end());
B.erase(unique(B.begin(),B.end()),B.end());
return are_connected(A,B);
}
std::vector<int> longest_trip(int N, int D)
{
vector<int>A={0},B;
bool not_connected = false;
for (int i=1;i<N;i++){
if (connected({A.back()},{i})){
A.push_back(i);
not_connected=false;
} else {
if (B.empty() || not_connected || connected({B.back()},{i})){
B.push_back(i);
not_connected=true;
} else {
reverse(B.begin(),B.end());
for (auto i:B) A.push_back(i);
if (B.size()==1){
not_connected=true;
}
B={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... |