Submission #61179

# Submission time Handle Problem Language Result Execution time Memory
61179 2018-07-25T10:01:25 Z gs14004 Abduction 2 (JOI17_abduction2) C++17
100 / 100
1012 ms 4716 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
 
struct line{
	int pos, val, axis;
	bool operator<(const line &l)const{
		return val < l.val;
	}
}a[100005];
 
int n, m, q;
int st[100005], ed[100005];
lint ldp[100005], rdp[100005];
int rev[2][50005];
 
lint solve(int x, int y, int cs){
	memset(ldp, 0, sizeof(ldp));
	memset(rdp, 0, sizeof(rdp));
	int xl = 0, xh = n-1, yl = 0, yh = m-1;
	set<int> s[2];
	lint ret = 0;
	for(int i=0; i<n+m; i++){
		set<int> ::iterator l, r;
		if(a[i].axis == 0){
			st[i] = yl, ed[i] = yh;
			if(rev[1][ed[i]] < i){
				int r = rev[1][ed[i]];
				rdp[i] = max(ldp[r] + abs(st[r] - a[i].pos), rdp[r] + abs(ed[r] - a[i].pos));
			}
			if(rev[1][st[i]] < i){
				int r = rev[1][st[i]];
				ldp[i] = max(ldp[r] + abs(st[r] - a[i].pos), rdp[r] + abs(ed[r] - a[i].pos));
			}
			if(cs & 1){
				if(x <= a[i].pos) xh = min(xh, a[i].pos);
				else xl = max(xl, a[i].pos);
			}
			else{
				if(x < a[i].pos) xh = min(xh, a[i].pos);
				else xl = max(xl, a[i].pos);
			}
		}
		else{
			st[i] = xl, ed[i] = xh;
			if(rev[0][ed[i]] < i){
				int r = rev[0][ed[i]];
				rdp[i] = max(ldp[r] + abs(st[r] - a[i].pos), rdp[r] + abs(ed[r] - a[i].pos));
			}
			if(rev[0][st[i]] < i){
				int r = rev[0][st[i]];
				ldp[i] = max(ldp[r] + abs(st[r] - a[i].pos), rdp[r] + abs(ed[r] - a[i].pos));
			}
			if(cs & 2){
				if(y <= a[i].pos) yh = min(yh, a[i].pos);
				else yl = max(yl, a[i].pos);
			}
			else{
				if(y < a[i].pos) yh = min(yh, a[i].pos);
				else yl = max(yl, a[i].pos);
			}
		}
		if(a[i].axis == 0 && a[i].pos == x){
			ret = max({ret, ldp[i] + abs(st[i] - y), rdp[i] + abs(ed[i] - y)});
		}
		if(a[i].axis == 1 && a[i].pos == y){
			ret = max({ret, ldp[i] + abs(st[i] - x), rdp[i] + abs(ed[i] - x)});
		}
	}
	return ret;
}
 
int main(){
	scanf("%d %d %d",&n,&m,&q);
	for(int i=0; i<n; i++){
		scanf("%d",&a[i].val);
		a[i].pos = i;
		a[i].axis = 0;
	}
	for(int i=0; i<m; i++){
		scanf("%d",&a[i+n].val);
		a[i+n].pos = i;
		a[i+n].axis = 1;
	}
	sort(a, a+n+m);
	reverse(a, a+n+m);
	for(int i=0; i<n+m; i++){
		rev[a[i].axis][a[i].pos] = i;
	}
	for(int i=0; i<q; i++){
		int x, y;
		scanf("%d %d",&x,&y);
		lint ret = 0;
		for(int j=0; j<4; j++) ret = max(ret, solve(x-1, y-1, j));
		printf("%lld\n", ret);
	}
}

Compilation message

abduction2.cpp: In function 'int main()':
abduction2.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&m,&q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:78:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i].val);
   ~~~~~^~~~~~~~~~~~~~~~
abduction2.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i+n].val);
   ~~~~~^~~~~~~~~~~~~~~~~~
