# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082350 | Halym2007 | Longest Trip (IOI23_longesttrip) | C++17 | 189 ms | 5608 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 <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
const int N = 2e5 + 5;
//bool are_connected (vector <int> A, vector <int> B) {
// return true;
//}
pii jog;
vector <int> v[N];
int n, vis[N][2];
vector <int> ret, belle;
void dfs (int x, int type, int val) {
vis[x][type] = 1;
if (type == 1) {
ret.pb (x);
}
if (jog.ff < val) {
jog = {val, x};
belle = 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... |