제출 #1250485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250485		goulthen	Snowball (JOI21_ho_t2)	C++20	0 / 100	1 ms	328 KiB

Main

//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define int long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, b, a) for (int i = b; i >= a; --i)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define lsb(x) (x)&(-x)
#define bug(x) cerr << #x << " " << x << endl;
 
void setIO(string name = "") {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    if (!name.empty()) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
 
ll fexp(ll a, ll b, ll m) {
    if (b == 0) return 1LL;
    ll p = a;
    ll ans = 1;
    while (b > 0) {
        if (b % 2 != 0) ans = (ans * p) % m;
        p = (p * p) % m;
        b >>= 1;
    }
    return ans;
}
 
const int MAXN = 2e5 + 10;
const int INF = 1e18 + 5;
const int MOD = 1e9+7;
int a[MAXN], ml[MAXN], mr[MAXN], ans[MAXN], op[MAXN];

void solve() {
    int n,q;cin >> n >> q;
    rep(i,1,n) cin >> a[i];
    int cur = 0;
    rep(i,1,q) {
        cin >> op[i];
        cur+=op[i];
        ml[i]=max(ml[i-1],-cur);
        mr[i]=max(mr[i-1],cur);
    }

    rep(i,2,n) {
        int lo = 1, hi = q, anss=1;
        while (lo<=hi) {
            int mid = (lo+hi)/2;
            if (a[i]-a[i-1]<=ml[mid]+mr[mid]) {
                hi = mid-1;
            } else {
                lo = mid + 1;
                anss =mid;
            }
        }
        int k = a[i]-a[i-1];
        k-=ml[anss]+mr[anss];
        ans[i-1] += mr[anss];
        ans[i] += ml[anss];
        if (op[anss+1]>0) ans[i-1] += k;
        else if (op[anss+1]<0) ans[i] += k;
    }
    ans[1] += ml[q];
    ans[n] += mr[q];
    rep(i,1,n) cout << ans[i] << '\n';
}
 
int32_t main() {
    setIO();
    int tt = 1;
    //cin >> tt;
 
    while (tt-- > 0) solve();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

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

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