abduction2.cpp:94:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 2084 KB Output is correct
3 Correct 5 ms 2084 KB Output is correct
4 Correct 4 ms 2084 KB Output is correct
5 Correct 5 ms 2084 KB Output is correct
6 Correct 4 ms 2084 KB Output is correct
7 Correct 5 ms 2084 KB Output is correct
8 Correct 5 ms 2112 KB Output is correct
9 Correct 2 ms 2112 KB Output is correct
10 Correct 5 ms 2112 KB Output is correct
11 Correct 6 ms 2112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 2084 KB Output is correct
3 Correct 5 ms 2084 KB Output is correct
4 Correct 4 ms 2084 KB Output is correct
5 Correct 5 ms 2084 KB Output is correct
6 Correct 4 ms 2084 KB Output is correct
7 Correct 5 ms 2084 KB Output is correct
8 Correct 5 ms 2112 KB Output is correct
9 Correct 2 ms 2112 KB Output is correct
10 Correct 5 ms 2112 KB Output is correct
11 Correct 6 ms 2112 KB Output is correct
12 Correct 7 ms 2240 KB Output is correct
13 Correct 7 ms 2240 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 7 ms 2284 KB Output is correct
16 Correct 7 ms 2284 KB Output is correct
17 Correct 7 ms 2284 KB Output is correct
18 Correct 7 ms 2284 KB Output is correct
19 Correct 7 ms 2284 KB Output is correct
20 Correct 7 ms 2284 KB Output is correct
21 Correct 7 ms 2284 KB Output is correct
22 Correct 6 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 2084 KB Output is correct
3 Correct 5 ms 2084 KB Output is correct
4 Correct 4 ms 2084 KB Output is correct
5 Correct 5 ms 2084 KB Output is correct
6 Correct 4 ms 2084 KB Output is correct
7 Correct 5 ms 2084 KB Output is correct
8 Correct 5 ms 2112 KB Output is correct
9 Correct 2 ms 2112 KB Output is correct
10 Correct 5 ms 2112 KB Output is correct
11 Correct 6 ms 2112 KB Output is correct
12 Correct 7 ms 2240 KB Output is correct
13 Correct 7 ms 2240 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 7 ms 2284 KB Output is correct
16 Correct 7 ms 2284 KB Output is correct
17 Correct 7 ms 2284 KB Output is correct
18 Correct 7 ms 2284 KB Output is correct
19 Correct 7 ms 2284 KB Output is correct
20 Correct 7 ms 2284 KB Output is correct
21 Correct 7 ms 2284 KB Output is correct
22 Correct 6 ms 2392 KB Output is correct
23 Correct 71 ms 4468 KB Output is correct
24 Correct 45 ms 4608 KB Output is correct
25 Correct 45 ms 4608 KB Output is correct
26 Correct 51 ms 4608 KB Output is correct
27 Correct 60 ms 4608 KB Output is correct
28 Correct 46 ms 4716 KB Output is correct
29 Correct 60 ms 4716 KB Output is correct
30 Correct 40 ms 4716 KB Output is correct
31 Correct 40 ms 4716 KB Output is correct
32 Correct 53 ms 4716 KB Output is correct
33 Correct 58 ms 4716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 79 ms 4716 KB Output is correct
2 Correct 80 ms 4716 KB Output is correct
3 Correct 68 ms 4716 KB Output is correct
4 Correct 67 ms 4716 KB Output is correct
5 Correct 71 ms 4716 KB Output is correct
6 Correct 63 ms 4716 KB Output is correct
7 Correct 75 ms 4716 KB Output is correct
8 Correct 64 ms 4716 KB Output is correct
9 Correct 71 ms 4716 KB Output is correct
10 Correct 80 ms 4716 KB Output is correct
11 Correct 60 ms 4716 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 2084 KB Output is correct
3 Correct 5 ms 2084 KB Output is correct
4 Correct 4 ms 2084 KB Output is correct
5 Correct 5 ms 2084 KB Output is correct
6 Correct 4 ms 2084 KB Output is correct
7 Correct 5 ms 2084 KB Output is correct
8 Correct 5 ms 2112 KB Output is correct
9 Correct 2 ms 2112 KB Output is correct
10 Correct 5 ms 2112 KB Output is correct
11 Correct 6 ms 2112 KB Output is correct
12 Correct 7 ms 2240 KB Output is correct
13 Correct 7 ms 2240 KB Output is correct
14 Correct 7 ms 2284 KB Output is correct
15 Correct 7 ms 2284 KB Output is correct
16 Correct 7 ms 2284 KB Output is correct
17 Correct 7 ms 2284 KB Output is correct
18 Correct 7 ms 2284 KB Output is correct
19 Correct 7 ms 2284 KB Output is correct
20 Correct 7 ms 2284 KB Output is correct
21 Correct 7 ms 2284 KB Output is correct
22 Correct 6 ms 2392 KB Output is correct
23 Correct 71 ms 4468 KB Output is correct
24 Correct 45 ms 4608 KB Output is correct
25 Correct 45 ms 4608 KB Output is correct
26 Correct 51 ms 4608 KB Output is correct
27 Correct 60 ms 4608 KB Output is correct
28 Correct 46 ms 4716 KB Output is correct
29 Correct 60 ms 4716 KB Output is correct
30 Correct 40 ms 4716 KB Output is correct
31 Correct 40 ms 4716 KB Output is correct
32 Correct 53 ms 4716 KB Output is correct
33 Correct 58 ms 4716 KB Output is correct
34 Correct 79 ms 4716 KB Output is correct
35 Correct 80 ms 4716 KB Output is correct
36 Correct 68 ms 4716 KB Output is correct
37 Correct 67 ms 4716 KB Output is correct
38 Correct 71 ms 4716 KB Output is correct
39 Correct 63 ms 4716 KB Output is correct
40 Correct 75 ms 4716 KB Output is correct
41 Correct 64 ms 4716 KB Output is correct
42 Correct 71 ms 4716 KB Output is correct
43 Correct 80 ms 4716 KB Output is correct
44 Correct 60 ms 4716 KB Output is correct
45 Correct 982 ms 4716 KB Output is correct
46 Correct 917 ms 4716 KB Output is correct
47 Correct 881 ms 4716 KB Output is correct
48 Correct 787 ms 4716 KB Output is correct
49 Correct 1012 ms 4716 KB Output is correct
50 Correct 609 ms 4716 KB Output is correct
51 Correct 754 ms 4716 KB Output is correct
52 Correct 662 ms 4716 KB Output is correct
53 Correct 672 ms 4716 KB Output is correct
54 Correct 704 ms 4716 KB Output is correct
55 Correct 620 ms 4716 KB Output is correct
56 Correct 478 ms 4716 KB Output is correct
57 Correct 578 ms 4716 KB Output is correct
58 Correct 628 ms 4716 KB Output is correct
59 Correct 435 ms 4716 KB Output is correct