제출 #485758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
485758		hollwo_pelw	Financial Report (JOI21_financial)	C++17	100 / 100	244 ms	11464 KiB

Main

/*
// 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("JOI21_financial.inp", "JOI21_financial.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 = 3e5 + 5;

int n, d, a[N], ord[N], st[N << 2], sz = 1;
set<pair<int, int>> ranges; // >= d

inline void del_pos(int p) {
	auto it = ranges.upper_bound({p, n});

	if (it == ranges.begin()) return ;
	if ((--it) -> second < p) return ;

	ranges.erase(it);

	int l = it -> first, r = it -> second;
	if (p - l >= d) ranges.emplace(l, p - 1);
	if (r - p >= d) ranges.emplace(p + 1, r);
}

inline int get_pos(int p) {
	auto it = ranges.upper_bound({p, p});
	if (it == ranges.begin()) 
		return 0;
	return (-- it) -> second + 1;
}

inline void update(int p, int v) {
	for (st[p += sz] = v; p >>= 1; )
		st[p] = max(st[p << 1], st[p << 1 | 1]);
}

inline int query(int l, int r) {
	int res = 0;
	for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
		if (l & 1) res = max(res, st[l ++]);
		if (r & 1) res = max(res, st[-- r]);
	}
	return res;
}

void Hollwo_Pelw() {
	cin >> n >> d;
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	ranges.emplace(1, n);
	while (sz <= n) sz <<= 1;

	iota(ord + 1, ord + n + 1, 1);
	sort(ord + 1, ord + n + 1, [](const int &x, const int &y) {
		return a[x] == a[y] ? x > y : a[x] < a[y];
	});

	for (int _ = 1; _ <= n; _++) {
		int p = ord[_];
		
		del_pos(p);

		int val = query(get_pos(p), p) + 1;
		
		update(p, val);
	}

	cout << st[1];
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void FAST_IO(std::string, std::string, std::string)':
Main.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);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.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: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 5 / 5
• Subtask 6: 35 / 35