oj.uz

답안 #258001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258001 2020-08-05T07:46:13 Z Vladikus004 Wand (COCI19_wand) C++14
70 / 70
 102 ms 11372 KB 
#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 100000 + 3;
int n, m,p[N];
vector <vector <int> > v;
map <pii, int> mp;

void dfs(int x){
    p[x] = 1;
    for( auto u: v[x]){
        if (!p[u])
        dfs(u);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n >> m;
    v.resize(n);
    for (int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        --x; --y;
        swap(x, y);
        if (mp[{x, y}]) continue;
        mp[{x, y}] = 1;
        v[x].push_back(y);
    }
    dfs(0);
    p[0] = 0;
    for (auto u: v[0]){
        if (mp[{u, 0}]) p[0] = 1;
    }
    if (v[0].empty()) p[0] = 1;
    for (int i = 0; i < n; i++) cout << p[i];
}

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 87 ms 10616 KB Output is correct
4 Correct 93 ms 10488 KB Output is correct
5 Correct 92 ms 10616 KB Output is correct
6 Correct 102 ms 11016 KB Output is correct
7 Correct 92 ms 10488 KB Output is correct
8 Correct 82 ms 10872 KB Output is correct
9 Correct 97 ms 11000 KB Output is correct
10 Correct 89 ms 11372 KB Output is correct