Submission #628940

#	Time	Username	Problem	Language	Result	Execution time	Memory
628940		hy_1	Keys (IOI21_keys)	C++17	0 / 100	1 ms	212 KiB

keys

#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);
	if(count(u.begin() , u.end() , 0) == 0 && count(v.begin() , v.end() , 0) == 0){
		return ans;
	}else{
		for(int i  =0; i <r.size(); i++){
			ans[i] = 0;
		}
	}
	return ans;
}

Compilation message (stderr)

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   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