Submission #1337208

#	Time	Username	Problem	Language	Result	Execution time	Memory
1337208		retarde	Snowball (JOI21_ho_t2)	C++20	0 / 100	1 ms	348 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

inline void solve() {
    int n, q;
    cin >> n >> q;
    vi a(n + 2); for (int i = 1; i <= n; i++) cin >> a[i];
    a[0] = -1e18; a[n + 1] = 1e18;
    vi qs(q); cin >> qs[0];
    for (int i = 1; i < q; i++) {
        cin >> qs[i];
        qs[i] += qs[i - 1];
    }

    vi pos(n + 1), neg(n + 1);
    for (int i = 1; i <= q; i++) {
        pos[i] = pos[i - 1]; neg[i] = neg[i - 1];
        if (qs[i - 1] >= 0) pos[i] = max(pos[i - 1], qs[i - 1]);
        if (qs[i - 1] <= 0) neg[i] = max(neg[i - 1], -qs[i - 1]);
    }

    vi ans(n + 2);
    for (int i = 0; i <= n; i++) {
        // i and i + 1
        int d = a[i + 1] - a[i];
        int lo = 0; int hi = q;
        while (hi > lo + 1) {
            int mid = (lo + hi) / 2;
            if (pos[mid]+neg[mid] >= d) hi = mid;
            else lo = mid;
        }
        if (pos[hi]+neg[hi]<=d) {
            ans[i]+=pos[hi];
            ans[i+1]+=neg[hi];
        } else {
            assert(qs[hi - 1] != 0);
            if (qs[hi - 1] < 0) {
                ans[i] += pos[hi - 1];
                ans[i + 1] += (d - pos[hi - 1]);
            } else {
                ans[i + 1] += neg[hi - 1];
                ans[i] += (d - neg[hi - 1]);
            }
        }
    }

    for (int i = 1; i <= n; i++) cout << ans[i] << "\n";
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:81:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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