Submission #145331

#	Time	Username	Problem	Language	Result	Execution time	Memory
145331		arayi	Ili (COI17_ili)	C++17	100 / 100	3738 ms	61176 KiB

ili

#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;

lli gcd(lli a, lli b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}
lli cg(lli n) {
	return n ^ (n >> 1);
}
lli SUM(lli a)
{
	return (a * (a + 1) / 2);
}
bool CAN(int x, int y, int n, int m)
{
	if (x >= 0 && y >= 0 && x < n && y < m)
	{
		return true;
	}
	return false;
}
double her(double x1, double y1, double x2, double y2)
{
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b)
{
	int p = 0;
	string c;
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	if (b.length() < a.length())
	{
		for (int i = b.length(); i < a.length(); i++)
		{
			b += "0";
		}
	}
	else
	{
		for (int i = a.length(); i < b.length(); i++)
		{
			a += "0";
		}
	}

	a += "0", b += "0";
	for (int i = 0; i < a.length(); i++)
	{
		c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
		p = (a[i] + b[i] - '0' - '0' + p) / 10;
	}
	if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
	reverse(c.begin(), c.end());
	return c;
}
string strmin(string a, string b)
{
	if (a.length() > b.length()) return b;
	if (b.length() > a.length()) return a;
	for (int i = 0; i < a.length(); i++)
	{
		if (a[i] > b[i]) return b;
		if (b[i] > a[i]) return a;
	}
	return a;
}

char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };



const int N = 1e6 + 30;
const lli mod = 1000000007;
int n, m, k;
string s;
bitset <10010> a[10100], zro, sm;
vector <int> p[N], p1[N];
queue <int> fp;
bool col[N];
int main()
{
	fastio;
	cin >> n >> m;
	cin >> s;
	for (int i = 0; i < m; i++)
	{
		char A, B;
		int a1, b1;
		cin >> A >> a1;
		cin >> B >> b1;
		if (A == 'x') a[i + 1][a1] = 1, p1[a1].PB(i + 1);
		else a[i + 1] = (a[i + 1] | a[a1]), p[a1].PB(i + 1);
		if (B == 'x') a[i + 1][b1] = 1, p1[b1].PB(i + 1);
		else a[i + 1] = (a[i + 1] | a[b1]), p[b1].PB(i + 1);;
		if (s[i] == '0') zro = (zro | a[i + 1]);
	}
	for (int i = 0; i < m; i++)
	{
		if (s[i] == '?' && (a[i + 1] & zro) == a[i + 1])
			s[i] = '0';
		else if(s[i] == '?')
		{
			sm = (a[i + 1] | zro);
			for (int j = 1; j <= n; j++)
			{
				if (!sm[j])
				{
					for (auto q : p1[j])
					{
						if (!col[q])
							fp.push(q), col[q] = true;
					}
				}
			}
			while (!fp.empty())
			{
				k = fp.front();
				fp.pop();
				for (auto q : p[k]) if (!col[q]) col[q] = true, fp.push(q);
			}
			for (int j = 0; j < m; j++)
			{
				if (s[j] == '1' && !col[j + 1])
				{
					s[i] = '1';
				}
			}
			memset(col, 0, sizeof(col));
		}
	}
	cout << s;
	return 0;
}

Compilation message (stderr)

ili.cpp: In function 'std::__cxx11::string strsum(std::__cxx11::string, std::__cxx11::string)':
ili.cpp:58:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = b.length(); i < a.length(); i++)
                            ~~^~~~~~~~~~~~
ili.cpp:65:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = a.length(); i < b.length(); i++)
                            ~~^~~~~~~~~~~~
ili.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~
ili.cpp: In function 'std::__cxx11::string strmin(std::__cxx11::string, std::__cxx11::string)':
ili.cpp:85:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 42 / 42
• Subtask 3: 51 / 51