Submission #771588

#	Time	Username	Problem	Language	Result	Execution time	Memory
771588		Filya	Snowball (JOI21_ho_t2)	C++14	0 / 100	1 ms	512 KiB

Main

//♥God will make a way♥
 
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////de/////////////////////
ll a[300005], b[300005], l[300005], r[300005], pmax[300005], pmin[300005];
int main() {
    fastio;
    int n, q; cin >> n >> q;
    fra(n) frb(q) 
    ll pref = 0, mini = b[0], maxi = b[0];
    fri(q) {
        pref += b[i];
        mini = min(mini, pref);
        maxi = max(maxi, pref);
        pmin[i] = mini, pmax[i] = maxi;
    }
    r[n-1] = maxi + a[n-1];
    l[0] = mini + a[0];
    // print(pmin, q); print(pmax, q);
    fri(n-1) { //ira u hajordi baxumy
        ll l1 = 0, r1 = q-1, m, ans;
        while(l1 <= r1) {
            m = (l1 + r1) / 2;
            mini = pmin[m] + a[i+1];
            maxi = pmax[m] + a[i];
            if(mini <= maxi) {
                ans = m;
                r1 = m-1;
            } else l1 = m+1;
        }
        mini = pmin[ans] + a[i+1];
        maxi = pmax[ans] + a[i];
        if(b[ans] > 0) { //1in baxvelu vaxt menq enq aj gnacel => minin enq
            r[i] = mini; 
        } else r[i] = maxi; 
    }
    frr(1, n) { //inqn u naxordy
        ll l1 = 0, r1 = q-1, m, ans;
        while(l1 <= r1) {
            m = (l1 + r1) / 2;
            mini = pmin[m] + a[i];
            maxi = pmax[m] + a[i-1];
            if(mini <= maxi) {
                ans = m;
                r1 = m-1;
            } else l1 = m + 1;
        }
        mini = pmin[ans] + a[i];
        maxi = pmax[ans] + a[i-1];
        if(b[ans] > 0) { //1in baxvelu vaxt menq enq aj gnacel => minin enq
            l[i] = mini; 
        } else l[i] = maxi; 
    }
    // print(l, n); print(r, n);
    fri(n) cout << r[i] - l[i] << '\n';
    return 0;
}


/*
[-4 1 5 7 ]
[1 5 7 13 ]
5
4
2
6
*/

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:134:17: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  134 |         if(b[ans] > 0) { //1in baxvelu vaxt menq enq aj gnacel => minin enq
      |            ~~~~~^
Main.cpp:117:17: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  117 |         if(b[ans] > 0) { //1in baxvelu vaxt menq enq aj gnacel => minin enq
      |            ~~~~~^

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