oj.uz

Submission #721057

# Submission time Handle Problem Language Result Execution time Memory
721057 2023-04-10T09:23:23 Z YENGOYAN Stranded Far From Home (BOI22_island) C++17
35 / 100
 1000 ms 50172 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<bool> vis(n);
  vector<vector<int>> new_gp(n);
  function<void(int)> dfs = [&](int u) {
    vis[u] = 1;
    ans[u] = '0';
    for(int &v : new_gp[u]) {
      if(!vis[v]){
        dfs(v);
      }
    }
  };
  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){
          vis = vector<bool> (n);
          dfs(v);
        }
      }
    }
    for(int &v : gp[u]){
      if(s[v] <= s[u]){
        new_gp[v].push_back(u);
        new_gp[u].push_back(v);
        unions(u, v);
      }
    }
  }
  for(int i = 0; i < n; ++i){
    cout << ans[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 0 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 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 7 ms 672 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 2 ms 596 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 253 ms 50024 KB Output is correct
4 Correct 178 ms 34376 KB Output is correct
5 Correct 337 ms 48616 KB Output is correct
6 Correct 280 ms 44876 KB Output is correct
7 Correct 350 ms 50172 KB Output is correct
8 Correct 245 ms 30004 KB Output is correct
9 Correct 265 ms 44908 KB Output is correct
10 Correct 317 ms 46412 KB Output is correct
11 Correct 214 ms 32308 KB Output is correct
12 Correct 274 ms 29976 KB Output is correct
13 Correct 205 ms 41432 KB Output is correct
14 Correct 183 ms 40220 KB Output is correct
15 Correct 209 ms 50028 KB Output is correct
16 Correct 165 ms 49444 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 439 ms 49740 KB Output is correct
3 Correct 471 ms 45072 KB Output is correct
4 Correct 180 ms 28884 KB Output is correct
5 Correct 211 ms 37436 KB Output is correct
6 Correct 402 ms 49976 KB Output is correct
7 Correct 219 ms 50008 KB Output is correct
8 Correct 206 ms 49952 KB Output is correct
9 Correct 154 ms 49528 KB Output is correct
10 Correct 273 ms 42760 KB Output is correct
11 Correct 243 ms 41260 KB Output is correct

Subtask #4
0 / 30.0

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

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 7 ms 672 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 253 ms 50024 KB Output is correct
18 Correct 178 ms 34376 KB Output is correct
19 Correct 337 ms 48616 KB Output is correct
20 Correct 280 ms 44876 KB Output is correct
21 Correct 350 ms 50172 KB Output is correct
22 Correct 245 ms 30004 KB Output is correct
23 Correct 265 ms 44908 KB Output is correct
24 Correct 317 ms 46412 KB Output is correct
25 Correct 214 ms 32308 KB Output is correct
26 Correct 274 ms 29976 KB Output is correct
27 Correct 205 ms 41432 KB Output is correct
28 Correct 183 ms 40220 KB Output is correct
29 Correct 209 ms 50028 KB Output is correct
30 Correct 165 ms 49444 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 439 ms 49740 KB Output is correct
33 Correct 471 ms 45072 KB Output is correct
34 Correct 180 ms 28884 KB Output is correct
35 Correct 211 ms 37436 KB Output is correct
36 Correct 402 ms 49976 KB Output is correct
37 Correct 219 ms 50008 KB Output is correct
38 Correct 206 ms 49952 KB Output is correct
39 Correct 154 ms 49528 KB Output is correct
40 Correct 273 ms 42760 KB Output is correct
41 Correct 243 ms 41260 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Execution timed out 1077 ms 29352 KB Time limit exceeded
44 Halted 0 ms 0 KB -