oj.uz

Submission #889298

# Submission time Handle Problem Language Result Execution time Memory
889298 2023-12-19T10:02:05 Z irmuun Keys (IOI21_keys) C++17
0 / 100
 1 ms 348 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++){
        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++){
            p[i]+=(used[j]==true);
        }
        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
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -