oj.uz

답안 #259552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259552 2020-08-08T02:24:19 Z 임성재(#5054) 역사적 조사 (JOI14_historical) C++17
5 / 100
 161 ms 1936 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 = 80;

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

int main() {
	fast;

	cin >> n >> q;

	v.eb(0);

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

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

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

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

		qr[a / sz].eb(mp(b, a), i);
	}

	for(int i=0; i<sz; i++) {
		sort(all(qr[i]));
	}

	for(int i=0; i<sz; i++) {
		memset(cnt, 0, sizeof(cnt));

		multiset<ll> S;
		for(int j=0; j<=n; j++) S.insert(0);

		ll s = i * sz, e = i * sz;
		
		for(auto j : qr[i]) {
			while(e <= j.fi.fi) {
				S.erase(- v[x[e]] * cnt[x[e]]);
				cnt[x[e]]++;
				S.insert(- v[x[e]] * cnt[x[e]]);
				
				e++;
			}

			for(int k = s; k < j.fi.se; k++) {
				S.erase(- v[x[k]] * cnt[x[k]]);
				cnt[x[k]]--;
				S.insert(- v[x[k]] * cnt[x[k]]);
			}

			ans[j.se] = - (*S.begin());

			for(int k = s; k < j.fi.se; k++) {
				S.erase(- v[x[k]] * cnt[x[k]]);
				cnt[x[k]]++;
				S.insert(- v[x[k]] * cnt[x[k]]);
			}
		}
	}

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

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 4 ms 1152 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 5 ms 1152 KB Output is correct
14 Correct 5 ms 1152 KB Output is correct
15 Correct 5 ms 1152 KB Output is correct
16 Correct 7 ms 1152 KB Output is correct
17 Correct 11 ms 1152 KB Output is correct
18 Correct 21 ms 1152 KB Output is correct
19 Correct 42 ms 1280 KB Output is correct
20 Correct 93 ms 1448 KB Output is correct
21 Correct 148 ms 1536 KB Output is correct
22 Incorrect 161 ms 1600 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 6 ms 1152 KB Output is correct
4 Correct 11 ms 1152 KB Output is correct
5 Correct 29 ms 1280 KB Output is correct
6 Correct 32 ms 1280 KB Output is correct
7 Correct 68 ms 1536 KB Output is correct
8 Incorrect 135 ms 1936 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 4 ms 1152 KB Output is correct
5 Correct 4 ms 1152 KB Output is correct
6 Correct 4 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 1152 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 6 ms 1280 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 5 ms 1152 KB Output is correct
14 Correct 5 ms 1152 KB Output is correct
15 Correct 5 ms 1152 KB Output is correct
16 Correct 7 ms 1152 KB Output is correct
17 Correct 11 ms 1152 KB Output is correct
18 Correct 21 ms 1152 KB Output is correct
19 Correct 42 ms 1280 KB Output is correct
20 Correct 93 ms 1448 KB Output is correct
21 Correct 148 ms 1536 KB Output is correct
22 Incorrect 161 ms 1600 KB Output isn't correct
23 Halted 0 ms 0 KB -