Submission #83158

#	Time	Username	Problem	Language	Result	Execution time	Memory
83158		fredbr	Pictionary (COCI18_pictionary)	C++17	42 / 140	1577 ms	1524 KiB

pictionary

#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;


template <int maxn>
struct Dsu {
    int n;
    int pai[maxn], w[maxn];

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

    bool find(int a, int b)
    {
        a = find(a), b= find(b);
        return a == b;
    }
    void join(int a, int b)
    {
        a = find(a), b = find(b);
    
        if (w[a] < w[b]) swap(a, b);

        pai[b] = a;
        w[a] += w[b];
    }

    void init(int n_) {
        n  = n_;
        fill(w+1, w+n+1, 1);
        iota(pai+1, pai+n+1, 1);
    }
};

int const maxn = 101010;

Dsu<maxn> dsu;

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);

    int n, m;
    int q;
    cin >> n >> m >> q;

    while (q--) {
        dsu.init(n);

        int a, b;
        cin >> a >> b;

        for (int k = m; k >= 1; k--) {
            for (int i = k*2; i <= n; i += k) {
                if (!dsu.find(k, i)) dsu.join(k, i);
            }
            if (dsu.find(a, b)) {
                cout << m-k+1 << "\n";
                break;
            }
        }
    }
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 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