Submission #876654

#	Time	Username	Problem	Language	Result	Execution time	Memory
876654		efedmrlr	Collecting Stamps 3 (JOI20_ho_t3)	C++17	100 / 100	55 ms	135720 KiB

ho_t3

#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 (stderr)

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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75