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>
#include "Joi.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
void Joi(int N, int M, int A[], int B[], long long X, int T){
for(int i=0;i<N;i++){
if(i<60&&(X&(1ll<<i))){
MessageBoard(i,1);
}
else{
MessageBoard(i,0);
}
}
}
#include<bits/stdc++.h>
#include "Ioi.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
const int maxn=1e4+5;
vector<int>adj[maxn],num(maxn,0);
vector<bool>used(maxn,0);
void dfs(int x,int p){
used[x]=true;
for(int y:adj[x]){
if(y!=p){
int val=Move(y);
num[y]=val;
dfs(y,x);
}
}
if(p>-1){
Move(x);
}
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T){
num[P]=V;
for(int i=0;i<M;i++){
adj[A[i]].pb(B[i]);
adj[B[i]].pb(A[i]);
}
dfs(P,-1);
long long ans=0;
for(int i=0;i<60;i++){
if(num[i]==1) ans+=(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... |