제출 #535186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
535186		Icebear16	열쇠 (IOI21_keys)	C++17	0 / 100	2 ms	588 KiB

keys

#include <bits/stdc++.h>
std::vector<int> adj[3000];
std::vector<int> Adj[3000];
std::vector<int> temp[3000];
std::vector<bool> visited(3000,false);
int k=0;
std::set<int> s;
void dfs(int n, std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c){
	if(visited[n]){
		return;
	}else{
		visited[n]=true;
		s.insert(r[n]);
		k+=1;
	}
	for(int i=0;i<r.size();i++){
		Adj[i]=temp[i];
	}
	for(int i=0;i<u.size();i++){
		if(u[i]==n){
			Adj[v[i]].push_back(c[i]);
		}
		if(v[i]==n){
			Adj[u[i]].push_back(c[i]);
		}
	}
	for(int i=0;i<adj[n].size();i++){
		int y=adj[n][i];
		for(int j=0;j<Adj[y].size();j++){
            if(s.count(Adj[y][j])==1){
              dfs(y,r,u,v,c);
              break;
            }
		}
	}
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	std::vector<int> ans(r.size(), 1);
	for(int i=0;i<u.size();i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for(int i=0;i<r.size();i++){
		for(int j=0;j<r.size();j++){
			s.erase(j);
		}
		s.insert(r[i]);
		dfs(i,r,u,v,c);
		ans[i]=k;
		k=0;
		for(int j=0;j<r.size();j++){
			visited[j]=false;
		}
	}
	int m=1000000;
	for(int i=0;i<r.size();i++){
		m=std::min(m,ans[i]);
	}
	for(int i=0;i<r.size();i++){
		if(ans[i]==m){
			ans[i]=1;
		}else{
			ans[i]=0;
		}
	}
	return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

keys.cpp: In function 'void dfs(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:16:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~
keys.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~
keys.cpp:27:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  for(int i=0;i<adj[n].size();i++){
      |              ~^~~~~~~~~~~~~~
keys.cpp:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for(int j=0;j<Adj[y].size();j++){
      |               ~^~~~~~~~~~~~~~
keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:40:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~
keys.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~
keys.cpp:45:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for(int j=0;j<r.size();j++){
      |               ~^~~~~~~~~
keys.cpp:52:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |   for(int j=0;j<r.size();j++){
      |               ~^~~~~~~~~
keys.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~
keys.cpp:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~

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