Submission #870176

#	Time	Username	Problem	Language	Result	Execution time	Memory
870176		Mher777	Stranded Far From Home (BOI22_island)	C++17	0 / 100	355 ms	90204 KiB

island

#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

struct node {
    set<int> s;
    int sz;
    ll mn, sum;
};

const int N = 200005;
ll a[N];
node st[N];
int ans[N], p[N];
vi g[N];

void make_set(int u) {
    st[u].s.insert(u);
    st[u].sz = 1;
    p[u] = u;
    st[u].sum = st[u].mn = a[u];
}

int find_set(int u) {
    if (u == p[u]) return u;
    return p[u] = find_set(p[u]);
}

void union_sets(int a, int b, ll val) {
    a = find_set(a), b = find_set(b);
    if (a == b) return;
    if (st[a].sz > st[b].sz) {
        st[a].sz += st[b].sz, st[a].sum += st[b].sum;
        st[a].mn = min(st[b].mn, st[a].mn);
        p[b] = a;
        if (st[b].sum >= val) {
            for (auto elem : st[b].s) st[a].s.insert(elem);
        }
        else {
            for (auto elem : st[b].s) ans[elem] = 0;
        }
    }
    else {
        st[b].sz += st[a].sz, st[b].sum += st[a].sum;
        st[b].mn = min(st[b].mn, st[a].mn);
        p[a] = b;
        if (st[b].sum < val) {
            for (auto elem : st[b].s) ans[elem] = 0;
            st[b].s.clear();
        }
        for (auto elem : st[a].s) st[b].s.insert(elem);
    }
}

void slv() {
    int n, m;
    cin >> n >> m;
    vector<pair<ll,int>> v;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        ans[i] = 1;
        v.pub({ a[i],i });
    }
    sort(all(v));
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        g[x].pub(y);
        g[y].pub(x);
    }
    for (auto elem : v) {
        int u = elem.ss;
        make_set(u);
        for (auto to : g[u]) {
            if (p[to] != 0) union_sets(u, to, a[u]);
        }
    }
    for (int i = 1; i <= n; i++) cout << ans[i];
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    precision(0);
    cs();
    return 0;
}

Compilation message (stderr)

island.cpp: In function 'll range_sum(ll, ll)':
island.cpp:89:21: warning: unused variable 'cnt' [-Wunused-variable]
   89 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
island.cpp: In function 'll bin_to_dec(std::string)':
island.cpp:112:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

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