oj.uz

Submission #83178

# Submission time Handle Problem Language Result Execution time Memory
83178 2018-11-05T22:29:40 Z fredbr Pictionary (COCI18_pictionary) C++17
0 / 140
 71 ms 10880 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;

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

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

    bool check(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 (a == b) return;
        if (w[a] < w[b]) swap(a, b);

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

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

struct Query
{
    int ff, ss, id;
};

int const maxn = 101010;

int n, m, q, lk;
Dsu<maxn> dsu;
vector<Query> qr[maxn], nqr[maxn];
vector<ii> qe, nq;
int res[maxn];

void clear()
{
    swap(qe, nq), swap(qr, nqr), lk = m+1, dsu.init(n);
}

void add(int k)
{
    while (lk > k) {
        --lk;
        for (int j = 2*lk; j <= n; j += lk)
            dsu.join(lk, j);
    }
}

void split(int l, int k, int r)
{
    bool isl = false, isr = false;
    for (auto p : qr[l]) {
        if (!dsu.check(p.ff, p.ss))
            isl = true, nqr[l].push_back(p);
        else
            isr = true, nqr[k].push_back(p);
    }
    if (!isr) nq.push_back({k, r});
    if (!isl) nq.push_back({l, k});
    qr[l].clear();
}

void add_ans(int l)
{
    for (auto p : qr[l]) {
        res[p.id] = l;
    }
}

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

    cin >> n >> m >> q;

    dsu.init(n);
    qe.push_back({1, m+1});

    for (int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b;

        qr[1].push_back({a, b, i});
    }
    
    lk = m+1;
    for (auto pp : qe) {

        int l, r;
        tie(l, r) = pp;
        
        add((l+r)/2);      

        if (l+1 < r) split(l, (l+r)/2, r);    
        else add_ans(l);

        if (pp == qe.back()) clear();
    }

    for (int i = 0; i < q; i++) cout << m-res[i]+1 << "\n";
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 5368 KB Output isn't correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 6148 KB Output isn't correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 8704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 9328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 9328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 9328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 9532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 9892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 10880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 10880 KB Output isn't correct
2 Halted 0 ms 0 KB -