oj.uz

답안 #480494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
480494 2021-10-16T16:02:15 Z pure_mem Uzastopni (COCI15_uzastopni) C++14
160 / 160
 127 ms 7516 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")

#include <bits/stdc++.h>

#define X first
#define Y second
#define ll long long 
#define MP make_pair

using namespace std;

const int N = 1e4 + 1, M = 100;
const ll mod = 1e9 + 7;

int n, cl[N];
vector<int> g[N];
vector< pair<int, int> > ans[N]; 
bitset<M> dp[M], tmp;

void dfs(int v) {
	for(int to: g[v])
		dfs(to);
	for(int i = M - 1;i >= 0;i--)
		dp[i].reset();
	for(int to: g[v]) {
		for(pair<int, int> &nx: ans[to])
			dp[nx.X][nx.Y] = 1;
	}
	dp[cl[v]].reset();
	for(int i = M - 1;i >= 0;i--) {
		if(i == cl[v]) {
			if(i + 1 < M) dp[i] = dp[i + 1];
			dp[i][i] = 1;
		}
		else {
			tmp.reset();
			for(int j = M - 1;j >= i;j--) {
				if(i <= cl[v] && cl[v] <= j) continue;
				if(dp[i][j]) {
					if(j + 1 < M) tmp |= dp[j + 1];
					tmp[j] = 1; 
				}
			}
			dp[i] = tmp;
		}
		if(i > cl[v]) continue;
		for(int j = cl[v];j < M;j++)
			if(dp[i][j]) ans[v].push_back(MP(i, j));
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	cin >> n;
	for(int i = 1;i <= n;i++)
		cin >> cl[i], cl[i]--;
	for(int i = 1, x, y;i < n;i++) {
		cin >> x >> y;
		g[x].push_back(y);
	} 
	dfs(1);
	cout << ans[1].size();
	return 0;
}

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 106 ms 1264 KB Output is correct
12 Correct 98 ms 1228 KB Output is correct
13 Correct 101 ms 1256 KB Output is correct
14 Correct 119 ms 7516 KB Output is correct
15 Correct 127 ms 7492 KB Output is correct
16 Correct 119 ms 7484 KB Output is correct
17 Correct 97 ms 1296 KB Output is correct
18 Correct 106 ms 1268 KB Output is correct
19 Correct 114 ms 3580 KB Output is correct
20 Correct 118 ms 3524 KB Output is correct