# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946293 | PM1 | LOSTIKS (INOI20_lostiks) | C++17 | 1390 ms | 345140 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 ll long long
#define fr first
#define sc second
const int mxn=1e6+5,sz=(1<<22);
int n,dis[40][40],par[mxn][22],c[mxn],key[25],door[25],cnt=0,d[mxn];
ll dp[sz][25],ans=1e9;
vector<pair<int,int>>v[mxn];
void dfs(int z,int f=0){
for(int i=1;i<=20;i++)
par[z][i]=par[par[z][i-1]][i-1];
for(auto i:v[z]){
if(par[z][0]!=i.fr){
par[i.fr][0]=z;
c[i.fr]=c[z];
d[i.fr]=d[z]+1;
if(i.sc){
door[++cnt]=z;
key[cnt]=i.sc;
c[i.fr]|=(1<<(cnt-1));
}
dfs(i.fr);
}
}
}
int lca(int x,int y){
if(x==0 || y==0)return 0;
if(d[x]<d[y])swap(x,y);
int res=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |