제출 #1091635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1091635		marvinthang	Fish 3 (JOI24_fish3)	C++17	100 / 100	231 ms	36068 KiB

Main

/*************************************
*    author: marvinthang             *
*    created: 21.03.2024 16:51:45    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// index from 0
template <class T> struct Fenwick {
    int n; vector <T> bit;
    Fenwick(int _n = 0): n(_n), bit(n + 1, 0) {}
    void reset(void) { fill(bit.begin(), bit.end(), 0); }
    void resize(int _n) { n = _n; bit.assign(n + 1, 0); }
    void update(int i, T val) { for (++i; i <= n; i += i & -i) bit[i] += val; }
    T get(int i) {
        if (i < 0) return 0;
        T res(0);
        for (i = min(i + 1, n); i > 0; i &= i - 1) res += bit[i];
        return res;
    }
    int upper_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i) 
            if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
    int lower_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i)
            if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
};

// end of template

void process(void) {
	int n; long long d; cin >> n >> d;
	vector <long long> c(n); cin >> c;
	vector <vector <pair <int, int>>> queriesAt(n);
	int q; cin >> q;
	REP(i, q) {
		int l, r; cin >> l >> r; --l; --r;
		queriesAt[r].emplace_back(l, i);
	}
	vector <long long> res(q, -1);
	Fenwick <long long> bit_const(n), bit_idx(n);
	auto update = [&] (int i, long long val) {
		bit_const.update(i, (1 - i) * val);
		bit_idx.update(i, val);
	};
	auto get = [&] (int i) {
		return bit_const.get(i) + bit_idx.get(i) * i;
	};
	REP(i, n) bit_const.update(i, c[i]);
	partial_sum(ALL(c), c.begin());
	vector <int> last{-1};
	REP(r, n) {
		while ((int) last.size() > 1) {
			int i = last.back();
			long long val0 = get(i);
			long long val1 = val0 - get(i - 1);
			long long val2 = get(i + 1) - val0;
			if (val1 > val2) {
				if (val2 >= val1 % d) {
					last.pop_back();
					long long del = (val1 / d - (val2 - val1 % d) / d) * d;
					int j = last.back() + 1;
					update(j, -del);
					update(i + 1, del);
					if (get(j) - get(j - 1) < 0) {
						last.clear();
						while (get(j + 1) - get(j) < 0) ++j;
						last.push_back(j);
					}
				} else {
					last.clear();
					last.push_back(i);
				}
			} else break;
		}
		last.push_back(r);
		for (auto [l, i]: queriesAt[r]) if (l > last[0]) 
			res[i] = (c[r] - (l ? c[l - 1] : 0) - get(r) + get(l - 1)) / d;
	}
	for (auto x: res) cout << x << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("fish3");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

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

Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:126:2: note: in expansion of macro 'file'
  126 |  file("fish3");
      |  ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:126:2: note: in expansion of macro 'file'
  126 |  file("fish3");
      |  ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36