Submission #244211

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
244211	2020-07-02T22:20:21 Z	rqi	Fireworks (APIO16_fireworks)	C++14	7 / 100	9 ms	7552 KB

fireworks

#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<pl, ll> T;
const int mx = 300005;
int N, M;
vector<pair<int, ll>> adj[mx];

T ID = mp(mp(0, INF), 0);
T comb(T a, T b){
    if(a.f.f > b.f.f) swap(a, b);
    if(a.f.s <= b.f.f){
        return mp(mp(a.f.s, b.f.f), a.s+b.s+b.f.f-a.f.s);
    }
    return mp(mp(b.f.f, min(a.f.s, b.f.s)), a.s+b.s);
}

T solve(int node){
    
    if(node > N) return mp(mp(0, 0), 0);
    ll c = 0; //c value
    int curslop = -sz(adj[node]);
    vl inflections;
    vector<T> vals;
    for(auto u: adj[node]){
        T x = solve(u.f);
        x.f.f+=u.s;
        x.f.s+=u.s;
        vals.pb(x);
        inflections.pb(x.f.f);
        inflections.pb(x.f.s);
    }
    sort(all(inflections));
    //if(node == 3) dbg(curslop, inflections);
    for(int i = 0; i < sz(inflections); i++){
        curslop++;
        if(curslop < 0) continue;
        ll l = inflections[i];
        ll r = inflections[i+1];
        //if(node == 3) dbg(l, r);
        for(auto u: vals){
            c+=u.s;
            if(l <= u.f.f){
                c+=u.f.f-l;
            }
            if(u.f.s <= l){
                c+=l-u.f.s;
            }
        }
        //dbg(node, l, r, c);
        return mp(mp(l, r), c);
    }
}

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

    // for(int i = 1; i <= N+M; i++){
    //     dbg(i, adj[i]);
    // }

    T ans = solve(1);
    ps(ans.s);
    // 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); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp: In function 'T solve(int)':
fireworks.cpp:188:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	7424 KB	Output is correct
2	Correct	8 ms	7424 KB	Output is correct
3	Correct	8 ms	7424 KB	Output is correct
4	Correct	8 ms	7424 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	9 ms	7424 KB	Output is correct
7	Correct	8 ms	7424 KB	Output is correct
8	Correct	8 ms	7424 KB	Output is correct
9	Correct	9 ms	7424 KB	Output is correct
10	Correct	9 ms	7424 KB	Output is correct

Subtask #2
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	7424 KB	Output is correct
2	Correct	9 ms	7424 KB	Output is correct
3	Incorrect	9 ms	7424 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	7424 KB	Output is correct
2	Correct	8 ms	7424 KB	Output is correct
3	Correct	8 ms	7424 KB	Output is correct
4	Correct	8 ms	7424 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	9 ms	7424 KB	Output is correct
7	Correct	8 ms	7424 KB	Output is correct
8	Correct	8 ms	7424 KB	Output is correct
9	Correct	9 ms	7424 KB	Output is correct
10	Correct	9 ms	7424 KB	Output is correct
11	Correct	8 ms	7424 KB	Output is correct
12	Correct	9 ms	7424 KB	Output is correct
13	Incorrect	9 ms	7424 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #4
0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	7424 KB	Output is correct
2	Correct	8 ms	7424 KB	Output is correct
3	Correct	8 ms	7424 KB	Output is correct
4	Correct	8 ms	7424 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	9 ms	7424 KB	Output is correct
7	Correct	8 ms	7424 KB	Output is correct
8	Correct	8 ms	7424 KB	Output is correct
9	Correct	9 ms	7424 KB	Output is correct
10	Correct	9 ms	7424 KB	Output is correct
11	Correct	8 ms	7424 KB	Output is correct
12	Correct	9 ms	7424 KB	Output is correct
13	Incorrect	9 ms	7424 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Submission #244211

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 0 / 19.0

Subtask #3 0 / 29.0

Subtask #4 0 / 45.0

Subtask #1
7.0 / 7.0

Subtask #2
0 / 19.0

Subtask #3
0 / 29.0

Subtask #4
0 / 45.0