# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624693 | MilosMilutinovic | Klasika (COCI20_klasika) | C++14 | 1660 ms | 524288 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.
/**
* author: wxhtzdy
* created: 08.08.2022 17:17:05
**/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005 * 30;
set<int> ids[MAXN];
int trie[MAXN][2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int q;
cin >> q;
vector<string> op(q);
vector<int> x(q);
vector<int> y(q);
int n = 1;
vector<vector<pair<int, int>>> g(1);
for (int i = 0; i < q; i++) {
cin >> op[i] >> x[i] >> y[i];
if (op[i] == "Add") {
--x[i];
g.push_back({});
g[x[i]].emplace_back(n, y[i]);
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... |