# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
790751 | peteza | Simurgh (IOI17_simurgh) | C++14 | 87 ms | 7500 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 "simurgh.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cassert>
using namespace std;
using pii = pair<int, int>;
int ct, ign;
bool vis[505];
vector<pii> adj[505];
vector<int> times[505];
bool checked[50505];
int inside[50505];
void dfs(int x, vector<int> &to) {
for(pii e:adj[x]) {
if(e.first == ign) {
times[ct].push_back(e.second);
continue;
}
if(vis[e.first]) continue;
vis[e.first] = 1;
to.push_back(e.second);
dfs(e.first, to);
}
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
std::vector<int> r;
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... |