#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
void program();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 5e5;
const int N = (1<<20);
int n, m;
int p[MX], c[MX];
vi chl[MX];
struct Func {
ll y = 0, delta = 0, shift = 0;
multiset<ll> ms;
};
void combine(Func& res, Func& b) {
if(res.ms.size() < b.ms.size())
swap(res,b);
res.y += b.y;
res.delta += b.delta;
FOR(x,b.ms)
res.ms.insert(x + b.shift - res.shift);
}
void shiftLeft(Func& f, ll x) {
ll cx = 0;
ll delta = f.delta;
while(!f.ms.empty() && *(f.ms.begin()) + f.shift <= x) {
ll nx = *(f.ms.begin()) + f.shift;
f.y += (nx-cx)*delta;
delta++;
cx = nx;
f.ms.erase(f.ms.begin());
}
f.y += (x-cx)*delta;
f.shift -= x;
}
ll computeMin(Func& f) {
ll v = f.y;
ll delta = f.delta;
ll lx = 0;
FOR(i,f.ms) {
ll cx = i + f.shift;
if(cx >= 0) {
v += delta*(cx-lx);
lx = cx;
}
delta++;
if(delta == 0)
return v;
}
return v;
}
ll computePos(Func& f, ll x) {
ll v = f.y;
ll delta = f.delta;
ll lx = 0;
FOR(i,f.ms) {
ll cx = i + f.shift;
if(cx >= x) {
v += delta*(x-lx);
return v;
}
if(cx >= 0) {
v += delta*(cx-lx);
lx = cx;
}
delta++;
}
v += delta*(x-lx);
return v;
}
Func f[MX];
void program() {
IN(n,m);
p[1] = 0, c[1] = 0;
REP(u,2,n+m+1) IN(p[u],c[u]);
n += m;
RE1(u,n) chl[p[u]].pb(u);
REV(u,1,n+1) {
if(chl[u].empty()) {
// base case
f[u].y = c[u];
f[u].delta = -1;
f[u].shift = 0;
f[u].ms.insert(c[u]);
f[u].ms.insert(c[u]);
} else {
FOR(v,chl[u])
combine(f[u], f[v]);
// move graph to right
f[u].shift += c[u];
f[u].y -= f[u].delta*c[u];
// remove slopes bigger then 1
while(f[u].delta + f[u].ms.size() > 1) {
f[u].ms.erase(--f[u].ms.end());
}
// remember positions op last two elements
int x2 = *(--f[u].ms.end()) + f[u].shift; f[u].ms.erase(--f[u].ms.end()); // delta 1
int x1 = *(--f[u].ms.end()) + f[u].shift; f[u].ms.erase(--f[u].ms.end()); // delta 0
// shift graph to left
shiftLeft(f[u],c[u]);
f[u].y += c[u];
// reinsert last two elements
f[u].ms.insert(x1 - f[u].shift);
f[u].ms.insert(x2 - f[u].shift);
}
}
OUTL(computeMin(f[1]));
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
47224 KB |
Output is correct |
2 |
Correct |
24 ms |
47160 KB |
Output is correct |
3 |
Correct |
25 ms |
47312 KB |
Output is correct |
4 |
Correct |
25 ms |
47252 KB |
Output is correct |
5 |
Correct |
25 ms |
47316 KB |
Output is correct |
6 |
Correct |
26 ms |
47308 KB |
Output is correct |
7 |
Correct |
25 ms |
47280 KB |
Output is correct |
8 |
Correct |
28 ms |
47308 KB |
Output is correct |
9 |
Correct |
26 ms |
47252 KB |
Output is correct |
10 |
Correct |
25 ms |
47204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
47180 KB |
Output is correct |
2 |
Correct |
26 ms |
47200 KB |
Output is correct |
3 |
Correct |
25 ms |
47180 KB |
Output is correct |
4 |
Correct |
26 ms |
47232 KB |
Output is correct |
5 |
Correct |
25 ms |
47308 KB |
Output is correct |
6 |
Correct |
26 ms |
47260 KB |
Output is correct |
7 |
Correct |
29 ms |
47308 KB |
Output is correct |
8 |
Correct |
25 ms |
47272 KB |
Output is correct |
9 |
Correct |
25 ms |
47304 KB |
Output is correct |
10 |
Correct |
27 ms |
47308 KB |
Output is correct |
11 |
Correct |
25 ms |
47308 KB |
Output is correct |
12 |
Correct |
25 ms |
47228 KB |
Output is correct |
13 |
Correct |
25 ms |
47244 KB |
Output is correct |
14 |
Correct |
25 ms |
47232 KB |
Output is correct |
15 |
Correct |
25 ms |
47328 KB |
Output is correct |
16 |
Correct |
25 ms |
47312 KB |
Output is correct |
17 |
Correct |
25 ms |
47308 KB |
Output is correct |
18 |
Correct |
25 ms |
47308 KB |
Output is correct |
19 |
Correct |
26 ms |
47308 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
47224 KB |
Output is correct |
2 |
Correct |
24 ms |
47160 KB |
Output is correct |
3 |
Correct |
25 ms |
47312 KB |
Output is correct |
4 |
Correct |
25 ms |
47252 KB |
Output is correct |
5 |
Correct |
25 ms |
47316 KB |
Output is correct |
6 |
Correct |
26 ms |
47308 KB |
Output is correct |
7 |
Correct |
25 ms |
47280 KB |
Output is correct |
8 |
Correct |
28 ms |
47308 KB |
Output is correct |
9 |
Correct |
26 ms |
47252 KB |
Output is correct |
10 |
Correct |
25 ms |
47204 KB |
Output is correct |
11 |
Correct |
25 ms |
47180 KB |
Output is correct |
12 |
Correct |
26 ms |
47200 KB |
Output is correct |
13 |
Correct |
25 ms |
47180 KB |
Output is correct |
14 |
Correct |
26 ms |
47232 KB |
Output is correct |
15 |
Correct |
25 ms |
47308 KB |
Output is correct |
16 |
Correct |
26 ms |
47260 KB |
Output is correct |
17 |
Correct |
29 ms |
47308 KB |
Output is correct |
18 |
Correct |
25 ms |
47272 KB |
Output is correct |
19 |
Correct |
25 ms |
47304 KB |
Output is correct |
20 |
Correct |
27 ms |
47308 KB |
Output is correct |
21 |
Correct |
25 ms |
47308 KB |
Output is correct |
22 |
Correct |
25 ms |
47228 KB |
Output is correct |
23 |
Correct |
25 ms |
47244 KB |
Output is correct |
24 |
Correct |
25 ms |
47232 KB |
Output is correct |
25 |
Correct |
25 ms |
47328 KB |
Output is correct |
26 |
Correct |
25 ms |
47312 KB |
Output is correct |
27 |
Correct |
25 ms |
47308 KB |
Output is correct |
28 |
Correct |
25 ms |
47308 KB |
Output is correct |
29 |
Correct |
26 ms |
47308 KB |
Output is correct |
30 |
Runtime error |
66 ms |
95680 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
47224 KB |
Output is correct |
2 |
Correct |
24 ms |
47160 KB |
Output is correct |
3 |
Correct |
25 ms |
47312 KB |
Output is correct |
4 |
Correct |
25 ms |
47252 KB |
Output is correct |
5 |
Correct |
25 ms |
47316 KB |
Output is correct |
6 |
Correct |
26 ms |
47308 KB |
Output is correct |
7 |
Correct |
25 ms |
47280 KB |
Output is correct |
8 |
Correct |
28 ms |
47308 KB |
Output is correct |
9 |
Correct |
26 ms |
47252 KB |
Output is correct |
10 |
Correct |
25 ms |
47204 KB |
Output is correct |
11 |
Correct |
25 ms |
47180 KB |
Output is correct |
12 |
Correct |
26 ms |
47200 KB |
Output is correct |
13 |
Correct |
25 ms |
47180 KB |
Output is correct |
14 |
Correct |
26 ms |
47232 KB |
Output is correct |
15 |
Correct |
25 ms |
47308 KB |
Output is correct |
16 |
Correct |
26 ms |
47260 KB |
Output is correct |
17 |
Correct |
29 ms |
47308 KB |
Output is correct |
18 |
Correct |
25 ms |
47272 KB |
Output is correct |
19 |
Correct |
25 ms |
47304 KB |
Output is correct |
20 |
Correct |
27 ms |
47308 KB |
Output is correct |
21 |
Correct |
25 ms |
47308 KB |
Output is correct |
22 |
Correct |
25 ms |
47228 KB |
Output is correct |
23 |
Correct |
25 ms |
47244 KB |
Output is correct |
24 |
Correct |
25 ms |
47232 KB |
Output is correct |
25 |
Correct |
25 ms |
47328 KB |
Output is correct |
26 |
Correct |
25 ms |
47312 KB |
Output is correct |
27 |
Correct |
25 ms |
47308 KB |
Output is correct |
28 |
Correct |
25 ms |
47308 KB |
Output is correct |
29 |
Correct |
26 ms |
47308 KB |
Output is correct |
30 |
Runtime error |
66 ms |
95680 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |