oj.uz

답안 #210174

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210174 2020-03-16T18:31:45 Z ZwariowanyMarcin Uzastopni (COCI15_uzastopni) C++14
160 / 160
 38 ms 11512 KB 
#include <bits/stdc++.h>
#define LL long long
#define LD long double
#define pb push_back
#define mp make_pair
#define ss(x) (int) x.size()
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl
#define rep2(i, j, n) for (LL i = j; i <= n; ++i)
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
#define boost cin.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()

using namespace std;

const int N = 1e4 + 10;
const int K = 110;
const int V = 100;

int n;
int a, b;
vector <int> v[N];
int prawo[N][K], lewo[N][K];
int c[N];

void dfs(int u) {
	vector <int> L, R;
	for (auto it : v[u]) {
		dfs(it);
		if (c[it] < c[u]) L.pb(it);
		if (c[it] > c[u]) R.pb(it);
	}
	prawo[u][c[u]] = 1;
	lewo[u][c[u]] = 1;
	sort(R.begin(), R.end(), [](int a, int b) {
		return c[a] < c[b];
	});
	sort(L.begin(), L.end(), [](int a, int b) {
		return c[a] > c[b];
	});
	for (auto it : R)
		rep(Left, c[u] + 1, V)
			rep(Right, Left, V)
				prawo[u][Right] |= (lewo[it][Left] & prawo[it][Right] & prawo[u][Left - 1]);
	
	for (auto it : L)
		rep(Left, 1, c[u] - 1)
			rep(Right, Left, c[u] - 1)
				lewo[u][Left] |= (lewo[it][Left] && prawo[it][Right] & lewo[u][Right + 1]);
}

int main() {
	scanf ("%d", &n);
	rep(i, 1, n) scanf ("%d", c + i);
	rep(i, 1, n - 1) {
		scanf ("%d%d", &a, &b);
		v[a].pb(b);
	}
	dfs(1);
	int L = 0;
	int R = 0;
	rep(i, 1, V) {
		L += lewo[1][i];
		R += prawo[1][i];
	}
	printf ("%d\n", L * R);
		
	return 0;
}

Compilation message

uzastopni.cpp: In function 'int main()':
uzastopni.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d", &n);
  ~~~~~~^~~~~~~~~~
uzastopni.cpp:56:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i, 1, n) scanf ("%d", c + i);
               ~~~~~~^~~~~~~~~~~~~
uzastopni.cpp:58:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d%d", &a, &b);
   ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
160.0 / 160.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 6 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 38 ms 9464 KB Output is correct
12 Correct 38 ms 9464 KB Output is correct
13 Correct 36 ms 9464 KB Output is correct
14 Correct 34 ms 11512 KB Output is correct
15 Correct 33 ms 11512 KB Output is correct
16 Correct 34 ms 11512 KB Output is correct
17 Correct 36 ms 9468 KB Output is correct
18 Correct 36 ms 9468 KB Output is correct
19 Correct 27 ms 9336 KB Output is correct
20 Correct 27 ms 9336 KB Output is correct