oj.uz

답안 #255935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255935 2020-08-02T06:06:21 Z IgorI Collapse (JOI18_collapse) C++17
100 / 100
 12656 ms 40800 KB 
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;

const int N = 302020;

int n;

int cuts[N];
int cutssz;
int root[N], sz[N];
int comp;

void Reset()
{
    for (int i = 0; i < n; i++) root[i] = i, sz[i] = 1;
    cutssz = 0;
    comp = n;
}

int Root(int x)
{
    if (x == root[x]) return root[x];
    return Root(root[x]);
}

void Merge(int v, int u)
{
    v = Root(v), u = Root(u);
    if (v == u) return;
    comp--;
    if (sz[v] < sz[u])
    {
        cuts[cutssz++] = v;
        sz[u] += sz[v];
        root[v] = u;
    }
    else
    {
        cuts[cutssz++] = u;
        sz[v] += sz[u];
        root[u] = v;
    }
}

void Cut()
{
    cutssz--;
    int x = cuts[cutssz];
    sz[root[x]] -= sz[x];
    root[x] = x;
    comp++;
}

int v[N], u[N], L[N], R[N], ans[N], z[N], it[N];

vector<pair<int, pair<int, int> > > on_left[N];
vector<pair<int, pair<int, int> > > on_right[N];

void solve(int le, int ri, int gap_le, int gap_ri)
{
    if (le + 1 == ri)
    {
        if (v[le] == -1)
        {
            int ss = cutssz;
            for (int i = gap_le + 1; i <= z[le]; i++)
            {
                for (auto e : on_left[i])
                {
                    if (e.second.first <= it[le] && it[le] < e.second.second)
                    {
                        Merge(e.first, i);
                    }
                }
            }
            for (int i = gap_ri - 1; i > z[le]; i--)
            {
                for (auto e : on_right[i])
                {
                    if (e.second.first <= it[le] && it[le] < e.second.second)
                    {
                        Merge(i, e.first);
                    }
                }
            }
            ans[le] = comp;
            while (cutssz != ss) Cut();
        }
        return;
    }
    int mi = (le + ri) / 2;
    int ss = cutssz;
    for (int i = le; i < mi; i++)
    {
        if (v[i] != -1 && R[i] != -1 && ri <= R[i]) Merge(v[i], u[i]);
    }
    solve(mi, ri, gap_le, gap_ri);
    while (cutssz != ss) Cut();
    for (int i = ri - 1; i >= mi; i--)
    {
        if (v[i] != -1 && L[i] != -1 && L[i] < le) Merge(v[i], u[i]);
    }
    solve(le, mi, gap_le, gap_ri);
    while (cutssz != ss) Cut();
}

void DCP(vector<int> x, vector<int> y, vector<pair<int, int> > &t, vector<int> p, int gap_le, int gap_ri)
{
    Reset();
    map<pair<int, int>, int> open;
    int T = 0;
    int j = 0;
    for (int i = 0; i < x.size(); i++)
    {
        if (y[i] <= gap_le || gap_ri <= x[i])
        {
            if (open.find({x[i], y[i]}) == open.end())
            {
                open[{x[i], y[i]}] = T;
                v[T] = x[i];
                u[T] = y[i];
                T++;
            }
            else
            {
                int z = open[{x[i], y[i]}];
                L[T] = z;
                L[z] = -1;
                R[T] = -1;
                R[z] = T;
                v[T] = x[i];
                u[T] = y[i];
                open.erase({x[i], y[i]});
                T++;
            }
        }
        while (j < t.size() && i == t[j].first)
        {
            v[T] = -1, u[T] = -1;
            it[T] = t[j].first;
            z[T] = p[j];
            T++;
            j++;
        }
    }
    solve(0, T, gap_le, gap_ri);
    j = 0;
    for (int i = 0; i < T; i++)
    {
        if (v[i] == -1)
        {
            t[j].first = ans[i];
            j++;
        }
    }
}

void solve_queries(int gap_le, int gap_ri, vector<int> x, vector<int> y, vector<int> w, vector<int> p, vector<int> &answer)
{
    vector<pair<int, int> > times;
    for (int i = 0; i < w.size(); i++)
    {
        if (gap_le <= p[i] && p[i] < gap_ri)
        {
            times.push_back({w[i], i});
        }
    }
    sort(times.begin(), times.end());
    vector<int> mp(times.size());
    for (int i = 0; i < times.size(); i++)
    {
        mp[i] = p[times[i].second];
    }
    if (times.size())
    DCP(x, y, times, mp, gap_le, gap_ri);
    for (int i = 0; i < times.size(); i++)
    {
        answer[times[i].second] = times[i].first;
    }
}

