oj.uz

답안 #629390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629390 2022-08-14T12:47:55 Z Joshua_Andersson Stranded Far From Home (BOI22_island) C++14
100 / 100
 532 ms 90552 KB 
#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

#define FILE_TC 0
#if FILE_TC
ifstream filein("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
#define cin filein
//ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
void fast(){}
#else
inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
#endif

#if !FILE_TC
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))

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();



    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);
    set<int> visited;
    rep(i, n)
    {
        if (setcontains(visited, uf.find(i))) continue;
        visited.insert(uf.find(i));
        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:143:8: warning: 'UF::startstrength' will be initialized after [-Wreorder]
  143 |     vi startstrength;
      |        ^~~~~~~~~~~~~
island.cpp:141:9: warning:   'll UF::n' [-Wreorder]
  141 |     int n;
      |         ^
island.cpp:148:5: warning:   when initialized here [-Wreorder]
  148 |     UF(int n, vi strengths) : strength(strengths), startstrength(strengths), n(n), parent(n), size(n, 1), canwin(n)
      |     ^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 852 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 192 ms 54240 KB Output is correct
4 Correct 212 ms 58184 KB Output is correct
5 Correct 291 ms 68840 KB Output is correct
6 Correct 341 ms 72516 KB Output is correct
7 Correct 304 ms 71692 KB Output is correct
8 Correct 367 ms 59436 KB Output is correct
9 Correct 249 ms 81136 KB Output is correct
10 Correct 159 ms 57292 KB Output is correct
11 Correct 265 ms 66544 KB Output is correct
12 Correct 372 ms 57056 KB Output is correct
13 Correct 224 ms 57688 KB Output is correct
14 Correct 226 ms 57808 KB Output is correct
15 Correct 211 ms 59184 KB Output is correct
16 Correct 181 ms 56968 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 328 ms 74260 KB Output is correct
3 Correct 343 ms 78440 KB Output is correct
4 Correct 238 ms 59156 KB Output is correct
5 Correct 204 ms 57604 KB Output is correct
6 Correct 396 ms 77852 KB Output is correct
7 Correct 248 ms 59140 KB Output is correct
8 Correct 240 ms 59256 KB Output is correct
9 Correct 149 ms 56924 KB Output is correct
10 Correct 176 ms 53852 KB Output is correct
11 Correct 206 ms 60896 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 399 ms 59820 KB Output is correct
3 Correct 380 ms 66964 KB Output is correct
4 Correct 490 ms 75140 KB Output is correct
5 Correct 532 ms 84684 KB Output is correct
6 Correct 428 ms 70740 KB Output is correct
7 Correct 232 ms 63352 KB Output is correct
8 Correct 183 ms 58556 KB Output is correct
9 Correct 159 ms 35084 KB Output is correct
10 Correct 470 ms 90472 KB Output is correct
11 Correct 194 ms 60620 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 852 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 192 ms 54240 KB Output is correct
18 Correct 212 ms 58184 KB Output is correct
19 Correct 291 ms 68840 KB Output is correct
20 Correct 341 ms 72516 KB Output is correct
21 Correct 304 ms 71692 KB Output is correct
22 Correct 367 ms 59436 KB Output is correct
23 Correct 249 ms 81136 KB Output is correct
24 Correct 159 ms 57292 KB Output is correct
25 Correct 265 ms 66544 KB Output is correct
26 Correct 372 ms 57056 KB Output is correct
27 Correct 224 ms 57688 KB Output is correct
28 Correct 226 ms 57808 KB Output is correct
29 Correct 211 ms 59184 KB Output is correct
30 Correct 181 ms 56968 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 328 ms 74260 KB Output is correct
33 Correct 343 ms 78440 KB Output is correct
34 Correct 238 ms 59156 KB Output is correct
35 Correct 204 ms 57604 KB Output is correct
36 Correct 396 ms 77852 KB Output is correct
37 Correct 248 ms 59140 KB Output is correct
38 Correct 240 ms 59256 KB Output is correct
39 Correct 149 ms 56924 KB Output is correct
40 Correct 176 ms 53852 KB Output is correct
41 Correct 206 ms 60896 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 399 ms 59820 KB Output is correct
44 Correct 380 ms 66964 KB Output is correct
45 Correct 490 ms 75140 KB Output is correct
46 Correct 532 ms 84684 KB Output is correct
47 Correct 428 ms 70740 KB Output is correct
48 Correct 232 ms 63352 KB Output is correct
49 Correct 183 ms 58556 KB Output is correct
50 Correct 159 ms 35084 KB Output is correct
51 Correct 470 ms 90472 KB Output is correct
52 Correct 194 ms 60620 KB Output is correct
53 Correct 0 ms 328 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 2 ms 824 KB Output is correct
57 Correct 2 ms 852 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 2 ms 724 KB Output is correct
60 Correct 1 ms 724 KB Output is correct
61 Correct 1 ms 852 KB Output is correct
62 Correct 2 ms 980 KB Output is correct
63 Correct 2 ms 852 KB Output is correct
64 Correct 2 ms 980 KB Output is correct
65 Correct 2 ms 852 KB Output is correct
66 Correct 2 ms 852 KB Output is correct
67 Correct 203 ms 58688 KB Output is correct
68 Correct 185 ms 58240 KB Output is correct
69 Correct 290 ms 68964 KB Output is correct
70 Correct 308 ms 72608 KB Output is correct
71 Correct 299 ms 71728 KB Output is correct
72 Correct 406 ms 59428 KB Output is correct
73 Correct 255 ms 81044 KB Output is correct
74 Correct 152 ms 57308 KB Output is correct
75 Correct 271 ms 66564 KB Output is correct
76 Correct 288 ms 57012 KB Output is correct
77 Correct 220 ms 57664 KB Output is correct
78 Correct 251 ms 57884 KB Output is correct
79 Correct 250 ms 59264 KB Output is correct
80 Correct 151 ms 56928 KB Output is correct
81 Correct 337 ms 78732 KB Output is correct
82 Correct 392 ms 78532 KB Output is correct
83 Correct 232 ms 59208 KB Output is correct
84 Correct 208 ms 57676 KB Output is correct
85 Correct 324 ms 77912 KB Output is correct
86 Correct 235 ms 59152 KB Output is correct
87 Correct 237 ms 59276 KB Output is correct
88 Correct 172 ms 53836 KB Output is correct
89 Correct 224 ms 60736 KB Output is correct
90 Correct 378 ms 64324 KB Output is correct
91 Correct 374 ms 67004 KB Output is correct
92 Correct 425 ms 75356 KB Output is correct
93 Correct 514 ms 84684 KB Output is correct
94 Correct 406 ms 70744 KB Output is correct
95 Correct 229 ms 63352 KB Output is correct
96 Correct 136 ms 58544 KB Output is correct
97 Correct 177 ms 35080 KB Output is correct
98 Correct 518 ms 90552 KB Output is correct
99 Correct 194 ms 60516 KB Output is correct
100 Correct 51 ms 11588 KB Output is correct
101 Correct 353 ms 69064 KB Output is correct
102 Correct 319 ms 56000 KB Output is correct
103 Correct 342 ms 51836 KB Output is correct
104 Correct 371 ms 61352 KB Output is correct