oj.uz

답안 #733630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733630 2023-05-01T05:55:22 Z SanguineChameleon Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 340 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;
}

struct median {
	multiset<int> Sl;
	multiset<int> Sr;
	long long left_sum = 0;
	long long right_sum = 0;

	void clear() {
		Sl.clear();
		Sr.clear();
		left_sum = 0;
		right_sum = 0;
	}

	void insert(int x, int y) {
		if (Sl.empty()) {
			Sl.insert(x);
			Sr.insert(y);
			left_sum = x;
			right_sum = y;
		}
		else {
			if (x <= *Sr.begin()) {
				Sl.insert(x);
				left_sum += x;
			}
			else {
				Sr.insert(x);
				right_sum += x;
			}
			if (y <= *Sr.begin()) {
				Sl.insert(y);
				left_sum += y;
			}
			else {
				Sr.insert(y);
				right_sum += y;
			}
			if (Sl.size() > Sr.size()) {
				left_sum -= *Sl.rbegin();
				right_sum += *Sl.rbegin();
				Sr.insert(*Sl.rbegin());
				Sl.erase(prev(Sl.end()));
			}
			else if (Sl.size() < Sr.size()) {
				right_sum -= *Sr.begin();
				left_sum += *Sr.begin();
				Sl.insert(*Sr.begin());
				Sr.erase(Sr.begin());
			}
		}
		assert(Sl.size() == Sr.size());
	}

	long long get() {
		return right_sum - left_sum;
	};

} med;

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++;
			if (K == 1) {
				med.insert(S, T);
			}
		}
	}
	if (K == 1) {
		cout << med.get() + add;
		return;
	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 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 Incorrect 1 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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