제출 #782505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
782505		horiiseun	Stranded Far From Home (BOI22_island)	C++17	100 / 100	115 ms	25348 KiB

island

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif
 
int n, m, s[200005];
ll sm[200005];
vector<pair<ll, int>> ord;
vector<int> adj[200005];
bool ans[200005];
 
struct UnionFind {
    int par[200005];
    ll nx[200005];
    UnionFind() {
        for (int i = 0; i < 200005; i++) {
            par[i] = i;
            nx[i] = 0;
        }
    }
 
    int find(int x) {
        return par[x] == x ? x : par[x] = find(par[x]);
    }
 
    void merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x != y) {
            par[y] = x;
            sm[x] += sm[y];
            if (!nx[y] || s[nx[y]] == s[y]) nx[y] = x;
        }
    }
} uf;
 
int main() {
 
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        ord.push_back({s[i], i});
    }   
    sort(ord.begin(), ord.end());
    for (int i = 0, a, b; i < m; i++) {
        cin >> a >> b;
        if (make_pair(s[a], a) < make_pair(s[b], b)) swap(a, b);
        adj[a].push_back(b);
    }
 
    for (auto [v, i] : ord) {
        sm[i] = s[i];
        for (int j : adj[i]) {
            uf.merge(i, j);
        }
    }
    reverse(ord.begin(), ord.end());
    uf.nx[ord[0].second] = 0;
    ans[0] = 1;
    for (auto [v, i] : ord) {
        if (ans[uf.nx[i]] && sm[i] >= s[uf.nx[i]]) {
            ans[i] = true;
        }
    }
 
    for (int i = 1; i <= n; i++) {
        cout << ans[i];
    }
    cout << "\n";
 
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 30 / 30
• Subtask 5: 35 / 35