oj.uz

Submission #593205

# Submission time Handle Problem Language Result Execution time Memory
593205 2022-07-10T14:59:05 Z OttoTheDino Sightseeing in Kyoto (JOI22_kyoto) C++17
30 / 100
 16 ms 2772 KB 
//one of the coolest problems i've ever seen
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define pb(u)                       push_back(u)
#define len(a)                      (int)a.size()
typedef long long ll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll h, w, x = 0; cin >> h >> w;
    ll a[h+1], b[w+1];
    rep (i,1,h) cin >> a[i];
    rep (i,1,w) cin >> b[i];
    vector<ll> ha, hb;
    ha.pb(1), hb.pb(1);
    rep (i,2,h) {
        while (true) {
            ll n = len(ha);
            if (n==1 || ((a[ha[n-1]]-a[ha[n-2]])*(i-ha[n-1])<(a[i]-a[ha[n-1]])*(ha[n-1]-ha[n-2]))) break;
            ha.pop_back();
        }
        ha.pb(i);
    }
    rep (i,2,w) {
        while (true) {
            ll n = len(hb);
            if (n==1 || ((b[hb[n-1]]-b[hb[n-2]])*(i-hb[n-1])<(b[i]-b[hb[n-1]])*(hb[n-1]-hb[n-2]))) break;
            hb.pop_back();
        }
        hb.pb(i);
    }
    while (true) {
        ll n = len(ha), m = len(hb);
        if (max(n,m)<2) break;
        if (m==1 || ((a[ha[n-1]]-a[ha[n-2]])*(hb[m-1]-hb[m-2])>(b[hb[m-1]]-b[hb[m-2]])*(ha[n-1]-ha[n-2]))) {
            x += b[hb[m-1]] * (ha[n-1]-ha[n-2]);
            ha.pop_back();
        }
        else {
            x += a[ha[n-1]] * (hb[m-1]-hb[m-2]);
            hb.pop_back();
        }
    }
    cout << x << "\n";

    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 1 ms 340 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

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 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 7 ms 1236 KB Output is correct
5 Correct 5 ms 1108 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 15 ms 2628 KB Output is correct
8 Correct 15 ms 2516 KB Output is correct
9 Correct 15 ms 2636 KB Output is correct
10 Correct 14 ms 2644 KB Output is correct
11 Correct 12 ms 2488 KB Output is correct
12 Correct 16 ms 2628 KB Output is correct
13 Correct 15 ms 2632 KB Output is correct
14 Correct 13 ms 2644 KB Output is correct
15 Correct 15 ms 2772 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 320 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 1 ms 340 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -