oj.uz

Submission #1027617

# Submission time Handle Problem Language Result Execution time Memory
1027617 2024-07-19T08:00:22 Z KasymK Fireworks (APIO16_fireworks) C++17
7 / 100
 2 ms 3004 KB 
#include "bits/stdc++.h"
using namespace std;
#define ss second
#define ff first
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
const int N = 1e5+5;
vector<pii> adj[N];
int par[N];

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
	for(int i = 2; i <= n+m; ++i){
		int a, b;
		scanf("%d%d", &a, &b);
		par[i] = a;
		adj[a].pb({i,b});
	}
	int x = 1;
	auto cmp = [&](pii a, pii b) -> bool {
	    return a.ss < b.ss;
	};
	sort(all(adj[x]), cmp);
	int sz = (int)adj[x].size();
	int ad = adj[x][sz/2].ss;
	ll answer = 0;
	for(auto i : adj[x])
	    answer += abs(ad-i.ss);
	printf("%lld", answer);
    return 0;
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
fireworks.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   scanf("%d%d", &a, &b);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 3000 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 3004 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2908 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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