Submission #1048024

#	Time	Username	Problem	Language	Result	Execution time	Memory
1048024		mindiyak	Keys (IOI21_keys)	C++17	20 / 100	3056 ms	30976 KiB

keys

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include "keys.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

vector<vpi> paths(3e5+10,vpi());
int n;
vi visited;

void bfs(int pos,vi r){

	queue<int> nodes;
	set<int> keys;
	vpi nokeys;

	nodes.push(pos);

	while(!nodes.empty()){
		int node = nodes.front();nodes.pop();
		if(visited[node])continue;
		keys.insert(r[node]);
		visited[node] = 1;

		vpi temp;
		for(pi edge:nokeys){
			if(keys.count(edge.S)){
				nodes.push(edge.F);
			}else{
				temp.pb(edge);
			}
		}
		nokeys = temp;

		for(pi edge:paths[node]){
			if(keys.count(edge.S)){
				nodes.push(edge.F);
			}else{
				nokeys.pb(edge);
			}
		}
	}
}

vi find_reachable(vi r, vi u, vi v, vi c) {
	
	FOR(i,0,u.size()){
		paths[u[i]].pb({v[i],c[i]});
		paths[v[i]].pb({u[i],c[i]});
	}

	n = r.size();
	vi counter(n,0);
	int val = 1e9;

	FOR(i,0,n){
		visited = vi (n,0);
		bfs(i,r);
		int cnt = 0;
		FOR(j,0,n)cnt += visited[j];
		counter[i] = cnt;
		val = min(val,cnt);
	}

	// for(int a:counter)cout << a << " ";
	// cout << endl;


	FOR(i,0,n){
		if(counter[i] == val)counter[i] = 1;
		else counter[i] = 0;
	}


	return counter;
}

Compilation message (stderr)

keys.cpp: In function 'vi find_reachable(vi, vi, vi, vi)':
keys.cpp:22:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 | #define FOR(i, a, b) for (int i = a; i < (b); i++)
      |                                        ^
keys.cpp:81:2: note: in expansion of macro 'FOR'
   81 |  FOR(i,0,u.size()){
      |  ^~~

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