Submission #875451

#	Time	Username	Problem	Language	Result	Execution time	Memory
875451		lalig777	Traffic (CEOI11_tra)	C++14	32 / 100	5099 ms	37324 KiB

tra

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

void dfs(int nodo, int &count, vector<bool> &visitado, vector<bool> &east, vector<vector<int> > &listaAdy){
	visitado[nodo]=true;
	if (east[nodo]==true) count++;
	for (int j=0; j<listaAdy[nodo].size(); j++){
		int conexion=listaAdy[nodo][j];
		if (visitado[conexion]!=true) dfs(conexion, count, visitado, east, listaAdy);
	}return;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, m, A, B;
	cin>>n>>m>>A>>B;
	vector<pair<int, int> >west;
	vector<bool>east(n, false);
	int x, y;
	for (int i=0; i<n; i++){
		cin>>x>>y;
		if (x==0) west.push_back(make_pair(y, i));
		else if (x==A) east[i]=true;
	}sort(west.begin(), west.end());
	reverse(west.begin(), west.end());
	vector<vector<int> >listaAdy(n);
	for (int i=0; i<m; i++){
		int a, b, c;
		cin>>a>>b>>c;
		listaAdy[a-1].push_back(b-1);
		if (c==2) listaAdy[b-1].push_back(a-1);
	}
	for (int i=0; i<west.size(); i++){
		int nodo=west[i].second;
		vector<bool>visitado(n, false);
		int count=0;
		dfs(nodo, count, visitado, east, listaAdy);
		cout<<count<<'\n';
	}
	return 0;
}

Compilation message (stderr)

tra.cpp: In function 'void dfs(int, int&, std::vector<bool>&, std::vector<bool>&, std::vector<std::vector<int> >&)':
tra.cpp:10:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int j=0; j<listaAdy[nodo].size(); j++){
      |                ~^~~~~~~~~~~~~~~~~~~~~~
tra.cpp: In function 'int main()':
tra.cpp:37:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for (int i=0; i<west.size(); i++){
      |                ~^~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9