Submission #609753

#	Time	Username	Problem	Language	Result	Execution time	Memory
609753		duality	Fountain Parks (IOI21_parks)	C++17	45 / 100	506 ms	26612 KiB

parks

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "parks.h"

map<pii,int> M;
int parent[200000];
int find(int n) {
    if (parent[n] != n) parent[n] = find(parent[n]);
    return parent[n];
}
int construct_roads(vector<int> x,vector<int> y) {
    int i,n = x.size();
    vi u,v,a,b;
    for (i = 0; i < n; i++) M[mp(x[i],y[i])] = parent[i] = i;
    for (i = 0; i < n; i++) {
        if (((x[i]+y[i])/2) & 1) {
            if (M.count(mp(x[i]-2,y[i])) && (find(M[mp(x[i]-2,y[i])]) != find(i))) {
                u.pb(M[mp(x[i]-2,y[i])]),v.pb(i);
                parent[find(M[mp(x[i]-2,y[i])])] = find(i);
                a.pb(x[i]-1),b.pb(y[i]+1);
            }
            if (M.count(mp(x[i],y[i]-2)) && (find(M[mp(x[i],y[i]-2)]) != find(i))) {
                u.pb(M[mp(x[i],y[i]-2)]),v.pb(i);
                parent[find(M[mp(x[i],y[i]-2)])] = find(i);
                a.pb(x[i]-1),b.pb(y[i]-1);
            }
        }
        else {
            if (M.count(mp(x[i],y[i]-2)) && (find(M[mp(x[i],y[i]-2)]) != find(i))) {
                u.pb(M[mp(x[i],y[i]-2)]),v.pb(i);
                parent[find(M[mp(x[i],y[i]-2)])] = find(i);
                a.pb(x[i]+1),b.pb(y[i]-1);
            }
            if (M.count(mp(x[i]-2,y[i])) && (find(M[mp(x[i]-2,y[i])]) != find(i))) {
                u.pb(M[mp(x[i]-2,y[i])]),v.pb(i);
                parent[find(M[mp(x[i]-2,y[i])])] = find(i);
                a.pb(x[i]-1),b.pb(y[i]-1);
            }
        }
    }
    for (i = 0; i < n; i++) {
        if (find(i) != find(0)) return 0;
    }
    build(u,v,a,b);
    return 1;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 20 / 20
• Subtask 5: 20 / 20
• Subtask 6: 0 / 30