제출 #600183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
600183		luanaamorim	Pictionary (COCI18_pictionary)	C++14	140 / 140	201 ms	3336 KiB

pictionary

#include <bits/stdc++.h>
#define MAX (int)(1e6)
#define INF (int)(1e8)

using namespace std;

int n, m, q, a, b, pai[MAX], t, tam[MAX], tempo[MAX];

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

void join(int a, int b)
{
    int A = find(a), B = find(b);
    // cout << a << ' ' << b << endl;
    if (A==B) return;
    if (tam[A] > tam[B]) swap(A, B);
    tam[B] += tam[A];
    pai[A] = B;
    tempo[A] = t;
}

int query(int a, int b)
{
    int resp = 1;
    while (a != b)
    {
        // cout << a << ' ' << b << endl;
        // cout << tempo[a] << ' ' << tempo[b] << endl;
        if (tempo[a] < tempo[b]) resp = max(resp, tempo[a]), a = pai[a];
        else resp = max(resp, tempo[b]), b = pai[b];
    }
    return resp;
}

int main()
{
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
        tempo[i] = INF, pai[i] = i, tam[i] = 1;

    for (int i = m; i >= 1; i--)
    {
        ++t;
        for (int j = i; j <= n; j += i)
            join(i, j);
    }

    // for (int i = 1; i <= n; i++)
    //     cout << tempo[i] << endl;
        
    while (q--)
    {
        cin >> a >> b;
        cout << query(a, b) << endl;
    }
}

• 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