oj.uz

Submission #480725

# Submission time Handle Problem Language Result Execution time Memory
480725 2021-10-18T01:02:22 Z hollwo_pelw medians (balkan11_medians) C++17
100 / 100
 30 ms 2892 KB 
/*
// is short or still long ???
hollwo_pelw's template(short)
// Note : -Dhollwo_pelw_local
*/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// #include <ext/rope>

using namespace std;
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;

void FAST_IO(string filein = "", string fileout = "", string fileerr = ""){
	if (fopen(filein.c_str(), "r")){
		freopen(filein.c_str(), "r", stdin);
		freopen(fileout.c_str(), "w", stdout);
#ifdef hollwo_pelw_local
		freopen(fileerr.c_str(), "w", stderr);
#endif
	}
	cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
}

void Hollwo_Pelw();

signed main(){
#ifdef hollwo_pelw_local
	FAST_IO("input.inp", "output.out", "error.err");
	auto start = chrono::steady_clock::now();
#else
	FAST_IO("balkan11_medians.inp", "balkan11_medians.out");
#endif
	int testcases = 1;
	// cin >> testcases;
	for (int test = 1; test <= testcases; test++){
		// cout << "Case #" << test << ": ";
		Hollwo_Pelw();
	}
#ifdef hollwo_pelw_local
	auto end = chrono::steady_clock::now();
	cout << "\nExcution time : " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
	return 0;
}

const int N = 1e5 + 5;

int n, b[N], a[N << 1];
bool vis[N << 1];

void Hollwo_Pelw() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> b[i];
	int l = 1, r = 2 * n - 1;
	auto assign = [&](int i, int v) { vis[a[i] = v] = 1; };
	auto get_max = [&]() -> int { while (vis[r]) r --; return r; };
	auto get_min = [&]() -> int { while (vis[l]) l ++; return l; };

	assign(1, b[1]);
	for (int i = 2, p = 1; i <= n; i ++) {
		if (b[i] == b[i - 1]) {
			assign(++ p, get_max());
			assign(++ p, get_min());
		}
		if (b[i] > b[i - 1]) {
			assign(++ p, vis[b[i]] ? get_max() : b[i]);
			assign(++ p, get_max());
		}
		if (b[i] < b[i - 1]) {
			assign(++ p, vis[b[i]] ? get_min() : b[i]);
			assign(++ p, get_min());
		}
	}
	for (int i = 1; i < 2 * n; i++)
		cout << a[i] << ' ';
}

Compilation message

medians.cpp: In function 'void FAST_IO(std::string, std::string, std::string)':
medians.cpp:18:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |   freopen(filein.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
medians.cpp:19:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   freopen(fileout.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
65.0 / 65.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 9 ms 1100 KB Output is correct
6 Correct 19 ms 1996 KB Output is correct
7 Correct 30 ms 2892 KB Output is correct