oj.uz

Submission #87832

# Submission time Handle Problem Language Result Execution time Memory
87832 2018-12-02T17:23:22 Z jasony123123 Usmjeri (COCI17_usmjeri) C++11
140 / 140
 634 ms 69568 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

typedef pair <int, int> pii;

const int MAXN = 300005;
const int LOG = 19;
const int MOD = 1000000007;

int N, M;
vector <int> E[MAXN];
vector <pii> adj[MAXN];
int anc[MAXN][LOG];
int depth[MAXN];
int high[MAXN];
int clr[MAXN];

void load() {
	scanf("%d%d", &N, &M);
	for (int i = 1; i < N; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		E[a].push_back(b);
		E[b].push_back(a);
	}
}

void init(int x, int p) {
	anc[x][0] = p;
	depth[x] = depth[p] + 1;
	for (auto it : E[x])
		if (it != p)
			init(it, x);
}

int lca(int x, int y) {
	if (depth[x] < depth[y])
		swap(x, y);
	int diff = depth[x] - depth[y];
	for (int i = LOG - 1; i >= 0; i--)
		if (diff >> i & 1)
			x = anc[x][i];
	if (x == y)
		return x;
	for (int i = LOG - 1; i >= 0; i--)
		if (anc[x][i] != anc[y][i]) {
			x = anc[x][i];
			y = anc[y][i];
		}
	return anc[x][0];
}

void add_edge(int a, int b, int c) {
	adj[a].push_back({b, c});
	adj[b].push_back({a, c});
}

int connect(int x, int p) {
	for (auto it : E[x])
		if (it != p) {
			int tmp = connect(it, x);
			high[x] = min(high[x], tmp);
			if (tmp < depth[x])
				add_edge(it, x, 0);
		}
	return high[x];
}

bool dfs(int x, int c) {
	if (clr[x] != -1)
		return clr[x] == c;
	clr[x] = c;
	for (auto it : adj[x])
		if (!dfs(it.first, c ^ it.second))
			return false;
	return true;
}

int solve() {
	memset(clr, -1, sizeof clr);
	
	init(1, 0);
	
	for (int j = 1; j < LOG; j++)
		for (int i = 1; i <= N; i++)
			anc[i][j] = anc[anc[i][j - 1]][j - 1];
	
	for (int i = 1; i <= N; i++)
		high[i] = depth[i];
			
	while (M--) {
		int a, b;
		scanf("%d%d", &a, &b);
		int c = lca(a, b);
		high[a] = min(high[a], depth[c]);
		high[b] = min(high[b], depth[c]);
		if (a != c && b != c)
			add_edge(a, b, 1);
	}
	
	connect(1, 0);
	
	int sol = 1;
	for (int i = 2; i <= N; i++)
		if (clr[i] == -1) {
			if (!dfs(i, 0))
				return 0;
			sol = 2 * sol % MOD;
		}
	
	return sol;
}

int main() {
	load();
	printf("%d\n", solve());
	return 0;
}

Compilation message

usmjeri.cpp: In function 'void load()':
usmjeri.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
usmjeri.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~
usmjeri.cpp: In function 'int solve()':
usmjeri.cpp:96:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 34296 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 69568 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 69568 KB Output is correct
2 Correct 18 ms 69568 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 69568 KB Output is correct
2 Correct 18 ms 69568 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 69568 KB Output is correct
2 Correct 20 ms 69568 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 69568 KB Output is correct
2 Correct 20 ms 69568 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 69568 KB Output is correct
2 Correct 524 ms 69568 KB Output is correct
3 Correct 323 ms 69568 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 592 ms 69568 KB Output is correct
2 Correct 583 ms 69568 KB Output is correct
3 Correct 464 ms 69568 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 69568 KB Output is correct
2 Correct 634 ms 69568 KB Output is correct
3 Correct 471 ms 69568 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 593 ms 69568 KB Output is correct
2 Correct 521 ms 69568 KB Output is correct
3 Correct 336 ms 69568 KB Output is correct