oj.uz

답안 #200741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200741 2020-02-08T05:15:43 Z dimash241 Fireworks (APIO16_fireworks) C++17
7 / 100
 16 ms 14456 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")

# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
vector < int > g[N];
int c[N];

ll f[N];

inline ll go (int x) {
	ll ans = 0;
	for (int i = 1; i <= m; i ++) {
		if (c[i] > x) ans += c[i] - x;
		else ans += x - c[i];
	} 
	return ans;
}

int main () {
   	SpeedForce;
	cin >> n >> m;
	for (int i = 2; i <= n + m; ++i) {
		int p;
		cin >> p >> c[i];
		g[p].pb(i);
	}

	if (n == 1) {
		sort(c + 2, c + n + m + 1);
		for (int i = 1; i <= m; ++i) {
			c[i] = c[i+1];
			f[i] = f[i-1] + c[i];
		}

		int l = 1, r =  1e9;
		while (r - l > 1) {
			int md = (l + r) >> 1;
			if (go(md) < go(md + 1)) r = md;
			else l = md + 1;
		} 

		cout << min(go(l), go(r)) << '\n';
		return 0;
	}
    
   	return Accepted;
}

// B...a

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 14456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 16 ms 14456 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Incorrect 15 ms 14456 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 15 ms 14456 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 16 ms 14456 KB Output is correct
6 Correct 15 ms 14456 KB Output is correct
7 Correct 16 ms 14456 KB Output is correct
8 Correct 15 ms 14456 KB Output is correct
9 Correct 15 ms 14456 KB Output is correct
10 Correct 15 ms 14456 KB Output is correct
11 Incorrect 15 ms 14456 KB Output isn't correct
12 Halted 0 ms 0 KB -