oj.uz

Submission #25592

# Submission time Handle Problem Language Result Execution time Memory
25592 2017-06-23T06:49:29 Z dotorya 스트랩 (JOI14_straps) C++14
100 / 100
 39 ms 2116 KB 
#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 15;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

ll dp[4050];
ll tdp[4050];
pll in[2050];
int main() {
	int N, i, j;
	scanf("%d", &N);
	for (i = 1; i <= N; i++) scanf("%lld %lld", &in[i].first, &in[i].second);
	sort(in + 1, in + N + 1, [](pll a, pll b) {
		return a.first > b.first;
	});

	for (i = 0; i <= 4000; i++) dp[i] = -LL_INF;
	dp[1] = 0;
	for (i = 1; i <= N; i++) {
		for (j = 0; j <= 4000; j++) tdp[j] = dp[j];
		for (j = 1; j <= 4000; j++) {
			ll v = min(4000ll, j - 1 + in[i].first);
			tdp[v] = max(tdp[v], in[i].second + dp[j]);
		}
		for (j = 0; j <= 4000; j++) dp[j] = tdp[j];
	}

	ll ans = 0;
	for (i = 0; i <= 4000; i++) ans = max(ans, dp[i]);
	return !printf("%lld\n", ans);
}

Compilation message

straps.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)  
 ^
straps.cpp:24:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:336777216")  
 ^
straps.cpp: In function 'int main()':
straps.cpp:58:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
straps.cpp:59:74: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i = 1; i <= N; i++) scanf("%lld %lld", &in[i].first, &in[i].second);
                                                                          ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2116 KB Output is correct
2 Correct 0 ms 2116 KB Output is correct
3 Correct 0 ms 2116 KB Output is correct
4 Correct 0 ms 2116 KB Output is correct
5 Correct 0 ms 2116 KB Output is correct
6 Correct 0 ms 2116 KB Output is correct
7 Correct 0 ms 2116 KB Output is correct
8 Correct 0 ms 2116 KB Output is correct
9 Correct 0 ms 2116 KB Output is correct
10 Correct 0 ms 2116 KB Output is correct
11 Correct 0 ms 2116 KB Output is correct
12 Correct 0 ms 2116 KB Output is correct
13 Correct 0 ms 2116 KB Output is correct
14 Correct 0 ms 2116 KB Output is correct
15 Correct 0 ms 2116 KB Output is correct
16 Correct 0 ms 2116 KB Output is correct
17 Correct 0 ms 2116 KB Output is correct
18 Correct 0 ms 2116 KB Output is correct
19 Correct 0 ms 2116 KB Output is correct
20 Correct 0 ms 2116 KB Output is correct
21 Correct 0 ms 2116 KB Output is correct
22 Correct 0 ms 2116 KB Output is correct
23 Correct 0 ms 2116 KB Output is correct
24 Correct 0 ms 2116 KB Output is correct
25 Correct 0 ms 2116 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2116 KB Output is correct
2 Correct 0 ms 2116 KB Output is correct
3 Correct 0 ms 2116 KB Output is correct
4 Correct 0 ms 2116 KB Output is correct
5 Correct 0 ms 2116 KB Output is correct
6 Correct 0 ms 2116 KB Output is correct
7 Correct 0 ms 2116 KB Output is correct
8 Correct 9 ms 2116 KB Output is correct
9 Correct 13 ms 2116 KB Output is correct
10 Correct 13 ms 2116 KB Output is correct
11 Correct 13 ms 2116 KB Output is correct
12 Correct 26 ms 2116 KB Output is correct
13 Correct 26 ms 2116 KB Output is correct
14 Correct 23 ms 2116 KB Output is correct
15 Correct 29 ms 2116 KB Output is correct
16 Correct 26 ms 2116 KB Output is correct
17 Correct 19 ms 2116 KB Output is correct
18 Correct 23 ms 2116 KB Output is correct
19 Correct 26 ms 2116 KB Output is correct
20 Correct 26 ms 2116 KB Output is correct
21 Correct 23 ms 2116 KB Output is correct
22 Correct 23 ms 2116 KB Output is correct
23 Correct 29 ms 2116 KB Output is correct
24 Correct 26 ms 2116 KB Output is correct
25 Correct 29 ms 2116 KB Output is correct
26 Correct 33 ms 2116 KB Output is correct
27 Correct 26 ms 2116 KB Output is correct
28 Correct 26 ms 2116 KB Output is correct
29 Correct 26 ms 2116 KB Output is correct
30 Correct 36 ms 2116 KB Output is correct
31 Correct 36 ms 2116 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2116 KB Output is correct
2 Correct 0 ms 2116 KB Output is correct
3 Correct 0 ms 2116 KB Output is correct
4 Correct 0 ms 2116 KB Output is correct
5 Correct 0 ms 2116 KB Output is correct
6 Correct 0 ms 2116 KB Output is correct
7 Correct 0 ms 2116 KB Output is correct
8 Correct 0 ms 2116 KB Output is correct
9 Correct 13 ms 2116 KB Output is correct
10 Correct 19 ms 2116 KB Output is correct
11 Correct 13 ms 2116 KB Output is correct
12 Correct 13 ms 2116 KB Output is correct
13 Correct 13 ms 2116 KB Output is correct
14 Correct 13 ms 2116 KB Output is correct
15 Correct 19 ms 2116 KB Output is correct
16 Correct 19 ms 2116 KB Output is correct
17 Correct 39 ms 2116 KB Output is correct
18 Correct 26 ms 2116 KB Output is correct
19 Correct 23 ms 2116 KB Output is correct
20 Correct 26 ms 2116 KB Output is correct
21 Correct 26 ms 2116 KB Output is correct
22 Correct 26 ms 2116 KB Output is correct
23 Correct 26 ms 2116 KB Output is correct
24 Correct 26 ms 2116 KB Output is correct
25 Correct 26 ms 2116 KB Output is correct
26 Correct 23 ms 2116 KB Output is correct
27 Correct 26 ms 2116 KB Output is correct
28 Correct 26 ms 2116 KB Output is correct
29 Correct 23 ms 2116 KB Output is correct
30 Correct 23 ms 2116 KB Output is correct
31 Correct 26 ms 2116 KB Output is correct
32 Correct 23 ms 2116 KB Output is correct
33 Correct 23 ms 2116 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2116 KB Output is correct
2 Correct 23 ms 2116 KB Output is correct
3 Correct 26 ms 2116 KB Output is correct
4 Correct 26 ms 2116 KB Output is correct
5 Correct 26 ms 2116 KB Output is correct
6 Correct 26 ms 2116 KB Output is correct
7 Correct 26 ms 2116 KB Output is correct
8 Correct 26 ms 2116 KB Output is correct
9 Correct 36 ms 2116 KB Output is correct
10 Correct 23 ms 2116 KB Output is correct
11 Correct 29 ms 2116 KB Output is correct
12 Correct 23 ms 2116 KB Output is correct
13 Correct 23 ms 2116 KB Output is correct
14 Correct 23 ms 2116 KB Output is correct
15 Correct 26 ms 2116 KB Output is correct
16 Correct 26 ms 2116 KB Output is correct
17 Correct 26 ms 2116 KB Output is correct
18 Correct 23 ms 2116 KB Output is correct
19 Correct 26 ms 2116 KB Output is correct
20 Correct 29 ms 2116 KB Output is correct
21 Correct 26 ms 2116 KB Output is correct
22 Correct 29 ms 2116 KB Output is correct
23 Correct 26 ms 2116 KB Output is correct
24 Correct 29 ms 2116 KB Output is correct
25 Correct 23 ms 2116 KB Output is correct