Submission #1305513

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305513		darkdevilvaqif	Stranded Far From Home (BOI22_island)	C++20	10 / 100	1098 ms	12908 KiB

island

/*
  _      __        __         __        ____                    ___    _                   __
 | | /| / / ___ _ / /_ ____  / /       / __ \  ___  ___        / _ \  (_) ___  ____ ___   / /
 | |/ |/ / / _ `// __// __/ / _ \     / /_/ / / _ \/ -_)      / ___/ / / / -_)/ __// -_) /_/ 
 |__/|__/  \_,_/ \__/ \__/ /_//_/     \____/ /_//_/\__/      /_/    /_/  \__/ \__/ \__/ (_)  
                                                                                             
*/

#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define ld long double
#define all(v, l) v.begin() + l, v.end()
#define rall(v, l) v.rbegin(), v.rend() - l
#define pb push_back
#define rsz resize
#define fi first
#define se second
#define LMAX LLONG_MAX
#define LMIN LLONG_MIN
#define IMAX INT_MAX
#define IMIN INT_MIN
#define endl "\n"
#define newline cout << endl;
using namespace std;
 
// constants

// functions
ll GCD(ll A, ll B);
ll LCM(ll A, ll B);
ll power(ll base, ll exponent);

// structs
struct graph
{
    vector <vector <int> > g;
    vector <bool> used;
    
    void prep(int n)
    {
        g.rsz(n);
        used.rsz(n);
    }
    
    void add(int u, int v)
    {
        g[u].pb(v);
        g[v].pb(u);
    }
    
    void BFS(int start, vector <int> &humans)
    {
        priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
        used[start] = true;
        ll cur = humans[start];
        for (auto u : g[start])
        {
            pq.push({humans[u], u});
        }
        
        while (!pq.empty())
        {
            auto [d, v] = pq.top();
            pq.pop();

            if (cur < d)
            {
                break;
            }
            
            used[v] = true;
            cur += 1LL * d;
            for (auto u : g[v])
            {
                if (used[u])
                {
                    continue;
                }
                
                pq.push({humans[u], u});
            }
        }
    }
    
    void cleanse()
    {
        fill(all(used, 0), false);
    }
};

// globals

// variables
int n, m;
string ans;

// iterators
int i;

// notes
/*
One piece on top!

 -stuff you should look for-
* int overflow, array bounds
* special cases (n=1?)
* do something instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH

continue - skip the rest in the loop
*/
 
void solve()
{
    cin >> n >> m;
    vector <int> v(n + 1);
    for (i = 1; i <= n; i++)
    {
        cin >> v[i];
    }
    graph G;
    G.prep(n + 1);
    while (m--)
    {
        int a, b;
        cin >> a >> b;
        
        G.add(a, b);
    }
    
    ans = string(n, '0');
    for (i = 1; i <= n; i++)
    {
        G.cleanse();
        G.BFS(i, v);
        
        ans[i - 1] = (count(all(G.used, 1), false) ? '0' : '1');
    }
    
    cout << ans;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
        newline
    }
}
 
int GCD(int A, int B)
{
    if (!A)
    {
        return B;
    }
    return GCD(B % A, A);
}

int LCM(int A, int B)
{
    return A * B / GCD(A, B);
}

int power(int base, int exponent)
{
    int res = 1;
    while (exponent) 
    {
        if (exponent & 1)
        { 
            res *= base;
        }
        base *= base;
        exponent >>= 1;    
    }
    return res;
}

/*
$$$$$$$$\ $$$$$$$$\ 
$$  _____|\____$$  |
$$ |          $$  / 
$$$$$\       $$  /  
$$  __|     $$  /   
$$ |       $$  /    
$$$$$$$$\ $$$$$$$$\ 
\________|\________|
*/

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