# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850191 | CodePlatina | Longest Trip (IOI23_longesttrip) | C++17 | 855 ms | 2036 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 <iostream>
#include <algorithm>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
vector<int> gph[404];
bool chc[404];
bool vst[404];
void dfs(int x)
{
vst[x] = true;
for(auto y : gph[x]) if(chc[y] && !vst[y]) dfs(y);
}
vector<vector<int>> cmpn(int N)
{
fill(vst, vst + N, false);
for(int i = 0; i < N; ++i) if(chc[i]) { dfs(i); break; }
vector<int> r1, r2;
for(int i = 0; i < N; ++i) if(chc[i])
{
if(vst[i]) r1.push_back(i);
else r2.push_back(i);
}
# | 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... |