oj.uz

Submission #967427

# Submission time Handle Problem Language Result Execution time Memory
967427 2024-04-22T05:41:34 Z nguyentunglam Keys (IOI21_keys) C++17
100 / 100
 446 ms 92276 KB 
#include <vector>
#include<bits/stdc++.h>
using namespace std;

const int N = 3e5 + 10;

vector<pair<int, int> > adj[N];

vector<pair<int, int> > waiting[N];

priority_queue<pair<int, int> > q, can_vis;

int off[N], pre[N], nxt[N], h[N], h_keys[N], p[N], r[N], vis[N];

vector<int> unfinished;

int find_nxt (int i) {
  return off[i] == 0 ? i : pre[i] = find_nxt(pre[i]);
}

void calc (int u) {
//  cout << u << endl;
  vis[u] = 1;
  p[u] = 1e9;
  unfinished.push_back(u);

  auto climb = [&] (int u, int v) {
    while (1) {
      int climb = find_nxt(u);
      if (h[climb] <= h[v]) break;
      off[climb] = 1;
    }
  };

  auto reach = [&] (int u) {
    return find_nxt(u);
  };

  h_keys[r[u]] = h[u];

  for(auto &[v, c] : adj[u]) {
    q.push({h_keys[c], v});
    waiting[c].emplace_back(h[u], v);
  }

  for(auto &[depth, v] : waiting[r[u]]) {
    q.push({depth, v});
  } waiting[r[u]].clear();

  while (!q.empty() && q.top().first >= h[reach(u)]) {
    int depth, v; tie(depth, v) = q.top(); q.pop();

    if (vis[v] == 0) {
      can_vis.push({h[u], v});
    }
    if (vis[v] == 1) {
      climb(u, v);
    }
    if (vis[v] == 2) {
      return;
    }
  }

  while (!can_vis.empty()) {
    int depth, v; tie(depth, v) = can_vis.top();
    if (vis[v] != 0) {
      can_vis.pop();
      continue;
    }
    if (depth >= h[reach(u)]) {
      can_vis.pop();
      nxt[u] = v;
      pre[v] = u;
      h[v] = h[u] + 1;
      calc(v);
      return;
    }
    else break;
  }


  int v = reach(u);
  int cost = h[u] - h[v] + 1;
  while (1) {
    p[v] = cost;
    if (u == v) return;
    v = nxt[v];
  }
}

std::vector<int> find_reachable(std::vector<int> R, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
  int n = R.size();
	vector<int> ans(n);
  for(int i = 0; i < n; i++) r[i] = R[i];
  for(int i = 0; i < U.size(); i++) {
    adj[U[i]].emplace_back(V[i], C[i]);
    adj[V[i]].emplace_back(U[i], C[i]);
  }

  for(int i = 0; i < n; i++) if (!vis[i]) {
    pre[i] = n;
    nxt[n] = i;
    h[i] = 1;
    calc(i);
    for(int &j : unfinished) {
      vis[j] = 2;
      h_keys[r[j]] = 0;
      for(auto &[v, c] : adj[j]) {
        waiting[c].clear();
      }
      while (!can_vis.empty()) can_vis.pop();
      while (!q.empty()) q.pop();
    } unfinished.clear();
//    cout << endl;
  }

//	for(int i = 0; i < n; i++) cout << p[i] << " "; cout << endl;

	int mn = 1e9;

	for(int i = 0; i < n; i++) mn = min(mn, p[i]);

  for(int i = 0; i < n; i++) ans[i] = p[i] == mn;

	return ans;
}

