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 "islands.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int edge[400][400];
variant<bool, vector<int>> find_journey(int _n, int m, vector<int> u, vector<int> v) {
n = _n;
for (int i = 0; i < m; i++)
edge[u[i]][v[i]] = i;
vector<int> ret;
for (int i = 1; i < n; i++)
ret.push_back(edge[i - 1][i]);
for (int i = n - 1; i; i--)
ret.push_back(edge[i][i - 1]);
for (int i = n - 1; i; i--)
ret.push_back(edge[i - 1][i]);
for (int i = 1; i < n; i++)
ret.push_back(edge[i][i - 1]);
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... |