oj.uz

답안 #218769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218769 2020-04-02T17:35:07 Z Vimmer Matching (COCI20_matching) C++14
58 / 110
 1470 ms 524292 KB 
#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001

using namespace std;

int x[N], y[N], a[N][2], b[N][2], n, xr[N], yr[N];

set <int> tx[N * 4], ty[N * 4], alone;

set <pair <int, int> > tx_del[N * 4], ty_del[N * 4];

vector <int > pshx[N * 4], pshy[N * 4];

vector <pair <int, int> > psh_delx[N * 4], psh_dely[N * 4];

bool mk[N], mkr[N][2];

vector <pair <int, int> > g;

void Pushx(int v, int tl, int tr)
{
    while (sz(pshx[v]) > 0)
    {
        int val = pshx[v].back();

        pshx[v].pop_back();

        tx[v].insert(val);

        if (tl != tr) {pshx[v + v].pb(val); pshx[v + v + 1].pb(val);}
    }
}
void Pushy(int v, int tl, int tr)
{
    while (sz(pshy[v]) > 0)
    {
        int val = pshy[v].back();

        pshy[v].pop_back();

        ty[v].insert(val);

        if (tl != tr) {pshy[v + v].pb(val); pshy[v + v + 1].pb(val);}
    }

}

void upd(int v, int tl, int tr, int l, int r, int val, bool f)
{
    if (r < tl || tr < l) return;

    if (l <= tl && tr <= r) {if (!f) pshx[v].pb(val); else pshy[v].pb(val); return;}

    int md = (tl + tr) >> 1;

    upd(v + v, tl, md, l, r, val, f);

    upd(v + v + 1, md + 1, tr, l, r, val, f);
}

void Push_delx(int v, int tl, int tr)
{
    while (sz(psh_delx[v]) > 0)
    {
        pair <int, int>  pt = psh_delx[v].back();

        psh_delx[v].pop_back();

        tx_del[v].insert(pt);

        if (tl != tr) {psh_delx[v + v].pb(pt); psh_delx[v + v + 1].pb(pt); }
    }
}

void Push_dely(int v, int tl, int tr)
{
    while (sz(psh_dely[v]) > 0)
    {
        pair <int, int>  pt = psh_dely[v].back();

        psh_dely[v].pop_back();

        ty_del[v].insert(pt);

        if (tl != tr) {psh_dely[v + v].pb(pt); psh_dely[v + v + 1].pb(pt); }
    }
}

void upd_del(int v, int tl, int tr, int l, int r, pair <int, int> val, bool f)
{
    if (tl > tr || l > r || r < tl || tr < l) return;

    if (l <= tl && tr <= r) {if (!f) psh_delx[v].pb(val); else psh_dely[v].pb(val); return;}

    int md = (tl + tr) >> 1;

    upd_del(v + v, tl, md, l, r, val, f);

    upd_del(v + v + 1, md + 1, tr, l, r, val, f);
}

bool good(int v, int tl, int tr, int pos, int l, int r, bool f)
{
    if (f) Pushy(v, tl, tr); else Pushx(v, tl, tr);

    if (tl == tr)
    {
        set <int> :: iterator it;

        if (f)
        {
            it = ty[v].lower_bound(l);

            return (it == ty[v].end() ? 1 : *it > r);
        }
        else
        {
            it = tx[v].lower_bound(l);

            return (it == tx[v].end() ? 1 : *it > r);
        }
    }
    else
    {
        int md = (tl + tr) >> 1;

        if (pos <= md) return good(v + v, tl, md, pos, l, r, f);

        return good(v + v + 1, md + 1, tr, pos, l, r, f);
    }
}

void add_remove(int fr, int sc, int nm)
{
    if (!mk[fr]) alone.insert(fr);

    if (!mk[sc]) alone.insert(sc);
}

void good_del(int v, int tl, int tr, int pos, int l, int r, bool f)
{
    if (f) Push_dely(v, tl, tr); else Push_delx(v, tl, tr);

    if (tl == tr)
    {
        set <pair <int, int> > :: iterator it;

        if (f)
        {
            it = ty_del[v].lower_bound({l, -1e9});

            while (it != ty_del[v].end() && (*it).F <= r) {add_remove(b[(*it).S][0], (*it).S, (*it).S); it++;}
        }
        else
        {
            it = tx_del[v].lower_bound({l, -1e9});

            while (it != tx_del[v].end() && (*it).F <= r) {add_remove(b[(*it).S][1], (*it).S, (*it).S); it++;}
        }
    }
    else
    {
        int md = (tl + tr) >> 1;

        if (pos <= md) good_del(v + v, tl, md, pos, l, r, f);
          else  good_del(v + v + 1, md + 1, tr, pos, l, r, f);
    }
}

