| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 257992 |
2020-08-05T07:30:28 Z |
leaked |
Wand (COCI19_wand) |
C++14 |
|
49 ms |
7800 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
void umin(int &a,int b){a=min(a,b);}
void umax(int &a,int b){a=max(a,b);}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll tx[4]={0,1,-1,1};
const ll ty[4]={-1,0,1,1};
const char rev_to[4]={'E','W','N','S'};
const int M=1e9;
const int N=2e5+2;
const int ppp=73;
const int lg=19;
const int OPEN=1;
const int CLOSE=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,N),mt19937(time(0)));
void bad(){
cout<<"NE";
exit(0);
}
vector<int>g[N];
bool used[N];
bool col[N];
map<pii,int>mp;
void dfs(int v,int p){
used[v]=1;
if(p!=-1) col[v]=1;
for(auto &z : g[v]){
if(mp[{z,v}]) continue;
mp[{z,v}]=1;
dfs(z,v);
}
}
int p[N],n,m;
signed main()
{
// freopen("in.txt","r",stdin);
fast_io;
cin>>n>>m;
int v,u;
fill(p,p+n+1,-1);
for(int i=0;i<m;i++){
cin>>v>>u;--v;--u;
g[u].p_b(v);
p[u]=v;
}
dfs(0,-1);
if(!sz(g[0])) col[0]=1;
for(int i=0;i<n;i++) cout<<(col[i]);
return 0;
}
/*
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4992 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4992 KB |
Output is correct |
| 3 |
Correct |
37 ms |
7672 KB |
Output is correct |
| 4 |
Correct |
36 ms |
7544 KB |
Output is correct |
| 5 |
Correct |
35 ms |
7680 KB |
Output is correct |
| 6 |
Correct |
40 ms |
7800 KB |
Output is correct |
| 7 |
Correct |
36 ms |
7616 KB |
Output is correct |
| 8 |
Correct |
44 ms |
7672 KB |
Output is correct |
| 9 |
Correct |
38 ms |
7416 KB |
Output is correct |
| 10 |
Correct |
49 ms |
7676 KB |
Output is correct |
