oj.uz

Submission #244309

# Submission time Handle Problem Language Result Execution time Memory
244309 2020-07-03T15:19:57 Z rqi Fireworks (APIO16_fireworks) C++14
100 / 100
 530 ms 62152 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

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

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

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

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

typedef pair<ll, multiset<ll>> T; //-starting slope, inflection points
const int mx = 300005;
int N, M;
vector<pair<int, ll>> adj[mx];
ll esum = 0; //sum of all edge values (y intercept)
T dp[mx];

void comb(T &a, T &b){ //a+=b
    //dbg(a, b);
    if(sz(a.s) < sz(b.s)) swap(a, b);
    a.f+=b.f;
    for(auto u: b.s){
        a.s.ins(u);
    }
    T s;
    swap(b, s); //save memory
}

void adjust(T &a){
    while(sz(a.s) > a.f+1) a.s.erase(prev(a.s.end())); //slope +2 at the end
}

void shift(T &a, ll inc){
    assert(sz(a.s) >= 2);
    auto it1 = prev(a.s.end());
    ll val1 = *it1;
    auto it2 = prev(prev(a.s.end()));
    ll val2 = *it2;
    a.s.erase(it1);
    a.s.erase(it2);
    val1+=inc;
    val2+=inc;
    a.s.ins(val1);
    a.s.ins(val2);
}

void solve(int node){
    if(sz(adj[node]) == 0){
        dp[node].f = 1;
        dp[node].s.ins(0);
        dp[node].s.ins(0);
        return;
    }

    // dbg(node);
    // dbg(adj[node]);
    for(int i = 0; i < sz(adj[node]); i++){
        auto u = adj[node][i];
        
        solve(u.f);
        //dbg(u.f, dp[u.f]);
        shift(dp[u.f], u.s);
        //dbg(u.f, dp[u.f]);
        if(i == 0){
            swap(dp[node], dp[u.f]);
        }
        else{
            comb(dp[node], dp[u.f]);
        }
    }
    adjust(dp[node]);
    // dbg(node, dp[node]);
}

int main() {
    setIO();
    
    cin >> N >> M;
    for(int i = 2; i <= N+M; i++){
        int P, C;
        cin >> P >> C;
        adj[P].pb(mp(i, C));
        esum+=C;
    }

    solve(1);
    //dbg(dp[1], esum);
    ll curslope = -dp[1].f;
    ll lastx = 0;
    for(auto u: dp[1].s){
        esum+=(u-lastx)*curslope;
        curslope++;
        lastx = u;
        if(curslope == 0) break;
    }
    ps(esum);
    // you should actually read the stuff at the bottom
}

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

Compilation message

