oj.uz

답안 #448211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448211 2021-07-29T10:16:47 Z NhatMinh0208 Collecting Stamps 3 (JOI20_ho_t3) C++17
25 / 100
 51 ms 64356 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
ll n,m,i,j,k,l,t,t1,u,v,a,b,res=0;
ll arr[201],brr[201];
ll dp[202][202][202][2];
int main()
{
	fio;
    cin>>n>>t;
    for (i=1;i<=n;i++)
    {
        cin>>arr[i];
    }
    for (i=1;i<=n;i++)
    {
        cin>>brr[i];
    }
    if (n==1)
    {
        if (min(arr[1],t-arr[1])<=brr[1]) cout<<1;
        else cout<<0;
        return 0;
    }
    arr[0]=0;
    arr[n+1]=t;
    for (i=1;i<=n;i++) for (j=i;j<=n;j++)
    for (k=0;k<=n-(j-i+1);k++)
    {
        dp[i][j][k][0]=1e18;
        dp[i][j][k][1]=1e18;
    }
    if (arr[1]<=brr[1])
    {
        dp[2][n][1][0]=arr[1];
    }
    else
    {
        dp[2][n][0][0]=arr[1];
    }

    if (t-arr[n]<=brr[n])
    {
        dp[1][n-1][1][1]=t-arr[n];
    }
    else
    {
        dp[1][n-1][0][1]=t-arr[n];
    }
    for (i=1;i<=n;i++) for (j=n;j>=i;j--) for (k=0;k<=n-(j-i+1);k++)
    {
        if ((i==1)and(j==n)) continue;
        if (dp[i][j][k][0]<1e17) res=max(res,k);
        // if (dp[i][j][k][0]<1e18) cout<<i<<' '<<j<<' '<<k<<' '<<0<<" | "<<dp[i][j][k][0]<<endl;
        // if (dp[i][j][k][1]<1e18) cout<<i<<' '<<j<<' '<<k<<' '<<1<<" | "<<dp[i][j][k][1]<<endl;
        if (dp[i][j][k][1]<1e17) res=max(res,k);
        if (i<j)
        {
            if (dp[i][j][k][0]<1e17)
            {
                u=dp[i][j][k][0]+(arr[i]-arr[i-1]);
                if (u<=brr[i])
                dp[i+1][j][k+1][0]=min(dp[i+1][j][k+1][0],u);
                else
                dp[i+1][j][k][0]=min(dp[i+1][j][k][0],u);
                
                u=dp[i][j][k][0]+(arr[i-1]+t-arr[j]);
                if (u<=brr[j])
                dp[i][j-1][k+1][1]=min(dp[i][j-1][k+1][1],u);
                else
                dp[i][j-1][k][1]=min(dp[i][j-1][k][1],u);
            }
            if (dp[i][j][k][1]<1e17)
            {
                u=dp[i][j][k][1]+(arr[j+1]-arr[j]);
                if (u<=brr[j])
                dp[i][j-1][k+1][1]=min(dp[i][j-1][k+1][1],u);
                else
                dp[i][j-1][k][1]=min(dp[i][j-1][k][1],u);
                
                u=dp[i][j][k][1]+(arr[i]+t-arr[j+1]);
                if (u<=brr[i])
                dp[i+1][j][k+1][0]=min(dp[i+1][j][k+1][0],u);
                else
                dp[i+1][j][k][0]=min(dp[i+1][j][k][0],u);
            }
        }
        else
        {
            if((dp[i][j][k][0]+min(arr[i]-arr[i-1],t-(arr[i]-arr[i-1]))<=brr[i])
            or (dp[i][j][k][1]+min(arr[i+1]-arr[i],t-(arr[i+1]-arr[i]))<=brr[i]))
            res=max(res,k+1);
        }
    }
    cout<<res;
}
// a

Compilation message

