oj.uz

답안 #851315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851315 2023-09-19T14:25:07 Z niter Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 411 ms 321188 KB 
#include <bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define opa(x) cout << #x << " = " << x << ", ";
#define op(x) cout << #x << " = " << x << endl;
#define ops(x) cout << x;
#define entr cout << endl;
#define spac cout << ' ';
#define all(x) (x).begin(), (x).end()
#define STL(x) cout << #x << " : "; for(auto &qwe:x) cout << qwe << ' '; cout << endl;
#define arr(x, n) cout << #x << " : "; loop(qwe,0,n) cout << x[qwe] << ' '; cout << endl;
#define deb1 cout << "deb1" << endl;
#define deb2 cout << "deb2" << endl;
#define deb3 cout << "deb3" << endl;
#define deb4 cout << "deb4" << endl;
#define deb5 cout << "deb5" << endl;
using namespace std;
typedef long long ll;

const int mxn = 5e6;
ll dp[mxn];
int a_in[100005], b_in[100005];
vector<ll> a, b;
vector<ll> mul_a, mul_b;
const ll INF = 4e18;
vector<pair<int, ll>> E[mxn];

inline int hsh(int i, int j){ return (i << 11) + j; }
inline int get_i(int x){ return x >> 11; }
inline int get_j(int x){ return x & 2047; }
void solve(){
    int n, m; cin >> n >> m;
    loop(i,0,n){
        cin >> a_in[i];
    }
    loop(j,0,m){
        cin >> b_in[j];
    }
    a.pb(a_in[0]);
    int now_mul = 1;
    loop(i,1,n-1){
        if(a_in[i] >= a_in[i-1] && a_in[i] >= a_in[i+1]){
            a_in[i] = a_in[i-1];
            now_mul++;
        }
        else{
            a.pb(a_in[i]);
            mul_b.pb(now_mul);
            now_mul = 1;
        }
    }
    a.pb(a_in[n-1]);
    mul_b.pb(now_mul);
    n = a.size();

    now_mul = 1;
    b.pb(b_in[0]);
    loop(i,1,m-1){
        if(b_in[i] >= b_in[i-1] && b_in[i] >= b_in[i+1]){
            b_in[i] = b_in[i-1];
            now_mul++;
        }
        else{
            b.pb(b_in[i]);
            mul_a.pb(now_mul);
            now_mul = 1;
        }
    }
    b.pb(b_in[m-1]);
    mul_a.pb(now_mul);
    m = b.size();

    loop(i,0,n){
        loop(j,0,m){
            dp[hsh(i, j)] = INF;
        }
    }
    loop(i,0,n){
        loop(j,0,m-1){
            E[hsh(i, j)].pb({hsh(i, j+1), a[i] * mul_a[j]});
        }
    }
    loop(j,0,m){
        loop(i,0,n-1){
            E[hsh(i, j)].pb({hsh(i+1, j), b[j] * mul_b[i]});
        }
    }
    dp[0] = 0;
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    pq.push({0, 0});
    while(!pq.empty()){
        ll dis = pq.top().ff;
        int now = pq.top().ss;
//        opa(dis) op(now);
        pq.pop();
        if(dis != dp[now]) continue;
        for(auto &i:E[now]){
            ll nxt_dis = dis + i.ss;
            int nxt = i.ff;
            if(dp[nxt] > nxt_dis){
                dp[nxt] = nxt_dis;
                pq.push({nxt_dis, nxt});
            }
        }
    }
    cout << dp[hsh(n-1, m-1)] << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
//    freopen("test_input.txt", "r", stdin);
    int t = 1;
    while(t--){
        solve();
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 119640 KB Output is correct
2 Correct 25 ms 119384 KB Output is correct
3 Correct 28 ms 119868 KB Output is correct
4 Correct 29 ms 120544 KB Output is correct
5 Correct 26 ms 123736 KB Output is correct
6 Correct 26 ms 121692 KB Output is correct
7 Correct 25 ms 121688 KB Output is correct
8 Correct 24 ms 119520 KB Output is correct
9 Correct 167 ms 144340 KB Output is correct
10 Correct 146 ms 143064 KB Output is correct
11 Correct 139 ms 143952 KB Output is correct
12 Correct 133 ms 143696 KB Output is correct
13 Correct 411 ms 186800 KB Output is correct
14 Correct 132 ms 145940 KB Output is correct
15 Correct 126 ms 143184 KB Output is correct
16 Correct 409 ms 186508 KB Output is correct
17 Correct 25 ms 119640 KB Output is correct
18 Correct 25 ms 119640 KB Output is correct
19 Correct 25 ms 119640 KB Output is correct
20 Correct 27 ms 119640 KB Output is correct
21 Correct 25 ms 119640 KB Output is correct
22 Correct 25 ms 119388 KB Output is correct
23 Correct 25 ms 119644 KB Output is correct
24 Correct 26 ms 119640 KB Output is correct
25 Correct 25 ms 119640 KB Output is correct
26 Correct 25 ms 119640 KB Output is correct
27 Correct 28 ms 119964 KB Output is correct
28 Correct 25 ms 119640 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 119608 KB Output is correct
2 Correct 24 ms 119828 KB Output is correct
3 Correct 119 ms 138832 KB Output is correct
4 Runtime error 151 ms 321188 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 119640 KB Output is correct
2 Correct 25 ms 119384 KB Output is correct
3 Correct 28 ms 119868 KB Output is correct
4 Correct 29 ms 120544 KB Output is correct
5 Correct 26 ms 123736 KB Output is correct
6 Correct 26 ms 121692 KB Output is correct
7 Correct 25 ms 121688 KB Output is correct
8 Correct 24 ms 119520 KB Output is correct
9 Correct 167 ms 144340 KB Output is correct
10 Correct 146 ms 143064 KB Output is correct
11 Correct 139 ms 143952 KB Output is correct
12 Correct 133 ms 143696 KB Output is correct
13 Correct 411 ms 186800 KB Output is correct
14 Correct 132 ms 145940 KB Output is correct
15 Correct 126 ms 143184 KB Output is correct
16 Correct 409 ms 186508 KB Output is correct
17 Correct 25 ms 119640 KB Output is correct
18 Correct 25 ms 119640 KB Output is correct
19 Correct 25 ms 119640 KB Output is correct
20 Correct 27 ms 119640 KB Output is correct
21 Correct 25 ms 119640 KB Output is correct
22 Correct 25 ms 119388 KB Output is correct
23 Correct 25 ms 119644 KB Output is correct
24 Correct 26 ms 119640 KB Output is correct
25 Correct 25 ms 119640 KB Output is correct
26 Correct 25 ms 119640 KB Output is correct
27 Correct 28 ms 119964 KB Output is correct
28 Correct 25 ms 119640 KB Output is correct
29 Correct 26 ms 119608 KB Output is correct
30 Correct 24 ms 119828 KB Output is correct
31 Correct 119 ms 138832 KB Output is correct
32 Runtime error 151 ms 321188 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -