oj.uz

Submission #6107

# Submission time Handle Problem Language Result Execution time Memory
6107 2014-06-19T20:05:37 Z kriii 역사적 조사 (JOI14_historical) C++
40 / 100
 4000 ms 11568 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

map<int, int> chk;
int N,Q,C,X[100010],O[100010],Z,F; long long R[100010],B[200100],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 e != t.e ? e < t.e : s < t.s;}
};
vector<seg> intv[201];

void upt(int x, int p)
{
	x = X[x]; O[x] += p;
	B[x+F] = R[x] * O[x];
	x = (x + F + 2) / 4;
	while (x){
		B[x] = max(max(B[x*4-2],B[x*4-1]),max(B[x*4],B[x*4+1]));
		x = (x + 2) / 4;
	}
}

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 (Z=1;Z<C;Z<<=2) F += Z; F++;

	for (int i=0,s,e;i<Q;i++){
		scanf ("%d %d",&s,&e); s--;
		intv[s/10000].push_back(seg(s,e,i));
	}
	for (int i=0;i<10;i++) if (!intv[i].empty()){
		for (int k=0;k<F+C;k++) B[k] = 0;
		for (int k=0;k<C;k++) O[k] = 0;
		int s = 0, e = 0;
		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 (s < intv[i][j].s) upt(s++,-1);
			while (s > intv[i][j].s) upt(--s,1);
			A[intv[i][j].i] = B[1];
		}
	}

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

	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5124 KB Output is correct
2 Correct 0 ms 5124 KB Output is correct
3 Correct 0 ms 5124 KB Output is correct
4 Correct 16 ms 5124 KB Output is correct
5 Correct 72 ms 5124 KB Output is correct
6 Correct 176 ms 5324 KB Output is correct
7 Correct 176 ms 5328 KB Output is correct
8 Correct 144 ms 5320 KB Output is correct
9 Correct 144 ms 5320 KB Output is correct
10 Correct 264 ms 5300 KB Output is correct
11 Correct 252 ms 5292 KB Output is correct
12 Correct 256 ms 5280 KB Output is correct
13 Correct 252 ms 5276 KB Output is correct
14 Correct 216 ms 5256 KB Output is correct
15 Correct 224 ms 5268 KB Output is correct
16 Correct 180 ms 5320 KB Output is correct
17 Correct 72 ms 5316 KB Output is correct
18 Correct 220 ms 5264 KB Output is correct
19 Correct 256 ms 5400 KB Output is correct
20 Correct 264 ms 5420 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5124 KB Output is correct
2 Correct 0 ms 5124 KB Output is correct
3 Correct 0 ms 5124 KB Output is correct
4 Correct 0 ms 5124 KB Output is correct
5 Correct 0 ms 5124 KB Output is correct
6 Correct 0 ms 5124 KB Output is correct
7 Correct 0 ms 5124 KB Output is correct
8 Correct 8 ms 5256 KB Output is correct
9 Correct 20 ms 5388 KB Output is correct
10 Correct 12 ms 5124 KB Output is correct
11 Correct 80 ms 6112 KB Output is correct
12 Correct 72 ms 5124 KB Output is correct
13 Correct 124 ms 5672 KB Output is correct
14 Correct 188 ms 8100 KB Output is correct
15 Correct 220 ms 9924 KB Output is correct
16 Correct 176 ms 10980 KB Output is correct
17 Correct 40 ms 5904 KB Output is correct
18 Correct 80 ms 6688 KB Output is correct
19 Correct 152 ms 11568 KB Output is correct
20 Correct 76 ms 10392 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 5512 KB Output is correct
2 Correct 2240 ms 5540 KB Output is correct
3 Execution timed out 4000 ms 6224 KB Program timed out
4 Halted 0 ms 0 KB -