const int K = 3000;

vector<int> simulateCollapse(int n0, vector<int> t, vector<int> x, vector<int> y, vector<int> w, vector<int> p)
{
    n = n0;
    int c = t.size();
    int q = w.size();
    set<pair<int, int> > s;
    for (int i = 0; i < c; i++)
    {
        if (x[i] > y[i]) swap(x[i], y[i]);
        if (s.find({x[i], y[i]}) == s.end())
        {
            s.insert({x[i], y[i]});
        }
        else
        {
            s.erase({x[i], y[i]});
        }
    }
    while (s.size())
    {
        pair<int, int> d = *(s.begin());
        s.erase(s.begin());
        x.push_back(d.first);
        y.push_back(d.second);
        c++;
    }
    map<pair<int, int>, int> mm;
    for (int i = 0; i < c; i++)
    {
        if (mm.find({x[i], y[i]}) == mm.end())
        {
            mm[{x[i], y[i]}] = i;
        }
        else
        {
            int z = mm[{x[i], y[i]}];
            mm.erase({x[i], y[i]});
            on_left[y[i]].push_back({x[i], {z, i}});
            on_right[x[i]].push_back({y[i], {z, i}});
        }
    }
    vector<int> answer(q);
    vector<int> pleft(n);
    vector<int> pright(n);
    for (int i = 1; i < n; i++)
    {
        pleft[i] = pleft[i - 1] + on_left[i].size();
    }
    for (int i = n - 2; i >= 0; i--)
    {
        pright[i] = pright[i + 1] + on_right[i].size();
    }
    vector<pair<int, int> > e;
    int GL = 0;
    while (GL != n - 1)
    {
        int okay = GL + 1;
        for (int HF = GL + 1; HF < n; HF++)
        {
            if (pleft[HF - 1] - pleft[GL] <= K && pright[GL + 1] - pright[HF] <= K)
                okay = HF;
        }
        e.push_back({GL, okay});
        GL = okay;
    }
    for (auto ee : e)
    {
        solve_queries(ee.first, ee.second, x, y, w, p, answer);
    }
    return answer;
}

Compilation message

collapse.cpp: In function 'void DCP(std::vector<int>, std::vector<int>, std::vector<std::pair<int, int> >&, std::vector<int>, int, int)':
collapse.cpp:118:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < x.size(); i++)
                     ~~^~~~~~~~~~
collapse.cpp:142:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (j < t.size() && i == t[j].first)
                ~~^~~~~~~~~~
collapse.cpp: In function 'void solve_queries(int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>&)':
collapse.cpp:166:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < w.size(); i++)
                     ~~^~~~~~~~~~
collapse.cpp:175:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < times.size(); i++)
                     ~~^~~~~~~~~~~~~~
collapse.cpp:181:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < times.size(); i++)
                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15104 KB Output is correct
