oj.uz

Submission #152843

# Submission time Handle Problem Language Result Execution time Memory
152843 2019-09-10T01:58:09 Z cgiosy Fireworks (APIO16_fireworks) C++17
7 / 100
 3 ms 376 KB 
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<n; i++)
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);cin.tie(nullptr);
	int N, M; long s=0;
	cin>>N>>M;
	vector<vector<pair<int, int>>> G(N);
	rep(i, 1, N+M) {
		int p, w;
		cin>>p>>w; --p;
		G[p].push_back({i, w});
	}
	function<pair<int, int>(int, int)> f=[&](int i, int m) {
		if(i>=N) return make_pair(m, m);
		int k=0, n=G[i].size();
		vector<int> A(n*2), L(n), R(n);
		for(auto[j,w]:G[i]) {
			auto[a,b]=f(j, m+w);
			A[k*2]=L[k]=a, A[k*2+1]=R[k]=b, k++;
		}
		sort(begin(A), end(A));
		int l=max(m, A[n-1]), r=max(m, A[n]); m=(l+r)/2;
		rep(j, 0, n) s+=m<L[j] ? L[j]-m : R[j]<m ? m-R[j] : 0;
		return make_pair(l, r);
	};
	f(0, 0);
	cout<<s;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 19.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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