oj.uz

Submission #259588

# Submission time Handle Problem Language Result Execution time Memory
259588 2020-08-08T03:26:23 Z 임성재(#5054) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 9020 KB 
#include<bits/stdc++.h>  
using namespace std;  
  
#define fast ios::sync_with_stdio(false);cin.tie(NULL)  
#define fi first  
#define se second  
#define all(v) (v).begin(),(v).end()  
#define pb push_back  
#define eb emplace_back
#define pre(a) cout<<fixed; cout.precision(a)
#define mp make_pair
  
typedef long long ll;  
typedef pair<int,int> pii;  
typedef pair<ll,ll> pll;  
const ll INF = 1e18;
const int inf = 1e9;
const ll sz = 1;

ll n, q;
ll x[100010];
ll cnt[100010];
ll ans[100010];
vector<ll> v;
vector<pair<pll, ll>> qr;

ll tree[400010];

void update(int node, int s, int e, int i, ll x) {
	if(s == e) {
		tree[node] = x;
		return;
	}

	int m = s + e >> 1;

	if(i <= m) update(node*2, s, m, i, x);
	else update(node*2+1, m+1, e, i, x);

	tree[node] = max(tree[node*2], tree[node*2+1]);
}
 
void add(int k) {
	cnt[k]++;
	update(1, 0, n, k, cnt[k] * v[k]);
}

void erase(int k) {
	cnt[k]--;
	update(1, 0, n, k, cnt[k] * v[k]);
}

ll cal() {
	return tree[1];
}

int main() {
	fast;

	cin >> n >> q;

	for(int i=0; i<n; i++) {
		cin >> x[i];
		v.eb(x[i]);
	}

	sort(all(v));
	v.erase(unique(all(v)), v.end());

	for(int i=0; i<n; i++) {
		x[i] = lower_bound(all(v), x[i]) - v.begin();
	}

	for(int i=1; i<=q; i++) {
		ll a, b;
		cin >> a >> b;
		a--, b--;

		qr.eb(mp(a, b), i);
	}

	sort(all(qr), [](pair<pll, ll> i, pair<pll, ll> j) {
		if(i.fi.fi / sz == j.fi.fi / sz) return i.fi.se < j.fi.se;
		return i.fi.fi < j.fi.fi;
	});

	int s = qr[0].fi.fi;
	int e = qr[0].fi.se;

	for(int i=s; i<=e; i++) {
		add(x[i]);
	}

	ans[qr[0].se] = cal();

	for(int i=1; i<q; i++) {
		while(s < qr[i].fi.fi) erase(x[s++]);
		while(s > qr[i].fi.fi) add(x[--s]);
		while(e < qr[i].fi.se) add(x[++e]);
		while(e > qr[i].fi.se) erase(x[e--]);

		ans[qr[i].se] = cal();
	}

	for(int i=1; i<=q; i++) {
		cout << ans[i] << "\n";
	}
}

Compilation message

historic.cpp: In function 'void update(int, int, int, int, ll)':
historic.cpp:35:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = s + e >> 1;
          ~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 48 ms 512 KB Output is correct
20 Correct 225 ms 616 KB Output is correct
21 Correct 546 ms 880 KB Output is correct
22 Correct 577 ms 876 KB Output is correct
23 Correct 498 ms 880 KB Output is correct
24 Correct 513 ms 872 KB Output is correct
25 Correct 689 ms 1000 KB Output is correct
26 Correct 649 ms 928 KB Output is correct
27 Correct 648 ms 1000 KB Output is correct
28 Correct 638 ms 908 KB Output is correct
29 Correct 619 ms 1000 KB Output is correct
30 Correct 614 ms 908 KB Output is correct
31 Correct 510 ms 872 KB Output is correct
32 Correct 429 ms 872 KB Output is correct
33 Correct 620 ms 1000 KB Output is correct
34 Correct 678 ms 920 KB Output is correct
35 Correct 682 ms 944 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 8 ms 768 KB Output is correct
9 Correct 18 ms 1152 KB Output is correct
10 Correct 19 ms 1280 KB Output is correct
11 Correct 80 ms 5984 KB Output is correct
12 Correct 53 ms 2168 KB Output is correct
13 Correct 78 ms 3824 KB Output is correct
14 Correct 103 ms 5996 KB Output is correct
15 Correct 126 ms 8544 KB Output is correct
16 Correct 97 ms 7656 KB Output is correct
17 Correct 48 ms 3820 KB Output is correct
18 Correct 76 ms 5736 KB Output is correct
19 Correct 99 ms 9020 KB Output is correct
20 Correct 49 ms 6384 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 48 ms 512 KB Output is correct
20 Correct 225 ms 616 KB Output is correct
21 Correct 546 ms 880 KB Output is correct
22 Correct 577 ms 876 KB Output is correct
23 Correct 498 ms 880 KB Output is correct
24 Correct 513 ms 872 KB Output is correct
25 Correct 689 ms 1000 KB Output is correct
26 Correct 649 ms 928 KB Output is correct
27 Correct 648 ms 1000 KB Output is correct
28 Correct 638 ms 908 KB Output is correct
29 Correct 619 ms 1000 KB Output is correct
30 Correct 614 ms 908 KB Output is correct
31 Correct 510 ms 872 KB Output is correct
32 Correct 429 ms 872 KB Output is correct
33 Correct 620 ms 1000 KB Output is correct
34 Correct 678 ms 920 KB Output is correct
35 Correct 682 ms 944 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 2 ms 512 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 4 ms 512 KB Output is correct
43 Correct 8 ms 768 KB Output is correct
44 Correct 18 ms 1152 KB Output is correct
45 Correct 19 ms 1280 KB Output is correct
46 Correct 80 ms 5984 KB Output is correct
47 Correct 53 ms 2168 KB Output is correct
48 Correct 78 ms 3824 KB Output is correct
49 Correct 103 ms 5996 KB Output is correct
50 Correct 126 ms 8544 KB Output is correct
51 Correct 97 ms 7656 KB Output is correct
52 Correct 48 ms 3820 KB Output is correct
53 Correct 76 ms 5736 KB Output is correct
54 Correct 99 ms 9020 KB Output is correct
55 Correct 49 ms 6384 KB Output is correct
56 Correct 2256 ms 1152 KB Output is correct
57 Execution timed out 4038 ms 1532 KB Time limit exceeded
58 Halted 0 ms 0 KB -