oj.uz

Submission #623110

# Submission time Handle Problem Language Result Execution time Memory
623110 2022-08-05T08:10:23 Z Hanksburger Keys (IOI21_keys) C++17
37 / 100
 3000 ms 36804 KB 
#include "keys.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > adj[300005];
bool visited[300005], key[300005];
vector<int> vec[300005], ans;
int p[300005];
queue<int> q;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c)
{
    int n=r.size(), mn=1e9;
    for (int i=0; i<c.size(); i++)
    {
        adj[u[i]].push_back({v[i], c[i]});
        adj[v[i]].push_back({u[i], c[i]});
    }
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<n; j++)
        {
            visited[j]=key[j]=0;
            vec[j].clear();
        }
        q.push(i);
        visited[i]=1;
        while (!q.empty())
        {
            int u=q.front();
            q.pop();
            key[r[u]]=1;
            for (int j=0; j<vec[r[u]].size(); j++)
            {
                if (!visited[vec[r[u]][j]])
                {
                    q.push(vec[r[u]][j]);
                    visited[vec[r[u]][j]]=1;
                }
            }
            for (int j=0; j<adj[u].size(); j++)
            {
                if (key[adj[u][j].second])
                {
                    if (!visited[adj[u][j].first])
                    {
                        q.push(adj[u][j].first);
                        visited[adj[u][j].first]=1;
                    }
                }
                else
                    vec[adj[u][j].second].push_back(adj[u][j].first);
            }
        }
        for (int j=0; j<n; j++)
            p[i]+=visited[j];
    }
    for (int i=0; i<n; i++)
        mn=min(mn, p[i]);
    for (int i=0; i<n; i++)
        ans.push_back(p[i]==mn);
    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:12:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for (int i=0; i<c.size(); i++)
      |                   ~^~~~~~~~~
keys.cpp:31:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             for (int j=0; j<vec[r[u]].size(); j++)
      |                           ~^~~~~~~~~~~~~~~~~
keys.cpp:39:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for (int j=0; j<adj[u].size(); j++)
      |                           ~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Correct 8 ms 14300 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 10 ms 14328 KB Output is correct
7 Correct 8 ms 14392 KB Output is correct
8 Correct 9 ms 14408 KB Output is correct
9 Correct 10 ms 14400 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Correct 8 ms 14300 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 10 ms 14328 KB Output is correct
7 Correct 8 ms 14392 KB Output is correct
8 Correct 9 ms 14408 KB Output is correct
9 Correct 10 ms 14400 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 8 ms 14416 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14384 KB Output is correct
14 Correct 8 ms 14312 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 7 ms 14412 KB Output is correct
17 Correct 8 ms 14484 KB Output is correct
18 Correct 8 ms 14404 KB Output is correct
19 Correct 8 ms 14400 KB Output is correct
20 Correct 11 ms 14404 KB Output is correct
21 Correct 10 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 9 ms 14400 KB Output is correct
25 Correct 10 ms 14420 KB Output is correct
26 Correct 9 ms 14400 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Correct 8 ms 14300 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 10 ms 14328 KB Output is correct
7 Correct 8 ms 14392 KB Output is correct
8 Correct 9 ms 14408 KB Output is correct
9 Correct 10 ms 14400 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 8 ms 14416 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14384 KB Output is correct
14 Correct 8 ms 14312 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 7 ms 14412 KB Output is correct
17 Correct 8 ms 14484 KB Output is correct
18 Correct 8 ms 14404 KB Output is correct
19 Correct 8 ms 14400 KB Output is correct
20 Correct 11 ms 14404 KB Output is correct
21 Correct 10 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 9 ms 14400 KB Output is correct
25 Correct 10 ms 14420 KB Output is correct
26 Correct 9 ms 14400 KB Output is correct
27 Correct 46 ms 14548 KB Output is correct
28 Correct 47 ms 14612 KB Output is correct
29 Correct 46 ms 14600 KB Output is correct
30 Correct 31 ms 14520 KB Output is correct
31 Correct 12 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 11 ms 14444 KB Output is correct
34 Correct 24 ms 14480 KB Output is correct
35 Correct 28 ms 14500 KB Output is correct
36 Correct 93 ms 14712 KB Output is correct
37 Correct 78 ms 14556 KB Output is correct
38 Correct 108 ms 14724 KB Output is correct
39 Correct 103 ms 14832 KB Output is correct
40 Correct 21 ms 14424 KB Output is correct
41 Correct 54 ms 14552 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Correct 8 ms 14300 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 10 ms 14328 KB Output is correct
7 Correct 8 ms 14392 KB Output is correct
8 Correct 9 ms 14408 KB Output is correct
9 Correct 10 ms 14400 KB Output is correct
10 Execution timed out 3067 ms 36804 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Correct 8 ms 14300 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 9 ms 14404 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 10 ms 14328 KB Output is correct
7 Correct 8 ms 14392 KB Output is correct
8 Correct 9 ms 14408 KB Output is correct
9 Correct 10 ms 14400 KB Output is correct
10 Correct 9 ms 14408 KB Output is correct
11 Correct 8 ms 14416 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 7 ms 14384 KB Output is correct
14 Correct 8 ms 14312 KB Output is correct
15 Correct 9 ms 14420 KB Output is correct
16 Correct 7 ms 14412 KB Output is correct
17 Correct 8 ms 14484 KB Output is correct
18 Correct 8 ms 14404 KB Output is correct
19 Correct 8 ms 14400 KB Output is correct
20 Correct 11 ms 14404 KB Output is correct
21 Correct 10 ms 14420 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 9 ms 14420 KB Output is correct
24 Correct 9 ms 14400 KB Output is correct
25 Correct 10 ms 14420 KB Output is correct
26 Correct 9 ms 14400 KB Output is correct
27 Correct 46 ms 14548 KB Output is correct
28 Correct 47 ms 14612 KB Output is correct
29 Correct 46 ms 14600 KB Output is correct
30 Correct 31 ms 14520 KB Output is correct
31 Correct 12 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 11 ms 14444 KB Output is correct
34 Correct 24 ms 14480 KB Output is correct
35 Correct 28 ms 14500 KB Output is correct
36 Correct 93 ms 14712 KB Output is correct
37 Correct 78 ms 14556 KB Output is correct
38 Correct 108 ms 14724 KB Output is correct
39 Correct 103 ms 14832 KB Output is correct
40 Correct 21 ms 14424 KB Output is correct
41 Correct 54 ms 14552 KB Output is correct
42 Execution timed out 3067 ms 36804 KB Time limit exceeded
43 Halted 0 ms 0 KB -