oj.uz

답안 #330497

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330497 2020-11-25T14:41:49 Z AmineWeslati Fireworks (APIO16_fireworks) C++14
26 / 100
 171 ms 8300 KB 
//Never stop trying
#ifndef LOCAL
#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#endif
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX =3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int N,M; 
int P[MX],C[MX];
vi adj[MX];

bool sub1(){
	if(N!=1) return false;
	return true;
}

ll memo[305][305];

ll solve(int u, int p, int x){
	if(sz(adj[u])==1) return abs(x-C[u]);
	if(memo[u][x]!=-1) return memo[u][x];
	ll ans=INF;
	FOR(i,0,x+1){
		ll cur=abs(x-i-C[u]);
		for(auto v: adj[u]) if(v!=p) 
			cur+=solve(v,u,i);
		ckmin(ans,cur);	
	}
	return memo[u][x]=ans;
}

int main() {
    boost; IO();
    memset(memo,-1,sizeof(memo));

    cin>>N>>M; 
    FOR(i,2,N+M+1){
    	cin>>P[i]>>C[i];
    	adj[P[i]].pb(i);
    	adj[i].pb(P[i]);
    }

    if(sub1()){
    	vi vec;
    	FOR(i,2,N+M+1){
    		vec.pb(C[i]);
    	}
    	sort(all(vec));
    	int x=vec[sz(vec)/2];
    	ll ans=0;
    	for(auto xx: vec) ans+=abs(x-xx);
    	cout << ans << endl;
    }
    else{
    	ll ans=INF;
	    FOR(i,0,305){
	    	ll cur=0;
	    	for(auto u: adj[1]) cur+=solve(u,1,i);
	    	ckmin(ans,cur);
		}
	    cout << ans << endl;
    }
    


    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Compilation message

fireworks.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("O3")
      | 
fireworks.cpp:6: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8172 KB Output is correct
2 Correct 6 ms 8300 KB Output is correct
3 Correct 6 ms 8172 KB Output is correct
4 Correct 6 ms 8172 KB Output is correct
5 Correct 6 ms 8300 KB Output is correct
6 Correct 6 ms 8172 KB Output is correct
7 Correct 6 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 6 ms 8172 KB Output is correct
10 Correct 6 ms 8172 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 8172 KB Output is correct
2 Correct 16 ms 8172 KB Output is correct
3 Correct 25 ms 8300 KB Output is correct
4 Correct 43 ms 8172 KB Output is correct
5 Correct 43 ms 8192 KB Output is correct
6 Correct 47 ms 8172 KB Output is correct
7 Correct 55 ms 8172 KB Output is correct
8 Correct 64 ms 8192 KB Output is correct
9 Correct 67 ms 8172 KB Output is correct
10 Correct 75 ms 8172 KB Output is correct
11 Correct 83 ms 8172 KB Output is correct
12 Correct 90 ms 8300 KB Output is correct
13 Correct 96 ms 8172 KB Output is correct
14 Correct 126 ms 8172 KB Output is correct
15 Correct 104 ms 8172 KB Output is correct
16 Correct 117 ms 8172 KB Output is correct
17 Correct 98 ms 8172 KB Output is correct
18 Correct 110 ms 8172 KB Output is correct
19 Correct 101 ms 8172 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8172 KB Output is correct
2 Correct 6 ms 8300 KB Output is correct
3 Correct 6 ms 8172 KB Output is correct
4 Correct 6 ms 8172 KB Output is correct
5 Correct 6 ms 8300 KB Output is correct
6 Correct 6 ms 8172 KB Output is correct
7 Correct 6 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 6 ms 8172 KB Output is correct
10 Correct 6 ms 8172 KB Output is correct
11 Correct 10 ms 8172 KB Output is correct
12 Correct 16 ms 8172 KB Output is correct
13 Correct 25 ms 8300 KB Output is correct
14 Correct 43 ms 8172 KB Output is correct
15 Correct 43 ms 8192 KB Output is correct
16 Correct 47 ms 8172 KB Output is correct
17 Correct 55 ms 8172 KB Output is correct
18 Correct 64 ms 8192 KB Output is correct
19 Correct 67 ms 8172 KB Output is correct
20 Correct 75 ms 8172 KB Output is correct
21 Correct 83 ms 8172 KB Output is correct
22 Correct 90 ms 8300 KB Output is correct
23 Correct 96 ms 8172 KB Output is correct
24 Correct 126 ms 8172 KB Output is correct
25 Correct 104 ms 8172 KB Output is correct
26 Correct 117 ms 8172 KB Output is correct
27 Correct 98 ms 8172 KB Output is correct
28 Correct 110 ms 8172 KB Output is correct
29 Correct 101 ms 8172 KB Output is correct
30 Incorrect 171 ms 8300 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8172 KB Output is correct
2 Correct 6 ms 8300 KB Output is correct
3 Correct 6 ms 8172 KB Output is correct
4 Correct 6 ms 8172 KB Output is correct
5 Correct 6 ms 8300 KB Output is correct
6 Correct 6 ms 8172 KB Output is correct
7 Correct 6 ms 8172 KB Output is correct
8 Correct 6 ms 8172 KB Output is correct
9 Correct 6 ms 8172 KB Output is correct
10 Correct 6 ms 8172 KB Output is correct
11 Correct 10 ms 8172 KB Output is correct
12 Correct 16 ms 8172 KB Output is correct
13 Correct 25 ms 8300 KB Output is correct
14 Correct 43 ms 8172 KB Output is correct
15 Correct 43 ms 8192 KB Output is correct
16 Correct 47 ms 8172 KB Output is correct
17 Correct 55 ms 8172 KB Output is correct
18 Correct 64 ms 8192 KB Output is correct
19 Correct 67 ms 8172 KB Output is correct
20 Correct 75 ms 8172 KB Output is correct
21 Correct 83 ms 8172 KB Output is correct
22 Correct 90 ms 8300 KB Output is correct
23 Correct 96 ms 8172 KB Output is correct
24 Correct 126 ms 8172 KB Output is correct
25 Correct 104 ms 8172 KB Output is correct
26 Correct 117 ms 8172 KB Output is correct
27 Correct 98 ms 8172 KB Output is correct
28 Correct 110 ms 8172 KB Output is correct
29 Correct 101 ms 8172 KB Output is correct
30 Incorrect 171 ms 8300 KB Output isn't correct
31 Halted 0 ms 0 KB -