oj.uz

답안 #486967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486967 2021-11-13T15:11:22 Z Neos Holding (COCI20_holding) C++14
110 / 110
 63 ms 25176 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;

#define task "holding"
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i, l, r) for( ll i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( ll i = (r) ; i >= (l) ; i-- )
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define sz(x) (int)x.size()
#define mp make_pair
#define fi first
#define se second
#define ar array
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';

const int N = 101;
const int M = 2502;

int n, l, r, k, a[N];
int dp[N][N][M];

int DP(int pos, int _at, int k) {
    if (_at > r) return (k < 0 ? 1e9 : 0);
    if (pos > n || k < 0) return 1e9;
    if (dp[pos][_at][k]) return dp[pos][_at][k];

    int cost = abs(pos - _at);

    int mn = DP(pos + 1, _at, k);
    if (k >= cost) mn = min(mn, DP(pos + 1, _at + 1, k - cost) + a[pos]);
    return dp[pos][_at][k] = mn;
}

int main() {
//    fastIO;
    scanf("%d %d %d %d", &n, &l, &r, &k); k = min(k, M);
    forw(i, 1, n + 1) scanf("%d", &a[i]);
    printf("%d", DP(1, l, k));
}

Compilation message

holding.cpp: In function 'int main()':
holding.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     scanf("%d %d %d %d", &n, &l, &r, &k); k = min(k, M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
holding.cpp:55:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     forw(i, 1, n + 1) scanf("%d", &a[i]);
      |                       ~~~~~^~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 5 ms 4940 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 5 ms 4940 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 1612 KB Output is correct
17 Correct 1 ms 1740 KB Output is correct
18 Correct 2 ms 2892 KB Output is correct
19 Correct 5 ms 4940 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 544 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 3 ms 4172 KB Output is correct
12 Correct 4 ms 4940 KB Output is correct
13 Correct 5 ms 4940 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 1612 KB Output is correct
17 Correct 1 ms 1740 KB Output is correct
18 Correct 2 ms 2892 KB Output is correct
19 Correct 5 ms 4940 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 4 ms 2148 KB Output is correct
22 Correct 3 ms 4684 KB Output is correct
23 Correct 1 ms 1228 KB Output is correct
24 Correct 18 ms 16312 KB Output is correct
25 Correct 63 ms 25176 KB Output is correct