oj.uz

Submission #876654

# Submission time Handle Problem Language Result Execution time Memory
876654 2023-11-22T07:24:22 Z efedmrlr Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 55 ms 135720 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e15+500;
const int N = 205;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q,L;
vector<int> x,t; 
int dp[N][N][N][2];
int ccw_dist(int a, int b) {
    return L - abs(x[a] - x[b]);
}
int cw_dist(int a, int b) {
    return abs(x[a] - x[b]);
}
int dist(int a, int b, bool direct) {
    if(direct) {
        return cw_dist(a,b);
    }
    return ccw_dist(a,b);
}
inline void solve() {
    cin>>n>>L;
    x.resize(n+5); t.resize(n+5);
    REP(i,n) cin>>x[i + 1];
    REP(i,n) cin>>t[i + 1];
    x[0] = 0; x[n + 1] = 0;
    REP(i,N) REP(j,N) REP(k,N) REP(f,2){
        dp[i][j][k][f] = INF;
    }

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

                    int curt = dp[i][j][k][f];
                    if(curt == INF) continue;
                    int cur;
                    if(f) {
                        cur = i;
                    }
                    else {
                        cur = n - j + 1;
                    }
                    int nxt, nwt;
                    int nstamp = k;
                    //add cw
                    nxt = i + 1;
                    nwt = curt + dist(cur, nxt, f);
                    nstamp += (int)(nwt <= t[nxt]);
                    dp[i + 1][j][nstamp][1] = min(dp[i + 1][j][nstamp][1], nwt);
                    
                    //add ccw
                    nstamp = k;
                    nxt = n - j;
                    nwt = curt + dist(cur, nxt, !f);
                    nstamp += (int)(nwt <= t[nxt]);
                    dp[i][j + 1][nstamp][0] = min(dp[i][j + 1][nstamp][0], nwt);

                }
            }
        }
    }
    int ans = 0;
    for(int i = 0; i<=n; i++) {
        for(int j = 0; i + j <=n; j++) {
            for(int k = 1; k<=n; k++) {
                for(int f = 0; f<2; f++) {
                    if(dp[i][j][k][f] < INF) {
                        ans = max(ans , k);
                    }
                }
            }
        }
    }
    cout<<ans<<"\n";
}
 
signed main() {
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

ho_t3.cpp: In function 'std::string to_string(std::string, int, int)':
ho_t3.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
ho_t3.cpp: In function 'void solve()':
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:46:5: note: in expansion of macro 'REP'
   46 |     REP(i,n) cin>>x[i + 1];
      |     ^~~
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:47:5: note: in expansion of macro 'REP'
   47 |     REP(i,n) cin>>t[i + 1];
      |     ^~~
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:49:5: note: in expansion of macro 'REP'
   49 |     REP(i,N) REP(j,N) REP(k,N) REP(f,2){
      |     ^~~
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:49:14: note: in expansion of macro 'REP'
   49 |     REP(i,N) REP(j,N) REP(k,N) REP(f,2){
      |              ^~~
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:49:23: note: in expansion of macro 'REP'
   49 |     REP(i,N) REP(j,N) REP(k,N) REP(f,2){
      |                       ^~~
ho_t3.cpp:14:26: warning: unnecessary parentheses in declaration of 'f' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
ho_t3.cpp:49:32: note: in expansion of macro 'REP'
   49 |     REP(i,N) REP(j,N) REP(k,N) REP(f,2){
      |                                ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 135248 KB Output is correct
2 Correct 20 ms 135252 KB Output is correct
3 Correct 19 ms 135248 KB Output is correct
4 Correct 20 ms 135176 KB Output is correct
5 Correct 20 ms 135168 KB Output is correct
6 Correct 20 ms 135248 KB Output is correct
7 Correct 19 ms 135244 KB Output is correct
8 Correct 19 ms 135252 KB Output is correct
9 Correct 19 ms 135260 KB Output is correct
10 Correct 19 ms 135152 KB Output is correct
11 Correct 21 ms 135416 KB Output is correct
12 Correct 20 ms 135096 KB Output is correct
13 Correct 19 ms 135248 KB Output is correct
14 Correct 20 ms 135240 KB Output is correct
15 Correct 19 ms 135260 KB Output is correct
16 Correct 19 ms 135104 KB Output is correct
17 Correct 20 ms 135248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 135248 KB Output is correct
2 Correct 20 ms 135252 KB Output is correct
3 Correct 19 ms 135248 KB Output is correct
4 Correct 20 ms 135176 KB Output is correct
5 Correct 20 ms 135168 KB Output is correct
6 Correct 20 ms 135248 KB Output is correct
7 Correct 19 ms 135244 KB Output is correct
8 Correct 19 ms 135252 KB Output is correct
9 Correct 19 ms 135260 KB Output is correct
10 Correct 19 ms 135152 KB Output is correct
11 Correct 21 ms 135416 KB Output is correct
12 Correct 20 ms 135096 KB Output is correct
13 Correct 19 ms 135248 KB Output is correct
14 Correct 20 ms 135240 KB Output is correct
15 Correct 19 ms 135260 KB Output is correct
16 Correct 19 ms 135104 KB Output is correct
17 Correct 20 ms 135248 KB Output is correct
18 Correct 20 ms 135240 KB Output is correct
19 Correct 20 ms 135208 KB Output is correct
20 Correct 19 ms 135260 KB Output is correct
21 Correct 19 ms 135256 KB Output is correct
22 Correct 22 ms 135260 KB Output is correct
23 Correct 19 ms 135148 KB Output is correct
24 Correct 20 ms 135256 KB Output is correct
25 Correct 19 ms 135256 KB Output is correct
26 Correct 20 ms 135208 KB Output is correct
27 Correct 20 ms 135220 KB Output is correct
28 Correct 19 ms 135316 KB Output is correct
29 Correct 19 ms 135252 KB Output is correct
30 Correct 20 ms 135256 KB Output is correct
31 Correct 19 ms 135264 KB Output is correct
32 Correct 19 ms 135260 KB Output is correct
33 Correct 21 ms 135252 KB Output is correct
34 Correct 22 ms 135252 KB Output is correct
35 Correct 20 ms 135272 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 135248 KB Output is correct
2 Correct 20 ms 135252 KB Output is correct
3 Correct 19 ms 135248 KB Output is correct
4 Correct 20 ms 135176 KB Output is correct
5 Correct 20 ms 135168 KB Output is correct
6 Correct 20 ms 135248 KB Output is correct
7 Correct 19 ms 135244 KB Output is correct
8 Correct 19 ms 135252 KB Output is correct
9 Correct 19 ms 135260 KB Output is correct
10 Correct 19 ms 135152 KB Output is correct
11 Correct 21 ms 135416 KB Output is correct
12 Correct 20 ms 135096 KB Output is correct
13 Correct 19 ms 135248 KB Output is correct
14 Correct 20 ms 135240 KB Output is correct
15 Correct 19 ms 135260 KB Output is correct
16 Correct 19 ms 135104 KB Output is correct
17 Correct 20 ms 135248 KB Output is correct
18 Correct 44 ms 135256 KB Output is correct
19 Correct 34 ms 135252 KB Output is correct
20 Correct 28 ms 135192 KB Output is correct
21 Correct 32 ms 135260 KB Output is correct
22 Correct 37 ms 135720 KB Output is correct
23 Correct 24 ms 135256 KB Output is correct
24 Correct 22 ms 135248 KB Output is correct
25 Correct 26 ms 135248 KB Output is correct
26 Correct 20 ms 135248 KB Output is correct
27 Correct 25 ms 135168 KB Output is correct
28 Correct 21 ms 135260 KB Output is correct
29 Correct 24 ms 135188 KB Output is correct
30 Correct 24 ms 135504 KB Output is correct
31 Correct 23 ms 135248 KB Output is correct
32 Correct 21 ms 135260 KB Output is correct
33 Correct 23 ms 135284 KB Output is correct
34 Correct 20 ms 135252 KB Output is correct
35 Correct 22 ms 135172 KB Output is correct
36 Correct 21 ms 135252 KB Output is correct
37 Correct 23 ms 135248 KB Output is correct
38 Correct 24 ms 135256 KB Output is correct
39 Correct 25 ms 135256 KB Output is correct
40 Correct 21 ms 135260 KB Output is correct
41 Correct 51 ms 135172 KB Output is correct
42 Correct 30 ms 135248 KB Output is correct
43 Correct 52 ms 135312 KB Output is correct
44 Correct 31 ms 135260 KB Output is correct
45 Correct 54 ms 135260 KB Output is correct
46 Correct 31 ms 135260 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 135248 KB Output is correct
2 Correct 20 ms 135252 KB Output is correct
3 Correct 19 ms 135248 KB Output is correct
4 Correct 20 ms 135176 KB Output is correct
5 Correct 20 ms 135168 KB Output is correct
6 Correct 20 ms 135248 KB Output is correct
7 Correct 19 ms 135244 KB Output is correct
8 Correct 19 ms 135252 KB Output is correct
9 Correct 19 ms 135260 KB Output is correct
10 Correct 19 ms 135152 KB Output is correct
11 Correct 21 ms 135416 KB Output is correct
12 Correct 20 ms 135096 KB Output is correct
13 Correct 19 ms 135248 KB Output is correct
14 Correct 20 ms 135240 KB Output is correct
15 Correct 19 ms 135260 KB Output is correct
16 Correct 19 ms 135104 KB Output is correct
17 Correct 20 ms 135248 KB Output is correct
18 Correct 20 ms 135240 KB Output is correct
19 Correct 20 ms 135208 KB Output is correct
20 Correct 19 ms 135260 KB Output is correct
21 Correct 19 ms 135256 KB Output is correct
22 Correct 22 ms 135260 KB Output is correct
23 Correct 19 ms 135148 KB Output is correct
24 Correct 20 ms 135256 KB Output is correct
25 Correct 19 ms 135256 KB Output is correct
26 Correct 20 ms 135208 KB Output is correct
27 Correct 20 ms 135220 KB Output is correct
28 Correct 19 ms 135316 KB Output is correct
29 Correct 19 ms 135252 KB Output is correct
30 Correct 20 ms 135256 KB Output is correct
31 Correct 19 ms 135264 KB Output is correct
32 Correct 19 ms 135260 KB Output is correct
33 Correct 21 ms 135252 KB Output is correct
34 Correct 22 ms 135252 KB Output is correct
35 Correct 20 ms 135272 KB Output is correct
36 Correct 44 ms 135256 KB Output is correct
37 Correct 34 ms 135252 KB Output is correct
38 Correct 28 ms 135192 KB Output is correct
39 Correct 32 ms 135260 KB Output is correct
40 Correct 37 ms 135720 KB Output is correct
41 Correct 24 ms 135256 KB Output is correct
42 Correct 22 ms 135248 KB Output is correct
43 Correct 26 ms 135248 KB Output is correct
44 Correct 20 ms 135248 KB Output is correct
45 Correct 25 ms 135168 KB Output is correct
46 Correct 21 ms 135260 KB Output is correct
47 Correct 24 ms 135188 KB Output is correct
48 Correct 24 ms 135504 KB Output is correct
49 Correct 23 ms 135248 KB Output is correct
50 Correct 21 ms 135260 KB Output is correct
51 Correct 23 ms 135284 KB Output is correct
52 Correct 20 ms 135252 KB Output is correct
53 Correct 22 ms 135172 KB Output is correct
54 Correct 21 ms 135252 KB Output is correct
55 Correct 23 ms 135248 KB Output is correct
56 Correct 24 ms 135256 KB Output is correct
57 Correct 25 ms 135256 KB Output is correct
58 Correct 21 ms 135260 KB Output is correct
59 Correct 51 ms 135172 KB Output is correct
60 Correct 30 ms 135248 KB Output is correct
61 Correct 52 ms 135312 KB Output is correct
62 Correct 31 ms 135260 KB Output is correct
63 Correct 54 ms 135260 KB Output is correct
64 Correct 31 ms 135260 KB Output is correct
65 Correct 47 ms 135292 KB Output is correct
66 Correct 45 ms 135288 KB Output is correct
67 Correct 44 ms 135260 KB Output is correct
68 Correct 40 ms 135256 KB Output is correct
69 Correct 47 ms 135292 KB Output is correct
70 Correct 46 ms 135292 KB Output is correct
71 Correct 44 ms 135260 KB Output is correct
72 Correct 47 ms 135088 KB Output is correct
73 Correct 39 ms 135312 KB Output is correct
74 Correct 44 ms 135260 KB Output is correct
75 Correct 42 ms 135248 KB Output is correct
76 Correct 51 ms 135252 KB Output is correct
77 Correct 47 ms 135256 KB Output is correct
78 Correct 42 ms 135280 KB Output is correct
79 Correct 43 ms 135260 KB Output is correct
80 Correct 50 ms 135292 KB Output is correct
81 Correct 42 ms 135260 KB Output is correct
82 Correct 45 ms 135312 KB Output is correct
83 Correct 50 ms 135248 KB Output is correct
84 Correct 42 ms 135256 KB Output is correct
85 Correct 43 ms 135260 KB Output is correct
86 Correct 45 ms 135260 KB Output is correct
87 Correct 43 ms 135256 KB Output is correct
88 Correct 55 ms 135260 KB Output is correct
89 Correct 55 ms 135124 KB Output is correct
90 Correct 33 ms 135504 KB Output is correct
91 Correct 55 ms 135248 KB Output is correct
92 Correct 53 ms 135252 KB Output is correct
93 Correct 35 ms 135256 KB Output is correct