Submission #300057

#	Time	Username	Problem	Language	Result	Execution time	Memory
300057		shrek12357	Pictionary (COCI18_pictionary)	C++14	14 / 140	126 ms	4672 KiB

pictionary

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

const int MAXN = 10005;

int sz[MAXN], par[MAXN];

int get(int x) {
	return x == par[x] ? x : par[x] = get(par[x]);
}

void unite(int a, int b) {
	a = get(a), b = get(b);
	if (a == b) {
		return;
	}
	if (sz[a] > sz[b]) {
		swap(a, b);
	}
	par[a] = b;
	sz[b] += sz[a];
}

int main() {
	int n, m, q;
	cin >> n >> m >> q;
	vector<pair<pair<int, int>, int>> queries;
	int ans[MAXN];
	for (int i = 0; i < MAXN; i++) {
		sz[i] = 1;
		par[i] = i;
		ans[i] = -1;
	}
	for (int i = 0; i < q; i++) {
		int a, b;
		cin >> a >> b;
		queries.push_back({ { a, b }, i });
	}
	for (int i = 0; i < m; i++) {
		for (int j = m - i; j <= n; j += (m - i)) {
			unite(m-i, j);
			for (auto k : queries) {
				if (ans[k.second] == -1) {
					if (get(k.first.first) == get(k.first.second)) {
						ans[k.second] = i + 1;
					}
				}
			}
		}
	}
	for (int i = 0; i < q; i++) {
		cout << ans[i] << endl;
	}
}

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