oj.uz

Submission #347765

# Submission time Handle Problem Language Result Execution time Memory
347765 2021-01-13T11:15:23 Z Harry464 Pictionary (COCI18_pictionary) C++14
140 / 140
 792 ms 7764 KB 
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;

typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n, m, q;
    cin >> n >> m >> q;
    vector <pair <ll, ll>> kv(q);
    for (int i = 0; i < q; i++)
        cin >> kv[i].first >> kv[i].second;
    vector <ll> lo(q, 1);
    vector <ll> hi(q, m + 1);
    vector <ll> rjesenja(q, -1);
    ll rjeseni = 0;
    while (rjeseni < q){
        vector <pair <ll,ll>> mids(q);
        for (int i = 0; i < q; i++)
            mids[i].first = (lo[i]+hi[i])/2, mids[i].second = i;
        sort(mids.begin(), mids.end());
        vector <ll> par(n+1);
        vector <ll> ranks(n+1);
        for (int i = 0; i < n; i++)
            par[i+1] = i + 1, ranks[i+1] = 0;
        ll slid = 0;
        for (int i = 0; i < m; i++){
            ll tren = 2*(m - i);
            while (tren <= n){
                ll part = tren;
                while (part != par[part])
                    part = par[part];
                ll pars = m - i;
                while (pars != par[pars])
                    pars = par[pars];
                if (pars == part){
                    tren += m - i;
                    continue;
                }
                if (ranks[pars] < ranks[part])
                    swap(pars,part);
                par[part] = pars;
                if (ranks[pars] == ranks[part]) ranks[pars]++;
                tren += m - i;
            }
            while (slid <= q && mids[slid].first == i + 1){
                ll upit = mids[slid].second;
                if (rjesenja[upit] != -1){
                    slid++;
                    continue;
                }
                ll para = kv[upit].first, parb = kv[upit].second;
                while (para != par[para])
                    para = par[para];
                while (parb != par[parb])
                    parb = par[parb];
                if (para == parb){
                    hi[upit] = i + 1;
                } else {
                   lo[upit] = i + 2;
                }
                if (lo[upit] >= hi[upit])
                    rjeseni++, rjesenja[upit] = lo[upit];
                slid++;
            }
        }
    }
    for (int i = 0; i < q; i++)
        cout << rjesenja[i] << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 620 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 1480 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 4292 KB Output is correct
2 Correct 210 ms 4492 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 6352 KB Output is correct
2 Correct 289 ms 5740 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 3436 KB Output is correct
2 Correct 227 ms 3412 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 3724 KB Output is correct
2 Correct 229 ms 3876 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 399 ms 5128 KB Output is correct
2 Correct 312 ms 3648 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 6360 KB Output is correct
2 Correct 529 ms 6440 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 7004 KB Output is correct
2 Correct 636 ms 6868 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 792 ms 7764 KB Output is correct
2 Correct 717 ms 7520 KB Output is correct