# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258001 | Vladikus004 | Wand (COCI19_wand) | C++14 | 102 ms | 11372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |