oj.uz

Submission #32173

# Submission time Handle Problem Language Result Execution time Memory
32173 2017-10-02T11:51:45 Z Diuven None (JOI16_snowy) C++11
55 / 100
 19 ms 2484 KB 
#include "Anyalib.h"
#include <vector>
using namespace std;

namespace AS{
	struct edge{
		int to=-1, idx=-1;
		edge(int to, int idx): to(to), idx(idx){};
		edge(){};
	} P[500]; // 올라가는 간선
	vector<edge> G[500];
	vector<int> V;
	int N, S[500], now, dep[500], C[500], X;
	void idfs(int v, int p){
		dep[v]=now++;
		if(dep[v]%10==0)	V.push_back(v);
		for(edge e:G[v])
			if(e.to!=p){
				P[e.to]={v, e.idx};
				idfs(e.to, v);
			}
		now--;
	}
	void dfs(int v, int p, int d){
		S[v]=d;
		for(edge e:G[v])
			if(e.to!=p)
				dfs(e.to, v, d+C[e.idx]);
	}
}

using namespace AS;

void InitAnya(int _N, int A[], int B[]){
	N=_N;
	for(int i=0; i<=N-2; i++){
		G[A[i]].push_back({B[i], i});
		G[B[i]].push_back({A[i], i});
	}
	idfs(0,-1);
	X=(int)V.size()*9;
}

void Anya(int _C[]){
	fill(S, S+N, 0);
	for(int i=0; i<=N-2; i++)
		C[i]=_C[i];
	dfs(0, -1, 0);
	for(int i=0; i<(int)V.size(); i++)
		for(int k=0; k<9; k++)
			Save(9*i+k, !!(S[V[i]]&(1<<k)));
	for(int i=0; i<=N-2; i++)
		Save(X+i, C[i]);
}
#include "Borislib.h"
#include <vector>
using namespace std;

namespace BS{
	struct edge{
		int to=-1, idx=-1;
		edge(int to, int idx): to(to), idx(idx){};
		edge(){};
	} P[500];
	vector<edge> G[500];
	int N, dep[500], now, X, bck, pos[500];
	void idfs(int v, int p){
		dep[v]=now++;
		if(dep[v]%10==0)	pos[v]=bck++;
		for(edge e:G[v])
			if(e.to!=p){
				P[e.to]={v, e.idx};
				idfs(e.to, v);
			}
		now--;
	}
}

using namespace BS;

void InitBoris(int _N, int A[], int B[]){
	N=_N;
	for(int i=0; i<=N-2; i++){
		G[A[i]].push_back({B[i], i});
		G[B[i]].push_back({A[i], i});
	}
	idfs(0,-1);
	X=bck*9;
}
int Boris(int city){
	int ans=0;
	while(dep[city]%10!=0){
		ans+=Ask(X+P[city].idx);
		city=P[city].to;
	}
	for(int k=0; k<9; k++)
		ans+=(Ask(pos[city]*9+k)<<k);
	return ans;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2484 KB Output is correct
2 Correct 0 ms 2484 KB Output is correct
3 Correct 0 ms 2484 KB Output is correct
4 Correct 0 ms 2484 KB Output is correct
5 Correct 6 ms 2484 KB Output is correct
6 Correct 3 ms 2484 KB Output is correct
7 Correct 3 ms 2484 KB Output is correct
8 Correct 6 ms 2484 KB Output is correct
9 Correct 3 ms 2484 KB Output is correct
10 Correct 0 ms 2484 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2484 KB Output is correct
2 Correct 3 ms 2484 KB Output is correct
3 Correct 9 ms 2484 KB Output is correct
4 Correct 6 ms 2484 KB Output is correct
5 Correct 6 ms 2484 KB Output is correct
6 Correct 6 ms 2484 KB Output is correct
7 Correct 6 ms 2484 KB Output is correct
8 Correct 6 ms 2484 KB Output is correct
9 Correct 6 ms 2484 KB Output is correct
10 Correct 6 ms 2484 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2484 KB Output is correct
2 Correct 12 ms 2484 KB Output is correct
3 Correct 16 ms 2484 KB Output is correct
4 Correct 16 ms 2484 KB Output is correct
5 Correct 19 ms 2484 KB Output is correct
6 Correct 16 ms 2484 KB Output is correct
7 Correct 16 ms 2484 KB Output is correct
8 Correct 16 ms 2484 KB Output is correct
9 Correct 16 ms 2484 KB Output is correct
10 Correct 16 ms 2484 KB Output is correct
11 Correct 16 ms 2484 KB Output is correct
12 Correct 12 ms 2484 KB Output is correct
13 Correct 16 ms 2484 KB Output is correct
14 Correct 19 ms 2484 KB Output is correct
15 Correct 16 ms 2484 KB Output is correct
16 Correct 12 ms 2484 KB Output is correct
17 Correct 16 ms 2484 KB Output is correct
18 Correct 16 ms 2484 KB Output is correct
19 Correct 12 ms 2484 KB Output is correct
20 Correct 16 ms 2484 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2484 KB Output is correct
2 Correct 9 ms 2484 KB Output is correct
3 Incorrect 0 ms 2484 KB Wrong Answer [1]
4 Halted 0 ms 0 KB -