Submission #1220112

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220112		kokoxuya	Keys (IOI21_keys)	C++20	0 / 100	0 ms	324 KiB

keys

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x  << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x  << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x  << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
	cerr << #x << " : ";\
	for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
	cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
	cerr << "outputting" << #j<< ":\n";\
	for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
	cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}

int dfs(int cn,vector<vector<int>>&adjlist, vector<bool>&visited)
{
	visited[cn]=true;
	int ans=1;
	
	for(int to:adjlist[cn])
	{
		if(visited[to])continue;
		ans+=dfs(to,adjlist,visited);
	}
	return ans;
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) 
{
	int n=r.size();
	vector<int>p(n,0);
	vector<vector<int>>adjlist(n);
	
	for(int a=0;a<u.size();a++)
	{
		adjlist[u[a]].pb(v[a]);
		adjlist[v[a]].pb(u[a]);
	}
	
	vector<bool>visited(n,false);
	for(int a=0;a<n;a++)
	{
		if(r[a]==0)
		{
			p[a]=dfs(a,adjlist,visited);
			fill(visited.begin(),visited.end(),false);
		}
	}
	
	vector<int>ret(n,false);
	int minnum=INT_MAX;
	for(int a=0;a<n;a++)
	{
		minnum=min(minnum,p[a]);
	}
	
	for(int a=0;a<n;a++)
	{
		if(minnum==p[a])
		{
			ret[a]=true;
		}
	}
	
	return ret;
}

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