| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 628945 | hy_1 | 열쇠 (IOI21_keys) | C++17 | 1 ms | 228 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>
   
using namespace std;
int dfs(int source , vector<int> &c , int vv , vector<vector<pair<int , int > > > &adj){
	int cnt = 0;
	stack<int> st;
	st.push(source);
	set<int> stock;
	stock.insert(c[source]);
	vector<int> visited(vv , false);
	// int cnt = 0;
	while(!st.empty()){
		int cur = st.top();
		st.pop();
		visited[cur] = true;
		for(pair<int , int > i : adj[cur]){
			if(visited[i.first] == false && (count(stock.begin() , stock.end() , i.second)) != 0){
				st.push(i.first);
				visited[i.first] = true;
				cnt++;
			}
		}
	}
	return cnt;
}
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
	// vector<vector< pair<int, int > > > adj(r.size());
	vector<int> ans(r.size() , 1);
	for(int i=0; i<u.size(); i++){
		if(r[u[i]] == 0 && v[i] != u[i]){
			ans[i] = 0;
		}
	}
	for(int i=0; i<v.size(); i++){
		if(r[v[i]] == 0 && u[i] != v[i]){
			ans[i] = 0;
		}
	}
	return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
