# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980291 | vjudge1 | Longest Trip (IOI23_longesttrip) | C++17 | 21 ms | 1188 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>
#include <vector>
#define MP make_pair
#define f first
#define s second
#define mid ((l+r)>>1)
typedef long long ll;
using namespace std;
mt19937_64 rnd(286);
const int INF = (int)1e6;
vector <int> auxa,auxb;
bool conectados(int A, int B) {
auxa.clear(); auxb.clear();
auxa.push_back(A);
auxb.push_back(B);
return are_connected(auxa,auxb);
}
struct linea{
deque <int> lin;
linea(){}
linea(int A) {
lin.push_front(A);
}
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... |