# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217659 | Lego | Konstrukcija (COCI20_konstrukcija) | C++17 | 5 ms | 384 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 <bits/stdc++.h>
#define intl int
#define int long long
#define double long double
const bool MULTI_TEST = false;
const intl mod = 1e9 + 7, maxn = 400002, maxm = 2e5 + 1;
using namespace std;
int n = 1;
vector<pair<int, int>> edg;
vector<int> back_l = {1};
int mylt__ot2(int pref) {
vector<int> new_ = {n + 1, n + 2, n + 3};
for (auto x : back_l)
for (auto y : new_)
edg.push_back({x, y});
back_l = new_;
n = n + 3;
return -2 * pref;
}
int otr(int pref) {
edg.push_back({1, n + 1});
back_l.push_back(n + 1);
n = n + 1;
# | 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... |