Submission #443410

#TimeUsernameProblemLanguageResultExecution timeMemory
443410mjhmjh1104Fountain Parks (IOI21_parks)C++17
5 / 100
74 ms8956 KiB
#include "parks.h"
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

int construct_roads(vector<int> x, vector<int> y) {
    if ((int)x.size() == 1) return build({}, {}, {}, {}), 1;
    int n = (int)x.size();
    vector<int> u, v, a, b;
    vector<pair<int, int>> p;
    for (int i = 0; i < n; i++) p.push_back({ y[i], i });
    sort(p.begin(), p.end());
    if (p.back().first - p.front().first == 2 * n - 2) {
        for (int i = 1; i < n; i++) {
            u.push_back(p[i - 1].second);
            v.push_back(p[i].second);
            a.push_back(1);
            b.push_back(p[i - 1].first + 1);
        }
        build(u, v, a, b);
        return 1;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...