oj.uz

답안 #218619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218619 2020-04-02T11:55:07 Z Vimmer Matching (COCI20_matching) C++14
58 / 110
 2500 ms 68344 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define M ll(998244353)

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;

//typedef tree<int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> oredered_set;

int x[N], y[N], a[N][2], n;

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

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

bool mk[N];

queue <pair <int, int> > qr;

vector <pair <int, int> > vert, gorz;

void Push(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);}
    }

    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)
{
    Push(v, tl, tr);

    if (tl > tr || l > r || r < tl || tr < l) return;

    if (l <= tl && tr <= r) {if (!f) pshx[v].pb(val); else pshy[v].pb(val); Push(v, tl, tr); 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);
}

bool good(int v, int tl, int tr, int pos, int l, int r, bool f)
{
    Push(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);
    }
}
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 add(int fr, int sc)
{
    if (x[fr] == x[sc])
    {
        gorz.pb({fr, sc});

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

        upd(1, 1, N - 1, y[fr], y[sc], x[fr], 1);
    }
    else
    {
        vert.pb({fr, sc});

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

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

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

    if (a[x][1] != -1) a[x][1] = a[a[x][1]][1] = -1;

    if (a[x][0] != -1) a[x][0] = a[a[x][0]][0] = -1;
}


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

        if (a[i][1] == -1 && a[i][0] == -1) continue;

        if (a[i][1] != -1 && a[i][0] != -1) continue;

        if (a[i][1] != -1) {qr.push({a[i][1], i}); a[i][1] = a[a[i][1]][1] = -1; return;}

        if (a[i][0] != -1) {qr.push({a[i][0], i}); a[i][0] = a[a[i][0]][0] = -1; return;}
    }

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

        if (a[i][1] == -1 && a[i][0] == -1) continue;

        bool f0 = gd(i, a[i][0]);

        bool f1 = gd(i, a[i][1]);

        if (f0 && f1) continue;

        if (!f0 && !f1) continue;

        if (f0)
        {
            qr.push({i, a[i][0]});

            a[i][0] = a[a[i][0]][0] = -1;

            return;
        }
        else
        {
            qr.push({i, a[i][1]});

            a[i][1] = a[a[i][1]][1] = -1;

            return;
        }
    }

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

        if (a[i][1] == -1 && a[i][0] == -1) continue;
        if (!gd(i, a[i][0]) && !gd(i, a[i][1])) continue;

        if (!gd(i, a[i][0]))
        {
            qr.push({i, a[i][1]});

            a[i][1] = a[a[i][1]][1] = -1;

            return;
        }
        else
        {
            qr.push({i, a[i][0]});

            a[i][0] = a[a[i][0]][0] = -1;

            return;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    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++)
        for (int j = i + 1; j < n; j++)
          if (x[i] == x[j]) {a[i][0] = j; a[j][0] = i;}
            else if (y[i] == y[j]) {a[i][1] = j; a[j][1] = i;}

    fnd();

    while (sz(qr) > 0)
    {
        int fr = qr.front().F;

        int sc = qr.front().S;

        qr.pop();

        if (gd(fr, sc))
        {
            clr(fr);

            clr(sc);

            add(fr, sc);
        }

        fnd();
    }

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

    cout << "DA" << endl;

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

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56824 KB Output is correct
2 Correct 37 ms 56704 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56824 KB Output is correct
2 Correct 37 ms 56704 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 37 ms 56576 KB Output is correct
5 Correct 37 ms 56824 KB Output is correct
6 Correct 37 ms 56696 KB Output is correct
7 Correct 38 ms 56832 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56824 KB Output is correct
2 Correct 37 ms 56704 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 37 ms 56576 KB Output is correct
5 Correct 37 ms 56824 KB Output is correct
6 Correct 37 ms 56696 KB Output is correct
7 Correct 38 ms 56832 KB Output is correct
8 Correct 37 ms 56824 KB Output is correct
9 Correct 39 ms 56824 KB Output is correct
10 Correct 37 ms 56824 KB Output is correct
11 Correct 38 ms 56824 KB Output is correct
12 Correct 39 ms 56824 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56824 KB Output is correct
2 Correct 37 ms 56704 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 37 ms 56576 KB Output is correct
5 Correct 37 ms 56824 KB Output is correct
6 Correct 37 ms 56696 KB Output is correct
7 Correct 38 ms 56832 KB Output is correct
8 Correct 37 ms 56824 KB Output is correct
9 Correct 39 ms 56824 KB Output is correct
10 Correct 37 ms 56824 KB Output is correct
11 Correct 38 ms 56824 KB Output is correct
12 Correct 39 ms 56824 KB Output is correct
13 Correct 156 ms 59232 KB Output is correct
14 Correct 133 ms 59256 KB Output is correct
15 Correct 143 ms 59240 KB Output is correct
16 Correct 148 ms 59260 KB Output is correct
17 Correct 135 ms 59128 KB Output is correct
18 Correct 168 ms 59252 KB Output is correct
19 Correct 160 ms 59512 KB Output is correct
20 Correct 153 ms 59256 KB Output is correct
21 Correct 150 ms 59128 KB Output is correct
22 Correct 145 ms 59000 KB Output is correct
23 Correct 151 ms 68344 KB Output is correct
24 Correct 139 ms 67704 KB Output is correct

Subtask #5
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 56824 KB Output is correct
2 Correct 37 ms 56704 KB Output is correct
3 Correct 37 ms 56704 KB Output is correct
4 Correct 37 ms 56576 KB Output is correct
5 Correct 37 ms 56824 KB Output is correct
6 Correct 37 ms 56696 KB Output is correct
7 Correct 38 ms 56832 KB Output is correct
8 Correct 37 ms 56824 KB Output is correct
9 Correct 39 ms 56824 KB Output is correct
10 Correct 37 ms 56824 KB Output is correct
11 Correct 38 ms 56824 KB Output is correct
12 Correct 39 ms 56824 KB Output is correct
13 Correct 156 ms 59232 KB Output is correct
14 Correct 133 ms 59256 KB Output is correct
15 Correct 143 ms 59240 KB Output is correct
16 Correct 148 ms 59260 KB Output is correct
17 Correct 135 ms 59128 KB Output is correct
18 Correct 168 ms 59252 KB Output is correct
19 Correct 160 ms 59512 KB Output is correct
20 Correct 153 ms 59256 KB Output is correct
21 Correct 150 ms 59128 KB Output is correct
22 Correct 145 ms 59000 KB Output is correct
23 Correct 151 ms 68344 KB Output is correct
24 Correct 139 ms 67704 KB Output is correct
25 Execution timed out 2588 ms 59384 KB Time limit exceeded
26 Halted 0 ms 0 KB -