oj.uz

Submission #32113

# Submission time Handle Problem Language Result Execution time Memory
32113 2017-09-26T06:10:58 Z TAMREF 스트랩 (JOI14_straps) C++11
100 / 100
 26 ms 33596 KB 
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int,int>;
const int ilb = INT_MIN;
int dp[2005][2005], vis[2005][2005];
ii f[2005];
int n;
void input(){
    cin>>n;
    for(int i=0;i<n;i++) cin>>f[i].first>>f[i].second;
    sort(f,f+n,greater<ii>());
    for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) dp[i][j]=ilb;
    dp[0][1]=0;
}
void work(){
    for(int i=0;i<n;i++){
        dp[i+1][0]=dp[i][0];
        for(int j=1,k;j<=n;j++){
            dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
            k=min(n,j+f[i].first-1);
            if(dp[i][j]!=ilb) dp[i+1][k]=max(dp[i+1][k],dp[i][j]+f[i].second);
        }
    }
}
int main(){
    cin.sync_with_stdio(false);cin.tie(0);
    input();
    work();
    printf("%d\n",*max_element(dp[n],dp[n]+n+1));
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
45.0 / 45.0

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

Subtask #4
45.0 / 45.0

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