ho_t3.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 588 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 588 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 716 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 716 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 716 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 588 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 36 ms 51788 KB Output is correct
19 Correct 20 ms 31436 KB Output is correct
20 Correct 12 ms 16844 KB Output is correct
21 Correct 20 ms 29772 KB Output is correct
22 Correct 28 ms 38452 KB Output is correct
23 Correct 9 ms 14284 KB Output is correct
24 Correct 6 ms 11212 KB Output is correct
25 Correct 9 ms 14084 KB Output is correct
26 Correct 4 ms 5452 KB Output is correct
27 Correct 9 ms 14668 KB Output is correct
28 Correct 6 ms 10444 KB Output is correct
29 Correct 10 ms 14904 KB Output is correct
30 Correct 7 ms 11724 KB Output is correct
31 Correct 9 ms 14028 KB Output is correct
32 Correct 4 ms 7372 KB Output is correct
33 Correct 9 ms 14028 KB Output is correct
34 Correct 3 ms 5068 KB Output is correct
35 Correct 9 ms 13772 KB Output is correct
36 Correct 4 ms 6604 KB Output is correct
37 Correct 8 ms 14668 KB Output is correct
38 Correct 5 ms 8012 KB Output is correct
39 Correct 9 ms 15180 KB Output is correct
40 Correct 5 ms 8908 KB Output is correct
41 Correct 49 ms 63832 KB Output is correct
42 Correct 24 ms 42948 KB Output is correct
43 Correct 48 ms 63808 KB Output is correct
44 Correct 23 ms 42472 KB Output is correct
45 Correct 48 ms 63832 KB Output is correct
46 Correct 25 ms 43052 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 284 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 588 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 716 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 588 KB Output is correct
32 Correct 1 ms 588 KB Output is correct
33 Correct 1 ms 716 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 716 KB Output is correct
36 Correct 36 ms 51788 KB Output is correct
37 Correct 20 ms 31436 KB Output is correct
38 Correct 12 ms 16844 KB Output is correct
39 Correct 20 ms 29772 KB Output is correct
40 Correct 28 ms 38452 KB Output is correct
41 Correct 9 ms 14284 KB Output is correct
42 Correct 6 ms 11212 KB Output is correct
43 Correct 9 ms 14084 KB Output is correct
44 Correct 4 ms 5452 KB Output is correct
45 Correct 9 ms 14668 KB Output is correct
46 Correct 6 ms 10444 KB Output is correct
47 Correct 10 ms 14904 KB Output is correct
48 Correct 7 ms 11724 KB Output is correct
49 Correct 9 ms 14028 KB Output is correct
50 Correct 4 ms 7372 KB Output is correct
51 Correct 9 ms 14028 KB Output is correct
52 Correct 3 ms 5068 KB Output is correct
53 Correct 9 ms 13772 KB Output is correct
54 Correct 4 ms 6604 KB Output is correct
55 Correct 8 ms 14668 KB Output is correct
56 Correct 5 ms 8012 KB Output is correct
57 Correct 9 ms 15180 KB Output is correct
58 Correct 5 ms 8908 KB Output is correct
59 Correct 49 ms 63832 KB Output is correct
60 Correct 24 ms 42948 KB Output is correct
61 Correct 48 ms 63808 KB Output is correct
62 Correct 23 ms 42472 KB Output is correct
63 Correct 48 ms 63832 KB Output is correct
64 Correct 25 ms 43052 KB Output is correct
65 Correct 43 ms 57608 KB Output is correct
66 Correct 38 ms 52836 KB Output is correct
67 Correct 36 ms 50636 KB Output is correct
68 Correct 32 ms 46712 KB Output is correct
69 Correct 41 ms 57056 KB Output is correct
70 Correct 43 ms 54592 KB Output is correct
71 Correct 40 ms 55196 KB Output is correct
72 Correct 46 ms 55840 KB Output is correct
73 Correct 35 ms 51684 KB Output is correct
74 Correct 35 ms 48532 KB Output is correct
75 Correct 35 ms 53456 KB Output is correct
76 Correct 48 ms 61328 KB Output is correct
77 Correct 43 ms 61260 KB Output is correct
78 Correct 36 ms 47308 KB Output is correct
79 Correct 34 ms 48972 KB Output is correct
80 Correct 47 ms 59980 KB Output is correct
81 Correct 33 ms 49532 KB Output is correct
82 Correct 36 ms 52356 KB Output is correct
83 Correct 47 ms 63912 KB Output is correct
84 Correct 38 ms 54688 KB Output is correct
85 Correct 38 ms 59472 KB Output is correct
86 Correct 41 ms 58240 KB Output is correct
87 Correct 38 ms 53464 KB Output is correct
88 Incorrect 51 ms 64356 KB Output isn't correct
89 Halted 0 ms 0 KB -