oj.uz

Submission #485766

# Submission time Handle Problem Language Result Execution time Memory
485766 2021-11-09T09:50:47 Z milisav Fireworks (APIO16_fireworks) C++14
7 / 100
 14 ms 23772 KB 
#include<bits/stdc++.h>
#define maxn 1000000
using namespace std;
int n,m;
vector<int> a[maxn];
int p[maxn];
int c[maxn];
long long x[maxn][2];
long long t[maxn];
vector<long long> cur;
void dfs(int u) {
	if(a[u].size()==0) {
		x[u][0]=c[u];
		x[u][1]=c[u];
		return;
	}
	for(auto v:a[u]) {
		dfs(v);
	}
	cur.clear();
	for(auto v:a[u]) {
		cur.push_back(x[v][0]);
		cur.push_back(x[v][1]);
	}
	sort(cur.begin(),cur.end());
	int pos=cur.size()/2-1;
	x[u][0]=cur[pos]+c[u];
	x[u][1]=cur[pos+1]+c[u];
	long long p=cur[pos];
	for(auto v:a[u]) {
		t[u]+=t[v];
		if(p<x[v][0]) t[u]+=(x[v][0]-p);
		if(p>x[v][1]) t[u]+=(p-x[v][1]);
	}
}
int main() {
	scanf("%d %d",&n,&m);
	for(int i=2;i<=n+m;i++) {
		scanf("%d %d",&p[i],&c[i]);
		a[p[i]].push_back(i);
	}
	dfs(1);
	printf("%lld\n",t[1]);
	return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |  scanf("%d %d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
fireworks.cpp:39:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |   scanf("%d %d",&p[i],&c[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23756 KB Output is correct
2 Correct 11 ms 23756 KB Output is correct
3 Correct 12 ms 23756 KB Output is correct
4 Correct 11 ms 23772 KB Output is correct
5 Correct 11 ms 23756 KB Output is correct
6 Correct 13 ms 23692 KB Output is correct
7 Correct 11 ms 23756 KB Output is correct
8 Correct 11 ms 23756 KB Output is correct
9 Correct 14 ms 23756 KB Output is correct
10 Correct 11 ms 23740 KB Output is correct

Subtask #2
0 / 19.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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