Submission #1049643

#TimeUsernameProblemLanguageResultExecution timeMemory
1049643nisanduuKeys (IOI21_keys)C++17
0 / 100
0 ms348 KiB
#include <vector>
#include <bits/stdc++.h>

using namespace std;


vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	vector<int> ans(r.size(), 0);
	int n = r.size();
	int mini = 1e9;
	int type = c[0];
	for(int i=0;i<n;i++){
	    if(r[i]==type) ans[i] = n-1;
	    mini = min(mini,ans[i]);
	}
    for(int i=0;i<n;i++) ans[i] = ans[i]==mini ? 1 : 0;
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...