# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027610 | 2024-07-19T07:59:23 Z | KasymK | Fireworks (APIO16_fireworks) | C++17 | 1 ms | 3164 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+n; ++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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2908 KB | Output is correct |
2 | Incorrect | 1 ms | 3164 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 2908 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2908 KB | Output is correct |
2 | Incorrect | 1 ms | 3164 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2908 KB | Output is correct |
2 | Incorrect | 1 ms | 3164 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |