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;
std::vector<int> longest_trip(int N, int D)
{
if(D == 1) {
vector<int> ret;
for(int i = 0; i < N; ++i) ret.push_back(i);
return ret;
}
else {
vector<pair<int, int> > idp;
for(int i = 0; i < N; ++i) for(int j = i + 1; j < N; ++j) {
vector<int> a, b;
a.push_back(i); b.push_back(j);
if(!are_connected(a, b)) idp.push_back({i, j});
}
vector<int> chk(N, 0);
for(auto p : idp) chk[p.first] = chk[p.second] = 1;
vector<int> ret;
for(int i = 0; i < (int)idp.size(); ++i) ret.push_back(idp[i].first);
for(int i = 0; i < (int)idp.size(); ++i) ret.push_back(idp[i].second);
for(int i = 0; i < N; ++i) if(!chk[i]) ret.push_back(i);
return ret;
}
}
# | 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... |