# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088002 | Valaki2 | Longest Trip (IOI23_longesttrip) | C++17 | 96 ms | 1108 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;
#define pb push_back
const int maxn = 256;
int n;
int edge[maxn][maxn];
void getedges() {
for(int i = 0; i < n; i++) {
for(int j = i + 1; j < n; j++) {
int val = are_connected({i}, {j});
edge[i][j] = edge[j][i] = val;
}
}
}
bool vis[maxn];
void reset() {
for(int i = 0; i < n; i++) {
vis[i] = false;
for(int j = 0; j < n; j++) {
edge[i][j] = 0;
}
}
}
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... |