제출 #1277669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277669		icebear	Snowball (JOI21_ho_t2)	C++20	100 / 100	93 ms	8316 KiB

Main

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

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/** END OF TEMPLATE. ICEBEAR AND CAT WILL WIN VOI26 **/

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int n, q;
ll X[N], sumDelta[N], maxDelta[N], minDelta[N];

void init(void) {
    cin >> n >> q;
    FOR(i, 1, n) cin >> X[i];
}

void process(void) {
    X[0] = -INF;
    X[n+1] = INF;
    FOR(i, 1, q) {
        ll W; cin >> W;
        sumDelta[i] = sumDelta[i - 1] + W;
        minDelta[i] = min(minDelta[i - 1], sumDelta[i]);
        maxDelta[i] = max(maxDelta[i - 1], sumDelta[i]);
    }

    FOR(i, 1, n) {
        ll left = 0, right = 0;
        int low = 1, high = q, res = 0;
        while(low <= high) {
            int mid = (low + high) >> 1;
            if (X[i] + minDelta[mid] > X[i - 1] + maxDelta[mid]) res = mid, low = mid + 1;
            else high = mid - 1;
        }
        if (sumDelta[res + 1] < 0) left = X[i] - (X[i - 1] + maxDelta[res]);
        else left = -minDelta[res];

        low = 1, high = q, res = 0;
        while(low <= high) {
            int mid = (low + high) >> 1;
            if (X[i] + maxDelta[mid] < X[i + 1] + minDelta[mid]) res = mid, low = mid + 1;
            else high = mid - 1;
        }
        if (sumDelta[res + 1] > 0) right = (X[i + 1] + minDelta[res]) - X[i];
        else right = maxDelta[res];

        cout << left + right << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

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

Main.cpp: In function 'int main()':
Main.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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