Submission #394104

#TimeUsernameProblemLanguageResultExecution timeMemory
394104jeqchoFireworks (APIO16_fireworks)C++17
7 / 100
1 ms324 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pair<int,int>> vpi; #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) #define pb push_back #define rsz resize #define sz(x) int(x.size()) #define all(x) begin(x), end(x) #define fi first #define se second int const N=1e2+2; vpi adj[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n,m; cin>>n>>m; F0R(i,n+m-1) { int p,c; cin>>p>>c; --p; adj[i+1].pb({p,c}); adj[p].pb({i+1,c}); } ll rec=2e18; FOR(i,n,n+m) { ll tar = adj[i].back().se; ll cand=0; FOR(j,n,n+m) { cand+=abs(tar-adj[j].back().se); } rec=min(cand,rec); } cout<<rec<<'\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...