oj.uz

Submission #733619

# Submission time Handle Problem Language Result Execution time Memory
733619 2023-05-01T05:11:28 Z SanguineChameleon Palembang Bridges (APIO15_bridge) C++17
22 / 100
 47 ms 6676 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

vector<long long> calc(vector<int> A) {
	int M = A.size();
	vector<long long> res(M);
	vector<long long> pref(M);
	pref[0] = A[0];
	for (int i = 1; i < M; i++) {
		pref[i] = pref[i - 1] + A[i];
	}
	for (int i = 2; i <= M; i++) {
		int mid = A[(i - 1) / 2];
		long long left_sum = pref[(i - 1) / 2];
		long long right_sum = pref[i - 1] - left_sum;
		res[i - 1] = abs(1LL * mid * ((i + 1) / 2) - left_sum) + abs(1LL * mid * (i / 2) - right_sum);
	}
	return res;
}

void just_do_it() {
	int K, N;
	cin >> K >> N;
	vector<int> A;
	long long add = 0;
	for (int i = 0; i < N; i++) {
		char P, Q;
		int S, T;
		cin >> P >> S >> Q >> T;
		if (P == Q) {
			add += abs(S - T);
		}
		else {
			add++;
			A.push_back(S);
			A.push_back(T);
		}
	}
	if (A.empty()) {
		cout << add;
		return;
	}
	sort(A.begin(), A.end());
	int M = A.size();
	vector<long long> pref = calc(A);
	reverse(A.begin(), A.end());
	vector<long long> suf = calc(A);
	reverse(suf.begin(), suf.end());
	if (K == 1) {
		cout << pref[M - 1] + add;
		return;
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 24 ms 6540 KB Output is correct
13 Correct 42 ms 6556 KB Output is correct
14 Correct 31 ms 5848 KB Output is correct
15 Correct 34 ms 3980 KB Output is correct
16 Correct 39 ms 6564 KB Output is correct
17 Correct 30 ms 6524 KB Output is correct
18 Correct 39 ms 6552 KB Output is correct
19 Correct 43 ms 6676 KB Output is correct
20 Correct 31 ms 6480 KB Output is correct
21 Correct 47 ms 6560 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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