oj.uz

답안 #259411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259411 2020-08-07T18:28:31 Z b00n0rp Fireworks (APIO16_fireworks) C++17
100 / 100
 246 ms 63848 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#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;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 300005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m;
int par[MAXN],weight[MAXN];
priority_queue<int>* pq[MAXN];
vi adj[MAXN];
int a[MAXN],b[MAXN];
 
void solvethetestcase(){
    cin >> n >> m;
    FOR(i,2,n+m+1){
    	cin >> par[i] >> weight[i];
    	adj[par[i]].pb(i);
    	b[i] = -weight[i];
    }
    FORD(i,n+m,n+1){
    	pq[i] = new priority_queue<int>();
    	pq[i]->push(-b[i]);
    	pq[i]->push(-b[i]);
    	a[i] = 1;
    }
    FORD(i,n,1){
    	int bigchild = -1,mx = -1;
    	for(auto u:adj[i]){
    		if((int)pq[u]->size() > mx){
    			bigchild = u;
    			mx = pq[u]->size();
    		}
    	}
    	pq[i] = pq[bigchild];
    	a[i] = a[bigchild];
    	b[i] += b[bigchild];
    	for(auto u:adj[i]){
    		if(u != bigchild){
    			a[i] += a[u];
    			b[i] += b[u];
    			while(pq[u]->size()){
    				pq[i]->push(pq[u]->top());
    				pq[u]->pop();
    			}
    		}
    	}
    	while(a[i] > 1){
    		b[i] += pq[i]->top();
    		pq[i]->pop();
    		a[i]--;
    	}
    	int s1 = pq[i]->top();
    	pq[i]->pop();
    	int s0 = pq[i]->top();
    	pq[i]->pop();
    	pq[i]->push(s1+weight[i]);
    	pq[i]->push(s0+weight[i]);
    }
    cout << b[1]+pq[1]->top() << "\n";
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7424 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 5 ms 7424 KB Output is correct
18 Correct 5 ms 7424 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7424 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 5 ms 7424 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct
20 Correct 5 ms 7424 KB Output is correct
21 Correct 5 ms 7424 KB Output is correct
22 Correct 5 ms 7424 KB Output is correct
23 Correct 5 ms 7424 KB Output is correct
24 Correct 5 ms 7424 KB Output is correct
25 Correct 5 ms 7424 KB Output is correct
26 Correct 5 ms 7424 KB Output is correct
27 Correct 5 ms 7424 KB Output is correct
28 Correct 5 ms 7424 KB Output is correct
29 Correct 5 ms 7424 KB Output is correct
30 Correct 5 ms 7424 KB Output is correct
31 Correct 5 ms 7552 KB Output is correct
32 Correct 6 ms 7552 KB Output is correct
33 Correct 8 ms 7808 KB Output is correct
34 Correct 7 ms 7808 KB Output is correct
35 Correct 7 ms 7808 KB Output is correct
36 Correct 9 ms 7936 KB Output is correct
37 Correct 8 ms 8064 KB Output is correct
38 Correct 9 ms 8192 KB Output is correct
39 Correct 8 ms 8064 KB Output is correct
40 Correct 7 ms 7808 KB Output is correct
41 Correct 7 ms 7808 KB Output is correct
42 Correct 7 ms 7808 KB Output is correct
43 Correct 8 ms 8064 KB Output is correct
44 Correct 8 ms 8064 KB Output is correct
45 Correct 8 ms 8064 KB Output is correct
46 Correct 8 ms 8320 KB Output is correct
47 Correct 8 ms 8320 KB Output is correct
48 Correct 8 ms 8192 KB Output is correct
49 Correct 8 ms 8320 KB Output is correct
50 Correct 7 ms 8064 KB Output is correct
51 Correct 7 ms 8064 KB Output is correct
52 Correct 8 ms 8192 KB Output is correct
53 Correct 8 ms 8192 KB Output is correct
54 Correct 8 ms 8320 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7424 KB Output is correct
2 Correct 5 ms 7424 KB Output is correct
3 Correct 5 ms 7424 KB Output is correct
4 Correct 5 ms 7424 KB Output is correct
5 Correct 5 ms 7424 KB Output is correct
6 Correct 5 ms 7424 KB Output is correct
7 Correct 5 ms 7424 KB Output is correct
8 Correct 5 ms 7424 KB Output is correct
9 Correct 5 ms 7424 KB Output is correct
10 Correct 5 ms 7424 KB Output is correct
11 Correct 5 ms 7424 KB Output is correct
12 Correct 5 ms 7424 KB Output is correct
13 Correct 5 ms 7424 KB Output is correct
14 Correct 5 ms 7424 KB Output is correct
15 Correct 5 ms 7424 KB Output is correct
16 Correct 5 ms 7424 KB Output is correct
17 Correct 5 ms 7424 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 5 ms 7424 KB Output is correct
20 Correct 5 ms 7424 KB Output is correct
21 Correct 5 ms 7424 KB Output is correct
22 Correct 5 ms 7424 KB Output is correct
23 Correct 5 ms 7424 KB Output is correct
24 Correct 5 ms 7424 KB Output is correct
25 Correct 5 ms 7424 KB Output is correct
26 Correct 5 ms 7424 KB Output is correct
27 Correct 5 ms 7424 KB Output is correct
28 Correct 5 ms 7424 KB Output is correct
29 Correct 5 ms 7424 KB Output is correct
30 Correct 5 ms 7424 KB Output is correct
31 Correct 5 ms 7552 KB Output is correct
32 Correct 6 ms 7552 KB Output is correct
33 Correct 8 ms 7808 KB Output is correct
34 Correct 7 ms 7808 KB Output is correct
35 Correct 7 ms 7808 KB Output is correct
36 Correct 9 ms 7936 KB Output is correct
37 Correct 8 ms 8064 KB Output is correct
38 Correct 9 ms 8192 KB Output is correct
39 Correct 8 ms 8064 KB Output is correct
40 Correct 7 ms 7808 KB Output is correct
41 Correct 7 ms 7808 KB Output is correct
42 Correct 7 ms 7808 KB Output is correct
43 Correct 8 ms 8064 KB Output is correct
44 Correct 8 ms 8064 KB Output is correct
45 Correct 8 ms 8064 KB Output is correct
46 Correct 8 ms 8320 KB Output is correct
47 Correct 8 ms 8320 KB Output is correct
48 Correct 8 ms 8192 KB Output is correct
49 Correct 8 ms 8320 KB Output is correct
50 Correct 7 ms 8064 KB Output is correct
51 Correct 7 ms 8064 KB Output is correct
52 Correct 8 ms 8192 KB Output is correct
53 Correct 8 ms 8192 KB Output is correct
54 Correct 8 ms 8320 KB Output is correct
55 Correct 12 ms 9088 KB Output is correct
56 Correct 35 ms 13820 KB Output is correct
57 Correct 60 ms 18168 KB Output is correct
58 Correct 79 ms 21184 KB Output is correct
59 Correct 109 ms 25848 KB Output is correct
60 Correct 137 ms 30196 KB Output is correct
61 Correct 159 ms 33776 KB Output is correct
62 Correct 185 ms 36332 KB Output is correct
63 Correct 222 ms 41840 KB Output is correct
64 Correct 246 ms 43632 KB Output is correct
65 Correct 121 ms 33404 KB Output is correct
66 Correct 122 ms 33400 KB Output is correct
67 Correct 122 ms 33500 KB Output is correct
68 Correct 184 ms 42348 KB Output is correct
69 Correct 206 ms 42864 KB Output is correct
70 Correct 210 ms 42856 KB Output is correct
71 Correct 231 ms 63624 KB Output is correct
72 Correct 227 ms 63848 KB Output is correct
73 Correct 204 ms 60008 KB Output is correct
74 Correct 200 ms 60264 KB Output is correct
75 Correct 217 ms 58688 KB Output is correct
76 Correct 202 ms 58860 KB Output is correct
77 Correct 210 ms 57320 KB Output is correct
78 Correct 209 ms 56932 KB Output is correct
79 Correct 198 ms 56800 KB Output is correct