#ifdef ngu
int main() {
  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);
    int n, m;
    assert(2 == scanf("%d%d", &n, &m));
    std::vector<int> r(n), u(m), v(m), c(m);
    for(int i=0; i<n; i++) {
        assert(1 == scanf("%d", &r[i]));
    }
    for(int i=0; i<m; i++) {
        assert(3 == scanf("%d %d %d", &u[i], &v[i], &c[i]));
    }
    fclose(stdin);

    std::vector<int> ans = find_reachable(r, u, v, c);

    for (int i = 0; i < (int) ans.size(); ++i) {
        if(i) putchar(' ');
        putchar(ans[i]+'0');
    }
    printf("\n");
    return 0;
}
#endif // ngu

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:95:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |   for(int i = 0; i < U.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15536 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15544 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15540 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15536 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15544 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15540 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct
10 Correct 5 ms 14424 KB Output is correct
11 Correct 5 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 7 ms 14536 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 6 ms 14428 KB Output is correct
16 Correct 6 ms 14428 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 6 ms 14428 KB Output is correct
22 Correct 6 ms 14428 KB Output is correct
23 Correct 6 ms 14428 KB Output is correct
24 Correct 6 ms 14428 KB Output is correct
25 Correct 7 ms 14428 KB Output is correct
26 Correct 7 ms 14540 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15536 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15544 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15540 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct
10 Correct 5 ms 14424 KB Output is correct
11 Correct 5 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 7 ms 14536 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 6 ms 14428 KB Output is correct
16 Correct 6 ms 14428 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 6 ms 14428 KB Output is correct
22 Correct 6 ms 14428 KB Output is correct
23 Correct 6 ms 14428 KB Output is correct
24 Correct 6 ms 14428 KB Output is correct
25 Correct 7 ms 14428 KB Output is correct
26 Correct 7 ms 14540 KB Output is correct
27 Correct 8 ms 14684 KB Output is correct
28 Correct 7 ms 14684 KB Output is correct
29 Correct 7 ms 14684 KB Output is correct
30 Correct 6 ms 14680 KB Output is correct
31 Correct 7 ms 14684 KB Output is correct
32 Correct 6 ms 14428 KB Output is correct
33 Correct 6 ms 14656 KB Output is correct
34 Correct 7 ms 14684 KB Output is correct
35 Correct 7 ms 14684 KB Output is correct
36 Correct 8 ms 14800 KB Output is correct
37 Correct 8 ms 14940 KB Output is correct
38 Correct 8 ms 14940 KB Output is correct
39 Correct 7 ms 14940 KB Output is correct
40 Correct 6 ms 14684 KB Output is correct
41 Correct 7 ms 14552 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15536 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15544 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15540 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct
10 Correct 228 ms 49708 KB Output is correct
11 Correct 333 ms 77876 KB Output is correct
12 Correct 37 ms 20816 KB Output is correct
13 Correct 187 ms 46052 KB Output is correct
14 Correct 208 ms 86460 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 4 ms 15708 KB Output is correct
3 Correct 5 ms 15536 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15544 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 4 ms 15540 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 5 ms 14428 KB Output is correct
10 Correct 5 ms 14424 KB Output is correct
11 Correct 5 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 7 ms 14536 KB Output is correct
14 Correct 6 ms 14428 KB Output is correct
15 Correct 6 ms 14428 KB Output is correct
16 Correct 6 ms 14428 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 6 ms 14428 KB Output is correct
21 Correct 6 ms 14428 KB Output is correct
22 Correct 6 ms 14428 KB Output is correct
23 Correct 6 ms 14428 KB Output is correct
24 Correct 6 ms 14428 KB Output is correct
25 Correct 7 ms 14428 KB Output is correct
26 Correct 7 ms 14540 KB Output is correct
27 Correct 8 ms 14684 KB Output is correct
28 Correct 7 ms 14684 KB Output is correct
29 Correct 7 ms 14684 KB Output is correct
30 Correct 6 ms 14680 KB Output is correct
31 Correct 7 ms 14684 KB Output is correct
32 Correct 6 ms 14428 KB Output is correct
33 Correct 6 ms 14656 KB Output is correct
34 Correct 7 ms 14684 KB Output is correct
35 Correct 7 ms 14684 KB Output is correct
36 Correct 8 ms 14800 KB Output is correct
37 Correct 8 ms 14940 KB Output is correct
38 Correct 8 ms 14940 KB Output is correct
39 Correct 7 ms 14940 KB Output is correct
40 Correct 6 ms 14684 KB Output is correct
41 Correct 7 ms 14552 KB Output is correct
42 Correct 228 ms 49708 KB Output is correct
43 Correct 333 ms 77876 KB Output is correct
44 Correct 37 ms 20816 KB Output is correct
45 Correct 187 ms 46052 KB Output is correct
46 Correct 208 ms 86460 KB Output is correct
47 Correct 5 ms 14428 KB Output is correct
48 Correct 5 ms 14428 KB Output is correct
49 Correct 5 ms 14428 KB Output is correct
50 Correct 223 ms 92276 KB Output is correct
51 Correct 251 ms 87972 KB Output is correct
52 Correct 192 ms 46196 KB Output is correct
53 Correct 177 ms 46208 KB Output is correct
54 Correct 196 ms 46160 KB Output is correct
55 Correct 257 ms 53312 KB Output is correct
56 Correct 337 ms 64928 KB Output is correct
57 Correct 272 ms 61992 KB Output is correct
58 Correct 271 ms 64184 KB Output is correct
59 Correct 446 ms 70684 KB Output is correct
60 Correct 383 ms 62652 KB Output is correct
61 Correct 393 ms 81468 KB Output is correct
62 Correct 350 ms 67776 KB Output is correct
63 Correct 142 ms 50772 KB Output is correct
64 Correct 9 ms 15708 KB Output is correct
65 Correct 10 ms 15708 KB Output is correct
66 Correct 352 ms 67692 KB Output is correct
67 Correct 26 ms 21588 KB Output is correct
68 Correct 40 ms 26420 KB Output is correct
69 Correct 378 ms 69484 KB Output is correct
70 Correct 95 ms 38220 KB Output is correct
71 Correct 224 ms 87164 KB Output is correct
72 Correct 389 ms 70632 KB Output is correct
73 Correct 339 ms 67776 KB Output is correct