oj.uz

답안 #39835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39835 2018-01-20T15:13:15 Z cheater2k Snowy Roads (JOI16_snowy) C++14
35 / 100
 22 ms 4188 KB 
#include "Anyalib.h"
#include <bits/stdc++.h>
using namespace std;

namespace A {
	const int N = 505;
	
	int n;
	int dep[N];
	int snowy[N];
	int w[N]; // for edges
	int mod;
	int where[N];
	vector< pair<int,int> > G[N];
	vector<int> cand;

	void dfs(int u) {
		for (auto e : G[u]) {
			int v = e.second;
			dep[v] = dep[u] + 1;
			dfs(v);
		}
	}

	void redfs(int u) {
		for (auto e : G[u]) {
			int id = e.first, v = e.second;
			snowy[v] = snowy[u] + w[id];
			redfs(v);
		}
	}

	void init() {
		dfs(0);
		vector<int> buf[10];
		for (int i = 0; i < n; ++i) {
			buf[dep[i] % 10].push_back(i);
		}
		mod = 0;
		for (int i = 1; i < 10; ++i) {
			if (buf[i].size() < buf[mod].size()) mod = i;
		}

		cand = buf[mod];
	}

	void solve() {
		for (int i = 0; i < n; ++i) snowy[i] = 0;
		redfs(0);

		// save the edges into bits from 0 to N - 2
		for (int i = 0; i < n - 1; ++i) {
			Save(i, w[i]);
		}

		// save the "snowy" values of the vertices that are candidates
		// each has 9 bits
		int cur = n - 1;
		for (int u : cand) {
			where[u] = cur;
			for (int i = 0; i < 9; ++i) {
				Save(cur, snowy[u] >> i & 1); ++cur;
			}
		}

		assert(cur < 1000);
	}
}

void InitAnya(int N , int A[] , int B[]) {
	A::n = N;
	for (int i = 0; i < N - 1; ++i) {
		A::G[A[i]].push_back(make_pair(i, B[i]));
	}
	A::init();
}

void Anya(int C[]) {
 	for (int i = 0; i < A::n - 1; ++i) {
  	A::w[i] = C[i];
  }
  A::solve();
}

#include "Borislib.h"
#include <bits/stdc++.h>
using namespace std;

namespace B {
	const int N = 505;
	
	int n;
	int par[N], topar[N];
	int dep[N];
	int w[N]; // for edges
	int mod;
	int where[N];
	vector< pair<int,int> > G[N];
	vector<int> cand;

	void dfs(int u) {
		for (auto e : G[u]) {
			int v = e.second;
			dep[v] = dep[u] + 1;
			dfs(v);
		}
	}

	void init() {
		dfs(0);
		vector<int> buf[10];
		for (int i = 0; i < n; ++i) {
			buf[dep[i] % 10].push_back(i);
		}
		mod = 0;
		for (int i = 1; i < 10; ++i) {
			if (buf[i].size() < buf[mod].size()) mod = i;
		}

		cand = buf[mod];

		// where
		int cur = n - 1;
		for (int u : cand) {
			where[u] = cur; cur += 9;
		}
	}

	int solve(int u) {
		int ret = 0;
		while(u && dep[u] % 10 != mod) {
			ret += Ask(topar[u]); u = par[u];
		}
		if (dep[u] % 10 == mod) {
			int start = where[u];
			int cur = 0;
			for (int i = start; i < start + 9; ++i) {
				cur += (1 << (i - start)) * Ask(i);
			}
			ret += cur;
		}
		return ret;
	}
}

void InitBoris(int N , int A[] , int B[]) {
  B::n = N;
	for (int i = 0; i < N - 1; ++i) {
		B::par[B[i]] = A[i];
		B::topar[B[i]] = i;
		B::G[A[i]].push_back(make_pair(i, B[i]));
	}
	B::init();
}

int Boris(int city) {
  return B::solve(city);
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4188 KB Output is correct
2 Incorrect 0 ms 4188 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 4188 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 4188 KB Output is correct
2 Correct 19 ms 4188 KB Output is correct
3 Correct 17 ms 4188 KB Output is correct
4 Correct 11 ms 4188 KB Output is correct
5 Correct 17 ms 4188 KB Output is correct
6 Correct 12 ms 4188 KB Output is correct
7 Correct 20 ms 4188 KB Output is correct
8 Correct 11 ms 4188 KB Output is correct
9 Correct 18 ms 4188 KB Output is correct
10 Correct 22 ms 4188 KB Output is correct
11 Correct 17 ms 4188 KB Output is correct
12 Correct 15 ms 4188 KB Output is correct
13 Correct 14 ms 4188 KB Output is correct
14 Correct 15 ms 4188 KB Output is correct
15 Correct 19 ms 4188 KB Output is correct
16 Correct 16 ms 4188 KB Output is correct
17 Correct 15 ms 4188 KB Output is correct
18 Correct 22 ms 4188 KB Output is correct
19 Correct 13 ms 4188 KB Output is correct
20 Correct 15 ms 4188 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 4188 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -