oj.uz

답안 #856920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856920 2023-10-04T20:45:55 Z Tudy006 Climbers (RMI18_climbers) C++14
100 / 100
 157 ms 196088 KB 
#include <bits/stdc++.h>

using namespace std;

const int NMAX = 5000;
const long long INF = 1e18;

priority_queue <pair<long long, pair<int, int>>> pq;

long long modul( long long x ) {return x < 0 ? -x : x;}
bool between( int a, int b, int c ) {return ( a <= b && b <= c ) || ( a >= b && b >= c );}

long long dist[NMAX][NMAX - 1];

void update( int i, int j, long long d ) {
    if ( d < dist[i][j] ) {
        dist[i][j] = d;
        pq.push( { -d, { i, j } } );
    }
}
int main() {
    int n;
    cin >> n;
    vector <int> v;
    for ( int i = 1, x; i <= n; i ++ ) {
        cin >> x;
        while ( v.size() >= 2 && between( v[v.size() - 2], v[v.size() - 1], x ) ) v.pop_back();
        v.push_back( x );
    }


    n = v.size();
    for ( int i = 0; i <= n - 1; i ++ ) {
        for ( int j = 0; j <= n - 2; j ++ ) {
            dist[i][j] = INF;
        }
    }
    dist[0][n - 2] = 0;
    pq.push( { 0, {0, n - 2} } );

    while ( !pq.empty() ) {
        auto p = pq.top();
        int i = p.second.first, j = p.second.second;
        long long d = dist[i][j];
        if ( -p.first == d ) {

            if ( i == j || i == j + 1 ) {
                cout << d << '\n';
                return 0;
            }

            if ( i + 1 < n && between( v[j], v[i + 1], v[j + 1] ) ) {
                update( i + 1, j, d + modul( v[i] - v[i + 1] ) );
            }
            if ( i - 1 >= 0 && between( v[j], v[i - 1], v[j + 1] ) ) {
                update( i - 1, j, d + modul( v[i] - v[i - 1] ) );
            }
            if ( i + 1 < n && between( v[i], v[j], v[i + 1] ) ) {
                update( j, i, d + modul( v[i] - v[j] ) );
            }
            if ( i - 1 >= 0 && between( v[i], v[j], v[i - 1] ) ) {
                update( j, i - 1, d + modul( v[i] - v[j] ) );
            }

            if ( i + 1 < n && between( v[i], v[j + 1], v[i + 1] ) ) {
                update( j + 1, i, d + modul( v[i] - v[j + 1] ) );
            }
            if ( i - 1 >= 0 && between( v[i], v[j + 1], v[i - 1] ) ) {
                update( j + 1, i - 1, d + modul( v[i] - v[j + 1] ) );
            }
        }
        pq.pop();
    }
    cout << "NO\n";
    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 6 ms 39260 KB Output is correct
4 Correct 20 ms 119396 KB Output is correct
5 Correct 52 ms 196088 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 12776 KB Output is correct
3 Correct 59 ms 39260 KB Output is correct
4 Correct 103 ms 113240 KB Output is correct
5 Correct 135 ms 113244 KB Output is correct
6 Correct 137 ms 156756 KB Output is correct
7 Correct 146 ms 150400 KB Output is correct
8 Correct 119 ms 187388 KB Output is correct
9 Correct 149 ms 189268 KB Output is correct
10 Correct 157 ms 187384 KB Output is correct