# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
104666 | 2019-04-08T15:52:17 Z | leonarda | Wand (COCI19_wand) | C++14 | 66 ms | 4928 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2688 KB | Output is correct |
2 | Correct | 4 ms | 2688 KB | Output is correct |
3 | Correct | 65 ms | 4728 KB | Output is correct |
4 | Correct | 56 ms | 4620 KB | Output is correct |
5 | Correct | 66 ms | 4728 KB | Output is correct |
6 | Correct | 57 ms | 4876 KB | Output is correct |
7 | Correct | 48 ms | 4748 KB | Output is correct |
8 | Correct | 66 ms | 4856 KB | Output is correct |
9 | Incorrect | 47 ms | 4728 KB | Output isn't correct |
10 | Correct | 53 ms | 4928 KB | Output is correct |