제출 #83926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83926		luciocf	Pictionary (COCI18_pictionary)	C++14	140 / 140	407 ms	15172 KiB

pictionary

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

typedef pair<int, int> pii;

int ini[maxn], fim[maxn], n, m, q;

int pai[maxn], sz[maxn];

pii query[maxn];

vector<int> v[maxn];

int Find(int x)
{
	if (pai[x] == x) return x;
	return pai[x] = Find(pai[x]);
}

void Join(int x, int y)
{
	x = Find(x), y = Find(y);
	if (x == y) return;

	if (sz[x] < sz[y]) swap(x, y);

	sz[x] += sz[y], pai[y] = x;
}

void init(void)
{
	for (int i = 1; i <= m; i++)
		v[i].clear();

	for (int i = 1; i <= n; i++)
		pai[i] = i, sz[i] = 1;
}

void solve(void)
{
	bool flag = 1;

	while (flag)
	{
		init();
		flag = 0;

		for (int i = 1; i <= q; i++)
		{
			if (ini[i] != fim[i])
			{
				int mid = (ini[i]+fim[i])/2;
				v[mid].push_back(i), flag = 1;
			}
		}

		for (int i = 1; i <= m; i++)
		{
			int d = m-i+1;
			for (int j = d; j <= n; j += d)
				Join(d, j);

			for (auto x: v[i])
			{
				if (Find(query[x].first) == Find(query[x].second)) fim[x] = i;
				else ini[x] = i+1;
			}
		}		
	}
}

int main(void)
{
	cin >> n >> m >> q;

	for (int i = 1; i <= q; i++)
	{
		cin >> query[i].first >> query[i].second;
		ini[i] = 1, fim[i] = m;
	}

	solve();

	for (int i = 1; i <= q; i++)
		cout << fim[i] << "\n";
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14