oj.uz

답안 #259577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259577 2020-08-08T03:07:14 Z 임성재(#5054) 역사적 조사 (JOI14_historical) C++17
30 / 100
 1135 ms 12004 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 int 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) {
	S.erase(cnt[k] * v[k]);
	cnt[k]++;
	S.insert(cnt[k] * v[k]);
}

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

int main() {
	fast;

	cin >> n >> q;

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

	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--;

		if(a > b) swap(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 / sz < j.fi.fi / sz;
	});

	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] = *prev(S.end());

	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] = *prev(S.end());
	}

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 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 1 ms 384 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 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 1 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 30 ms 504 KB Output is correct
19 Correct 108 ms 512 KB Output is correct
20 Correct 456 ms 800 KB Output is correct
21 Correct 983 ms 1080 KB Output is correct
22 Incorrect 1135 ms 1080 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 26 ms 2044 KB Output is correct
10 Correct 27 ms 3576 KB Output is correct
11 Correct 104 ms 10596 KB Output is correct
12 Correct 92 ms 6664 KB Output is correct
13 Correct 106 ms 8224 KB Output is correct
14 Correct 126 ms 9832 KB Output is correct
15 Correct 124 ms 12004 KB Output is correct
16 Correct 138 ms 10216 KB Output is correct
17 Correct 77 ms 8552 KB Output is correct
18 Correct 109 ms 10652 KB Output is correct
19 Correct 115 ms 11484 KB Output is correct
20 Correct 79 ms 8936 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 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 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 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 1 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 30 ms 504 KB Output is correct
19 Correct 108 ms 512 KB Output is correct
20 Correct 456 ms 800 KB Output is correct
21 Correct 983 ms 1080 KB Output is correct
22 Incorrect 1135 ms 1080 KB Output isn't correct
23 Halted 0 ms 0 KB -