# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950597 | Nexus | Two Currencies (JOI23_currencies) | C++17 | 159 ms | 192964 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 a[N],b[N],n,m,q,s,t,x,y,z;
vector<ll>v[N],ed[N][N],p;
void dfs(ll node,ll ca)
{
if(node==t)
{
z=1;
return;
}
for(auto i:v[node])
if(i!=ca)
{
ll g=p.size();
for(auto j:ed[node][i])p.push_back(j);
dfs(i,node);
if(z)return;
ll k=g+ed[node][i].size();
for(ll j=g;j<k;++j)p[j]=0;
}
}
ll ans()
# | 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... |