oj.uz

Submission #675145

# Submission time Handle Problem Language Result Execution time Memory
675145 2022-12-27T02:12:09 Z SanguineChameleon Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 73 ms 3152 KB 
// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int ms = 2e5 + 20;
int a[ms];

void just_do_it() {
	int n, k;
	cin >> n >> k;
	int m = n + k;
	for (int i = 1; i <= m; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= k + 1; i++) {
		for (int j = m - k; j <= m; j++) {
			if (i >= j) {
				continue;
			}
			int lt = i + 1;
			int rt = j - 1;
			int cc = i - 1 + m - j;
			if (cc > k) {
				continue;
			}
			int pc = 1;
			bool ok = true;
			while (lt < rt) {
				if (a[lt] + a[rt] > a[i] + a[j]) {
					cc++;
					if (cc > k) {
						ok = false;
						break;
					}
					rt--;
				}
				else if (a[lt] + a[rt] < a[i] + a[j]) {
					cc++;
					if (cc > k) {
						ok = false;
						break;
					}
					lt++;
				}
				else {
					pc++;
					if (pc == n / 2) {
						break;
					}
					lt++;
					rt--;
				}
			}
			if (!ok) {
				continue;
			}
			vector<int> res;
			res.push_back(a[i]);
			res.push_back(a[j]);
			lt = i + 1;
			rt = j - 1;
			while (lt < rt) {
				if (a[lt] + a[rt] > a[i] + a[j]) {
					rt--;
				}
				else if (a[lt] + a[rt] < a[i] + a[j]) {
					lt++;
				}
				else {
					res.push_back(a[lt]);
					res.push_back(a[rt]);
					lt++;
					rt--;
				}
			}
			sort(res.begin(), res.end());
			for (auto x: res) {
				cout << x << " ";
			}
			return;
		}
	}
}

// END MAIN CODE

Compilation message

tabletennis.cpp: In function 'void file_io(std::string, std::string)':
tabletennis.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 32 ms 3060 KB Output is correct
3 Correct 30 ms 3008 KB Output is correct
4 Correct 34 ms 3072 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 3044 KB Output is correct
2 Correct 35 ms 3068 KB Output is correct
3 Correct 34 ms 3108 KB Output is correct
4 Correct 38 ms 3048 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 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

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 32 ms 3052 KB Output is correct
3 Correct 30 ms 3108 KB Output is correct
4 Correct 31 ms 3028 KB Output is correct
5 Correct 43 ms 3020 KB Output is correct
6 Correct 34 ms 3068 KB Output is correct
7 Correct 31 ms 3060 KB Output is correct
8 Correct 33 ms 3100 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 63 ms 3016 KB Output is correct
3 Correct 36 ms 3048 KB Output is correct
4 Correct 46 ms 3080 KB Output is correct
5 Correct 36 ms 3036 KB Output is correct
6 Correct 31 ms 3152 KB Output is correct
7 Correct 73 ms 3088 KB Output is correct
8 Correct 32 ms 3024 KB Output is correct