Submission #535791

#	Time	Username	Problem	Language	Result	Execution time	Memory
535791		abc864197532	Fire (JOI20_ho_t5)	C++17	7 / 100	185 ms	28180 KiB

ho_t5

 #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l)
		cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif

int main () {
	owo;
	int n, q;
	cin >> n >> q;
	vector <vector <int>> ST(n, vector <int> (18, 0));
	for (int i = 0; i < n; ++i)
		cin >> ST[i][0];
	for (int j = 1; j < 18; ++j) {
		for (int i = 0; i + (1 << j) <= n; ++i) {
			ST[i][j] = max(ST[i][j - 1], ST[i + (1 << j - 1)][j - 1]);
		}
	}
	while (q--) {
		int t, l, r;
		cin >> t >> l >> r;
		l = max(r - t - 1, 0);
		int g = __lg(r - l);
		cout << max(ST[l][g], ST[r - (1 << g)][g]) << '\n';
	}
}

Compilation message (stderr)

ho_t5.cpp: In function 'int main()':
ho_t5.cpp:36:48: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   36 |    ST[i][j] = max(ST[i][j - 1], ST[i + (1 << j - 1)][j - 1]);
      |                                              ~~^~~

• Subtask 1: 0 / 1
• Subtask 2: 0 / 6
• Subtask 3: 7 / 7
• Subtask 4: 0 / 6
• Subtask 5: 0 / 80