# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198438 | model_code | Airplanes (LMIO17_lektuvai) | C++17 | 197 ms | 26408 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 <algorithm>
#include <cassert>
#include <iostream>
#include <cassert>
#include <vector>
#define endl '\n'
using namespace std;
struct Virsune {
int pirmine_pozicija;
pair<int, int> atsakinga;
vector<int> vaikai;
};
int N, S;
vector<Virsune> priklausomybiu_medis;
vector<int> segmentuotas_medis;
void rasti_atsakingumo_rezius(int virsune, int &atsakingumo_pradzia) {
Virsune &v = priklausomybiu_medis[virsune];
v.atsakinga.first = atsakingumo_pradzia;
atsakingumo_pradzia += 1;
for (int vaikas: v.vaikai) {
rasti_atsakingumo_rezius(vaikas, atsakingumo_pradzia);
}
v.atsakinga.second = atsakingumo_pradzia - 1;
#ifndef EVAL
cerr << "Virsune " << virsune << " su pozicija " << v.pirmine_pozicija
# | 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... |