#undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
#pragma GCC target("movbe") // byte swap
#pragma GCC target("aes,pclmul,rdrnd") // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
#include <bits/stdc++.h>
using namespace std;
#define enablell 1
typedef long long ll;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;
#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin__popcount(x)
#define leading_zeros(x) __builtin_clz(x)
#define gc() getchar_unlocked()
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
struct chash { // large odd number for C
const uint64_t C = ll(4e18 * acos(0)) | 71;
ll operator()(ll x) const { return x; }
};
//typedef __gnu_pbds::gp_hash_table<int, null_type, chash> h;
#endif
#endif
#if 1
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
inline void read(int& u, int& v) { read(u); read(v); }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T& a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif
#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)
#define all(a) a.begin(),a.end()
#define revall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define first(a) (*begin(a))
#define indexpair(p, i) ((i==0)?p.first:p.second)
#define chmax(a,b) ((a)=max((a),b))
#define chmin(a,b) ((a)=min((a),b))
#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U> l, const pair<T, U> r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U> l, const pair<T, U> r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U> l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }
#if 0
auto Start = chrono::high_resolution_clock::now();
#define elapsedmillis() (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count())
#define rununtil(time) if (elapsedmillis() >= time) break;
random_device rd;
mt19937 rng(rd());
#endif
const int mod = 1e9 + 7;
struct UF
{
int n;
vi strength;
vi startstrength;
vi parent;
vi size;
vector<set<int>> canwin;
UF(int n, vi strengths) : strength(strengths), startstrength(strengths), n(n), parent(n), size(n, 1), canwin(n)
{
rep(i, n) parent[i] = i;
rep(i, n) canwin[i].insert(i);
}
int find(int x) { return parent[x] == x ? x : parent[x] = find(parent[x]); }
// A smaller strength
void merge(int a, int b)
{
if (find(a) == find(b)) return;
int oa = a; int ob = b;
a = find(a); b = find(b);
bool awin = false;
bool bwin = false;
if (startstrength[oa] <= strength[b] && setcontains(canwin[a],oa)) bwin = true;
if (startstrength[oa] <= strength[ob]) bwin = true;
if (startstrength[ob] <= strength[a] && setcontains(canwin[b],ob)) awin = true;
if (startstrength[ob] <= strength[oa]) awin = true;
// Merging to a
if (awin && bwin)
{
if (canwin[a].size() < canwin[b].size()) swap(a,b);
repe(i, canwin[b]) canwin[a].insert(i);
}
else if (awin)
{
}
else if (bwin)
{
canwin[a].swap(canwin[b]);
}
parent[b] = a;
size[a] += size[b];
strength[a] += strength[b];
}
};
int32_t main()
{
fast();
#if 0
//ifstream cin("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
#endif
dread2(int, n, m);
vvp2 edges(n);
vi strengths(n);
vp2 ordering(n);
rep(i, n)
{
read(strengths[i]);
ordering[i].first = strengths[i];
ordering[i].second = i;
}
sort(all(ordering));
rep(i, m)
{
dread2(int, a, b);
a--; b--;
edges[a].emplace_back(strengths[b],b);
edges[b].emplace_back(strengths[a],a);
}
rep(i, n) sort(all(edges[i]));
UF uf(n, strengths);
rep(i, n)
{
int u = ordering[i].second;
set<int> visited;
repe(edge, edges[u])
{
int v = uf.find(edge.second);
if (!setcontains(visited,v)&&strengths[edge.second] <= uf.strength[uf.find(u)] && setcontains(uf.canwin[uf.find(v)], v))
{
visited.insert(v);
uf.merge(u, v);
}
}
}
vb canwin(n);
rep(i, n)
{
repe(u, uf.canwin[uf.find(i)])
{
canwin[u] = true;
}
}
rep(i, n)
{
cout << canwin[i];
}
quit;
}
Compilation message
island.cpp: In constructor 'UF::UF(ll, vi)':
island.cpp:134:8: warning: 'UF::startstrength' will be initialized after [-Wreorder]
134 | vi startstrength;
| ^~~~~~~~~~~~~
island.cpp:132:9: warning: 'll UF::n' [-Wreorder]
132 | int n;
| ^
island.cpp:139:5: warning: when initialized here [-Wreorder]
139 | UF(int n, vi strengths) : strength(strengths), startstrength(strengths), n(n), parent(n), size(n, 1), canwin(n)
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
18 ms |
796 KB |
Output is correct |
| 5 |
Correct |
21 ms |
844 KB |
Output is correct |
| 6 |
Correct |
24 ms |
848 KB |
Output is correct |
| 7 |
Correct |
17 ms |
820 KB |
Output is correct |
| 8 |
Correct |
12 ms |
724 KB |
Output is correct |
| 9 |
Correct |
2 ms |
852 KB |
Output is correct |
| 10 |
Correct |
20 ms |
960 KB |
Output is correct |
| 11 |
Correct |
20 ms |
980 KB |
Output is correct |
| 12 |
Correct |
16 ms |
988 KB |
Output is correct |
| 13 |
Correct |
1 ms |
844 KB |
Output is correct |
| 14 |
Correct |
3 ms |
852 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Execution timed out |
1085 ms |
53980 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Execution timed out |
1089 ms |
74080 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Execution timed out |
1100 ms |
59692 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
18 ms |
796 KB |
Output is correct |
| 5 |
Correct |
21 ms |
844 KB |
Output is correct |
| 6 |
Correct |
24 ms |
848 KB |
Output is correct |
| 7 |
Correct |
17 ms |
820 KB |
Output is correct |
| 8 |
Correct |
12 ms |
724 KB |
Output is correct |
| 9 |
Correct |
2 ms |
852 KB |
Output is correct |
| 10 |
Correct |
20 ms |
960 KB |
Output is correct |
| 11 |
Correct |
20 ms |
980 KB |
Output is correct |
| 12 |
Correct |
16 ms |
988 KB |
Output is correct |
| 13 |
Correct |
1 ms |
844 KB |
Output is correct |
| 14 |
Correct |
3 ms |
852 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Execution timed out |
1085 ms |
53980 KB |
Time limit exceeded |
| 18 |
Halted |
0 ms |
0 KB |
- |
