# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950860 | Nexus | Two Currencies (JOI23_currencies) | C++17 | 92 ms | 192896 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 ll long long
using namespace std;
const ll N=2e3+9,M=2e18+9,mod=1e9+7;
ll n,m,q,a[N],b[N],pa[N],dep[N],s,t,x,y,z;
vector<ll>v[N],ed[N][N],p;
void dfs(ll node,ll par)
{
pa[node]=par;
dep[node]=dep[par]+1;
for(auto i:v[node])if(i!=par)dfs(i,node);
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>m>>q;
for(ll i=1;i<n;++i)
{
cin>>a[i]>>b[i];
v[a[i]].push_back(b[i]);
v[b[i]].push_back(a[i]);
# | 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... |