oj.uz

Submission #249007

# Submission time Handle Problem Language Result Execution time Memory
249007 2020-07-14T03:29:40 Z luciocf Ili (COI17_ili) C++14
0 / 100
 1 ms 896 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int maxn = 2e4+10;
 
int n, m;
int a[maxn], b[maxn];
int l[maxn], r[maxn];
 
bool mark[maxn];

vector<int> grafo[maxn];
 
void dfs(int u)
{
	mark[u] = 1;
	a[u] = 0;
 
	if (!mark[l[u]]) dfs(l[u]);
	if (!mark[r[u]]) dfs(r[u]);
}
 
void do_1(void)
{
	while (true)
	{
		for (int i = n+1; i <= n+m; i++)
			if (a[i] == 0 && !mark[i])
				dfs(i);

		bool novo = 0;

		for (int i = n+1; i <= n+m; i++)
		{
			if (a[i] == -1 && a[l[i]] == 0 && a[r[i]] == 0)
				a[i] = 0;
			
			if (a[i] == 0 && !mark[i])
			{
				novo = 1;
				break;
			}
		}

		if (!novo) break; 
	}
}
 
bool dfs2(int u)
{
	if (b[u] == 1) return false;
	mark[u] = 1, b[u] = 0;

	if (!mark[l[u]] && !dfs2(l[u])) return false;
	if (!mark[r[u]] && !dfs2(r[u])) return false;

	for (auto v: grafo[u])
	{
		if (b[v] == 1)
		{
			if (l[v] == u && b[r[v]] == 0) return false;
			else if (r[v] == u && b[l[v]] == 0) return false;
		}
		else if (b[v] == -1)
		{
			if ((l[v] == u && b[r[v]] == 0) || (r[v] == u && b[l[v]] == 0))
			{
				b[v] = 0;
				if (!mark[b[v]] && !dfs2(b[v])) return false;
			}
		}
	}

	return true;
}
 
bool can(int u)
{
	memset(mark, 0, sizeof mark);
	for (int i = 1; i <= n+m; i++)
		b[i] = a[i];
	b[u] = 0;

	return dfs2(u);
}
 
int main(void)
{
	scanf("%d %d", &n, &m);
 
	memset(a, -1, sizeof a);
 
	for (int i = 1; i <= m; i++)
	{
		char c;
		scanf(" %c", &c);
 
		if (c == '1') a[n+i] = 1;
		else if (c == '0') a[n+i] = 0;
	}
 
	for (int i = 1; i <= m; i++)
	{
		char c1, c2;
 
		scanf(" %c %c", &c1, &c2);
 
		if (c1 == 'x')
		{
			l[n+i] = (int)(c2-'0');
			grafo[(int)(c2-'0')].push_back(n+i);
		}
		else
		{
			l[n+i] = n+(int)(c2-'0');
			grafo[n+(int)(c2-'0')].push_back(n+i);
		}
 
		scanf(" %c %c", &c1, &c2);
 
		if (c1 == 'x')
		{
			r[n+i] = (int)(c2-'0');
			grafo[(int)(c2-'0')].push_back(n+i);
		}
		else
		{
			r[n+i] = n+(int)(c2-'0');
			grafo[n+(int)(c2-'0')].push_back(n+i);
		}
	}
 
	do_1();
 
	for (int i = 1; i <= n+m; i++)
	{
		if (a[i] != -1) continue;
 
		if (!can(i))
			a[i] = 1;
	}
 
	for (int i = n+1; i <= n+m; i++)
	{
		if (a[i] == -1) printf("?");
		else if (a[i] == 0) printf("0");
		else printf("1");
	}
	printf("\n");
}

Compilation message

ili.cpp: In function 'int main()':
ili.cpp:90:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
ili.cpp:97:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c", &c);
   ~~~~~^~~~~~~~~~~
ili.cpp:107:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c %c", &c1, &c2);
   ~~~~~^~~~~~~~~~~~~~~~~~~~
ili.cpp:120:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %c %c", &c1, &c2);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Incorrect 1 ms 896 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Incorrect 1 ms 896 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Incorrect 1 ms 896 KB Output isn't correct
4 Halted 0 ms 0 KB -