oj.uz

답안 #104667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104667 2019-04-08T15:53:20 Z leonarda Wand (COCI19_wand) C++14
70 / 70
 75 ms 4860 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;

int n, m, out1;
vector<int> v[maxn];
bool moze[maxn];
bool memo[maxn];

void solve(int x) {
	if(v[x].empty() or memo[x]) return;
	memo[x] = 1;
	for(int i = 0; i < v[x].size(); ++i) {
		moze[v[x][i]] = 1;
		solve(v[x][i]);
	}
	return;
}

int main ()
{
	ios::sync_with_stdio(0);
	
	cin >> n >> m;
	for(int i = 0; i < m; ++i) {
		int x, y;
		cin >> x >> y;
		if(y == 1) ++out1;
		v[y - 1].pb(x - 1);
	}
	
	if(out1 == 0) {
		cout << 1;
		for(int i = 1; i < n; ++i)
			cout << 0;
		return 0;
	}
	
	solve(0);
	
	for(int i = 0; i < n; ++i)
		cout << moze[i];

return 0;
}
//written and directed by pcelicamaja

Compilation message

wand.cpp: In function 'void solve(int)':
wand.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v[x].size(); ++i) {
                 ~~^~~~~~~~~~~~~

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 5 ms 2688 KB Output is correct
3 Correct 60 ms 4728 KB Output is correct
4 Correct 46 ms 4728 KB Output is correct
5 Correct 40 ms 4728 KB Output is correct
6 Correct 53 ms 4860 KB Output is correct
7 Correct 43 ms 4712 KB Output is correct
8 Correct 70 ms 4800 KB Output is correct
9 Correct 46 ms 4720 KB Output is correct
10 Correct 75 ms 4856 KB Output is correct