oj.uz

Submission #639616

# Submission time Handle Problem Language Result Execution time Memory
639616 2022-09-10T17:48:39 Z teesla Monthly railway pass (LMIO18_menesinis_bilietas) C++14
10 / 100
 477 ms 30668 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn=5*1e5+10;
int n,m;

vector<int> adj[maxn];
int visitado[maxn];
void dfs(int x){
	visitado[x]=1;
	for(int i=0; i<adj[x].size(); i++){
		int viz=adj[x][i];
		if(visitado[viz]==1)continue;
		dfs(viz);
	}
	return;
}

int main(){
	cin >> n>> m;
	for(int i=0; i<m; i++){
		int a,b;
		char c;
		cin >> a >> b >> c;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dfs(1);
	int res=n;
	for(int i=1; i<=n; i++) if(visitado[i]==0) res=0;
	cout << res<<endl;
	return 0;
}

Compilation message

menesinis_bilietas.cpp: In function 'void dfs(int)':
menesinis_bilietas.cpp:10:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for(int i=0; i<adj[x].size(); i++){
      |               ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 30668 KB Output is correct
2 Correct 5 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12052 KB Output is correct
5 Correct 5 ms 11988 KB Output is correct
6 Correct 118 ms 14800 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12052 KB Output is correct
2 Correct 5 ms 11988 KB Output is correct
3 Incorrect 5 ms 11988 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Incorrect 5 ms 11988 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Incorrect 5 ms 11988 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 30668 KB Output is correct
2 Correct 5 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 7 ms 12052 KB Output is correct
5 Incorrect 5 ms 11988 KB Output isn't correct
6 Halted 0 ms 0 KB -