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;
const int nx=305;
int qrs[nx][nx];
int query(int i, int j)
{
if (i>j) swap(i, j);
return qrs[i][j];
}
std::vector<int> longest_trip(int N, int D)
{
for (int i=0; i<N; i++) for (int j=i+1; j<N; j++) qrs[i][j]=are_connected(vector<int> {i}, vector<int> {j});
deque<int> dq;
for (int i=0; i<N; i++) dq.push_back(i);
for (int i=0; i<N-2; i++) if (!query(dq[i], dq[i+1])) swap(dq[i+1], dq[i+2]);
if (!query(dq[N-2], dq[N-1])) dq.pop_front(), dq.push_back(0), swap(dq.back(), dq[dq.size()-2]);
vector<int> res;
for (int i=0; i<N; i++) res.push_back(dq[i]);
return res;
}
# | 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... |