# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863662 | 2023-10-20T16:48:57 Z | efedmrlr | Snowball (JOI21_ho_t2) | C++17 | 1 ms | 604 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<array<int,2> > inter; vector<int> lcost, rcost; int is_same_sign(int a, int b) { if(a == 0ll || b == 0ll) return 0; if((a > 0ll) == (b > 0ll)) return 1; return -1; } inline void solve() { cin >> n >> q; x.resize(n+1); w.resize(q+1); for(int i = 0; i<n; i++) cin>>x[i]; for(int i = 0; i<q; i++) cin>>w[i]; vector<int> tmp; tmp.pb(w[0]); for(int i = 1; i<q; i++) { if(is_same_sign(tmp.back(), w[i]) > 0ll) { tmp[tmp.size() - 1] += w[i]; } else if(w[i] == 0ll) {} else { tmp.pb(w[i]); } } swap(tmp, w); q = w.size(); tmp.clear(); int cur = w[0]; tmp.pb(cur); for(int i = 1; i<q; i++) { cur += w[i]; if(is_same_sign(tmp.back(), cur) > 0ll) { if(abs(tmp.back()) < abs(cur)) { tmp.pop_back(); tmp.pb(cur); } } else if(cur == 0ll) { } else { if(!(tmp.size() > 1 && abs(tmp[tmp.size() - 2]) > abs(cur) ) ) { tmp.pb(cur); } } } swap(tmp, w); q = w.size(); if(n == 1) { int ans = abs(w[q - 1]); ans += (q > 1) ? abs(w[q - 2]) : 0; cout<<ans<<"\n"; return; } inter.resize(n-1); for(int i = 1; i<n; i++) { inter[i-1] = {x[i] - x[i - 1], i - 1}; } sort(inter.begin(), inter.end()); lcost.resize(n), rcost.resize(n); if(w.back() < 0) { lcost[0] = abs(w.back()); } else if(w.size() > 1){ lcost[0] = abs(w[q - 2]); } else { lcost[0] = 0; } if(w.back() > 0) { rcost[n-1] = abs(w.back()); } else if(w.size() > 1){ rcost[n-1] = abs(w[q - 2]); } else { rcost[n-1] = 0; } cur = 2; int lastl = 0; int lastr = abs(w[0]); for(int i = 0; i<n-1; i++) { while(w.size() > cur && min(abs(w[cur]), inter[i][0] - abs(w[cur - 1]) ) > min(lastr, inter[i][0] - lastl) ) { lastl = abs(w[cur - 1]); lastr = abs(w[cur]); cur+=2; } if(w[0] > 0){ rcost[inter[i][1]] = min(lastr, inter[i][0] - lastl); } else { lcost[inter[i][1] + 1] = min(lastr, inter[i][0] - lastl); } } cur = 1; lastl = 0; lastr = 0; for(int i = 0; i<n-1; i++) { while(w.size() > cur && min(abs(w[cur]), inter[i][0] - abs(w[cur - 1]) ) > min(lastr, inter[i][0] - lastl) ) { lastl = abs(w[cur - 1]); lastr = abs(w[cur]); cur+=2; } if(w[0] < 0){ rcost[inter[i][1]] = min(lastr, inter[i][0] - lastl); } else { lcost[inter[i][1] + 1] = min(lastr, inter[i][0] - lastl); } } for(int i = 0; i < n; i++) { cout<<lcost[i] + rcost[i]<<" "; } cout<<"\n"; } signed main() { fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 472 KB | Output is correct |
5 | Correct | 1 ms | 604 KB | Output is correct |
6 | Incorrect | 1 ms | 604 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 472 KB | Output is correct |
5 | Correct | 1 ms | 604 KB | Output is correct |
6 | Incorrect | 1 ms | 604 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |