oj.uz

Submission #59200

# Submission time Handle Problem Language Result Execution time Memory
59200 2018-07-21T06:01:45 Z Mikaeel Amusement Park (JOI17_amusement_park) C++14
0 / 100
 52 ms 5708 KB 
#include "Joi.h"
#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#define put(x) cout<<#x<<" = "<<x<<endl;
#define pb push_back
#define bit(x,i) ((x>>i)&1ll)
using namespace std;
typedef long long num;
typedef pair<int,int> point;
const int maxn=1e4+10,lg=60;
vector<int> G[maxn];
int te=0;
num x;
bool mark[maxn];
void dfs(int a){
    mark[a]=1;
    MessageBoard(a,bit(x,te));
    te=(te+1)%lg;
    for(int b:G[a]){
	if(!mark[b]){
	    dfs(b);
	}
    }
}

void Joi(int N, int M, int A[], int B[], num X, int T) {
    x=X;
    for(int i = 0; i < M; i++){
	G[A[i]].pb(B[i]);
	G[B[i]].pb(A[i]);
    }
    dfs(0);
}

#include "Ioi.h"
#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#define put(x) cout<<#x<<" = "<<x<<endl;
#define pb push_back
#define bit(x,i) ((x>>i)&1ll)
using namespace std;
typedef long long num;
typedef pair<int,int> point;
const int maxn=1e4+10,lg=60;
vector<int> G0[maxn];
int te0=0;
num x0;
bool mark0[maxn];
int v,t[maxn],size[maxn],par[maxn];
int root;

void dfs0(int a){
    mark0[a]=1;
    t[a]=te0;
    te0=(te0+1)%lg;
    size[a]=1;
    for(int b:G0[a]){
	if(!mark0[b]){
	    par[b]=a;
	    dfs0(b);
	    size[a]+=size[b];
	}
    }
}
int ss=0;
void dfs1(int a){
    if(ss==lg) return;
    mark0[a]=1;
    if(v){
	x0|=1<<t[a];
    }
    ss++;
    for(int b:G0[a]){
	if(!mark0[b]){
	    v=Move(b);
	    dfs1(b);
	    if(ss<lg) v=Move(b);
	}
    }
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    v=V;
    for(int i = 0; i < M; i++){
	G0[A[i]].pb(B[i]);
	G0[B[i]].pb(A[i]);
    }
    dfs0(0);
    fill(mark0,mark0+N,0);
    root=P;
    while(size[root]<lg){
	root=par[root];
	v=Move(root);
    }
    dfs1(root);
    return x0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 1252 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 4900 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 5240 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 5348 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 5708 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -