# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
222096 |
2020-04-12T06:23:04 Z |
NONAME |
Wand (COCI19_wand) |
C++17 |
|
47 ms |
5112 KB |
#include <bits/stdc++.h>
#include <time.h>
//#include <random>
//#ifndef _LOCAL
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#endif
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;
//mt19937 rnd(0);
int n, m, rs[N];
vector <int> g[N];
void dfs(int v) {
for (int i = 0; i < sz(g[v]); i++) {
int to = g[v][i];
if (rs[to])
continue;
rs[to] = 1;
dfs(to);
}
}
void solve() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int v, u; cin >> v >> u; v--; u--;
g[u].pb(v);
}
dfs(0);
rs[0] |= g[0].empty();
for (int i = 0; i < n; i++)
cout << rs[i];
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef _LOCAL
in("input.txt");
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Test #" << i << elf;
clock_t start_time = clock();
solve();
cerr.precision(4); cerr << fixed;
cerr << elf;
cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;
cout << elf;
}
#else
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << el;
}
#endif
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
2688 KB |
Output is correct |
2 |
Correct |
6 ms |
2688 KB |
Output is correct |
3 |
Correct |
37 ms |
4856 KB |
Output is correct |
4 |
Correct |
43 ms |
4856 KB |
Output is correct |
5 |
Correct |
37 ms |
4856 KB |
Output is correct |
6 |
Correct |
40 ms |
4984 KB |
Output is correct |
7 |
Correct |
47 ms |
4856 KB |
Output is correct |
8 |
Correct |
42 ms |
4984 KB |
Output is correct |
9 |
Correct |
40 ms |
4736 KB |
Output is correct |
10 |
Correct |
41 ms |
5112 KB |
Output is correct |