oj.uz

Submission #682783

# Submission time Handle Problem Language Result Execution time Memory
682783 2023-01-17T02:38:21 Z Paul_Liao_1457 Collecting Stamps 3 (JOI20_ho_t3) C++17
15 / 100
 60 ms 63612 KB 
//記得跳題
#include<iostream>
#include<array>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<unordered_map>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<tuple>
 
#define ll long long
#define LL __int128_t
#define DB double
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (ll)(2e9)
#define MOD (ll)(1e9+7)
#define F first
#define S second
#define endl "\n"
#define AC ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
using namespace std;

template<class T> using PQ=priority_queue<T,vector<T>,less<T> >;

void file(){
    freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
    freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
}

/*int s[200005],seg[800005];

void build(int id,int l,int r){
    if(l==r){
        seg[id]=s[l]; return;
    }
    int mid=(l+r)>>1;
    build(id*2,l,mid);
    build(id*2+1,mid+1,r);
    seg[id]=max(seg[id*2],seg[id*2+1]);
}

int ask(int id,int l,int r,int L,int R){
    if(l>R||r<L) return 0;
    if(L<=l&&r<=R) return seg[id];
    int mid=(l+r)>>1;
    return max(ask(id*2,l,mid,L,R),ask(id*2+1,mid+1,r,L,R));
}
 */

int dp[201][201][2][201],x[201],y[201],t[201];

signed main(){
    AC;
    int n,l; cin>>n>>l;
    FOR(i,1,n+1){
        cin>>x[i]; y[n-i+1]=l-x[i];
    }
    FOR(i,1,n+1) cin>>t[i];
    FOR(i,0,n+1)FOR(j,0,n+1)FOR(k,0,2)FOR(s,0,i+j+1) dp[i][j][k][s]=INF;
    dp[0][0][0][0]=dp[0][0][1][0]=0;
    int ans=0;
    FOR(i,0,n+1)FOR(j,0,n+1){
        if(i+j>n) break;
        FOR(k,0,2)FOR(s,0,min(n,i+j)+1)if(dp[i][j][k][s]!=INF){
            //cout<<"dp["<<i<<"]["<<j<<"]["<<k<<"]["<<s<<"]="<<dp[i][j][k][s]<<endl;
            ans=max(ans,s);
            if(k==0){
                if(dp[i][j][k][s]+x[i+1]-x[i]<=t[i+1]){
                    dp[i+1][j][k][s+1]=min(dp[i+1][j][k][s+1],dp[i][j][k][s]+x[i+1]-x[i]);
                }
                else{
                    dp[i+1][j][k][s]=min(dp[i+1][j][k][s],dp[i][j][k][s]+x[i+1]-x[i]);
                }
                if(dp[i][j][k][s]+y[j+1]+x[i]<=t[n-j]){
                    dp[i][j+1][k^1][s+1]=min(dp[i][j+1][k^1][s+1],dp[i][j][k][s]+y[j+1]+x[i]);
                }
                else{
                    dp[i][j+1][k^1][s]=min(dp[i][j+1][k^1][s],dp[i][j][k][s]+y[j+1]+x[i]);
                }
            }
            else{
                if(dp[i][j][k][s]+x[i+1]+y[j]<=t[i+1]){
                    dp[i+1][j][k^1][s+1]=min(dp[i+1][j][k^1][s+1],dp[i][j][k][s]+x[i+1]+y[j]);
                }
                else{
                    dp[i+1][j][k^1][s]=min(dp[i+1][j][k^1][s],dp[i][j][k][s]+x[i+1]+y[j]);
                }
                if(dp[i][j][k][s]+y[j+1]-y[j]<=t[n-j]){
                    dp[i][j+1][k][s+1]=min(dp[i][j+1][k][s+1],dp[i][j][k][s]+y[j+1]-y[j]);
                }
                else{
                    dp[i][j+1][k][s]=min(dp[i][j+1][k][s],dp[i][j][k][s]+y[j+1]-y[j]);
                }
            }
        }
    }
    cout<<ans<<endl;
}


/*

 */

Compilation message

ho_t3.cpp: In function 'void file()':
ho_t3.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("/Users/liaoyunyang/Desktop/meta_in.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen("/Users/liaoyunyang/Desktop/meta_out.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Incorrect 1 ms 724 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 33 ms 51960 KB Output is correct
19 Correct 19 ms 31752 KB Output is correct
20 Correct 12 ms 17104 KB Output is correct
21 Correct 18 ms 29908 KB Output is correct
22 Correct 25 ms 38740 KB Output is correct
23 Correct 9 ms 14536 KB Output is correct
24 Correct 6 ms 11476 KB Output is correct
25 Correct 8 ms 14292 KB Output is correct
26 Correct 3 ms 5588 KB Output is correct
27 Correct 10 ms 14896 KB Output is correct
28 Correct 5 ms 10708 KB Output is correct
29 Correct 9 ms 15188 KB Output is correct
30 Correct 8 ms 11988 KB Output is correct
31 Correct 8 ms 14292 KB Output is correct
32 Correct 4 ms 7636 KB Output is correct
33 Correct 8 ms 14292 KB Output is correct
34 Correct 3 ms 5204 KB Output is correct
35 Correct 10 ms 13928 KB Output is correct
36 Correct 4 ms 6724 KB Output is correct
37 Correct 9 ms 14804 KB Output is correct
38 Correct 5 ms 8276 KB Output is correct
39 Correct 9 ms 15468 KB Output is correct
40 Correct 5 ms 9172 KB Output is correct
41 Correct 43 ms 63612 KB Output is correct
42 Correct 25 ms 43248 KB Output is correct
43 Correct 44 ms 63556 KB Output is correct
44 Correct 34 ms 42716 KB Output is correct
45 Correct 60 ms 63552 KB Output is correct
46 Correct 24 ms 43212 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Incorrect 1 ms 724 KB Output isn't correct
19 Halted 0 ms 0 KB -