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 "fun.h"
#include <vector>
const int N = 100000;
using namespace std;
vector<int> createFunTour(int n, int q) {
static char used[N];
vector<int> pp = vector<int>(n);
int n_, i, i_, j, d_;
i_ = -1, d_ = -1;
for (i = 0; i < n; i++) {
int d = hoursRequired(0, i);
if (d_ < d)
i_ = i, d_ = d;
}
q = -1;
i = i_, n_ = 0;
while (n_ < n) {
pp[n_++] = i, used[i] = 1;
i_ = -1, d_ = -1;
for (j = 0; j < n; j++)
if (!used[j]) {
int d = hoursRequired(i, j);
if (d_ < d)
i_ = j, d_ = d;
}
i = i_;
}
return pp;
}
# | 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... |