oj.uz

Submission #894369

# Submission time Handle Problem Language Result Execution time Memory
894369 2023-12-28T07:23:24 Z Trisanu_Das Keys (IOI21_keys) C++17
20 / 100
 3000 ms 13032 KB 
#include<bits/stdc++.h>
using namespace std;
 
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int n = r.size();
	vector<int> ans(n, 0);
    vector<bool> vi(n, 0), keys(n, 0);
    int m = n;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) vi[j] = 0, keys[j] = 0;
        vi[i] = 1;
        keys[r[i]] = 1;
        for(int k = 0; k < n; k++) {
            for(int j = 0; j < u.size(); j++) {
              if(keys[c[j]]){
                  if(vi[u[j]]) vi[v[j]] = 1, keys[r[v[j]]] = 1;
                  if(vi[v[j]]) vi[u[j]] = 1, keys[r[u[j]]] = 1;
              }
            }
        }
        int c = 0;
        for(int j = 0; j < n; j++) if(vi[j]) c++;
        m = min(c, m);
        ans[i] = c;
    }
    for(int i = 0; i < n; i++) ans[i] = ans[i] == m ? 1 : 0;
	return ans;
}

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 18 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 29 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 18 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 29 ms 348 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 436 KB Output is correct
12 Correct 14 ms 440 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 10 ms 436 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 348 KB Output is correct
22 Correct 3 ms 428 KB Output is correct
23 Correct 18 ms 348 KB Output is correct
24 Correct 16 ms 348 KB Output is correct
25 Correct 29 ms 444 KB Output is correct
26 Correct 27 ms 348 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 18 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 29 ms 348 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 436 KB Output is correct
12 Correct 14 ms 440 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 10 ms 436 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 348 KB Output is correct
22 Correct 3 ms 428 KB Output is correct
23 Correct 18 ms 348 KB Output is correct
24 Correct 16 ms 348 KB Output is correct
25 Correct 29 ms 444 KB Output is correct
26 Correct 27 ms 348 KB Output is correct
27 Execution timed out 3072 ms 348 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 18 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 29 ms 348 KB Output is correct
10 Execution timed out 3030 ms 13032 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 18 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 18 ms 436 KB Output is correct
9 Correct 29 ms 348 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 436 KB Output is correct
12 Correct 14 ms 440 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 10 ms 436 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 348 KB Output is correct
22 Correct 3 ms 428 KB Output is correct
23 Correct 18 ms 348 KB Output is correct
24 Correct 16 ms 348 KB Output is correct
25 Correct 29 ms 444 KB Output is correct
26 Correct 27 ms 348 KB Output is correct
27 Execution timed out 3072 ms 348 KB Time limit exceeded
28 Halted 0 ms 0 KB -