oj.uz

Submission #348640

# Submission time Handle Problem Language Result Execution time Memory
348640 2021-01-15T10:36:55 Z ACmachine Split the Attractions (IOI19_split) C++17
100 / 100
 166 ms 24704 KB 
#include "split.h"
 
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
 
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
 
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
 
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
 
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<vi> adj(n);
    int m = p.size();
    REP(i, m){
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    array<array<int, 2>, 3> P;
    P[0] = {a, 1}; P[1] = {b, 2}; P[2] = {c, 3};
    sort(all(P));
    a = P[0][0]; b = P[1][0]; c = P[2][0];
    int t = 0;
    vi in(n, -1);
    vi low(n, INF);
    vi subsz(n, 1);
    bool fn = false;
    vi res(n, 0);
    int to_mark = 0;
    function<void(int, int, int)> dfs_mark = [&](int v, int p, int id){
        if(res[v] != 0) return;
        if(to_mark > 0){
            res[v] = id;
            to_mark--;
        }
        else{
            res[v] = -1;
        }
        for(int x : adj[v]){
            if(in[x] < in[v] || x == p) continue;
            if(res[x] != 0) continue;
            dfs_mark(x, v, id);
        }
    };
    function<void(int, int)> dfs = [&](int v, int p){
        in[v] = ++t;
        for(int x : adj[v]){
            if(x == p) continue;
            if(in[x] == -1){
                dfs(x, v);
                subsz[v] += subsz[x];
                low[v] = min(low[v], low[x]);
            }
            else if(in[v] > in[x]){
                low[v] = min(low[v], in[x]);
            }
        }
        if(fn) return;
        if(subsz[v] < a) return;
        bool other_a = false; 
        for(int x : adj[v]){
            if(x == p) continue;
            if(in[x] < in[v]) continue;
            if(subsz[x] >= a) other_a = true;
        } 
        vi removed;
        if(!other_a){
            int curr = subsz[v];
            for(int x : adj[v]){
                if(fn) break;
                if(x == p || in[x] < in[v]) continue;
                if(low[x] >= in[v]) continue;
                if(curr - subsz[x] < a){
                    fn = true;
                    break;
                }
                else{
                    removed.pb(x);
                    curr -= subsz[x];
                }
            }
            if((n - curr) >= a){
                fn = true;
            } 
            if(fn){
                int pp = 0;
                if(curr >= b){
                    res[v] = P[1][1];
                    to_mark = P[1][0] - 1;
                }
                else{
                    res[v] = P[0][1];
                    to_mark = P[0][0] - 1;
                }
                for(int x : adj[v]){
                    if(x == p || in[x] < in[v]) continue; 
                    if(pp < (int)removed.size() && x == removed[pp]){
                        pp++;
                        continue;
                    }
                    if(curr >= b){
                        dfs_mark(x, v, P[1][1]);
                    }
                    else{
                        dfs_mark(x, v, P[0][1]);
                    }
                }
            }
        }
    };
    dfs(0, -1);
    if(!fn){
        return vi(n, 0);
    }
    int to_color = 0;
    function<void(int, int)> ndfs = [&](int v, int col){
        if(to_color == 0) return;
        res[v] = col;
        to_color--;
        for(int x : adj[v]){
            if(res[x] == 0) 
                ndfs(x, col);
        }
 
    };
    int next_col;
    int used = *max_element(all(res));
    if(P[0][1] == used){
        next_col = P[1][1];
        to_color = P[1][0];
    }
    else{
        next_col = P[0][1];
        to_color = P[0][0];
    }
    REP(i, n){
        if(res[i] == 0){
            ndfs(i, next_col);
            break;
        }
    }
    REP(i, n){
        if(res[i] == 0 || res[i] == -1) 
            res[i] = P[2][1];
    }
    return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB ok, correct split
2 Correct 0 ms 364 KB ok, correct split
3 Correct 1 ms 364 KB ok, correct split
4 Correct 0 ms 364 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 364 KB ok, correct split
7 Correct 120 ms 23788 KB ok, correct split
8 Correct 91 ms 19328 KB ok, correct split
9 Correct 114 ms 17900 KB ok, correct split
10 Correct 102 ms 24684 KB ok, correct split
11 Correct 110 ms 24684 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB ok, correct split
2 Correct 1 ms 256 KB ok, correct split
3 Correct 1 ms 364 KB ok, correct split
4 Correct 114 ms 17132 KB ok, correct split
5 Correct 83 ms 9068 KB ok, correct split
6 Correct 119 ms 24704 KB ok, correct split
7 Correct 112 ms 19052 KB ok, correct split
8 Correct 137 ms 11380 KB ok, correct split
9 Correct 93 ms 9068 KB ok, correct split
10 Correct 60 ms 9316 KB ok, correct split
11 Correct 61 ms 9316 KB ok, correct split
12 Correct 59 ms 9444 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB ok, correct split
2 Correct 103 ms 9196 KB ok, correct split
3 Correct 26 ms 3820 KB ok, correct split
4 Correct 1 ms 364 KB ok, correct split
5 Correct 104 ms 14188 KB ok, correct split
6 Correct 118 ms 13768 KB ok, correct split
7 Correct 110 ms 13420 KB ok, correct split
8 Correct 104 ms 16000 KB ok, correct split
9 Correct 119 ms 13036 KB ok, correct split
10 Correct 21 ms 3308 KB ok, no valid answer
11 Correct 32 ms 4864 KB ok, no valid answer
12 Correct 71 ms 9576 KB ok, no valid answer
13 Correct 88 ms 9452 KB ok, no valid answer
14 Correct 59 ms 9720 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB ok, correct split
2 Correct 1 ms 364 KB ok, no valid answer
3 Correct 1 ms 364 KB ok, correct split
4 Correct 0 ms 364 KB ok, correct split
5 Correct 1 ms 364 KB ok, correct split
6 Correct 1 ms 364 KB ok, correct split
7 Correct 1 ms 380 KB ok, correct split
8 Correct 1 ms 364 KB ok, correct split
9 Correct 4 ms 748 KB ok, correct split
10 Correct 3 ms 620 KB ok, correct split
11 Correct 1 ms 364 KB ok, correct split
12 Correct 3 ms 748 KB ok, correct split
13 Correct 1 ms 364 KB ok, correct split
14 Correct 1 ms 364 KB ok, correct split
15 Correct 1 ms 364 KB ok, correct split
16 Correct 1 ms 364 KB ok, correct split
17 Correct 1 ms 364 KB ok, correct split
18 Correct 1 ms 364 KB ok, correct split
19 Correct 1 ms 364 KB ok, correct split
20 Correct 1 ms 492 KB ok, correct split
21 Correct 2 ms 748 KB ok, correct split
22 Correct 2 ms 620 KB ok, correct split
23 Correct 2 ms 748 KB ok, correct split
24 Correct 2 ms 748 KB ok, correct split
25 Correct 2 ms 748 KB ok, correct split
26 Correct 3 ms 620 KB ok, correct split
27 Correct 3 ms 620 KB ok, correct split
28 Correct 3 ms 620 KB ok, correct split
29 Correct 1 ms 364 KB ok, correct split
30 Correct 3 ms 620 KB ok, correct split
31 Correct 1 ms 364 KB ok, correct split
32 Correct 1 ms 364 KB ok, correct split
33 Correct 1 ms 364 KB ok, correct split
34 Correct 2 ms 620 KB ok, correct split
35 Correct 2 ms 620 KB ok, correct split
36 Correct 2 ms 620 KB ok, correct split
37 Correct 3 ms 620 KB ok, correct split
38 Correct 3 ms 748 KB ok, correct split
39 Correct 3 ms 620 KB ok, correct split
40 Correct 3 ms 620 KB ok, correct split
41 Correct 2 ms 492 KB ok, correct split
42 Correct 2 ms 492 KB ok, correct split
43 Correct 3 ms 620 KB ok, correct split
44 Correct 3 ms 620 KB ok, correct split
45 Correct 3 ms 620 KB ok, correct split
46 Correct 3 ms 876 KB ok, correct split
47 Correct 2 ms 748 KB ok, no valid answer
48 Correct 2 ms 620 KB ok, correct split
49 Correct 3 ms 876 KB ok, correct split
50 Correct 1 ms 364 KB ok, no valid answer
51 Correct 1 ms 364 KB ok, no valid answer
52 Correct 2 ms 620 KB ok, no valid answer
53 Correct 3 ms 620 KB ok, no valid answer
54 Correct 2 ms 620 KB ok, no valid answer
55 Correct 2 ms 620 KB ok, no valid answer
56 Correct 2 ms 620 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB ok, correct split
2 Correct 0 ms 364 KB ok, correct split
3 Correct 1 ms 364 KB ok, correct split
4 Correct 0 ms 364 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 364 KB ok, correct split
7 Correct 120 ms 23788 KB ok, correct split
8 Correct 91 ms 19328 KB ok, correct split
9 Correct 114 ms 17900 KB ok, correct split
10 Correct 102 ms 24684 KB ok, correct split
11 Correct 110 ms 24684 KB ok, correct split
12 Correct 1 ms 364 KB ok, correct split
13 Correct 1 ms 256 KB ok, correct split
14 Correct 1 ms 364 KB ok, correct split
15 Correct 114 ms 17132 KB ok, correct split
16 Correct 83 ms 9068 KB ok, correct split
17 Correct 119 ms 24704 KB ok, correct split
18 Correct 112 ms 19052 KB ok, correct split
19 Correct 137 ms 11380 KB ok, correct split
20 Correct 93 ms 9068 KB ok, correct split
21 Correct 60 ms 9316 KB ok, correct split
22 Correct 61 ms 9316 KB ok, correct split
23 Correct 59 ms 9444 KB ok, correct split
24 Correct 1 ms 364 KB ok, correct split
25 Correct 103 ms 9196 KB ok, correct split
26 Correct 26 ms 3820 KB ok, correct split
27 Correct 1 ms 364 KB ok, correct split
28 Correct 104 ms 14188 KB ok, correct split
29 Correct 118 ms 13768 KB ok, correct split
30 Correct 110 ms 13420 KB ok, correct split
31 Correct 104 ms 16000 KB ok, correct split
32 Correct 119 ms 13036 KB ok, correct split
33 Correct 21 ms 3308 KB ok, no valid answer
34 Correct 32 ms 4864 KB ok, no valid answer
35 Correct 71 ms 9576 KB ok, no valid answer
36 Correct 88 ms 9452 KB ok, no valid answer
37 Correct 59 ms 9720 KB ok, no valid answer
38 Correct 1 ms 364 KB ok, correct split
39 Correct 1 ms 364 KB ok, no valid answer
40 Correct 1 ms 364 KB ok, correct split
41 Correct 0 ms 364 KB ok, correct split
42 Correct 1 ms 364 KB ok, correct split
43 Correct 1 ms 364 KB ok, correct split
44 Correct 1 ms 380 KB ok, correct split
45 Correct 1 ms 364 KB ok, correct split
46 Correct 4 ms 748 KB ok, correct split
47 Correct 3 ms 620 KB ok, correct split
48 Correct 1 ms 364 KB ok, correct split
49 Correct 3 ms 748 KB ok, correct split
50 Correct 1 ms 364 KB ok, correct split
51 Correct 1 ms 364 KB ok, correct split
52 Correct 1 ms 364 KB ok, correct split
53 Correct 1 ms 364 KB ok, correct split
54 Correct 1 ms 364 KB ok, correct split
55 Correct 1 ms 364 KB ok, correct split
56 Correct 1 ms 364 KB ok, correct split
57 Correct 1 ms 492 KB ok, correct split
58 Correct 2 ms 748 KB ok, correct split
59 Correct 2 ms 620 KB ok, correct split
60 Correct 2 ms 748 KB ok, correct split
61 Correct 2 ms 748 KB ok, correct split
62 Correct 2 ms 748 KB ok, correct split
63 Correct 3 ms 620 KB ok, correct split
64 Correct 3 ms 620 KB ok, correct split
65 Correct 3 ms 620 KB ok, correct split
66 Correct 1 ms 364 KB ok, correct split
67 Correct 3 ms 620 KB ok, correct split
68 Correct 1 ms 364 KB ok, correct split
69 Correct 1 ms 364 KB ok, correct split
70 Correct 1 ms 364 KB ok, correct split
71 Correct 2 ms 620 KB ok, correct split
72 Correct 2 ms 620 KB ok, correct split
73 Correct 2 ms 620 KB ok, correct split
74 Correct 3 ms 620 KB ok, correct split
75 Correct 3 ms 748 KB ok, correct split
76 Correct 3 ms 620 KB ok, correct split
77 Correct 3 ms 620 KB ok, correct split
78 Correct 2 ms 492 KB ok, correct split
79 Correct 2 ms 492 KB ok, correct split
80 Correct 3 ms 620 KB ok, correct split
81 Correct 3 ms 620 KB ok, correct split
82 Correct 3 ms 620 KB ok, correct split
83 Correct 3 ms 876 KB ok, correct split
84 Correct 2 ms 748 KB ok, no valid answer
85 Correct 2 ms 620 KB ok, correct split
86 Correct 3 ms 876 KB ok, correct split
87 Correct 1 ms 364 KB ok, no valid answer
88 Correct 1 ms 364 KB ok, no valid answer
89 Correct 2 ms 620 KB ok, no valid answer
90 Correct 3 ms 620 KB ok, no valid answer
91 Correct 2 ms 620 KB ok, no valid answer
92 Correct 2 ms 620 KB ok, no valid answer
93 Correct 2 ms 620 KB ok, no valid answer
94 Correct 110 ms 15340 KB ok, correct split
95 Correct 166 ms 23148 KB ok, correct split
96 Correct 147 ms 20716 KB ok, correct split
97 Correct 27 ms 4332 KB ok, correct split
98 Correct 30 ms 4460 KB ok, correct split
99 Correct 49 ms 7788 KB ok, correct split
100 Correct 146 ms 14572 KB ok, correct split
101 Correct 124 ms 13292 KB ok, correct split
102 Correct 118 ms 12388 KB ok, correct split
103 Correct 109 ms 12132 KB ok, correct split
104 Correct 116 ms 13656 KB ok, correct split
105 Correct 45 ms 6508 KB ok, correct split
106 Correct 129 ms 14300 KB ok, correct split
107 Correct 94 ms 10348 KB ok, correct split
108 Correct 92 ms 10220 KB ok, correct split
109 Correct 152 ms 13676 KB ok, correct split
110 Correct 142 ms 13284 KB ok, correct split
111 Correct 139 ms 13412 KB ok, correct split
112 Correct 132 ms 13544 KB ok, correct split
113 Correct 136 ms 13540 KB ok, correct split
114 Correct 12 ms 2284 KB ok, correct split
115 Correct 14 ms 1900 KB ok, correct split
116 Correct 126 ms 13284 KB ok, correct split
117 Correct 132 ms 13156 KB ok, correct split
118 Correct 96 ms 10348 KB ok, correct split
119 Correct 89 ms 10220 KB ok, correct split
120 Correct 105 ms 18412 KB ok, correct split
121 Correct 79 ms 10604 KB ok, no valid answer
122 Correct 77 ms 10716 KB ok, no valid answer
123 Correct 145 ms 15340 KB ok, no valid answer
124 Correct 143 ms 14956 KB ok, no valid answer
125 Correct 85 ms 11876 KB ok, no valid answer
126 Correct 54 ms 9828 KB ok, no valid answer
127 Correct 101 ms 12260 KB ok, no valid answer