bool gd(int fr, int sc)
{
    if (x[fr] == x[sc])
    {
        if (y[fr] > y[sc]) swap(fr, sc);

        return good(1, 1, N - 1, x[fr], y[fr], y[sc], 0);
    }
    else
    {
        if (x[fr] > x[sc]) swap(fr, sc);

        return good(1, 1, N - 1, y[fr], x[fr], x[sc], 1);
    }
}

void seacrh(int fr, int sc)
{
    if (x[fr] == x[sc])
    {
        if (y[fr] > y[sc]) swap(fr, sc);

        good_del(1, 1, N, x[fr], y[fr], y[sc], 0);
    }
    else
    {
        if (x[fr] > x[sc]) swap(fr, sc);

        good_del(1, 1, N, y[fr], x[fr], x[sc], 1);
    }
}

void add(int fr, int sc)
{
    if (x[fr] == x[sc])
    {
        g.pb({fr, sc});

        if (y[fr] > y[sc]) swap(fr, sc);

        upd(1, 1, N - 1, y[fr], y[sc], x[fr], 1);

        seacrh(fr, sc);
    }
    else
    {
        g.pb({fr, sc});

        if (x[fr] > x[sc]) swap(fr, sc);

        upd(1, 1, N - 1, x[fr], x[sc], y[fr], 0);

        seacrh(fr, sc);
    }
}

void clr(int x)
{
    mk[x] = 1;

    if (a[x][1] != -1) {if (!mk[a[x][1]])  alone.insert(a[x][1]); a[x][1] = a[a[x][1]][1] = -1;}

    if (a[x][0] != -1) {if (!mk[a[x][0]])  alone.insert(a[x][0]); a[x][0] = a[a[x][0]][0] = -1;}
}


void fnd()
{
    while (sz(alone) > 0)
    {
        int v = *alone.begin();

        alone.erase(alone.begin());

        if (mk[v]) continue;

        if (a[v][1] != -1 && gd(v, a[v][1])) {add(v, a[v][1]); clr(a[v][1]); clr(v); continue;}

        if (a[v][0] != -1 && gd(v, a[v][0])) {add(v, a[v][0]); clr(a[v][0]); clr(v); continue;}

        cout << "NE" << endl;

        exit(0);
    }

    for (int i = 0; i < n; i++)
    {
        if (mk[i]) continue;

        g.pb({i, a[i][0]});

        clr(a[i][0]);

        clr(i);
    }
}

void add_del(int fr, int sc)
{
    if (x[fr] == x[sc])
    {
        if (mkr[fr][0]) return;

        mkr[fr][0] = 1;

        mkr[sc][0] = 1;

        if (y[fr] > y[sc]) swap(fr, sc);

        upd_del(1, 1, N, y[fr], y[sc], {x[fr], fr }, 1);
    }
    else
    {
        if (mkr[fr][1]) return;

        mkr[fr][1] = 1;

        mkr[sc][1] = 1;

        if (x[fr] > x[sc]) swap(fr, sc);

        upd_del(1, 1, N, x[fr], x[sc], {y[fr], fr }, 0);
    }
}
int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    for (int i = 1; i < N; i++) xr[i] = yr[i] = -1;

    for (int i = 0; i < n; i++) {cin >> x[i] >> y[i]; a[i][0] = a[i][1] = -1;}

    for (int i = 0; i < n; i++)
        {
            int X = x[i], Y = y[i];

            if (xr[X] == -1) xr[X] = i; else {a[i][0] = xr[X]; a[xr[X]][0] = i;}

            if (yr[Y] == -1) yr[Y] = i; else {a[i][1] = yr[Y]; a[yr[Y]][1] = i;}
        }

    for (int i = 0; i < n; i++)
    {
        b[i][0] = a[i][0];

        b[i][1] = a[i][1];

        if (a[i][0] == a[i][1] && a[i][1] == -1) {cout << "NE" << endl; exit(0);}

        if (a[i][0] == -1 || a[i][1] == -1) alone.insert(i); else {add_del(i, a[i][0]); add_del(i, a[i][1]);}
    }

    fnd();

    if (sz(g) != n / 2) {cout << "NE" << endl; exit(0);}

    cout << "DA" << endl;

    for (auto it : g) cout << it.F + 1 << " " << it.S + 1 << endl;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 113912 KB Output is correct
