# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88846 | sailormoon | Triumphal arch (POI13_luk) | C++14 | 0 ms | 0 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 <map>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
vector<vector<int>> graph (300001); // size
set visited;
int canHandle(int v, int crs) {
int num_children = 0, need_crews = 0;
visited.insert(v);
for (int i = 0; i < graph[v].size(); i++) {
if (visited.find(graph[v][i]) == visited.end()) {
num_children++;
need_crews += canHandle(graph[v][i], crs);
}
}
return max(0, num_children + need_crews - crs);
}
int main() {
int n, a, b, start = 0, midpoint, end; // n -> towns, a -> from, b -> to
scanf("%d", &n);
end = n; // last point