oj.uz

Submission #721049

# Submission time Handle Problem Language Result Execution time Memory
721049 2023-04-10T09:02:03 Z YENGOYAN Stranded Far From Home (BOI22_island) C++17
35 / 100
 1000 ms 39928 KB 
/*
                                    //\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
                                    \\                                    //
                                    //  271828___182845__904523__53602__  \\
                                    \\  87___47____13______52____66__24_  //
                                    //  97___75____72______47____09___36  \\
                                    \\  999595_____74______96____69___67  //
                                    //  62___77____24______07____66__30_  \\
                                    \\  35___35____47______59____45713__  //
                                    //                                    \\
                                    \\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
*/
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
#include <functional>

using namespace std;
using LL = long long;
const int N = 1e5 + 5;
const LL mod = 1e9 + 7, inf = 1e18;

vector<int> dx = { 1, 0, 0, -1, 1, 1, -1, -1 };
vector<int> dy = { 0, 1, -1, 0, 1, -1, 1, -1 };

void solve() {
  int n, m; cin >> n >> m;
  vector<int> s(n);
  map<int, vector<int>> srt;
  vector<pair<int, int>> vp;
  for(int i = 0; i < n; ++i){
    cin >> s[i];
    srt[s[i]].push_back(i);
    vp.push_back({s[i], i});
  }
  sort(vp.begin(), vp.end());
  vector<vector<int>> gp(n);
  for(int i = 0; i < m; ++i){
    int u, v; cin >> u >> v;
    gp[--u].push_back(--v);
    gp[v].push_back(u);
  }
  vector<LL> par(n), sz(n);
  for(int i = 0; i < n; ++i){
    par[i] = i;
    sz[i] = s[i];
  }
  string ans(n, '1');
  function<int(int)> get = [&](int u){
    if(par[u] == u) return u;
    return get(par[u]);
  };
  function<void(int u, int v)> unions = [&](int u, int v){
    int a = get(u), b = get(v);
    if(a == b) return;
    par[b] = a;
    sz[a] += sz[b];
  };
  vector<int> vis(n, -1);
  function<int(int)> check = [&](int u){
    if(vis[u] != -1) return vis[u];
    if(ans[u] == '0') return vis[u] = 0;
    if(par[u] == u) return vis[u] = 1;
    return vis[u] = check(par[u]);
  };
  for(int i = 0; i < n; ++i){
    int cnt = vp[i].first, u = vp[i].second;
    for(int &v : gp[u]){
      if(s[v] <= s[u]){
        int p = get(v);
        if(sz[p] < cnt){
          ans[p] = '0';
        }
      }
    }
    for(int &v : gp[u]){
      if(s[v] <= s[u]){
        unions(u, v);
      }
    }
  }
  for(int i = 0; i < n; ++i){
    cout << check(i);
  }
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
 // int t; cin >> t; while (t--)
    solve();

}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 668 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 7 ms 520 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 3 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 179 ms 39928 KB Output is correct
4 Correct 174 ms 18784 KB Output is correct
5 Correct 216 ms 38488 KB Output is correct
6 Correct 177 ms 34620 KB Output is correct
7 Correct 184 ms 39812 KB Output is correct
8 Correct 212 ms 18752 KB Output is correct
9 Correct 174 ms 34772 KB Output is correct
10 Correct 168 ms 35436 KB Output is correct
11 Correct 135 ms 19412 KB Output is correct
12 Correct 161 ms 18788 KB Output is correct
13 Correct 154 ms 18680 KB Output is correct
14 Correct 140 ms 18776 KB Output is correct
15 Correct 209 ms 39824 KB Output is correct
16 Correct 136 ms 39400 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 307 ms 39552 KB Output is correct
3 Correct 316 ms 34700 KB Output is correct
4 Correct 176 ms 18644 KB Output is correct
5 Correct 132 ms 18684 KB Output is correct
6 Correct 324 ms 39772 KB Output is correct
7 Correct 183 ms 39816 KB Output is correct
8 Correct 191 ms 39788 KB Output is correct
9 Correct 138 ms 39416 KB Output is correct
10 Correct 230 ms 33940 KB Output is correct
11 Correct 165 ms 21068 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1092 ms 19032 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 668 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 7 ms 520 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 3 ms 468 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 179 ms 39928 KB Output is correct
18 Correct 174 ms 18784 KB Output is correct
19 Correct 216 ms 38488 KB Output is correct
20 Correct 177 ms 34620 KB Output is correct
21 Correct 184 ms 39812 KB Output is correct
22 Correct 212 ms 18752 KB Output is correct
23 Correct 174 ms 34772 KB Output is correct
24 Correct 168 ms 35436 KB Output is correct
25 Correct 135 ms 19412 KB Output is correct
26 Correct 161 ms 18788 KB Output is correct
27 Correct 154 ms 18680 KB Output is correct
28 Correct 140 ms 18776 KB Output is correct
29 Correct 209 ms 39824 KB Output is correct
30 Correct 136 ms 39400 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 307 ms 39552 KB Output is correct
33 Correct 316 ms 34700 KB Output is correct
34 Correct 176 ms 18644 KB Output is correct
35 Correct 132 ms 18684 KB Output is correct
36 Correct 324 ms 39772 KB Output is correct
37 Correct 183 ms 39816 KB Output is correct
38 Correct 191 ms 39788 KB Output is correct
39 Correct 138 ms 39416 KB Output is correct
40 Correct 230 ms 33940 KB Output is correct
41 Correct 165 ms 21068 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Execution timed out 1092 ms 19032 KB Time limit exceeded
44 Halted 0 ms 0 KB -