oj.uz

Submission #863755

# Submission time Handle Problem Language Result Execution time Memory
863755 2023-10-20T20:41:32 Z efedmrlr Snowball (JOI21_ho_t2) C++17
100 / 100
 76 ms 23500 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 = 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

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.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 456 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 25 ms 8900 KB Output is correct
21 Correct 24 ms 8652 KB Output is correct
22 Correct 23 ms 8656 KB Output is correct
23 Correct 21 ms 8504 KB Output is correct
24 Correct 25 ms 9416 KB Output is correct
25 Correct 70 ms 19904 KB Output is correct
26 Correct 72 ms 19944 KB Output is correct
27 Correct 69 ms 19432 KB Output is correct
28 Correct 69 ms 19392 KB Output is correct
29 Correct 68 ms 18632 KB Output is correct
30 Correct 65 ms 16912 KB Output is correct
31 Correct 64 ms 16208 KB Output is correct
32 Correct 52 ms 16468 KB Output is correct
33 Correct 7 ms 2396 KB Output is correct
34 Correct 69 ms 18804 KB Output is correct
35 Correct 65 ms 18256 KB Output is correct
36 Correct 70 ms 19904 KB Output is correct
37 Correct 71 ms 19388 KB Output is correct
38 Correct 76 ms 19548 KB Output is correct
39 Correct 72 ms 19648 KB Output is correct
40 Correct 71 ms 19612 KB Output is correct
41 Correct 25 ms 11180 KB Output is correct
42 Correct 59 ms 16468 KB Output is correct
43 Correct 62 ms 21496 KB Output is correct
44 Correct 23 ms 9548 KB Output is correct
45 Correct 68 ms 19684 KB Output is correct
46 Correct 64 ms 21696 KB Output is correct
47 Correct 65 ms 21440 KB Output is correct
48 Correct 68 ms 23500 KB Output is correct