#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define ft first
#define sd second
#define MP make_pair
#define all(x) x.begin(),x.end()
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 100100;
const ll OO = 1e18;
const ld E = 1e-9;
vector<int> g[N];
int n, m;
bool mrk[N];
void dfs(int v){
if (mrk[v]) return;
mrk[v] = 1;
for (int u : g[v])
dfs(u);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("in.txt","r",stdin);
cin >> n >> m;
for (int i = 0; i < m; i++){
int x, y; cin >> x >> y;
x--; y--;
g[y].PB(x);
}
for (int u : g[0])
dfs(u);
for (int i = 0; i < n; i++)
cout << mrk[i];
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2688 KB |
Output is correct |
2 |
Correct |
7 ms |
2816 KB |
Output is correct |
3 |
Correct |
38 ms |
5376 KB |
Output is correct |
4 |
Correct |
39 ms |
5368 KB |
Output is correct |
5 |
Correct |
39 ms |
5368 KB |
Output is correct |
6 |
Correct |
40 ms |
5496 KB |
Output is correct |
7 |
Correct |
37 ms |
5368 KB |
Output is correct |
8 |
Correct |
38 ms |
5496 KB |
Output is correct |
9 |
Incorrect |
40 ms |
5496 KB |
Output isn't correct |
10 |
Correct |
40 ms |
5628 KB |
Output is correct |