답안 #26220 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
26220	2017-06-28T11:57:39 Z	imsifile	유괴 2 (JOI17_abduction2)	C++	100 / 100	1479 ms	127356 KB

abduction2

#include<stdio.h>
#include<memory.h>
#include<algorithm>
#include<map>
using namespace std;

typedef long long lld;

struct seg {
	int j2, itr[150000];
	seg(){ j2 = 1<<16; memset(itr, 0x7f, sizeof(itr)); }
	const int& operator[] (const int ix){ return itr[j2+ix]; }
	void add(int ix, int val){
		ix+=j2; itr[ix]=val;
		for(ix>>=1; ix; ix>>=1) itr[ix]=max(itr[ix*2],itr[ix*2+1]);
	}
	int getup(int ix, int val){
		ix+=j2;
		while(1){
			if(itr[ix]>val){
				if(ix>=j2) break;
				if(itr[ix*2]>val) ix*=2;
				else ix*=2, ix++;
			}
			else{
				if(ix%2) ix++;
				else ix>>=1;
			}
		}
		return ix-j2;
	}
	int getdown(int ix, int val){
		ix+=j2;
		while(1){
			if(itr[ix]>val){
				if(ix>=j2) break;
				if(itr[ix*2+1]>val) ix*=2, ix++;
				else ix*=2;
			}
			else{
				if(ix%2 == 0) ix--;
				else ix>>=1;
			}
		}
		return ix-j2;
	}
} ho, ver;

int H, W, Q;
map<pair<int,int>, lld> vd, hd;

lld verti(int, int);
lld hori(int, int);

lld verti(int h, int v){
	lld gap = vd[make_pair(h,v)];
	if(gap) return gap;

	lld up=0, down=0;
	up = ho.getup(h+1, ver[v]);
	if(up<=H) up = up-h + hori(v, up);
	else up = H-h;
	down = ho.getdown(h-1, ver[v]);
	if(down>=1) down = h-down + hori(v, down);
	else down = h-1;
	return vd[make_pair(h,v)] = max(up, down);
}

lld hori(int v, int h){
	lld gap = hd[make_pair(h,v)];
	if(gap) return gap;

	lld up=0, down=0;
	up = ver.getup(v+1, ho[h]);
	if(up<=W) up = up-v + verti(h, up);
	else up = W-v;
	down = ver.getdown(v-1, ho[h]);
	if(down>=1) down = v-down + verti(h, down);
	else down = v-1;

	return hd[make_pair(h,v)] = max(up, down);
}

int main(){
	scanf("%d%d%d", &H, &W, &Q);
	for(int i=1; i<=H; i++){
		int a; scanf("%d", &a);
		ho.add(i, a);
	}
	for(int i=1; i<=W; i++){
		int a; scanf("%d", &a);
		ver.add(i, a);
	}
	while(Q--){
		int h, v;
		scanf("%d%d", &h, &v);
		printf("%lld\n", max(verti(h, v), hori(v, h)));
	}
	return 0;
}

Compilation message

abduction2.cpp: In function 'int main()':
abduction2.cpp:85:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &H, &W, &Q);
                             ^
abduction2.cpp:87:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a; scanf("%d", &a);
                         ^
abduction2.cpp:91:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a; scanf("%d", &a);
                         ^
abduction2.cpp:96:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &h, &v);
                        ^

Subtask #1
13.0 / 13.0

#	결과	메모리	Grader output
1	Correct	2348 KB	Output is correct
2	Correct	2348 KB	Output is correct
3	Correct	2348 KB	Output is correct
4	Correct	2348 KB	Output is correct
5	Correct	2348 KB	Output is correct
6	Correct	2348 KB	Output is correct
7	Correct	2348 KB	Output is correct
8	Correct	2348 KB	Output is correct
9	Correct	2348 KB	Output is correct
10	Correct	2348 KB	Output is correct
11	Correct	2348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2348 KB	Output is correct
2	Correct	0 ms	2348 KB	Output is correct
3	Correct	0 ms	2348 KB	Output is correct
4	Correct	0 ms	2348 KB	Output is correct
5	Correct	0 ms	2348 KB	Output is correct
6	Correct	0 ms	2348 KB	Output is correct
7	Correct	0 ms	2348 KB	Output is correct
8	Correct	0 ms	2348 KB	Output is correct
9	Correct	0 ms	2348 KB	Output is correct
10	Correct	0 ms	2348 KB	Output is correct
11	Correct	0 ms	2348 KB	Output is correct
12	Correct	0 ms	2348 KB	Output is correct
13	Correct	3 ms	2348 KB	Output is correct
14	Correct	0 ms	2348 KB	Output is correct
15	Correct	0 ms	2348 KB	Output is correct
16	Correct	0 ms	2348 KB	Output is correct
17	Correct	0 ms	2348 KB	Output is correct
18	Correct	0 ms	2348 KB	Output is correct
19	Correct	0 ms	2480 KB	Output is correct
20	Correct	3 ms	2612 KB	Output is correct
21	Correct	3 ms	2612 KB	Output is correct
22	Correct	3 ms	2744 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2348 KB	Output is correct
2	Correct	0 ms	2348 KB	Output is correct
3	Correct	0 ms	2348 KB	Output is correct
4	Correct	0 ms	2348 KB	Output is correct
5	Correct	0 ms	2348 KB	Output is correct
6	Correct	0 ms	2348 KB	Output is correct
7	Correct	0 ms	2348 KB	Output is correct
8	Correct	0 ms	2348 KB	Output is correct
9	Correct	0 ms	2348 KB	Output is correct
10	Correct	0 ms	2348 KB	Output is correct
11	Correct	0 ms	2348 KB	Output is correct
12	Correct	0 ms	2348 KB	Output is correct
13	Correct	3 ms	2348 KB	Output is correct
14	Correct	0 ms	2348 KB	Output is correct
15	Correct	0 ms	2348 KB	Output is correct
16	Correct	0 ms	2348 KB	Output is correct
17	Correct	0 ms	2348 KB	Output is correct
18	Correct	0 ms	2348 KB	Output is correct
19	Correct	0 ms	2480 KB	Output is correct
20	Correct	3 ms	2612 KB	Output is correct
21	Correct	3 ms	2612 KB	Output is correct
22	Correct	3 ms	2744 KB	Output is correct
23	Correct	26 ms	2348 KB	Output is correct
24	Correct	23 ms	2348 KB	Output is correct
25	Correct	23 ms	2348 KB	Output is correct
26	Correct	26 ms	2348 KB	Output is correct
27	Correct	29 ms	2348 KB	Output is correct
28	Correct	43 ms	6892 KB	Output is correct
29	Correct	39 ms	2848 KB	Output is correct
30	Correct	73 ms	8220 KB	Output is correct
31	Correct	96 ms	10032 KB	Output is correct
32	Correct	19 ms	2612 KB	Output is correct
33	Correct	33 ms	4124 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	2480 KB	Output is correct
2	Correct	3 ms	2480 KB	Output is correct
3	Correct	3 ms	2480 KB	Output is correct
4	Correct	3 ms	2480 KB	Output is correct
5	Correct	3 ms	2480 KB	Output is correct
6	Correct	0 ms	2480 KB	Output is correct
7	Correct	3 ms	2480 KB	Output is correct
8	Correct	3 ms	2744 KB	Output is correct
9	Correct	0 ms	2744 KB	Output is correct
10	Correct	6 ms	2744 KB	Output is correct
11	Correct	6 ms	2876 KB	Output is correct

