Submission #259584

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
259584	2020-08-08T03:21:07 Z	임성재(#5054)	역사적 조사 (JOI14_historical)	C++17	15 / 100	4000 ms	6304 KB

historic

#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;
multiset<ll> S;

void add(int k) {
	//if(cnt[k] > 0) S.erase(cnt[k] * v[k]);
	cnt[k]++;
	//if(cnt[k] > 0) S.insert(cnt[k] * v[k]);
}

void erase(int k) {
	//if(cnt[k] > 0) S.erase(cnt[k] * v[k]);
	cnt[k]--;
	//if(cnt[k] > 0) S.insert(cnt[k] * v[k]);
}

ll cal() {
	ll ret = 0;
	for(int i=0; i<v.size(); i++) {
		ret = max(ret, cnt[i] * v[i]);
	}

	return ret;
}

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 'll cal()':
historic.cpp:42:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<v.size(); i++) {
               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 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	0 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	0 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	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 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	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Correct	21 ms	640 KB	Output is correct
21	Correct	22 ms	880 KB	Output is correct
22	Correct	25 ms	880 KB	Output is correct
23	Correct	23 ms	880 KB	Output is correct
24	Correct	19 ms	880 KB	Output is correct
25	Correct	35 ms	872 KB	Output is correct
26	Correct	30 ms	880 KB	Output is correct
27	Correct	32 ms	872 KB	Output is correct
28	Correct	24 ms	880 KB	Output is correct
29	Correct	28 ms	880 KB	Output is correct
30	Correct	29 ms	880 KB	Output is correct
31	Correct	22 ms	872 KB	Output is correct
32	Correct	21 ms	880 KB	Output is correct
33	Correct	28 ms	880 KB	Output is correct
34	Correct	33 ms	880 KB	Output is correct
35	Correct	35 ms	872 KB	Output is correct

Subtask #3
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 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	1 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	5 ms	640 KB	Output is correct
9	Correct	10 ms	896 KB	Output is correct
10	Correct	10 ms	1280 KB	Output is correct
11	Correct	60 ms	5940 KB	Output is correct
12	Correct	27 ms	2044 KB	Output is correct
13	Correct	206 ms	3560 KB	Output is correct
14	Correct	2493 ms	5220 KB	Output is correct
15	Execution timed out	4057 ms	6304 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-

Subtask #4
0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 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	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	5 ms	512 KB	Output is correct
20	Correct	21 ms	640 KB	Output is correct
21	Correct	22 ms	880 KB	Output is correct
22	Correct	25 ms	880 KB	Output is correct
23	Correct	23 ms	880 KB	Output is correct
24	Correct	19 ms	880 KB	Output is correct
25	Correct	35 ms	872 KB	Output is correct
26	Correct	30 ms	880 KB	Output is correct
27	Correct	32 ms	872 KB	Output is correct
28	Correct	24 ms	880 KB	Output is correct
29	Correct	28 ms	880 KB	Output is correct
30	Correct	29 ms	880 KB	Output is correct
31	Correct	22 ms	872 KB	Output is correct
32	Correct	21 ms	880 KB	Output is correct
33	Correct	28 ms	880 KB	Output is correct
34	Correct	33 ms	880 KB	Output is correct
35	Correct	35 ms	872 KB	Output is correct
36	Correct	0 ms	384 KB	Output is correct
37	Correct	1 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	1 ms	512 KB	Output is correct
42	Correct	3 ms	512 KB	Output is correct
43	Correct	5 ms	640 KB	Output is correct
44	Correct	10 ms	896 KB	Output is correct
45	Correct	10 ms	1280 KB	Output is correct
46	Correct	60 ms	5940 KB	Output is correct
47	Correct	27 ms	2044 KB	Output is correct
48	Correct	206 ms	3560 KB	Output is correct
49	Correct	2493 ms	5220 KB	Output is correct
50	Execution timed out	4057 ms	6304 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-

Submission #259584

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 25.0

Subtask #4 0 / 60.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 25.0

Subtask #4
0 / 60.0