oj.uz

Submission #143646

# Submission time Handle Problem Language Result Execution time Memory
143646 2019-08-14T19:42:16 Z Benq Tax Evasion (LMIO19_mokesciai) C++14
100 / 100
 248 ms 42700 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    // friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend void pr(const modular& a) { pr(a.val); }
    friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
    friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int N,M,anc[MX],depth[MX];
vi child[MX];
bool bad[MX];
int st[MX], en[MX], ans = MOD;

template<class T, int SZ> struct Seg { // SZ should be power of 2
    T ID = {-MOD,-MOD}; // comb(ID,b) must equal b
    T comb(T a, T b) { return max(a,b); } // easily change this to min or max

    T seg[2*SZ];
    Seg() { memset(seg,0,sizeof seg); }

    void build() { FORd(i,1,SZ) seg[i] = comb(seg[2*i],seg[2*i+1]); }

    void upd(int p, T value) {  // set value at position p
        seg[p += SZ] = value;
        for (p /= 2; p; p /= 2) seg[p] = comb(seg[2*p],seg[2*p+1]);
    }

    T query(int l, int r) {  // sum on interval [l, r]
        r ++; T lres = ID, rres = ID; // make sure non-commutative operations work
        for (l += SZ, r += SZ; l < r; l /= 2, r /= 2) {
            if (l&1) lres = comb(lres,seg[l++]);
            if (r&1) rres = comb(seg[--r],rres);
        }
        return comb(lres,rres);
    }
};

Seg<pi,1<<19> S;

vi v;
int co = 0;
vpi todo;

void dfs(int x) {
	st[x] = co++;
	S.upd(st[x],{depth[x],st[x]});
	v.pb(x);
	if (bad[x]) {
		if (x == 1) {
			ps(1);
			exit(0);
		}
		todo.pb({depth[x],v[(sz(v)+1)/2]});
	}
	trav(t,child[x]) {
		depth[t] = depth[x]+1;
		dfs(t);
	}
	en[x] = co-1;
	v.pop_back();
}

void rem(int x) {
	pi t = S.query(st[x],en[x]);
	// ps("HA",x,t);
	ckmin(ans,t.f); S.upd(t.s,{-MOD,-MOD});
}

