oj.uz

답안 #145854

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145854 2019-08-21T07:19:11 Z maruii 역사적 조사 (JOI14_historical) C++14
100 / 100
 2449 ms 8132 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define ff first
#define ss second
#define eack emplace_back
#define all(x) (x).begin(), (x).end()

int X[100005], in[100005][2];
vector<int> xx;

const int SIZE = 1 << 17;
struct ST {
	long long A[2 * SIZE];
	int sz;
	void update(int x, long long v) {
		x += SIZE; A[x] += v;
		for (x >>= 1; x; x >>= 1) A[x] = max(A[x << 1], A[x << 1 | 1]);
	}
	long long query() { return A[1]; }
} seg;
		
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int N, Q; cin >> N >> Q;
	for (int i = 1; i <= N; ++i) cin >> X[i], xx.eack(X[i]);
	sort(all(xx));
	xx.erase(unique(all(xx)), xx.end());
	for (int i = 1; i <= N; ++i) {
		X[i] = lower_bound(all(xx), X[i]) - xx.begin();
	}
	seg.sz = xx.size() - 1;
	
	vector<pii> qry[320];
	vector<long long> ans(Q);

	for (int i = 0; i < Q; ++i) {
		cin >> in[i][0] >> in[i][1];
		qry[in[i][0] / 320].eack(in[i][1], i);
	}

	int s = 1, e = 0;
	for (int ii = 0; ii <= N / 320; ++ii) {
		sort(all(qry[ii]));
		for (auto i : qry[ii]) {
			int ns = in[i.ss][0], ne = in[i.ss][1];	
			for (; s < ns; ++s) seg.update(X[s], -xx[X[s]]);
			for (; s > ns; --s) seg.update(X[s - 1], xx[X[s - 1]]);
			for (; e < ne; ++e) seg.update(X[e + 1], xx[X[e + 1]]);
			for (; e > ne; --e) seg.update(X[e], -xx[X[e]]);
			ans[i.ss] = seg.query();
		}
	}
	
	for (auto i : ans) cout << i << '\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 1 ms 248 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 10 ms 504 KB Output is correct
5 Correct 22 ms 632 KB Output is correct
6 Correct 31 ms 632 KB Output is correct
7 Correct 27 ms 504 KB Output is correct
8 Correct 31 ms 632 KB Output is correct
9 Correct 35 ms 632 KB Output is correct
10 Correct 30 ms 632 KB Output is correct
11 Correct 33 ms 632 KB Output is correct
12 Correct 32 ms 700 KB Output is correct
13 Correct 99 ms 632 KB Output is correct
14 Correct 35 ms 632 KB Output is correct
15 Correct 32 ms 632 KB Output is correct
16 Correct 33 ms 632 KB Output is correct
17 Correct 38 ms 632 KB Output is correct
18 Correct 32 ms 632 KB Output is correct
19 Correct 32 ms 632 KB Output is correct
20 Correct 30 ms 608 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 420 KB Output is correct
3 Correct 3 ms 380 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 7 ms 632 KB Output is correct
9 Correct 13 ms 888 KB Output is correct
10 Correct 15 ms 1016 KB Output is correct
11 Correct 64 ms 4336 KB Output is correct
12 Correct 35 ms 1368 KB Output is correct
13 Correct 50 ms 2036 KB Output is correct
14 Correct 70 ms 3804 KB Output is correct
15 Correct 91 ms 6132 KB Output is correct
16 Correct 69 ms 4724 KB Output is correct
17 Correct 36 ms 2292 KB Output is correct
18 Correct 58 ms 3924 KB Output is correct
19 Correct 65 ms 5748 KB Output is correct
20 Correct 38 ms 3508 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 880 KB Output is correct
2 Correct 156 ms 1344 KB Output is correct
3 Correct 286 ms 1936 KB Output is correct
4 Correct 450 ms 2396 KB Output is correct
5 Correct 667 ms 2936 KB Output is correct
6 Correct 784 ms 3448 KB Output is correct
7 Correct 985 ms 3784 KB Output is correct
8 Correct 1372 ms 4408 KB Output is correct
9 Correct 1836 ms 4904 KB Output is correct
10 Correct 2333 ms 5112 KB Output is correct
11 Correct 1942 ms 6944 KB Output is correct
12 Correct 1798 ms 7156 KB Output is correct
13 Correct 1853 ms 7256 KB Output is correct
14 Correct 2309 ms 7732 KB Output is correct
15 Correct 2449 ms 8132 KB Output is correct
16 Correct 2369 ms 7996 KB Output is correct
17 Correct 2376 ms 7924 KB Output is correct
18 Correct 2356 ms 7932 KB Output is correct
19 Correct 2345 ms 7776 KB Output is correct
20 Correct 2332 ms 7688 KB Output is correct
21 Correct 2300 ms 7680 KB Output is correct
22 Correct 2260 ms 7668 KB Output is correct
23 Correct 2252 ms 7668 KB Output is correct
24 Correct 2222 ms 7592 KB Output is correct
25 Correct 2326 ms 7600 KB Output is correct