# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091206 | kawaii | Klasika (COCI20_klasika) | C++14 | 379 ms | 211008 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>
using namespace std;
// #define int long long
#define fi first
#define se second
const int MAXN = 2e5 + 5;
int t, n, m, k, node = 1, a[MAXN], val[MAXN], tin[MAXN], tout[MAXN], cnt = 0, mod = 1e9 + 7;
vector<int> adj[MAXN];
mt19937_64 rng;
int mul(int x, int y){
if(y == 0) return 1;
int ans = mul(x, y / 2);
if(y % 2 == 0) return (ans * ans) % mod;
else return (((ans * ans) % mod) * x) % mod;
}
struct Query{
string operation;
int x, y;
};
Query q[MAXN];
void dfs(int u){
tin[u] = ++cnt;
for(auto i: adj[u]) dfs(i);
tout[u] = cnt;
}
Compilation message (stderr)
# | 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... |