int main() {
    setIO(); re(N,M);
    FOR(i,2,N+1) {
    	int p; re(p);
    	child[p].pb(i);
    }
    F0R(i,M) {
    	int x; re(x);
    	bad[x] = 1;
    }
    depth[1] = 1; dfs(1);
    sort(todo.rbegin(),todo.rend());
    trav(t,todo) rem(t.s);
    ps(ans);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

mokesciai.cpp: In function 'void io::setIn(std::__cxx11::string)':
mokesciai.cpp:113:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mokesciai.cpp: In function 'void io::setOut(std::__cxx11::string)':
mokesciai.cpp:114:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13304 KB Output is correct
2 Correct 14 ms 13436 KB Output is correct
3 Correct 17 ms 14072 KB Output is correct
4 Correct 18 ms 14044 KB Output is correct
5 Correct 17 ms 13944 KB Output is correct
6 Correct 116 ms 39788 KB Output is correct
7 Correct 116 ms 39916 KB Output is correct
8 Correct 16 ms 13944 KB Output is correct
9 Correct 179 ms 41948 KB Output is correct
10 Correct 205 ms 42700 KB Output is correct
11 Correct 157 ms 41204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 13304 KB Output is correct
2 Correct 15 ms 13688 KB Output is correct
3 Correct 15 ms 13688 KB Output is correct
4 Correct 15 ms 13432 KB Output is correct
5 Correct 15 ms 13532 KB Output is correct
6 Correct 15 ms 13432 KB Output is correct
7 Correct 116 ms 39788 KB Output is correct
8 Correct 116 ms 39916 KB Output is correct
9 Correct 16 ms 13944 KB Output is correct
10 Correct 102 ms 27596 KB Output is correct
11 Correct 103 ms 27688 KB Output is correct
12 Correct 116 ms 19052 KB Output is correct
13 Correct 107 ms 29608 KB Output is correct
14 Correct 101 ms 19960 KB Output is correct
15 Correct 141 ms 19248 KB Output is correct
16 Correct 119 ms 29680 KB Output is correct
17 Correct 172 ms 20056 KB Output is correct
18 Correct 110 ms 33160 KB Output is correct
19 Correct 107 ms 24312 KB Output is correct
20 Correct 129 ms 23416 KB Output is correct
21 Correct 127 ms 23288 KB Output is correct
22 Correct 145 ms 23416 KB Output is correct
23 Correct 125 ms 22748 KB Output is correct
24 Correct 133 ms 23132 KB Output is correct

Subtask #3
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13304 KB Output is correct
2 Correct 32 ms 13228 KB Output is correct
3 Correct 13 ms 13304 KB Output is correct
4 Correct 16 ms 13304 KB Output is correct
5 Correct 13 ms 13304 KB Output is correct
6 Correct 16 ms 13576 KB Output is correct
7 Correct 18 ms 13560 KB Output is correct
8 Correct 18 ms 13816 KB Output is correct
9 Correct 19 ms 13432 KB Output is correct
10 Correct 15 ms 13432 KB Output is correct
11 Correct 16 ms 13688 KB Output is correct
12 Correct 16 ms 13432 KB Output is correct
13 Correct 18 ms 13688 KB Output is correct
14 Correct 17 ms 13432 KB Output is correct
15 Correct 16 ms 13816 KB Output is correct
16 Correct 16 ms 13816 KB Output is correct
17 Correct 16 ms 13560 KB Output is correct
18 Correct 18 ms 13816 KB Output is correct
19 Correct 17 ms 13560 KB Output is correct
20 Correct 16 ms 13560 KB Output is correct
21 Correct 15 ms 13560 KB Output is correct
22 Correct 14 ms 13304 KB Output is correct
23 Correct 14 ms 13436 KB Output is correct
24 Correct 17 ms 14072 KB Output is correct
25 Correct 18 ms 14044 KB Output is correct
26 Correct 17 ms 13944 KB Output is correct
27 Correct 15 ms 13304 KB Output is correct
28 Correct 15 ms 13688 KB Output is correct
29 Correct 15 ms 13688 KB Output is correct
30 Correct 15 ms 13432 KB Output is correct
31 Correct 15 ms 13532 KB Output is correct
32 Correct 15 ms 13432 KB Output is correct
33 Correct 16 ms 13944 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 13304 KB Output is correct
2 Correct 32 ms 13228 KB Output is correct
3 Correct 13 ms 13304 KB Output is correct
4 Correct 16 ms 13304 KB Output is correct
5 Correct 13 ms 13304 KB Output is correct
6 Correct 16 ms 13576 KB Output is correct
7 Correct 18 ms 13560 KB Output is correct
8 Correct 18 ms 13816 KB Output is correct
9 Correct 19 ms 13432 KB Output is correct
10 Correct 15 ms 13432 KB Output is correct
11 Correct 16 ms 13688 KB Output is correct
12 Correct 16 ms 13432 KB Output is correct
13 Correct 18 ms 13688 KB Output is correct
14 Correct 17 ms 13432 KB Output is correct
15 Correct 16 ms 13816 KB Output is correct
16 Correct 16 ms 13816 KB Output is correct
17 Correct 16 ms 13560 KB Output is correct
18 Correct 18 ms 13816 KB Output is correct
19 Correct 17 ms 13560 KB Output is correct
20 Correct 16 ms 13560 KB Output is correct
21 Correct 15 ms 13560 KB Output is correct
22 Correct 14 ms 13304 KB Output is correct
23 Correct 14 ms 13436 KB Output is correct
24 Correct 17 ms 14072 KB Output is correct
25 Correct 18 ms 14044 KB Output is correct
26 Correct 17 ms 13944 KB Output is correct
27 Correct 15 ms 13304 KB Output is correct
28 Correct 15 ms 13688 KB Output is correct
29 Correct 15 ms 13688 KB Output is correct
30 Correct 15 ms 13432 KB Output is correct
31 Correct 15 ms 13532 KB Output is correct
32 Correct 15 ms 13432 KB Output is correct
33 Correct 116 ms 39788 KB Output is correct
34 Correct 116 ms 39916 KB Output is correct
35 Correct 16 ms 13944 KB Output is correct
36 Correct 102 ms 27596 KB Output is correct
37 Correct 103 ms 27688 KB Output is correct
38 Correct 116 ms 19052 KB Output is correct
39 Correct 107 ms 29608 KB Output is correct
40 Correct 101 ms 19960 KB Output is correct
41 Correct 141 ms 19248 KB Output is correct
42 Correct 119 ms 29680 KB Output is correct
43 Correct 172 ms 20056 KB Output is correct
44 Correct 110 ms 33160 KB Output is correct
45 Correct 107 ms 24312 KB Output is correct
46 Correct 129 ms 23416 KB Output is correct
47 Correct 127 ms 23288 KB Output is correct
48 Correct 145 ms 23416 KB Output is correct
49 Correct 125 ms 22748 KB Output is correct
50 Correct 133 ms 23132 KB Output is correct
51 Correct 179 ms 41948 KB Output is correct
52 Correct 205 ms 42700 KB Output is correct
53 Correct 157 ms 41204 KB Output is correct
54 Correct 119 ms 28288 KB Output is correct
55 Correct 124 ms 28272 KB Output is correct
56 Correct 145 ms 30380 KB Output is correct
57 Correct 146 ms 21548 KB Output is correct
58 Correct 124 ms 18900 KB Output is correct
59 Correct 158 ms 26332 KB Output is correct
60 Correct 175 ms 20824 KB Output is correct
61 Correct 201 ms 32744 KB Output is correct
62 Correct 248 ms 22000 KB Output is correct
63 Correct 188 ms 34668 KB Output is correct
64 Correct 141 ms 25380 KB Output is correct
65 Correct 154 ms 24584 KB Output is correct
66 Correct 196 ms 25156 KB Output is correct
67 Correct 189 ms 25328 KB Output is correct
68 Correct 159 ms 24700 KB Output is correct
69 Correct 196 ms 26352 KB Output is correct
70 Correct 105 ms 18416 KB Output is correct
71 Correct 136 ms 28772 KB Output is correct