oj.uz

답안 #406057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406057 2021-05-17T07:24:35 Z maomao90 The short shank; Redemption (BOI21_prison) C++17
15 / 100
 2000 ms 46452 KB 
#include <bits/stdc++.h> 
using namespace std;

#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 4005

int n, d, t;
int ti[MAXN];
int cost[MAXN][MAXN];
ll dp[MAXN][MAXN];

int main() {
	scanf("%d%d%d", &n, &d, &t);
	REP (i, 1, n + 1) {
		scanf("%d", &ti[i]);
	}
	REP (i, 1, n + 1) {
		ll r = -1;
		int cur = 0;
		REP (j, i, n + 1) {
			if (t >= ti[j]) mxto(r, t - ti[j] + j);
			if (r >= j) cur++;
			cost[i][j] = cur;
		}
	}
	REP (i, 1, n + 1) {
		dp[0][i] = cost[1][i];
	}
	REP (i, 1, d + 1) {
		REP (j, 1, n + 1) {
			dp[i][j] = LINF;
			REP (k, 1, j) {
				mnto(dp[i][j], dp[i - 1][k] + cost[k + 1][j]);
			}
		}
	}
	printf("%lld\n", dp[d][n]);
	return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  scanf("%d%d%d", &n, &d, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
prison.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%d", &ti[i]);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 5 ms 2380 KB Output is correct
4 Correct 12 ms 3128 KB Output is correct
5 Correct 23 ms 3472 KB Output is correct
6 Correct 4 ms 2764 KB Output is correct
7 Correct 10 ms 3020 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 6 ms 2932 KB Output is correct
10 Correct 12 ms 3148 KB Output is correct
11 Correct 23 ms 3540 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Runtime error 11 ms 332 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 5 ms 2380 KB Output is correct
4 Correct 12 ms 3128 KB Output is correct
5 Correct 23 ms 3472 KB Output is correct
6 Correct 4 ms 2764 KB Output is correct
7 Correct 10 ms 3020 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 6 ms 2932 KB Output is correct
10 Correct 12 ms 3148 KB Output is correct
11 Correct 23 ms 3540 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 2252 KB Output is correct
14 Correct 5 ms 2380 KB Output is correct
15 Correct 13 ms 3136 KB Output is correct
16 Correct 23 ms 3528 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 11 ms 3008 KB Output is correct
19 Correct 4 ms 2764 KB Output is correct
20 Correct 6 ms 2892 KB Output is correct
21 Correct 13 ms 3140 KB Output is correct
22 Correct 29 ms 3524 KB Output is correct
23 Execution timed out 2078 ms 46452 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 10 ms 384 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 5 ms 2380 KB Output is correct
4 Correct 12 ms 3128 KB Output is correct
5 Correct 23 ms 3472 KB Output is correct
6 Correct 4 ms 2764 KB Output is correct
7 Correct 10 ms 3020 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 6 ms 2932 KB Output is correct
10 Correct 12 ms 3148 KB Output is correct
11 Correct 23 ms 3540 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 2252 KB Output is correct
14 Correct 5 ms 2380 KB Output is correct
15 Correct 13 ms 3136 KB Output is correct
16 Correct 23 ms 3528 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 11 ms 3008 KB Output is correct
19 Correct 4 ms 2764 KB Output is correct
20 Correct 6 ms 2892 KB Output is correct
21 Correct 13 ms 3140 KB Output is correct
22 Correct 29 ms 3524 KB Output is correct
23 Execution timed out 2078 ms 46452 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 2252 KB Output is correct
3 Correct 5 ms 2380 KB Output is correct
4 Correct 12 ms 3128 KB Output is correct
5 Correct 23 ms 3472 KB Output is correct
6 Correct 4 ms 2764 KB Output is correct
7 Correct 10 ms 3020 KB Output is correct
8 Correct 4 ms 2892 KB Output is correct
9 Correct 6 ms 2932 KB Output is correct
10 Correct 12 ms 3148 KB Output is correct
11 Correct 23 ms 3540 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Runtime error 11 ms 332 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -