oj.uz

답안 #484172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
484172 2021-11-02T09:30:53 Z dxz05 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
 31 ms 7008 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 3222;

ll a[N], p[N], s[N];
void solve(int TC) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];

    for (int i = 1; i <= n; i++){
        p[i] = p[i - 1] + max(0ll, a[i - 1] + 1 - a[i]);
    }

    for (int i = n; i >= 1; i--){
        s[i] = s[i + 1] + max(0ll, a[i + 1] + 1 - a[i]);
    }

    ll ans = LLINF;
    for (int i = 1; i <= n; i++){
        ans = min(ans, max(p[i], s[i]));
    }

    cout << ans;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #2
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 21 ms 6856 KB Output is correct
27 Correct 24 ms 6852 KB Output is correct
28 Correct 21 ms 7008 KB Output is correct
29 Correct 31 ms 6868 KB Output is correct
30 Correct 19 ms 6276 KB Output is correct
31 Correct 28 ms 6972 KB Output is correct
32 Correct 20 ms 6980 KB Output is correct
33 Correct 20 ms 6968 KB Output is correct
34 Correct 23 ms 6876 KB Output is correct
35 Correct 16 ms 6172 KB Output is correct
36 Correct 16 ms 6244 KB Output is correct
37 Correct 16 ms 6284 KB Output is correct
38 Correct 20 ms 6860 KB Output is correct
39 Correct 22 ms 6932 KB Output is correct
40 Correct 20 ms 6972 KB Output is correct
41 Correct 20 ms 6844 KB Output is correct
42 Correct 19 ms 6732 KB Output is correct
43 Correct 27 ms 6952 KB Output is correct
44 Correct 24 ms 6872 KB Output is correct
45 Correct 22 ms 6860 KB Output is correct
46 Correct 20 ms 6996 KB Output is correct
47 Correct 20 ms 6984 KB Output is correct
48 Correct 24 ms 6988 KB Output is correct