oj.uz

답안 #93515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93515 2019-01-09T07:50:35 Z arafat_01 Stove (JOI18_stove) C++17
100 / 100
 54 ms 2744 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
//#define int ll

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = (int)4e5 + 123;
const int mod = 1e9 + 7;
const ll inf = 1e18 + 9;

inline void boost () {
	ios_base::sync_with_stdio (0);
	cin.tie (0), cout.tie (0);
}
int n, k, t[N], pr[N], sz[N], all = n;
ll sum;

int get (int x) {
	if (x == pr[x]) return x;
	return pr[x] = get (pr[x]);
}

void unite (int u, int v, int c) {
	if (all == k) cout << sum, exit (0);
	u = get (u), v = get (v);
	if (u == v) return;
	if (sz[u] < sz[v]) swap (u, v);
	sz[u] += sz[v];
	pr[v] = u;
	sum += c; 
	all --;
	if (all == k) cout << sum, exit (0);
}

int main () {
	boost ();
	cin >> n >> k;
	all = n, sum = k;
	for (int i = 1;i <= n;i ++) {	
		cin >> t[i];
		pr[i] = i, sz[i] = 1;
	}
	vector < pair < int, int > > v;
	for (int i = 2;i <= n;i ++) v.pb (mp (t[i] - t[i - 1], i - 1));		
	sort (v.begin (), v.end ());
	for (int i = 0;i < sz (v);i ++) {
		int u = v[i].S;
		int u1 = u + 1;
		int c = v[i].F;
		unite (u, u1, c);
	}
	cout << sum;
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 26 ms 2668 KB Output is correct
17 Correct 54 ms 2744 KB Output is correct
18 Correct 26 ms 2672 KB Output is correct
19 Correct 25 ms 2676 KB Output is correct
20 Correct 24 ms 2644 KB Output is correct
21 Correct 24 ms 2676 KB Output is correct
22 Correct 24 ms 2676 KB Output is correct
23 Correct 24 ms 2680 KB Output is correct
24 Correct 24 ms 2668 KB Output is correct