2 Correct 70 ms 113912 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 113912 KB Output is correct
2 Correct 70 ms 113912 KB Output is correct
3 Correct 71 ms 113912 KB Output is correct
4 Correct 70 ms 113912 KB Output is correct
5 Correct 70 ms 113912 KB Output is correct
6 Correct 71 ms 113912 KB Output is correct
7 Correct 70 ms 113912 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 113912 KB Output is correct
2 Correct 70 ms 113912 KB Output is correct
3 Correct 71 ms 113912 KB Output is correct
4 Correct 70 ms 113912 KB Output is correct
5 Correct 70 ms 113912 KB Output is correct
6 Correct 71 ms 113912 KB Output is correct
7 Correct 70 ms 113912 KB Output is correct
8 Correct 71 ms 113912 KB Output is correct
9 Correct 69 ms 113912 KB Output is correct
10 Correct 70 ms 113912 KB Output is correct
11 Correct 70 ms 113856 KB Output is correct
12 Correct 69 ms 113912 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 113912 KB Output is correct
2 Correct 70 ms 113912 KB Output is correct
3 Correct 71 ms 113912 KB Output is correct
4 Correct 70 ms 113912 KB Output is correct
5 Correct 70 ms 113912 KB Output is correct
6 Correct 71 ms 113912 KB Output is correct
7 Correct 70 ms 113912 KB Output is correct
8 Correct 71 ms 113912 KB Output is correct
9 Correct 69 ms 113912 KB Output is correct
10 Correct 70 ms 113912 KB Output is correct
11 Correct 70 ms 113856 KB Output is correct
12 Correct 69 ms 113912 KB Output is correct
13 Correct 83 ms 114484 KB Output is correct
14 Correct 80 ms 114680 KB Output is correct
15 Correct 77 ms 114680 KB Output is correct
16 Correct 77 ms 114808 KB Output is correct
17 Correct 77 ms 114936 KB Output is correct
18 Correct 82 ms 114424 KB Output is correct
19 Correct 82 ms 114680 KB Output is correct
20 Correct 75 ms 114424 KB Output is correct
21 Correct 74 ms 114296 KB Output is correct
22 Correct 73 ms 114172 KB Output is correct
23 Correct 114 ms 125432 KB Output is correct
24 Correct 119 ms 124920 KB Output is correct

Subtask #5
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 113912 KB Output is correct
2 Correct 70 ms 113912 KB Output is correct
3 Correct 71 ms 113912 KB Output is correct
4 Correct 70 ms 113912 KB Output is correct
5 Correct 70 ms 113912 KB Output is correct
6 Correct 71 ms 113912 KB Output is correct
7 Correct 70 ms 113912 KB Output is correct
8 Correct 71 ms 113912 KB Output is correct
9 Correct 69 ms 113912 KB Output is correct
10 Correct 70 ms 113912 KB Output is correct
11 Correct 70 ms 113856 KB Output is correct
12 Correct 69 ms 113912 KB Output is correct
13 Correct 83 ms 114484 KB Output is correct
14 Correct 80 ms 114680 KB Output is correct
15 Correct 77 ms 114680 KB Output is correct
16 Correct 77 ms 114808 KB Output is correct
17 Correct 77 ms 114936 KB Output is correct
18 Correct 82 ms 114424 KB Output is correct
19 Correct 82 ms 114680 KB Output is correct
20 Correct 75 ms 114424 KB Output is correct
21 Correct 74 ms 114296 KB Output is correct
22 Correct 73 ms 114172 KB Output is correct
23 Correct 114 ms 125432 KB Output is correct
24 Correct 119 ms 124920 KB Output is correct
25 Correct 676 ms 203248 KB Output is correct
26 Correct 903 ms 248688 KB Output is correct
27 Correct 666 ms 189808 KB Output is correct
28 Correct 683 ms 203760 KB Output is correct
29 Correct 438 ms 171004 KB Output is correct
30 Correct 410 ms 166648 KB Output is correct
31 Correct 672 ms 222964 KB Output is correct
32 Correct 525 ms 191868 KB Output is correct
33 Correct 228 ms 131832 KB Output is correct
34 Correct 242 ms 134520 KB Output is correct
35 Correct 167 ms 121596 KB Output is correct
36 Correct 387 ms 137456 KB Output is correct
37 Runtime error 1470 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
38 Halted 0 ms 0 KB -