Submission #863755

#	Time	Username	Problem	Language	Result	Execution time	Memory
863755		efedmrlr	Snowball (JOI21_ho_t2)	C++17	100 / 100	76 ms	23500 KiB

Main

#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 = 1e17+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<int> x, w;
vector<int> lcost, rcost;
vector<int> lmax, rmax;
vector<array<int,2> > inter;

inline void solve() {
    cin >> n >> q;
    x.resize(n);
    w.resize(q);
    for(int i = 0; i<n; i++) cin>>x[i];
    for(int i = 0; i<q; i++) cin>>w[i];
    lcost.resize(n);
    rcost.resize(n);
    lmax.resize(q);
    rmax.resize(q);
    if(w[0] > 0) {
        lmax[0] = 0;
        rmax[0] = abs(w[0]);
    }
    else {
        lmax[0] = abs(w[0]);
        rmax[0] = 0;
    }
    int cur = w[0];
    for(int i = 1; i<q; i++) {
        cur += w[i];
        lmax[i] = max(lmax[i - 1], -cur);
        rmax[i] = max(rmax[i - 1], cur);
    }

    inter.resize(n-1);
    for(int i = 0; i<n-1; i++) {
        inter[i] = {x[i + 1] - x[i], i};
    }
    sort(inter.begin(), inter.end());
    int last = 0;
    vector<int> tmpl, tmpr;
    tmpl.pb(lmax[0]);
    tmpr.pb(rmax[0]);
    for(int i = 1; i<q; i++) {
        if(tmpl.back() == lmax[i]) {
            if(tmpr.back() > rmax[i]) {
                tmpr.pop_back(); tmpl.pop_back();
                tmpr.pb(rmax[i]); tmpl.pb(lmax[i]);
            }
        }
        else {
            tmpl.pb(lmax[i]); tmpr.pb(rmax[i]);
        }
    }
    for(int i = 0; i<n-1; i++) {
        while(last + 1 < tmpl.size() && max(0ll, min(tmpl[last] , inter[i][0] - tmpr[last]) ) < max(0ll, min(tmpl[last + 1], inter[i][0] - tmpr[last + 1]) ) ) {
            last++;
        }
        lcost[inter[i][1] + 1] = max(0ll, min(tmpl[last] , inter[i][0] - tmpr[last]) );
    }

    tmpl.clear(); tmpr.clear();
    tmpl.pb(lmax[0]);
    tmpr.pb(rmax[0]);
    for(int i = 1; i<q; i++) {
        if(tmpr.back() == rmax[i]) {
            if(tmpl.back() > lmax[i]) {
                tmpr.pop_back(); tmpl.pop_back();
                tmpr.pb(rmax[i]); tmpl.pb(lmax[i]);
            }
        }
        else {
            tmpl.pb(lmax[i]); tmpr.pb(rmax[i]);
        }
    }

    last = 0;
    for(int i = 0; i<n-1; i++) {
        while(last + 1 < tmpl.size() && max(0ll, min(tmpr[last] , inter[i][0] - tmpl[last]) ) < max(0ll, min(tmpr[last + 1], inter[i][0] - tmpl[last + 1]) ) ) {
            last++;
        }
        rcost[inter[i][1]] = max(0ll, min(tmpr[last] , inter[i][0] - tmpl[last]) );
    }
    lcost[0] = lmax[q - 1];
    rcost[n-1] = rmax[q - 1];
    for(int i = 0; i<n; i++) {
        cout<<lcost[i] + rcost[i]<<"\n";
    }
}   
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message (stderr)

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.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...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:81:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         while(last + 1 < tmpl.size() && max(0ll, min(tmpl[last] , inter[i][0] - tmpr[last]) ) < max(0ll, min(tmpl[last + 1], inter[i][0] - tmpr[last + 1]) ) ) {
      |               ~~~~~~~~~^~~~~~~~~~~~~
Main.cpp:104:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |         while(last + 1 < tmpl.size() && max(0ll, min(tmpr[last] , inter[i][0] - tmpl[last]) ) < max(0ll, min(tmpr[last + 1], inter[i][0] - tmpl[last + 1]) ) ) {
      |               ~~~~~~~~~^~~~~~~~~~~~~

• Subtask 1: 33 / 33
• Subtask 2: 67 / 67