#include <bits/stdc++.h>
#include <vector>
#include "Joi.h"
using namespace std;
using ll = long long;
const ll N=20005;
void Joi(int n, int m, int U[], int V[], long long x, int T) {
for(ll i=0;i<n;i++){
MessageBoard(i,(x>>(i%60))&1);
}
}
#include <bits/stdc++.h>
#include "Ioi.h"
using namespace std;
using ll = long long;
const ll N=10005;
ll ans,msg[N];
ll pr[N],used[N];
vector<ll> g[N];
set<pair<ll,ll>>edges;
void dfs(ll v){
used[v]=1;
for(ll to:g[v]){
if(used[to])continue;
pr[to]=v;
msg[to]=Move(to);
dfs(to);
}
msg[pr[v]]=Move(pr[v]);
}
long long Ioi(int n, int m, int U[], int VV[], int P, int V, int T) {
for(ll i=0;i<m;i++){
ll v=VV[i],u=U[i];
g[v].push_back(u);
g[u].push_back(v);
}
msg[P]=V;
dfs(P);
ll ans=0;
for(ll i=0;i<60;i++){
ans+=msg[i]*(1ll<<i);
}
return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |