oj.uz

Submission #797570

# Submission time Handle Problem Language Result Execution time Memory
797570 2023-07-29T16:37:33 Z TB_ Stranded Far From Home (BOI22_island) C++17
25 / 100
 1000 ms 28420 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;

ll n, m, val, from, to, w;
vl population;

vvl adj(200001);

int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    cin >> n >> m;
    pii biggestPop = {-1, -1};
    fo(i, n){
        cin >> val;
        population.pb(val);
        biggestPop = max(biggestPop, {val, i});
    }
    fo(i, m){
        cin >> from >> to;
        adj[--from].pb(--to);
        adj[to].pb(from);
    }
    vi ans(n, -1);
    ans[biggestPop.S] = 1;

    vi order;
    fo(i, n) order.pb(i);
    shuffle(all(order), rng);

    vi seen(n, 0);
    for(auto start : order){
        if(ans[start] != -1) continue;
        vi visited;
        priority_queue<pl> pq;
        pq.push({0, start});
        ll currentPop = population[start];
        bool succes = false;
        while(!pq.empty()){
            tie(w, to) = pq.top();
            pq.pop();
            w = -w;
            if(w>currentPop) break;
            if(ans[to] == 1){
                succes = true;
                break;
            }
            if(seen[to]) continue;
            seen[to] = 1;
            visited.pb(to);
            currentPop += w;

            for(auto v : adj[to])
                pq.push({-population[v], v});
        }
        if(succes){
            ans[start] = 1;
        }else{
            for(auto v : visited) ans[v] = 0;
        }
        for(auto v : visited) seen[v] = 0;
    }
    fo(i, n) cout << ans[i];

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 8 ms 5076 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5076 KB Output is correct
7 Correct 6 ms 5076 KB Output is correct
8 Correct 6 ms 5172 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 4 ms 5172 KB Output is correct
12 Correct 4 ms 5172 KB Output is correct
13 Correct 3 ms 5204 KB Output is correct
14 Correct 13 ms 5076 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 452 ms 24420 KB Output is correct
4 Correct 130 ms 22084 KB Output is correct
5 Correct 652 ms 22020 KB Output is correct
6 Correct 826 ms 22628 KB Output is correct
7 Correct 759 ms 22648 KB Output is correct
8 Correct 657 ms 22696 KB Output is correct
9 Correct 447 ms 23132 KB Output is correct
10 Correct 101 ms 20712 KB Output is correct
11 Execution timed out 1079 ms 27528 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 347 ms 20740 KB Output is correct
3 Correct 347 ms 21592 KB Output is correct
4 Correct 378 ms 23200 KB Output is correct
5 Correct 87 ms 19864 KB Output is correct
6 Correct 464 ms 21704 KB Output is correct
7 Correct 392 ms 22836 KB Output is correct
8 Correct 437 ms 23068 KB Output is correct
9 Correct 347 ms 25028 KB Output is correct
10 Correct 491 ms 22312 KB Output is correct
11 Correct 287 ms 20784 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 701 ms 21296 KB Output is correct
3 Correct 717 ms 22524 KB Output is correct
4 Correct 789 ms 22732 KB Output is correct
5 Correct 648 ms 22544 KB Output is correct
6 Correct 899 ms 22508 KB Output is correct
7 Execution timed out 1077 ms 28420 KB Time limit exceeded
8 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 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 8 ms 5076 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5076 KB Output is correct
7 Correct 6 ms 5076 KB Output is correct
8 Correct 6 ms 5172 KB Output is correct
9 Correct 3 ms 5204 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 4 ms 5172 KB Output is correct
12 Correct 4 ms 5172 KB Output is correct
13 Correct 3 ms 5204 KB Output is correct
14 Correct 13 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 452 ms 24420 KB Output is correct
18 Correct 130 ms 22084 KB Output is correct
19 Correct 652 ms 22020 KB Output is correct
20 Correct 826 ms 22628 KB Output is correct
21 Correct 759 ms 22648 KB Output is correct
22 Correct 657 ms 22696 KB Output is correct
23 Correct 447 ms 23132 KB Output is correct
24 Correct 101 ms 20712 KB Output is correct
25 Execution timed out 1079 ms 27528 KB Time limit exceeded
26 Halted 0 ms 0 KB -