Submission #441799

#	Time	Username	Problem	Language	Result	Execution time	Memory
441799		baluteshih	Fountain Parks (IOI21_parks)	C++17	5 / 100	149 ms	15820 KiB

parks

#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

int construct_roads(vector<int> x, vector<int> y) {
    if (x.size() == 1) {
	    build({}, {}, {}, {});
        return 1;
    }
    int n = SZ(x);
    vector<int> idx(n);
    iota(ALL(idx), 0);
    sort(ALL(idx), [&](int p, int q){ return y[p] < y[q]; });
    vector<int> u, v, a, b;
    for (int i = 0; i + 1 < n; ++i) {
        if (y[idx[i + 1]] - y[idx[i]] > 2)
            return 0;
        u.pb(idx[i]);
        v.pb(idx[i + 1]);
        a.pb(x[idx[i]] + 1);
        b.pb(y[idx[i]] + 1);
    }
    build(u, v, a, b);
    return 1;
}

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