oj.uz

답안 #96699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96699 2019-02-11T05:19:46 Z nandonathaniel Wand (COCI19_wand) C++14
70 / 70
 56 ms 5624 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[100005];
bool visited[100005];

void dfs(int node){
	for(int i=0;i<adj[node].size();i++){
		if(!visited[adj[node][i]]){
			visited[adj[node][i]]=true;
			dfs(adj[node][i]);
		}
	}
}

int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m,x,y;
    cin >> n >> m;
    for(int i=1;i<=m;i++){
    	cin >> x >> y;
    	adj[y].push_back(x);
	}
	dfs(1);
	bool stat=false;
	for(int i=1;i<=n;i++){
		if(visited[i])stat=true;
	}
	if(!stat){
		visited[1]=true;
	}
	for(int i=1;i<=n;i++){
		if(visited[i])cout << 1;
		else cout << 0;
	}
	cout << endl;
	return 0;
}

Compilation message

wand.cpp: In function 'void dfs(int)':
wand.cpp:7:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<adj[node].size();i++){
              ~^~~~~~~~~~~~~~~~~

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 34 ms 5544 KB Output is correct
4 Correct 33 ms 5496 KB Output is correct
5 Correct 33 ms 5492 KB Output is correct
6 Correct 35 ms 5596 KB Output is correct
7 Correct 37 ms 5496 KB Output is correct
8 Correct 35 ms 5580 KB Output is correct
9 Correct 56 ms 5496 KB Output is correct
10 Correct 34 ms 5624 KB Output is correct