Submission #6098

#	Time	Username	Problem	Language	Result	Execution time	Memory
6098		kriii	역사적 조사 (JOI14_historical)	C++98	5 / 100	32 ms	4092 KiB

historic

#include <stdio.h>
#include <algorithm>
#include <functional>
#include <vector>
#include <map>
#include <set>
using namespace std;

map<int, int> chk;
int N,Q,C,X[100010],O[100010]; long long R[100010],A[100010];

struct seg{
	seg(int s_, int e_, int i_){s = s_; e = e_; i = i_;}
	int s,e,i;
	bool operator <(const seg t)const{return s == t.s ? e < t.e : s < t.s;}
};
vector<seg> intv[201];

multiset<long long, greater<long long> > B;

void upt(int x, int p)
{
	x = X[x];
	if (O[x]) B.erase(B.find(R[x]*O[x]));
	O[x] += p;
	B.insert(R[x]*O[x]);
}

int main()
{
	scanf ("%d %d",&N,&Q);
	for (int i=0;i<N;i++){
		scanf ("%d",&X[i]);
		chk[X[i]] = 0;
	}
	
	for (map<int, int>::iterator I = chk.begin(); I != chk.end(); I++) R[C] = I->first, I->second = C++;
	for (int i=0;i<N;i++) X[i] = chk[X[i]];

	for (int i=0,s,e;i<Q;i++){
		scanf ("%d %d",&s,&e); s--;
		intv[s/1000+e/1000].push_back(seg(s,e,i));
	}
	for (int i=0;i<200;i++) if (!intv[i].empty()){
		int s = 0, e = 0; B.clear();
		sort(intv[i].begin(),intv[i].end());
		for (int j=0;j<intv[i].size();j++){
			while (e < intv[i][j].e) upt(e++,1);
			while (e > intv[i][j].e) upt(--e,-1);
			while (s < intv[i][j].s) upt(s++,-1);
			A[intv[i][j].i] = *B.begin();
		}
	}

	for (int i=0;i<Q;i++) printf ("%lld\n",A[i]);

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60