oj.uz

Submission #6100

# Submission time Handle Problem Language Result Execution time Memory
6100 2014-06-19T19:48:03 Z kriii 역사적 조사 (JOI14_historical) C++
15 / 100
 4000 ms 9656 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[100100],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];

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/2000+e/2000].push_back(seg(s,e,i));
	}
	for (int i=0;i<100;i++) if (!intv[i].empty()){
		for (int k=0;k<C;k++) O[k] = B[F+k] = 0; B[1] = 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 (e > intv[i][j].e) upt(--e,-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 4344 KB Output is correct
2 Correct 0 ms 4344 KB Output is correct
3 Correct 0 ms 4344 KB Output is correct
4 Correct 0 ms 4344 KB Output is correct
5 Correct 0 ms 4344 KB Output is correct
6 Correct 0 ms 4344 KB Output is correct
7 Correct 0 ms 4344 KB Output is correct
8 Correct 0 ms 4344 KB Output is correct
9 Correct 0 ms 4344 KB Output is correct
10 Correct 0 ms 4344 KB Output is correct
11 Correct 0 ms 4344 KB Output is correct
12 Correct 0 ms 4344 KB Output is correct
13 Correct 0 ms 4344 KB Output is correct
14 Correct 0 ms 4344 KB Output is correct
15 Correct 0 ms 4344 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4344 KB Output is correct
2 Correct 0 ms 4344 KB Output is correct
3 Correct 4 ms 4344 KB Output is correct
4 Correct 12 ms 4344 KB Output is correct
5 Correct 44 ms 4344 KB Output is correct
6 Correct 80 ms 4344 KB Output is correct
7 Correct 80 ms 4476 KB Output is correct
8 Correct 64 ms 4344 KB Output is correct
9 Correct 64 ms 4344 KB Output is correct
10 Correct 120 ms 4484 KB Output is correct
11 Correct 112 ms 4488 KB Output is correct
12 Correct 120 ms 4476 KB Output is correct
13 Correct 112 ms 4496 KB Output is correct
14 Correct 100 ms 4476 KB Output is correct
15 Correct 100 ms 4492 KB Output is correct
16 Correct 80 ms 4344 KB Output is correct
17 Correct 32 ms 4344 KB Output is correct
18 Correct 100 ms 4480 KB Output is correct
19 Correct 116 ms 4484 KB Output is correct
20 Correct 116 ms 4480 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4344 KB Output is correct
2 Correct 0 ms 4344 KB Output is correct
3 Correct 0 ms 4344 KB Output is correct
4 Correct 0 ms 4344 KB Output is correct
5 Correct 0 ms 4344 KB Output is correct
6 Correct 0 ms 4344 KB Output is correct
7 Correct 4 ms 4344 KB Output is correct
8 Correct 12 ms 4476 KB Output is correct
9 Correct 48 ms 4608 KB Output is correct
10 Correct 40 ms 4344 KB Output is correct
11 Correct 316 ms 5716 KB Output is correct
12 Correct 228 ms 4344 KB Output is correct
13 Correct 628 ms 5004 KB Output is correct
14 Correct 900 ms 6988 KB Output is correct
15 Correct 960 ms 8228 KB Output is correct
16 Incorrect 572 ms 9656 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 4476 KB Output is correct
2 Correct 548 ms 4612 KB Output is correct
3 Correct 1200 ms 5032 KB Output is correct
4 Correct 1756 ms 5572 KB Output is correct
5 Correct 2320 ms 5832 KB Output is correct
6 Correct 2556 ms 5584 KB Output is correct
7 Correct 2164 ms 5600 KB Output is correct
8 Correct 2084 ms 5712 KB Output is correct
9 Correct 1460 ms 5856 KB Output is correct
10 Correct 1108 ms 5980 KB Output is correct
11 Correct 2160 ms 6008 KB Output is correct
12 Correct 3280 ms 6004 KB Output is correct
13 Execution timed out 4000 ms 6276 KB Program timed out
14 Halted 0 ms 0 KB -