oj.uz

답안 #417232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417232 2021-06-03T13:41:52 Z huangqr Worst Reporter 4 (JOI21_worst_reporter4) C++14
14 / 100
 2000 ms 61664 KB 
#ifdef local
#define debug(x) cout<<#x<<" "<<x<<endl;
#else
#define debug(x)
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
const ll mod=1e9+7,lim=2e5+5,bitlim=15,inf=1e9;
vector<ll>adjl[lim];
ll pwr[lim],cost[lim];
 
map<ll,ll> dp(ll pos){
	if(adjl[pos].size() == 0){
		map<ll,ll>ret;
		ret[0] = 0;
		ret[pwr[pos] + 1] = cost[pos];
		return ret;
	}
	else{
		map<ll,ll> *ret;
		vector<map<ll,ll> >vv;
		ll maxsz=0,maxszidx=0;
		for(auto u:adjl[pos]){
			vv.push_back(dp(u));
			if(vv.back().size()>maxsz){
				maxsz=vv.back().size();
				maxszidx=vv.size()-1;
			}
		}
		ret = &vv[maxszidx];
		for(int i=0;i<adjl[pos].size();i++){
			if(i==maxszidx)continue;
			for(auto p:vv[i]){
				ll k,v;
				tie(k,v)=p;
				ret->operator[](k)+=v;
			}
		}
		ret->operator[](0) += cost[pos];
		ret->operator[](pwr[pos] + 1) += cost[pos];
		auto it=ret->upper_bound(pwr[pos]);
		ll rem=cost[pos];
		while(rem>0){
			it--;
			if(rem<=it->second)it->second-=rem,rem=0;
			else rem-=it->second,it=ret->erase(it);
		}
		return *ret;
	}
}
 
int main(){
	ios_base::sync_with_stdio(0),cin.tie(NULL);
	ll n;
	cin>>n;
	for(int i=1;i<=n;i++){
		ll a;
		cin>>a>>pwr[i]>>cost[i];
		if(i!=a)adjl[a].push_back(i);
	}
	cout<<dp(1).begin()->second<<"\n";
	return 0;
}

Compilation message

worst_reporter2.cpp: In function 'std::map<long long int, long long int> dp(ll)':
worst_reporter2.cpp:27:23: warning: comparison of integer expressions of different signedness: 'std::map<long long int, long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   27 |    if(vv.back().size()>maxsz){
      |       ~~~~~~~~~~~~~~~~^~~~~~
worst_reporter2.cpp:33:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   for(int i=0;i<adjl[pos].size();i++){
      |               ~^~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 10 ms 5696 KB Output is correct
6 Correct 8 ms 5196 KB Output is correct
7 Correct 7 ms 5196 KB Output is correct
8 Correct 10 ms 5776 KB Output is correct
9 Correct 8 ms 5196 KB Output is correct
10 Correct 7 ms 5196 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 32 ms 6348 KB Output is correct
13 Correct 8 ms 6428 KB Output is correct
14 Correct 24 ms 5848 KB Output is correct
15 Correct 15 ms 5836 KB Output is correct
16 Correct 13 ms 5624 KB Output is correct
17 Correct 8 ms 5208 KB Output is correct
18 Correct 8 ms 5140 KB Output is correct
19 Correct 181 ms 6052 KB Output is correct
20 Correct 16 ms 5836 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 8 ms 6536 KB Output is correct
23 Correct 8 ms 6048 KB Output is correct
24 Correct 358 ms 6476 KB Output is correct
25 Correct 15 ms 6220 KB Output is correct
26 Correct 619 ms 7052 KB Output is correct
27 Correct 115 ms 6084 KB Output is correct
28 Correct 226 ms 6264 KB Output is correct
29 Correct 387 ms 6596 KB Output is correct
30 Correct 281 ms 6244 KB Output is correct
31 Correct 286 ms 6300 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 10 ms 5696 KB Output is correct
6 Correct 8 ms 5196 KB Output is correct
7 Correct 7 ms 5196 KB Output is correct
8 Correct 10 ms 5776 KB Output is correct
9 Correct 8 ms 5196 KB Output is correct
10 Correct 7 ms 5196 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 32 ms 6348 KB Output is correct
13 Correct 8 ms 6428 KB Output is correct
14 Correct 24 ms 5848 KB Output is correct
15 Correct 15 ms 5836 KB Output is correct
16 Correct 13 ms 5624 KB Output is correct
17 Correct 8 ms 5208 KB Output is correct
18 Correct 8 ms 5140 KB Output is correct
19 Correct 181 ms 6052 KB Output is correct
20 Correct 16 ms 5836 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 8 ms 6536 KB Output is correct
23 Correct 8 ms 6048 KB Output is correct
24 Correct 358 ms 6476 KB Output is correct
25 Correct 15 ms 6220 KB Output is correct
26 Correct 619 ms 7052 KB Output is correct
27 Correct 115 ms 6084 KB Output is correct
28 Correct 226 ms 6264 KB Output is correct
29 Correct 387 ms 6596 KB Output is correct
30 Correct 281 ms 6244 KB Output is correct
31 Correct 286 ms 6300 KB Output is correct
32 Correct 10 ms 5692 KB Output is correct
33 Correct 487 ms 36700 KB Output is correct
34 Correct 316 ms 12408 KB Output is correct
35 Correct 540 ms 35572 KB Output is correct
36 Correct 304 ms 12392 KB Output is correct
37 Correct 229 ms 11820 KB Output is correct
38 Correct 226 ms 11972 KB Output is correct
39 Execution timed out 2079 ms 61664 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 10 ms 5696 KB Output is correct
6 Correct 8 ms 5196 KB Output is correct
7 Correct 7 ms 5196 KB Output is correct
8 Correct 10 ms 5776 KB Output is correct
9 Correct 8 ms 5196 KB Output is correct
10 Correct 7 ms 5196 KB Output is correct
11 Correct 6 ms 5196 KB Output is correct
12 Correct 32 ms 6348 KB Output is correct
13 Correct 8 ms 6428 KB Output is correct
14 Correct 24 ms 5848 KB Output is correct
15 Correct 15 ms 5836 KB Output is correct
16 Correct 13 ms 5624 KB Output is correct
17 Correct 8 ms 5208 KB Output is correct
18 Correct 8 ms 5140 KB Output is correct
19 Correct 181 ms 6052 KB Output is correct
20 Correct 16 ms 5836 KB Output is correct
21 Correct 7 ms 5708 KB Output is correct
22 Correct 8 ms 6536 KB Output is correct
23 Correct 8 ms 6048 KB Output is correct
24 Correct 358 ms 6476 KB Output is correct
25 Correct 15 ms 6220 KB Output is correct
26 Correct 619 ms 7052 KB Output is correct
27 Correct 115 ms 6084 KB Output is correct
28 Correct 226 ms 6264 KB Output is correct
29 Correct 387 ms 6596 KB Output is correct
30 Correct 281 ms 6244 KB Output is correct
31 Correct 286 ms 6300 KB Output is correct
32 Correct 10 ms 5692 KB Output is correct
33 Correct 487 ms 36700 KB Output is correct
34 Correct 316 ms 12408 KB Output is correct
35 Correct 540 ms 35572 KB Output is correct
36 Correct 304 ms 12392 KB Output is correct
37 Correct 229 ms 11820 KB Output is correct
38 Correct 226 ms 11972 KB Output is correct
39 Execution timed out 2079 ms 61664 KB Time limit exceeded
40 Halted 0 ms 0 KB -