oj.uz

Submission #1041210

# Submission time Handle Problem Language Result Execution time Memory
1041210 2024-08-01T17:48:42 Z Marco_Escandon Stranded Far From Home (BOI22_island) C++11
10 / 100
 1000 ms 42076 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> G[200001];
ll cad[200001];
ll maxi=0;
ll cmc(ll node)
{
    priority_queue<pair<ll,ll>> q;
    map<ll,ll> mapa;
    ll ac=cad[node]; mapa[node]=1;
    for(auto i:G[node]){ mapa[i]=1;q.push({-cad[i],i});}
    while(!q.empty()&&ac<maxi&&ac>=-q.top().first)
    {
        ll temp=q.top().second;q.pop();
        ac+=cad[temp];
        for(auto i:G[temp])
        {
            if(mapa[i]==0)
            {
                mapa[i]=1;
                q.push({-cad[i],i});
            }
        }
    }
    return (ac>=maxi);
}
int main()
{
    ll n,m;
    cin>>n>>m;
    vector<pair<ll,ll>> temp;
    for(int i=1; i<=n; i++)
    {
        cin>>cad[i];
        temp.push_back({cad[i],i});
    }
    sort(temp.begin(),temp.end());
    maxi=temp.back().first;
    for(int i=0; i<m; i++)
    {
        ll a,b;
        cin>>a>>b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<ll> sol(n,0);
    for(auto i:temp)
    {
        sol[i.second-1]=cmc(i.second);
        
    }
    for(auto i:sol)
        cout<<i;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 6660 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 3 ms 6596 KB Output is correct
8 Correct 3 ms 6492 KB Output is correct
9 Correct 525 ms 6748 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 292 ms 6788 KB Output is correct
14 Correct 220 ms 6756 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 308 ms 18868 KB Output is correct
4 Execution timed out 1004 ms 33204 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 210 ms 17540 KB Output is correct
3 Correct 201 ms 22100 KB Output is correct
4 Correct 216 ms 22316 KB Output is correct
5 Execution timed out 1099 ms 28960 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 237 ms 18664 KB Output is correct
3 Correct 248 ms 22996 KB Output is correct
4 Correct 229 ms 23216 KB Output is correct
5 Correct 177 ms 23200 KB Output is correct
6 Correct 158 ms 22716 KB Output is correct
7 Execution timed out 1018 ms 42076 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 3 ms 6660 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 3 ms 6596 KB Output is correct
8 Correct 3 ms 6492 KB Output is correct
9 Correct 525 ms 6748 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct
12 Correct 3 ms 6492 KB Output is correct
13 Correct 292 ms 6788 KB Output is correct
14 Correct 220 ms 6756 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 308 ms 18868 KB Output is correct
18 Execution timed out 1004 ms 33204 KB Time limit exceeded
19 Halted 0 ms 0 KB -