oj.uz

답안 #515978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
515978 2022-01-20T08:55:51 Z David_M Collecting Stamps 3 (JOI20_ho_t3) C++14
0 / 100
 1 ms 848 KB 
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e13, P=998244353;


int n, ANS;
ll L;
ll dp[202][202][202][2];

void solve(){
    cin>>n>>L;
    vector<ll> a(n), T(n);
    for (auto &x:a)cin>>x;
    for (auto &x:T)cin>>x;

    for (int i=0; i<=n; i++)
        for (int j=0; j<=n; j++)
            for (int k=0; k<=n; k++)
                dp[i][j][k][0]=dp[i][j][k][1]=INF;
    dp[n][0][0][0]=dp[n][0][0][1]=0;

    for (int l=n; l>=0; l--){
        for (int r=0; r<=l; r++){
//            cout<<r<<" "<<l<<" "<<r+(n-l)<<endl;
            for (int ans=0; ans<=n; ans++){
                for (int i=0; i<2; i++){
                    ll curl=(l==n?L:a[l]);
                    ll curr=(r==0?0:a[r-1]);
                    ll t=dp[l][r][ans][i], len=curr+(L-curl);
                    if(t==INF)continue;
                    if(l>0){
                        ll tt=t+(curl-a[l-1])+((ll)(i^0)*len);
                        int Ans=ans+(tt<=T[l-1]);
                        ll &next=dp[l-1][r][Ans][0];
                        next=min(tt, next);
                        ANS=max(Ans, ANS);
                    }
                    if(r<n){
                        ll tt=t+(a[r]-curr)+((ll)(i^1)*len);
                        int Ans=ans+(tt<=T[r+0]);
                        ll &next=dp[l][r+1][Ans][1];
                        next=min(tt, next);
                        ANS=max(Ans, ANS);
                    }
                }
            }
        }
    }
    cout<<ANS;
}


main(){ios_base::sync_with_stdio(false), cin.tie(0);

	int T=1;
	//cin>>T;
    while(T--){
        solve();
    }

}

Compilation message

ho_t3.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){ios_base::sync_with_stdio(false), cin.tie(0);
      | ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Correct 1 ms 576 KB Output is correct
8 Correct 1 ms 712 KB Output is correct
9 Correct 1 ms 848 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 1 ms 832 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 592 KB Output is correct
16 Incorrect 1 ms 848 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Correct 1 ms 576 KB Output is correct
8 Correct 1 ms 712 KB Output is correct
9 Correct 1 ms 848 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 1 ms 832 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 592 KB Output is correct
16 Incorrect 1 ms 848 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Correct 1 ms 576 KB Output is correct
8 Correct 1 ms 712 KB Output is correct
9 Correct 1 ms 848 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 1 ms 832 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 592 KB Output is correct
16 Incorrect 1 ms 848 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 592 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 848 KB Output is correct
7 Correct 1 ms 576 KB Output is correct
8 Correct 1 ms 712 KB Output is correct
9 Correct 1 ms 848 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 1 ms 832 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 592 KB Output is correct
16 Incorrect 1 ms 848 KB Output isn't correct
17 Halted 0 ms 0 KB -