oj.uz

답안 #874442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874442 2023-11-17T04:03:09 Z BrayanD Collecting Stamps 3 (JOI20_ho_t3) C++14
15 / 100
 127 ms 186676 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 205
#define oo 2e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll dp[MAX][410][MAX][5],a[MAX],t[MAX],n,m;   
int main(){
    cin>>n>>m;a[n]=m;t[n]=0;
    for(int i=0;i<n;i++){
        cin>>a[i];a[i+n+1]=a[i]+m;
    }
    for(int i=0;i<n;i++){
        cin>>t[i];t[i+n+1]=t[i];
    }
    for(int k=0;k<=n;k++)
        for(int i=n;i>=0;i--)
            for(int j=n;j<=i+n;j++)
                dp[i][j][k][0]=dp[i][j][k][1]=-1;
    dp[n][n][0][0]=dp[n][n][0][1]=0;
    ll r=0;
    for(int k=0;k<=n;k++){
        for(int i=n;i>=0;i--){
            for(int j=n;j<=i+n;j++){
                if(dp[i][j][k][0]!=-1){
                    if(j<i+n){
                        ll x=0,y=dp[i][j][k][0]+abs(a[i]-a[j+1]);
                        if(y<=t[j+1])x++;
                        if(dp[i][j+1][k+x][1]==-1)dp[i][j+1][k+x][1]=y;
                        else dp[i][j+1][k+x][1]=min(dp[i][j+1][k+x][1],y);
                    }
                    if(i>0){
                        ll x=0,y=dp[i][j][k][0]+abs(a[i]-a[i-1]);
                        if(y<=t[i-1])x++;
                        if(dp[i-1][j][k+x][0]==-1)dp[i-1][j][k+x][0]=y;
                        else dp[i-1][j][k+x][0]=min(dp[i-1][j][k+x][0],y);
                    }
                }
                if(dp[i][j][k][1]!=-1){
                    if(j<i+n){
                        ll x=0,y=dp[i][j][k][1]+abs(a[j]-a[j+1]);
                        if(y<=t[j+1])x++;
                        if(dp[i][j+1][k+x][1]==-1)dp[i][j+1][k+x][1]=y;
                        else   dp[i][j+1][k+x][1]=min(dp[i][j+1][k+x][1],y);
                    }
                    if(i>0){
                        ll x=0,y=dp[i][j][k][1]+abs(a[j]-a[i-1]);
                        if(y<=t[i-1])x++;
                        if(dp[i-1][j][k+x][0]==-1)dp[i-1][j][k+x][0]=y;
                        else dp[i-1][j][k+x][0]=min(dp[i-1][j][k+x][0],y);
                    }
                }
                if(dp[i][j][k][1]!=-1 || dp[i][j][k][0]!=-1)r=k;
            }
        }
    }cout<<r<<" ";
return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 26972 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 26972 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 6 ms 26972 KB Output is correct
13 Correct 3 ms 26972 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 3 ms 26972 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 26972 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 26972 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 6 ms 26972 KB Output is correct
13 Correct 3 ms 26972 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 3 ms 26972 KB Output is correct
18 Correct 5 ms 33368 KB Output is correct
19 Correct 3 ms 22876 KB Output is correct
20 Correct 3 ms 26972 KB Output is correct
21 Correct 4 ms 33236 KB Output is correct
22 Correct 2 ms 18776 KB Output is correct
23 Correct 4 ms 33364 KB Output is correct
24 Correct 3 ms 29020 KB Output is correct
25 Correct 4 ms 33116 KB Output is correct
26 Correct 4 ms 33248 KB Output is correct
27 Correct 2 ms 16732 KB Output is correct
28 Correct 2 ms 18780 KB Output is correct
29 Correct 4 ms 33240 KB Output is correct
30 Correct 4 ms 33116 KB Output is correct
31 Correct 4 ms 33116 KB Output is correct
32 Correct 3 ms 29020 KB Output is correct
33 Correct 4 ms 33116 KB Output is correct
34 Correct 4 ms 33116 KB Output is correct
35 Correct 3 ms 33116 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 26972 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 26972 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 6 ms 26972 KB Output is correct
13 Correct 3 ms 26972 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 3 ms 26972 KB Output is correct
18 Correct 127 ms 186676 KB Output is correct
19 Incorrect 61 ms 141144 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 1 ms 12636 KB Output is correct
5 Correct 2 ms 14684 KB Output is correct
6 Correct 3 ms 26972 KB Output is correct
7 Correct 2 ms 16732 KB Output is correct
8 Correct 3 ms 22876 KB Output is correct
9 Correct 3 ms 26972 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 6 ms 26972 KB Output is correct
13 Correct 3 ms 26972 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 16732 KB Output is correct
16 Correct 3 ms 26972 KB Output is correct
17 Correct 3 ms 26972 KB Output is correct
18 Correct 5 ms 33368 KB Output is correct
19 Correct 3 ms 22876 KB Output is correct
20 Correct 3 ms 26972 KB Output is correct
21 Correct 4 ms 33236 KB Output is correct
22 Correct 2 ms 18776 KB Output is correct
23 Correct 4 ms 33364 KB Output is correct
24 Correct 3 ms 29020 KB Output is correct
25 Correct 4 ms 33116 KB Output is correct
26 Correct 4 ms 33248 KB Output is correct
27 Correct 2 ms 16732 KB Output is correct
28 Correct 2 ms 18780 KB Output is correct
29 Correct 4 ms 33240 KB Output is correct
30 Correct 4 ms 33116 KB Output is correct
31 Correct 4 ms 33116 KB Output is correct
32 Correct 3 ms 29020 KB Output is correct
33 Correct 4 ms 33116 KB Output is correct
34 Correct 4 ms 33116 KB Output is correct
35 Correct 3 ms 33116 KB Output is correct
36 Correct 127 ms 186676 KB Output is correct
37 Incorrect 61 ms 141144 KB Output isn't correct
38 Halted 0 ms 0 KB -