oj.uz

Submission #889366

# Submission time Handle Problem Language Result Execution time Memory
889366 2023-12-19T13:52:55 Z irmuun Keys (IOI21_keys) C++17
37 / 100
 3000 ms 27852 KB 
#include<bits/stdc++.h>
#include "keys.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

vector<int>find_reachable(vector<int>r,vector<int>u,vector<int>v,vector<int>c){
    int n=r.size();
    int mn=n;
    vector<int>p(n,0);
    vector<pair<int,int>>adj[n];
    vector<int>now[n];//if found key_i
    for(int i=0;i<u.size();i++){
        adj[u[i]].pb({v[i],c[i]});
        adj[v[i]].pb({u[i],c[i]});
    }
    vector<bool>used(n,0),found(n,0);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            now[j].clear();
        }
        fill(all(used),0);
        fill(all(found),0);
        queue<int>q;//nodes
        q.push(i);
        used[i]=true;
        while(!q.empty()){
            int x=q.front();
            q.pop();
            if(!found[r[x]]){
                found[r[x]]=true;
                for(auto y:now[r[x]]){
                    if(!used[y]){
                        used[y]=true;
                        q.push(y);
                    }
                }
                now[r[x]].clear();
            }
            for(auto [y,k]:adj[x]){
                if(found[k]==true){
                    if(!used[y]){
                        used[y]=true;
                        q.push(y);
                    }
                }
                else{
                    now[k].pb(y);
                }
            }
        }
        for(int j=0;j<n;j++){
            if(used[j]){
                p[i]++;
            }
        }
        mn=min(mn,p[i]);
    }
    for(int i=0;i<n;i++){
        if(p[i]==mn){
            p[i]=1;
        }
        else{
            p[i]=0;
        }
    }
    return p;
}

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

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 34 ms 604 KB Output is correct
28 Correct 34 ms 604 KB Output is correct
29 Correct 34 ms 604 KB Output is correct
30 Correct 18 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 13 ms 348 KB Output is correct
35 Correct 17 ms 348 KB Output is correct
36 Correct 65 ms 676 KB Output is correct
37 Correct 44 ms 896 KB Output is correct
38 Correct 76 ms 700 KB Output is correct
39 Correct 69 ms 692 KB Output is correct
40 Correct 7 ms 348 KB Output is correct
41 Correct 28 ms 604 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Execution timed out 3062 ms 27852 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 504 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 34 ms 604 KB Output is correct
28 Correct 34 ms 604 KB Output is correct
29 Correct 34 ms 604 KB Output is correct
30 Correct 18 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 13 ms 348 KB Output is correct
35 Correct 17 ms 348 KB Output is correct
36 Correct 65 ms 676 KB Output is correct
37 Correct 44 ms 896 KB Output is correct
38 Correct 76 ms 700 KB Output is correct
39 Correct 69 ms 692 KB Output is correct
40 Correct 7 ms 348 KB Output is correct
41 Correct 28 ms 604 KB Output is correct
42 Execution timed out 3062 ms 27852 KB Time limit exceeded
43 Halted 0 ms 0 KB -