# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362552 | Tenis0206 | Subway (info1cup19_subway) | C++11 | 12 ms | 1128 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 <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector < int > parents;
int computeMaxH(int x) {
int h = 0;
while (h * (h + 1) / 2 <= x)
h++;
return h - 1;
}
void generateTree(int maxH) {
parents.push_back(-1);
for (int i = 1; i <= maxH; ++i)
parents.push_back(i-1);
}
void printTree() {
printf("%d\n", (int)parents.size());
for (int i = 0; i < (int)parents.size(); ++i)
printf("%d %d\n", i, (int)parents[i]);
}
int main() {
//freopen("input","r",stdin);
//freopen("output","w",stdout);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |