oj.uz

Submission #475927

# Submission time Handle Problem Language Result Execution time Memory
475927 2021-09-24T13:10:11 Z ymm Collecting Stamps 3 (JOI20_ho_t3) C++17
15 / 100
 711 ms 145316 KB 
///
///   Let the voice of love take you higher!
///

#define _USE_MATH_DEFINES
#define FAST ios::sync_with_stdio(false),cin.tie(0);
#include <bits/stdc++.h>
#define Loop(x, l, r) for(ll x = ll(l); x < ll(r); ++x)
#define LoopR(x, l, r) for(ll x = ll(r)-1; x >= ll(l); --x)
#define all(x) x.begin(), x.end()
#define Kill(x) exit((cout << (x) << '\n', 0))
#define YN(flag) ((flag)? "YES": "NO")
#define F first
#define S second
typedef          long long   ll;
typedef unsigned long long  ull;
typedef std::pair<int,int>  pii;
typedef std::pair<ll ,ll >  pll;
using namespace std;

#define int ll

const int N = 210;
ll dp[2][N][N][N]; // d, cnt, l, r
ll len, _x[N], *x = _x+1;
ll _t[N], *t = _t+1;
int n;

ll dis(int i, int j)
{
    return min(abs(x[j]-x[i]), len-abs(x[j]-x[i]));
}

bool gd(int i, int j, ll t)
{
    //if(dis(i,j)+t <= ::t[j]) cerr << i << ' ' << j << ' ' << t << '\n';
    return dis(i,j)+t <= ::t[j];
}

void smin(ll& x, ll y){x = min(x, y);}

signed main()
{
    FAST;
    cin >> n >> len;
    Loop(i,0,n) cin >> x[i];
    x[n] = x[0]; x[-1] = x[n-1];
    Loop(i,0,n) cin >> t[i];
    t[n] = t[0]; t[-1] = t[n-1];
    memset(dp, 31, sizeof dp);
    dp[0][t[0  ]>=    x[  0]][1][n  ] =     x[  0];
    dp[0][t[0  ]>=    x[  0]][1][n  ] =     x[  0];
    dp[1][t[n-1]>=len-x[n-1]][0][n-1] = len-x[n-1];
    dp[1][t[n-1]>=len-x[n-1]][0][n-1] = len-x[n-1];
    LoopR(k,1,n)
    {
        Loop(l,0,n)
        {
            int r = l+k;
            Loop(cnt,0,n)
            {
                smin(dp[0][cnt+gd(l-1,l  ,dp[0][cnt][l][r])][l+1][r], dp[0][cnt][l][r]+dis(l-1,l  ));
                smin(dp[1][cnt+gd(l-1,r-1,dp[0][cnt][l][r])][l][r-1], dp[0][cnt][l][r]+dis(l-1,r-1));
                smin(dp[0][cnt+gd(r  ,l  ,dp[1][cnt][l][r])][l+1][r], dp[1][cnt][l][r]+dis(r  ,l  ));
                smin(dp[1][cnt+gd(r  ,r-1,dp[1][cnt][l][r])][l][r-1], dp[1][cnt][l][r]+dis(r  ,r-1));
            }
        }
    }
    int ans = 0;
    Loop(i,0,n) Loop(cnt,ans+1,n+1)
    {
        if(dp[0][cnt][i][i] < 1e15) ans = cnt;
        if(dp[1][cnt][i][i] < 1e15) ans = cnt;
    }
    cout << ans << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 145220 KB Output is correct
2 Correct 63 ms 145196 KB Output is correct
3 Correct 66 ms 145276 KB Output is correct
4 Correct 59 ms 145220 KB Output is correct
5 Correct 67 ms 145220 KB Output is correct
6 Correct 69 ms 145268 KB Output is correct
7 Correct 63 ms 145208 KB Output is correct
8 Correct 66 ms 145248 KB Output is correct
9 Correct 67 ms 145276 KB Output is correct
10 Correct 58 ms 145184 KB Output is correct
11 Correct 64 ms 145196 KB Output is correct
12 Correct 63 ms 145272 KB Output is correct
13 Correct 55 ms 145248 KB Output is correct
14 Correct 69 ms 145192 KB Output is correct
15 Correct 66 ms 145224 KB Output is correct
16 Correct 64 ms 145160 KB Output is correct
17 Correct 61 ms 145180 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 145220 KB Output is correct
2 Correct 63 ms 145196 KB Output is correct
3 Correct 66 ms 145276 KB Output is correct
4 Correct 59 ms 145220 KB Output is correct
5 Correct 67 ms 145220 KB Output is correct
6 Correct 69 ms 145268 KB Output is correct
7 Correct 63 ms 145208 KB Output is correct
8 Correct 66 ms 145248 KB Output is correct
9 Correct 67 ms 145276 KB Output is correct
10 Correct 58 ms 145184 KB Output is correct
11 Correct 64 ms 145196 KB Output is correct
12 Correct 63 ms 145272 KB Output is correct
13 Correct 55 ms 145248 KB Output is correct
14 Correct 69 ms 145192 KB Output is correct
15 Correct 66 ms 145224 KB Output is correct
16 Correct 64 ms 145160 KB Output is correct
17 Correct 61 ms 145180 KB Output is correct
18 Correct 60 ms 145216 KB Output is correct
19 Correct 63 ms 145232 KB Output is correct
20 Correct 57 ms 145172 KB Output is correct
21 Correct 64 ms 145192 KB Output is correct
22 Correct 59 ms 145248 KB Output is correct
23 Correct 58 ms 145252 KB Output is correct
24 Correct 59 ms 145276 KB Output is correct
25 Correct 68 ms 145248 KB Output is correct
26 Correct 61 ms 145316 KB Output is correct
27 Correct 57 ms 145208 KB Output is correct
28 Correct 64 ms 145220 KB Output is correct
29 Correct 67 ms 145300 KB Output is correct
30 Correct 58 ms 145180 KB Output is correct
31 Correct 63 ms 145216 KB Output is correct
32 Correct 65 ms 145288 KB Output is correct
33 Correct 58 ms 145192 KB Output is correct
34 Correct 64 ms 145288 KB Output is correct
35 Correct 60 ms 145184 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 145220 KB Output is correct
2 Correct 63 ms 145196 KB Output is correct
3 Correct 66 ms 145276 KB Output is correct
4 Correct 59 ms 145220 KB Output is correct
5 Correct 67 ms 145220 KB Output is correct
6 Correct 69 ms 145268 KB Output is correct
7 Correct 63 ms 145208 KB Output is correct
8 Correct 66 ms 145248 KB Output is correct
9 Correct 67 ms 145276 KB Output is correct
10 Correct 58 ms 145184 KB Output is correct
11 Correct 64 ms 145196 KB Output is correct
12 Correct 63 ms 145272 KB Output is correct
13 Correct 55 ms 145248 KB Output is correct
14 Correct 69 ms 145192 KB Output is correct
15 Correct 66 ms 145224 KB Output is correct
16 Correct 64 ms 145160 KB Output is correct
17 Correct 61 ms 145180 KB Output is correct
18 Incorrect 711 ms 145284 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 145220 KB Output is correct
2 Correct 63 ms 145196 KB Output is correct
3 Correct 66 ms 145276 KB Output is correct
4 Correct 59 ms 145220 KB Output is correct
5 Correct 67 ms 145220 KB Output is correct
6 Correct 69 ms 145268 KB Output is correct
7 Correct 63 ms 145208 KB Output is correct
8 Correct 66 ms 145248 KB Output is correct
9 Correct 67 ms 145276 KB Output is correct
10 Correct 58 ms 145184 KB Output is correct
11 Correct 64 ms 145196 KB Output is correct
12 Correct 63 ms 145272 KB Output is correct
13 Correct 55 ms 145248 KB Output is correct
14 Correct 69 ms 145192 KB Output is correct
15 Correct 66 ms 145224 KB Output is correct
16 Correct 64 ms 145160 KB Output is correct
17 Correct 61 ms 145180 KB Output is correct
18 Correct 60 ms 145216 KB Output is correct
19 Correct 63 ms 145232 KB Output is correct
20 Correct 57 ms 145172 KB Output is correct
21 Correct 64 ms 145192 KB Output is correct
22 Correct 59 ms 145248 KB Output is correct
23 Correct 58 ms 145252 KB Output is correct
24 Correct 59 ms 145276 KB Output is correct
25 Correct 68 ms 145248 KB Output is correct
26 Correct 61 ms 145316 KB Output is correct
27 Correct 57 ms 145208 KB Output is correct
28 Correct 64 ms 145220 KB Output is correct
29 Correct 67 ms 145300 KB Output is correct
30 Correct 58 ms 145180 KB Output is correct
31 Correct 63 ms 145216 KB Output is correct
32 Correct 65 ms 145288 KB Output is correct
33 Correct 58 ms 145192 KB Output is correct
34 Correct 64 ms 145288 KB Output is correct
35 Correct 60 ms 145184 KB Output is correct
36 Incorrect 711 ms 145284 KB Output isn't correct
37 Halted 0 ms 0 KB -