oj.uz

Submission #59206

# Submission time Handle Problem Language Result Execution time Memory
59206 2018-07-21T06:28:48 Z Mikaeel Amusement Park (JOI17_amusement_park) C++14
18 / 100
 43 ms 11344 KB 
#include "Joi.h"
#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#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(55);
}

#include "Ioi.h"
#include<bits/stdc++.h>
#define rep(i,l,r) for(int i=l;i<r;i++)
#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],size0[maxn],par[maxn];
int root;

void dfs0(int a){
    mark0[a]=1;
    t[a]=te0;
    te0=(te0+1)%lg;
    size0[a]=1;
    for(int b:G0[a]){
	if(!mark0[b]){
	    par[b]=a;
	    dfs0(b);
	    size0[a]+=size0[b];
	}
    }
}
int ss=0;
void dfs1(int a){
    //if(ss==lg) return;
    mark0[a]=1;
    if(v){
	x0|=1ll<<t[a];
    }
    ss++;
    for(int b:G0[a]){
	if(!mark0[b] && par[a]!=b){
	    v=Move(b);
	    dfs1(b);
	    v=Move(a);
	}
    }
}
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(55);
    fill(mark0,mark0+N,0);
    root=P;
    while(size0[root]<lg){
	root=par[root];
	v=Move(root);
    }
    dfs1(root);
    return x0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1248 KB Output is correct
2 Correct 6 ms 1536 KB Output is correct
3 Correct 5 ms 1680 KB Output is correct
4 Correct 5 ms 1916 KB Output is correct
5 Correct 4 ms 1972 KB Output is correct
6 Correct 5 ms 2100 KB Output is correct
7 Correct 5 ms 2224 KB Output is correct
8 Correct 6 ms 2224 KB Output is correct
9 Correct 4 ms 2224 KB Output is correct
10 Correct 5 ms 2224 KB Output is correct
11 Correct 9 ms 2448 KB Output is correct
12 Correct 4 ms 2448 KB Output is correct
13 Correct 7 ms 2476 KB Output is correct
14 Correct 7 ms 2504 KB Output is correct
15 Correct 6 ms 2504 KB Output is correct
16 Correct 7 ms 2504 KB Output is correct
17 Correct 7 ms 2504 KB Output is correct
18 Correct 7 ms 2540 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 4964 KB Output is correct
2 Correct 42 ms 5480 KB Output is correct
3 Correct 37 ms 5900 KB Output is correct
4 Correct 20 ms 6128 KB Output is correct
5 Correct 19 ms 6128 KB Output is correct
6 Correct 19 ms 6128 KB Output is correct
7 Correct 28 ms 6128 KB Output is correct
8 Correct 24 ms 6128 KB Output is correct
9 Correct 27 ms 6128 KB Output is correct
10 Correct 25 ms 6128 KB Output is correct
11 Correct 26 ms 6224 KB Output is correct
12 Correct 24 ms 6320 KB Output is correct
13 Correct 22 ms 6352 KB Output is correct
14 Correct 27 ms 6484 KB Output is correct
15 Correct 31 ms 6760 KB Output is correct
16 Correct 28 ms 7052 KB Output is correct
17 Correct 27 ms 7184 KB Output is correct
18 Correct 20 ms 7372 KB Output is correct
19 Correct 20 ms 7528 KB Output is correct
20 Correct 17 ms 8104 KB Output is correct
21 Correct 22 ms 8360 KB Output is correct
22 Correct 24 ms 8644 KB Output is correct
23 Correct 25 ms 8832 KB Output is correct
24 Correct 26 ms 8932 KB Output is correct
25 Correct 23 ms 9128 KB Output is correct
26 Correct 28 ms 9224 KB Output is correct
27 Correct 30 ms 9448 KB Output is correct
28 Correct 26 ms 9608 KB Output is correct
29 Correct 24 ms 9712 KB Output is correct
30 Correct 27 ms 9852 KB Output is correct
31 Correct 5 ms 9888 KB Output is correct
32 Correct 6 ms 9888 KB Output is correct
33 Correct 6 ms 9888 KB Output is correct
34 Correct 6 ms 9888 KB Output is correct
35 Correct 7 ms 9888 KB Output is correct
36 Correct 5 ms 9888 KB Output is correct
37 Correct 5 ms 9888 KB Output is correct
38 Correct 5 ms 9888 KB Output is correct
39 Correct 5 ms 9888 KB Output is correct
40 Correct 7 ms 9888 KB Output is correct
41 Correct 5 ms 9888 KB Output is correct
42 Correct 6 ms 9888 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9888 KB Output is correct
2 Correct 5 ms 9888 KB Output is correct
3 Correct 6 ms 9888 KB Output is correct
4 Incorrect 9 ms 9888 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 11024 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 11344 KB Output isn't correct
2 Halted 0 ms 0 KB -