oj.uz

답안 #771599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771599 2023-07-03T07:12:36 Z Filya Snowball (JOI21_ho_t2) C++14
100 / 100
 116 ms 16976 KB 
//♥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 = 0, maxi = 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];
    fri(n-1) { //ira u hajordi baxumy
        ll l1 = 0, r1 = q-1, m, ans = -1;
        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;
        }
        if(ans == -1) {
            r[i] = pmax[q-1] + a[i];
        } else {
            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; 
        }
    }
    // print(pmin, q); print(pmax, q);
    frr(1, n) { //inqn u naxordy
        // dbg(i)
        ll l1 = 0, r1 = q-1, m, ans = -1;
        while(l1 <= r1) {
            m = (l1 + r1) / 2;
            mini = pmin[m] + a[i];
            maxi = pmax[m] + a[i-1];
            // dbg(m) dbg(mini) dbg(maxi)
            if(mini <= maxi) {
                ans = m;
                r1 = m-1;
            } else l1 = m + 1;
        }
        // dbg(ans)
        if(ans == -1) {
            l[i] = pmin[q-1] + a[i];
        } else {
            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;
}


/*
3 10
-31 -22 -5
-3
0
5
-4
-2
10
-13
-1
9
6


3 3
-31 -22 -5
-3
0
5
[-34 -25 -8 ]
[-29 -20 -3 ]
5
5
5
*/

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 468 KB Output is correct

Subtask #2
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 20 ms 5248 KB Output is correct
21 Correct 30 ms 5220 KB Output is correct
22 Correct 18 ms 5212 KB Output is correct
23 Correct 18 ms 5304 KB Output is correct
24 Correct 25 ms 5924 KB Output is correct
25 Correct 112 ms 15040 KB Output is correct
26 Correct 111 ms 14844 KB Output is correct
27 Correct 105 ms 14524 KB Output is correct
28 Correct 110 ms 14784 KB Output is correct
29 Correct 106 ms 14220 KB Output is correct
30 Correct 104 ms 13700 KB Output is correct
31 Correct 55 ms 13068 KB Output is correct
32 Correct 58 ms 13180 KB Output is correct
33 Correct 9 ms 1800 KB Output is correct
34 Correct 116 ms 15344 KB Output is correct
35 Correct 115 ms 14872 KB Output is correct
36 Correct 109 ms 15032 KB Output is correct
37 Correct 108 ms 14748 KB Output is correct
38 Correct 108 ms 14516 KB Output is correct
39 Correct 104 ms 14756 KB Output is correct
40 Correct 60 ms 14796 KB Output is correct
41 Correct 21 ms 7664 KB Output is correct
42 Correct 46 ms 13160 KB Output is correct
43 Correct 65 ms 16692 KB Output is correct
44 Correct 20 ms 7636 KB Output is correct
45 Correct 52 ms 14732 KB Output is correct
46 Correct 59 ms 16588 KB Output is correct
47 Correct 62 ms 16820 KB Output is correct
48 Correct 65 ms 16976 KB Output is correct