oj.uz

Submission #967132

# Submission time Handle Problem Language Result Execution time Memory
967132 2024-04-21T08:42:23 Z nguyentunglam Keys (IOI21_keys) C++17
37 / 100
 3000 ms 32700 KB 
#include <vector>
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;

bool vis_room[N], vis_key[N];

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

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), p(n);
  for(int i = 0; i < U.size(); i++) {
    e[C[i]].emplace_back(U[i], V[i]);
    e[C[i]].emplace_back(V[i], U[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++) {
    queue<int> q_key, q_room;
    for(int j = 0; j < n; j++) vis_room[j] = vis_key[j] = 0;
    q_room.push(i);
    while (!q_key.empty() || !q_room.empty()) {
      if (!q_key.empty()) {
        int x = q_key.front(); q_key.pop();
        for(auto &[u, v] : e[x]) if (vis_room[u] || vis_room[v]) {
          if (!vis_room[u]) q_room.push(u), vis_room[u] = 1;
          if (!vis_room[v]) q_room.push(v), vis_room[v] = 1;
        }
      }
      if (!q_room.empty()) {
        p[i]++;
        int u = q_room.front(); q_room.pop();
        if (!vis_key[r[u]]) {
          vis_key[r[u]] = 1;
          q_key.push(r[u]);
        }
        for(auto &[v, c] : adj[u]) if (vis_key[c] && !vis_room[v]) {
          vis_room[v] = 1;
          q_room.push(v);
        }
      }
    }
	}

//	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:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |   for(int i = 0; i < U.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5140 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5140 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 5040 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 5132 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 1 ms 4952 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 4952 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5140 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 5040 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 5132 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 1 ms 4952 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 4952 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 23 ms 5396 KB Output is correct
28 Correct 25 ms 5388 KB Output is correct
29 Correct 23 ms 5208 KB Output is correct
30 Correct 17 ms 5252 KB Output is correct
31 Correct 2 ms 5212 KB Output is correct
32 Correct 3 ms 4952 KB Output is correct
33 Correct 2 ms 5212 KB Output is correct
34 Correct 11 ms 5208 KB Output is correct
35 Correct 16 ms 5212 KB Output is correct
36 Correct 68 ms 5212 KB Output is correct
37 Correct 49 ms 5464 KB Output is correct
38 Correct 77 ms 5212 KB Output is correct
39 Correct 68 ms 5212 KB Output is correct
40 Correct 7 ms 5212 KB Output is correct
41 Correct 31 ms 5356 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5140 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Execution timed out 3055 ms 32700 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5140 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 5212 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 5040 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 2 ms 5132 KB Output is correct
18 Correct 2 ms 4952 KB Output is correct
19 Correct 1 ms 4952 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 4952 KB Output is correct
22 Correct 2 ms 4956 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 2 ms 4956 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 2 ms 4956 KB Output is correct
27 Correct 23 ms 5396 KB Output is correct
28 Correct 25 ms 5388 KB Output is correct
29 Correct 23 ms 5208 KB Output is correct
30 Correct 17 ms 5252 KB Output is correct
31 Correct 2 ms 5212 KB Output is correct
32 Correct 3 ms 4952 KB Output is correct
33 Correct 2 ms 5212 KB Output is correct
34 Correct 11 ms 5208 KB Output is correct
35 Correct 16 ms 5212 KB Output is correct
36 Correct 68 ms 5212 KB Output is correct
37 Correct 49 ms 5464 KB Output is correct
38 Correct 77 ms 5212 KB Output is correct
39 Correct 68 ms 5212 KB Output is correct
40 Correct 7 ms 5212 KB Output is correct
41 Correct 31 ms 5356 KB Output is correct
42 Execution timed out 3055 ms 32700 KB Time limit exceeded
43 Halted 0 ms 0 KB -