fireworks.cpp: In function 'void setIn(std::__cxx11::string)':
fireworks.cpp:128:31: 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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
fireworks.cpp: In function 'void setOut(std::__cxx11::string)':
fireworks.cpp:129:32: 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
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 24 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 19 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 20 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 17 ms 23808 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 18 ms 23808 KB Output is correct
15 Correct 20 ms 23808 KB Output is correct
16 Correct 19 ms 23808 KB Output is correct
17 Correct 19 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 20 ms 23808 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 24 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 21 ms 23808 KB Output is correct
12 Correct 18 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 17 ms 23808 KB Output is correct
21 Correct 19 ms 23808 KB Output is correct
22 Correct 19 ms 23808 KB Output is correct
23 Correct 19 ms 23808 KB Output is correct
24 Correct 18 ms 23808 KB Output is correct
25 Correct 20 ms 23808 KB Output is correct
26 Correct 19 ms 23808 KB Output is correct
27 Correct 19 ms 23808 KB Output is correct
28 Correct 19 ms 23808 KB Output is correct
29 Correct 20 ms 23808 KB Output is correct
30 Correct 19 ms 23808 KB Output is correct
31 Correct 19 ms 23936 KB Output is correct
32 Correct 20 ms 23936 KB Output is correct
33 Correct 20 ms 23936 KB Output is correct
34 Correct 21 ms 24064 KB Output is correct
35 Correct 21 ms 24064 KB Output is correct
36 Correct 23 ms 24112 KB Output is correct
37 Correct 23 ms 24192 KB Output is correct
38 Correct 22 ms 24192 KB Output is correct
39 Correct 22 ms 24084 KB Output is correct
40 Correct 22 ms 24448 KB Output is correct
41 Correct 21 ms 24576 KB Output is correct
42 Correct 20 ms 24064 KB Output is correct
43 Correct 23 ms 24320 KB Output is correct
44 Correct 22 ms 24320 KB Output is correct
45 Correct 23 ms 24352 KB Output is correct
46 Correct 24 ms 24320 KB Output is correct
47 Correct 23 ms 24192 KB Output is correct
48 Correct 23 ms 24192 KB Output is correct
49 Correct 23 ms 24320 KB Output is correct
50 Correct 22 ms 24192 KB Output is correct
51 Correct 22 ms 24192 KB Output is correct
52 Correct 23 ms 24192 KB Output is correct
53 Correct 25 ms 24192 KB Output is correct
54 Correct 23 ms 24448 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 24 ms 23808 KB Output is correct
4 Correct 18 ms 23808 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 18 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 18 ms 23808 KB Output is correct
9 Correct 19 ms 23808 KB Output is correct
10 Correct 19 ms 23808 KB Output is correct
11 Correct 21 ms 23808 KB Output is correct
12 Correct 18 ms 23808 KB Output is correct
13 Correct 19 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 19 ms 23808 KB Output is correct
16 Correct 20 ms 23808 KB Output is correct
17 Correct 18 ms 23808 KB Output is correct
18 Correct 19 ms 23808 KB Output is correct
19 Correct 19 ms 23808 KB Output is correct
20 Correct 17 ms 23808 KB Output is correct
21 Correct 19 ms 23808 KB Output is correct
22 Correct 19 ms 23808 KB Output is correct
23 Correct 19 ms 23808 KB Output is correct
24 Correct 18 ms 23808 KB Output is correct
25 Correct 20 ms 23808 KB Output is correct
26 Correct 19 ms 23808 KB Output is correct
27 Correct 19 ms 23808 KB Output is correct
28 Correct 19 ms 23808 KB Output is correct
29 Correct 20 ms 23808 KB Output is correct
30 Correct 19 ms 23808 KB Output is correct
31 Correct 19 ms 23936 KB Output is correct
32 Correct 20 ms 23936 KB Output is correct
33 Correct 20 ms 23936 KB Output is correct
34 Correct 21 ms 24064 KB Output is correct
35 Correct 21 ms 24064 KB Output is correct
36 Correct 23 ms 24112 KB Output is correct
37 Correct 23 ms 24192 KB Output is correct
38 Correct 22 ms 24192 KB Output is correct
39 Correct 22 ms 24084 KB Output is correct
40 Correct 22 ms 24448 KB Output is correct
41 Correct 21 ms 24576 KB Output is correct
42 Correct 20 ms 24064 KB Output is correct
43 Correct 23 ms 24320 KB Output is correct
44 Correct 22 ms 24320 KB Output is correct
45 Correct 23 ms 24352 KB Output is correct
46 Correct 24 ms 24320 KB Output is correct
47 Correct 23 ms 24192 KB Output is correct
48 Correct 23 ms 24192 KB Output is correct
49 Correct 23 ms 24320 KB Output is correct
50 Correct 22 ms 24192 KB Output is correct
51 Correct 22 ms 24192 KB Output is correct
52 Correct 23 ms 24192 KB Output is correct
53 Correct 25 ms 24192 KB Output is correct
54 Correct 23 ms 24448 KB Output is correct
55 Correct 29 ms 24704 KB Output is correct
56 Correct 62 ms 26744 KB Output is correct
57 Correct 98 ms 28280 KB Output is correct
58 Correct 127 ms 29560 KB Output is correct
59 Correct 181 ms 31480 KB Output is correct
60 Correct 214 ms 32760 KB Output is correct
61 Correct 241 ms 34172 KB Output is correct
62 Correct 266 ms 35832 KB Output is correct
63 Correct 331 ms 37624 KB Output is correct
64 Correct 350 ms 37600 KB Output is correct
65 Correct 170 ms 62152 KB Output is correct
66 Correct 163 ms 62048 KB Output is correct
67 Correct 175 ms 33912 KB Output is correct
68 Correct 272 ms 52728 KB Output is correct
69 Correct 323 ms 51064 KB Output is correct
70 Correct 320 ms 51176 KB Output is correct
71 Correct 410 ms 45432 KB Output is correct
72 Correct 411 ms 45688 KB Output is correct
73 Correct 450 ms 44644 KB Output is correct
74 Correct 433 ms 44664 KB Output is correct
75 Correct 447 ms 44024 KB Output is correct
76 Correct 416 ms 44024 KB Output is correct
77 Correct 474 ms 43568 KB Output is correct
78 Correct 475 ms 44272 KB Output is correct
79 Correct 530 ms 57660 KB Output is correct