제출 #63822

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
63822		qkxwsm	금 캐기 (IZhO14_divide)	C++17	100 / 100	98 ms	38416 KiB

divide

/*
PROG: source
LANG: C++11
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
        int operator()(int x) const
        {
                x ^= (x >> 20) ^ (x >> 12);
                return x ^ (x >> 7) ^ (x >> 4);
        }
        int operator()(long long x) const
        {
                return x ^ (x >> 32);
        }
};

template<typename T> using orderedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
        {
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T normalize(T x, U mod = 1000000007)
{
	return (((x % mod) + mod) % mod);
}
long long randomizell(long long mod)
{
	return ((1ll << 45) * rand() + (1ll << 30) * rand() + (1ll << 15) * rand() + rand()) % mod;
}
int randomize(int mod)
{
	return ((1ll << 15) * rand() + rand()) % mod;
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 100013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> ppl;
typedef pair<ld, ld> pdd;

int N;
ll pos[MAXN];
ll energy[MAXN], gain[MAXN];
ll pref[MAXN];
ll arr[MAXN];
ll parr[MAXN];
ll stor[20][MAXN];
ll ans;

ll query(int L, int R)
{
        // ll res = -LLINF;
        // for (int i = L; i <= R; i++)
        // {
        //         ckmax(res, parr[i]);
        // }
        // return res;
        int lg = (31 - __builtin_clz(R - L + 1));
        return max(stor[lg][L], stor[lg][R - (1 << lg) + 1]);
}
int32_t main()
{
	ios_base::sync_with_stdio(0);
	srand(time(0));
	//	cout << fixed << setprecision(10);
	//	cerr << fixed << setprecision(10);
	if (fopen("input.in", "r"))
	{
		freopen ("input.in", "r", stdin);
		freopen ("output.out", "w", stdout);
	}
        cin >> N;
        for (int i = 0; i < N; i++)
        {
                cin >> pos[i] >> gain[i] >> energy[i];
                pref[i + 1] = pref[i] + gain[i];
                int x = energy[i];
                if (i)
                {
                        x -= (pos[i] - pos[i - 1]);
                }
                parr[i + 1] = parr[i] + x;
        }
        // for (int i = 0; i <= N; i++)
        // {
        //         cerr << parr[i] << ' ';
        // }
        // cerr << endl;
        for (int i = 0; i <= N; i++)
        {
                stor[0][i] = parr[i];
        }
        for (int i = 1; i < 20; i++)
        {
                for (int j = 0; j <= N; j++)
                {
                        if (j + (1 << i) > N + 1)
                        {
                                stor[i][j] = -LLINF;
                        }
                        else
                        {
                                stor[i][j] = max(stor[i - 1][j], stor[i - 1][j + (1 << (i - 1))]);
                        }
                }
        }
        for (int i = 0; i < N; i++)
        {
                int lo = i + 1, hi = N;
                while(hi > lo)
                {
                        int mid = (hi + lo + 1) / 2;
                        if (query(mid, N) - parr[i + 1] + (energy[i]) < 0)
                        {
                                hi = mid - 1;
                        }
                        else
                        {
                                lo = mid;
                        }
                }
                // cerr << i << ' ' << lo << endl;
                ckmax(ans, pref[lo] - pref[i]);
        }
        cout << ans << '\n';
        //<<pos, energy>, gain>

	//	cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}

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

divide.cpp: In function 'int32_t main()':
divide.cpp:172:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("input.in", "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
divide.cpp:173:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ("output.out", "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52