2 Correct 13 ms 14848 KB Output is correct
3 Correct 12 ms 14848 KB Output is correct
4 Correct 15 ms 14848 KB Output is correct
5 Correct 23 ms 15232 KB Output is correct
6 Correct 64 ms 15616 KB Output is correct
7 Correct 42 ms 14976 KB Output is correct
8 Correct 33 ms 14976 KB Output is correct
9 Correct 143 ms 15232 KB Output is correct
10 Correct 158 ms 15360 KB Output is correct
11 Correct 168 ms 15768 KB Output is correct
12 Correct 141 ms 15800 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 20852 KB Output is correct
2 Correct 54 ms 20844 KB Output is correct
3 Correct 152 ms 28480 KB Output is correct
4 Correct 64 ms 20844 KB Output is correct
5 Correct 379 ms 28496 KB Output is correct
6 Correct 846 ms 22352 KB Output is correct
7 Correct 1084 ms 39624 KB Output is correct
8 Correct 867 ms 28944 KB Output is correct
9 Correct 8116 ms 22568 KB Output is correct
10 Correct 8212 ms 22520 KB Output is correct
11 Correct 10164 ms 22924 KB Output is correct
12 Correct 2658 ms 31312 KB Output is correct
13 Correct 6898 ms 34288 KB Output is correct
14 Correct 6725 ms 39132 KB Output is correct
15 Correct 2430 ms 39140 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 20844 KB Output is correct
2 Correct 76 ms 20844 KB Output is correct
3 Correct 71 ms 20800 KB Output is correct
4 Correct 74 ms 20844 KB Output is correct
5 Correct 277 ms 20848 KB Output is correct
6 Correct 889 ms 20296 KB Output is correct
7 Correct 3436 ms 32624 KB Output is correct
8 Correct 6601 ms 37916 KB Output is correct
9 Correct 9100 ms 22464 KB Output is correct
10 Correct 12656 ms 22700 KB Output is correct
11 Correct 7656 ms 39880 KB Output is correct
12 Correct 10583 ms 40168 KB Output is correct
13 Correct 8273 ms 39848 KB Output is correct
14 Correct 10856 ms 40428 KB Output is correct
15 Correct 8000 ms 40072 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15104 KB Output is correct
2 Correct 13 ms 14848 KB Output is correct
3 Correct 12 ms 14848 KB Output is correct
4 Correct 15 ms 14848 KB Output is correct
5 Correct 23 ms 15232 KB Output is correct
6 Correct 64 ms 15616 KB Output is correct
7 Correct 42 ms 14976 KB Output is correct
8 Correct 33 ms 14976 KB Output is correct
9 Correct 143 ms 15232 KB Output is correct
10 Correct 158 ms 15360 KB Output is correct
11 Correct 168 ms 15768 KB Output is correct
12 Correct 141 ms 15800 KB Output is correct
13 Correct 42 ms 20852 KB Output is correct
14 Correct 54 ms 20844 KB Output is correct
15 Correct 152 ms 28480 KB Output is correct
16 Correct 64 ms 20844 KB Output is correct
17 Correct 379 ms 28496 KB Output is correct
18 Correct 846 ms 22352 KB Output is correct
19 Correct 1084 ms 39624 KB Output is correct
20 Correct 867 ms 28944 KB Output is correct
21 Correct 8116 ms 22568 KB Output is correct
22 Correct 8212 ms 22520 KB Output is correct
23 Correct 10164 ms 22924 KB Output is correct
24 Correct 2658 ms 31312 KB Output is correct
25 Correct 6898 ms 34288 KB Output is correct
26 Correct 6725 ms 39132 KB Output is correct
27 Correct 2430 ms 39140 KB Output is correct
28 Correct 49 ms 20844 KB Output is correct
29 Correct 76 ms 20844 KB Output is correct
30 Correct 71 ms 20800 KB Output is correct
31 Correct 74 ms 20844 KB Output is correct
32 Correct 277 ms 20848 KB Output is correct
33 Correct 889 ms 20296 KB Output is correct
34 Correct 3436 ms 32624 KB Output is correct
35 Correct 6601 ms 37916 KB Output is correct
36 Correct 9100 ms 22464 KB Output is correct
37 Correct 12656 ms 22700 KB Output is correct
38 Correct 7656 ms 39880 KB Output is correct
39 Correct 10583 ms 40168 KB Output is correct
40 Correct 8273 ms 39848 KB Output is correct
41 Correct 10856 ms 40428 KB Output is correct
42 Correct 8000 ms 40072 KB Output is correct
43 Correct 977 ms 26048 KB Output is correct
44 Correct 5065 ms 37648 KB Output is correct
45 Correct 1372 ms 26244 KB Output is correct
46 Correct 6808 ms 38100 KB Output is correct
47 Correct 9117 ms 22556 KB Output is correct
48 Correct 8643 ms 22836 KB Output is correct
49 Correct 11317 ms 22948 KB Output is correct
50 Correct 7420 ms 21984 KB Output is correct
51 Correct 2964 ms 28204 KB Output is correct
52 Correct 4807 ms 30692 KB Output is correct
53 Correct 4033 ms 30388 KB Output is correct
54 Correct 6183 ms 32872 KB Output is correct
55 Correct 6069 ms 32616 KB Output is correct
56 Correct 6633 ms 34944 KB Output is correct
57 Correct 7222 ms 37480 KB Output is correct
58 Correct 9329 ms 37888 KB Output is correct
59 Correct 7477 ms 40192 KB Output is correct
60 Correct 10506 ms 40800 KB Output is correct