oj.uz

Submission #573174

# Submission time Handle Problem Language Result Execution time Memory
573174 2022-06-06T08:25:31 Z MohamedAliSaidane Stranded Far From Home (BOI22_island) C++14
0 / 100
 3 ms 4948 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

        using namespace __gnu_pbds;
        using namespace std;

        typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;

        typedef long long ll;
        typedef long double ld;

        typedef pair<int,int> pii;
        typedef pair<ll,ll> pll;
        typedef pair<ld,ld> pld;

        typedef vector<int> vi;
        typedef vector<ll> vll;
        typedef vector<pii> vpi;
        typedef vector<pll> vpl;

        #define pb push_back
        #define popb pop_back
        #define pp pop_back
        #define pf push_front
        #define popf pop_front
        #define all(x) (x).begin(),(x).end()
        #define ff first
        #define ss second

        ///#define int ll

        int nx[4] = {0,0,1,-1}, ny[4] = {1,-1,0,0};
        ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;}
        ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);}

        const int nax = 2e5 + 4;
        int n, m;
        ll s[nax];
        vi adj[nax];

        void sub1()
        {
            string ans = "";
            for(int i = 1; i<= n; i++)
                ans += '1';
            for(int i = 1; i <= n; i++)
            {
                ll cur = s[i];
                set<pll> pq;
                for(auto e: adj[i])
                    pq.insert({s[e],e});
                bool vis[n + 1];
                memset(vis,false,sizeof(vis));
                while(!pq.empty())
                {
                    pll u = *(pq.begin());
                    pq.erase(pq.begin());
                    if(u.ff > cur)
                    {
                        ans[i - 1] = '0';
                        vis[u.ss] = 0;
                        break;
                    }
                    cur += u.ff;
                    vis[u.ss] = 1;
                    for(auto e: adj[u.ss])
                    {
                        if(vis[e])
                            continue;
                        vis[e]  = 1;
                        pq.insert({s[e],e});
                    }
                }
                for(int j = 1; j <= n; j ++)
                    if(!vis[j])
                        ans[i - 1] = '0';
            }
            cout << ans;
        }
        void solve()
        {
            cin >> n >> m;
            for(int i = 1; i <= n; i++)
                cin >> s[i];
            for(int i = 1; i <= m; i ++)
            {
                int a, b;
                cin >> a >> b;
                adj[a].pb(b);
                adj[b].pb(a);
            }
            if(n <= 2000 && m <= 2000)
            {
                sub1();
                return ;
            }
        }

        int32_t main()
        {
            ios::sync_with_stdio(false);
            cin.tie(0); cout.tie(0);
            int tt = 1;
            while(tt --)
                solve();
        }

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 4948 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Incorrect 3 ms 4948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Incorrect 3 ms 4948 KB Output isn't correct
4 Halted 0 ms 0 KB -