# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852692 | willychan | Two Currencies (JOI23_currencies) | C++14 | 823 ms | 31828 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;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
int n,m,q;
struct Query{
int a,b;
ll x,y;
int ans;
};
struct request{
int node;
ll v;
};
const int N = 1e5+5;
vector<int> side[N];
vector<request> Req;
vector<Query> Que;
// tree stuff
pair<int,int> dep[N];
int father[N][20];
int t;
void dfs(int cur){
dep[cur].first=++t;
for(auto i : side[cur]){
if(!dep[i].first){
father[i][0] = cur;
# | 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... |