Submission #570896

#	Time	Username	Problem	Language	Result	Execution time	Memory
570896		doowey	열쇠 (IOI21_keys)	C++17	0 / 100	9 ms	14404 KiB

keys

#include "keys.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair


const int N = (int)3e5 + 1;

vector<pii> T[N];
int col[N];
bool collect[N];
vector<int> st[N];
bool vis[N];

vector<int> nds;
vector<int> keys;

void clean(){
    for(auto x : nds){
        vis[x] = false;
    }
    for(auto x : keys){
        collect[x] = false;
        st[x].clear();
    }
    nds.clear();
    keys.clear();
}

void travel(int node){
    queue<int> que;
    que.push(node);
    vis[node]=true;
    int cur;

    while(!que.empty()){
        cur = que.front();
        que.pop();
        collect[col[cur]] = true;
        keys.push_back(col[cur]);
        nds.push_back(cur);
        for(auto x : T[cur]){
            if(vis[x.fi]) continue;
            keys.push_back(x.se);
            if(collect[x.fi]){
                vis[x.fi]=true;
                que.push(x.fi);
            }
            else{
                st[x.se].push_back(x.fi);
            }
        }
        for(auto x : st[col[cur]]){
            if(vis[x]) continue;
            vis[x] = true;
            que.push(x);
        }
        st[col[cur]].clear();
    }
}


vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int m = u.size();
    int n = r.size();
    for(int i = 0 ; i < n; i ++ ){
        col[i] = r[i];
    }
    for(int i = 0 ; i < m ; i ++ ){
        T[u[i]].push_back(mp(v[i], c[i]));
        T[v[i]].push_back(mp(u[i], c[i]));
    }
    vector<int> sol(n);
    int vv = n + 1;
    vector<int> qq;
    for(int i = 0 ; i < n; i ++ ){
        travel(i);
        //cout << i << ": " << nds.size() << "\n";
        if(nds.size() < vv){
            vv = nds.size();
            qq = {i};
        }
        else if(nds.size() == vv){
            qq.push_back(i);
        }
        for(int j = 0 ; j < n; j ++ ){
            vis[j] = false;
            collect[j] = false;
            st[j].clear();
        }
        nds.clear();
        keys.clear();
    }
    for(auto x : qq){
        sol[x] = 1;
    }
    return sol;
}

Compilation message (stderr)

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:86:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |         if(nds.size() < vv){
      |            ~~~~~~~~~~~^~~~
keys.cpp:90:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   90 |         else if(nds.size() == vv){
      |                 ~~~~~~~~~~~^~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 11
• Subtask 3: 0 / 17
• Subtask 4: 0 / 30
• Subtask 5: 0 / 33