Submission #623009

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
623009	2022-08-05T02:13:37 Z	iomoon191	Sightseeing in Kyoto (JOI22_kyoto)	C++17	100 / 100	34 ms	3896 KB

kyoto

#include <bits/stdc++.h>
using ll = long long;
#define int ll
using namespace std;

#define sz(x) (int)(x).size()
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, l, r) for(int i = l; i >= r; i--)
#define fi first
#define se second
#define M 998244353

typedef pair<int, int> pi;
typedef vector<int> vi;
#define db(x) cerr << __LINE__ << " " << #x << " " << x << "\n"

const int N = 500005;
const int inf = 3e18;

int h, w;
vector<pi> a, b;

int calc(pi x, pi y, pi z){
	int x1 = y.fi - x.fi;
	int x2 = z.fi - x.fi;
	int y1 = y.se - x.se;
	int y2 = z.se - x.se;
	return (1ll * x1 * y2) - (1ll * y1 * x2);
}

void solve(){
	cin >> h >> w;
	foru(i, 1, h){
		int o; cin >> o;
		while(sz(a) > 1 and calc(a[sz(a) - 2], a[sz(a) - 1], pi(i, o)) <= 0) a.pop_back();
		a.emplace_back(i, o);
	}
	foru(i, 1, w){
		int o; cin >> o;
		while(sz(b) > 1 and calc(b[sz(b) - 2], b[sz(b) - 1], pi(i, o)) <= 0) b.pop_back();
		b.emplace_back(i, o);
	}
	int dx = 0, dy = 0, res = 0;
	while(dx < sz(a) - 1 or dy < sz(b) - 1){
		bool ok = false;
		if(dx + 1 == sz(a)) ok = true;
		else if(dx < sz(a) - 1 and dy < sz(b) - 1){
			pi px = pi(a[dx + 1].fi - a[dx].fi, a[dx + 1].se - a[dx].se);
			pi py = pi(b[dy + 1].fi - b[dy].fi, b[dy + 1].se - b[dy].se);
			if(calc(pi(0, 0), py, px) >= 0)	
				ok = true;
		}
		if(ok){
			res += 1ll * (b[dy + 1].fi - b[dy].fi) * a[dx].se;
			dy++;
		}
		else{
			res += 1ll * (a[dx + 1].fi - a[dx].fi) * b[dy].se;
			dx++;
		}
	}
	cout << res;
} 

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t = 1; // cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	320 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	324 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	6 ms	624 KB	Output is correct
5	Correct	6 ms	596 KB	Output is correct
6	Correct	4 ms	340 KB	Output is correct
7	Correct	15 ms	1076 KB	Output is correct
8	Correct	14 ms	1052 KB	Output is correct
9	Correct	15 ms	1072 KB	Output is correct
10	Correct	15 ms	1076 KB	Output is correct
11	Correct	13 ms	1036 KB	Output is correct
12	Correct	16 ms	1056 KB	Output is correct
13	Correct	15 ms	1136 KB	Output is correct
14	Correct	16 ms	1072 KB	Output is correct
15	Correct	14 ms	1184 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	320 KB	Output is correct
23	Correct	1 ms	324 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct

Subtask #3
60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	304 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	320 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	324 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	324 KB	Output is correct
31	Correct	1 ms	304 KB	Output is correct
32	Correct	6 ms	624 KB	Output is correct
33	Correct	6 ms	596 KB	Output is correct
34	Correct	4 ms	340 KB	Output is correct
35	Correct	15 ms	1076 KB	Output is correct
36	Correct	14 ms	1052 KB	Output is correct
37	Correct	15 ms	1072 KB	Output is correct
38	Correct	15 ms	1076 KB	Output is correct
39	Correct	13 ms	1036 KB	Output is correct
40	Correct	16 ms	1056 KB	Output is correct
41	Correct	15 ms	1136 KB	Output is correct
42	Correct	16 ms	1072 KB	Output is correct
43	Correct	14 ms	1184 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	1 ms	324 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	0 ms	320 KB	Output is correct
51	Correct	1 ms	324 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	0 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct
55	Correct	10 ms	1108 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	1 ms	408 KB	Output is correct
58	Correct	4 ms	468 KB	Output is correct
59	Correct	26 ms	2256 KB	Output is correct
60	Correct	23 ms	2208 KB	Output is correct
61	Correct	22 ms	2224 KB	Output is correct
62	Correct	22 ms	2204 KB	Output is correct
63	Correct	24 ms	3896 KB	Output is correct
64	Correct	22 ms	2232 KB	Output is correct
65	Correct	23 ms	2208 KB	Output is correct
66	Correct	22 ms	2208 KB	Output is correct
67	Correct	34 ms	2248 KB	Output is correct

Submission #623009

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 30.0 / 30.0

Subtask #3 60.0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
30.0 / 30.0

Subtask #3
60.0 / 60.0