Subtask #5
56.0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2348 KB	Output is correct
2	Correct	0 ms	2348 KB	Output is correct
3	Correct	0 ms	2348 KB	Output is correct
4	Correct	0 ms	2348 KB	Output is correct
5	Correct	0 ms	2348 KB	Output is correct
6	Correct	0 ms	2348 KB	Output is correct
7	Correct	0 ms	2348 KB	Output is correct
8	Correct	0 ms	2348 KB	Output is correct
9	Correct	0 ms	2348 KB	Output is correct
10	Correct	0 ms	2348 KB	Output is correct
11	Correct	0 ms	2348 KB	Output is correct
12	Correct	0 ms	2348 KB	Output is correct
13	Correct	3 ms	2348 KB	Output is correct
14	Correct	0 ms	2348 KB	Output is correct
15	Correct	0 ms	2348 KB	Output is correct
16	Correct	0 ms	2348 KB	Output is correct
17	Correct	0 ms	2348 KB	Output is correct
18	Correct	0 ms	2348 KB	Output is correct
19	Correct	0 ms	2480 KB	Output is correct
20	Correct	3 ms	2612 KB	Output is correct
21	Correct	3 ms	2612 KB	Output is correct
22	Correct	3 ms	2744 KB	Output is correct
23	Correct	26 ms	2348 KB	Output is correct
24	Correct	23 ms	2348 KB	Output is correct
25	Correct	23 ms	2348 KB	Output is correct
26	Correct	26 ms	2348 KB	Output is correct
27	Correct	29 ms	2348 KB	Output is correct
28	Correct	43 ms	6892 KB	Output is correct
29	Correct	39 ms	2848 KB	Output is correct
30	Correct	73 ms	8220 KB	Output is correct
31	Correct	96 ms	10032 KB	Output is correct
32	Correct	19 ms	2612 KB	Output is correct
33	Correct	33 ms	4124 KB	Output is correct
34	Correct	3 ms	2480 KB	Output is correct
35	Correct	3 ms	2480 KB	Output is correct
36	Correct	3 ms	2480 KB	Output is correct
37	Correct	3 ms	2480 KB	Output is correct
38	Correct	3 ms	2480 KB	Output is correct
39	Correct	0 ms	2480 KB	Output is correct
40	Correct	3 ms	2480 KB	Output is correct
41	Correct	3 ms	2744 KB	Output is correct
42	Correct	0 ms	2744 KB	Output is correct
43	Correct	6 ms	2744 KB	Output is correct
44	Correct	6 ms	2876 KB	Output is correct
45	Correct	26 ms	2612 KB	Output is correct
46	Correct	36 ms	2612 KB	Output is correct
47	Correct	26 ms	2612 KB	Output is correct
48	Correct	33 ms	2612 KB	Output is correct
49	Correct	23 ms	2612 KB	Output is correct
50	Correct	49 ms	6480 KB	Output is correct
51	Correct	36 ms	7076 KB	Output is correct
52	Correct	123 ms	12280 KB	Output is correct
53	Correct	126 ms	11960 KB	Output is correct
54	Correct	119 ms	11436 KB	Output is correct
55	Correct	189 ms	16364 KB	Output is correct
56	Correct	1479 ms	127356 KB	Output is correct
57	Correct	303 ms	34764 KB	Output is correct
58	Correct	293 ms	33068 KB	Output is correct
59	Correct	296 ms	32936 KB	Output is correct

답안 #26220

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 10.0 / 10.0

Subtask #3 17.0 / 17.0

Subtask #4 4.0 / 4.0

Subtask #5 56.0 / 56.0

Subtask #1
13.0 / 13.0

Subtask #2
10.0 / 10.0

Subtask #3
17.0 / 17.0

Subtask #4
4.0 / 4.0

Subtask #5
56.0 / 56.0