oj.uz

Submission #62460

# Submission time Handle Problem Language Result Execution time Memory
62460 2018-07-28T15:41:15 Z Benq Fireworks (APIO16_fireworks) C++11
19 / 100
 32 ms 1016 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,M,P[301],C[301],dp[301][301];
array<int,301> tmp;

void process(int x) {
    // cout << "HI " << x << " " << C[x] << "\n";
    F0R(i,301) tmp[i] = MOD;
    if (x > N) FOR(i,1,301) dp[x][i] = MOD;
    F0R(i,301) F0R(j,301-i) tmp[i+j] = min(tmp[i+j],abs(i-C[x])+dp[x][j]);
    F0R(i,301) dp[x][i] = tmp[i];
    // if (x == 10) cout << dp[x][dp[x][3] << "\n";
    F0R(i,301) dp[P[x]][i] += dp[x][i];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    FOR(i,2,N+M+1) cin >> P[i] >> C[i];
    FORd(i,2,N+M+1) process(i);
    int ans = MOD;
    F0R(i,301) ans = min(ans,dp[1][i]);
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
0 / 7.0

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

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 6 ms 568 KB Output is correct
3 Correct 6 ms 568 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 12 ms 760 KB Output is correct
7 Correct 14 ms 760 KB Output is correct
8 Correct 12 ms 876 KB Output is correct
9 Correct 23 ms 876 KB Output is correct
10 Correct 18 ms 920 KB Output is correct
11 Correct 19 ms 920 KB Output is correct
12 Correct 27 ms 924 KB Output is correct
13 Correct 29 ms 928 KB Output is correct
14 Correct 20 ms 932 KB Output is correct
15 Correct 29 ms 936 KB Output is correct
16 Correct 19 ms 944 KB Output is correct
17 Correct 32 ms 944 KB Output is correct
18 Correct 20 ms 948 KB Output is correct
19 Correct 18 ms 1016 KB Output is correct

Subtask #3
0 / 29.0

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

Subtask #4
0 / 45.0

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