Submission #217226

#	Time	Username	Problem	Language	Result	Execution time	Memory
217226		kartel	Matching (COCI20_matching)	C++14	5 / 110	31 ms	47480 KiB

matching

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int x[N], y[N], n, i, mk[N];
vector <int> g[N], G[N];
vector <pair <int, int> > ans;

int main()
{
//    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//    in("data.in");
//    out("data.out");
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> x[i] >> y[i];
        g[x[i]].pb(i);
        G[y[i]].pb(i);
    }
    for (i = 1; i <= n; i++)
    {
        if (mk[i]) continue;
        if (!mk[g[x[i]][1]])
        {
            ans.pb({i, g[x[i]][1]});
            mk[g[x[i]][1]] = 1;
        }
        else if (!mk[G[y[i]][1]])
        {
            ans.pb({i, G[y[i]][1]});
            mk[G[y[i]][1]] = 1;
        }
        else
        {
            cout << "NE";
            return 0;
        }
    }
    cout << "DA" << el;
    for (auto x : ans) cout << x.F << " " << x.S << el;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 40
• Subtask 5: 0 / 52