結果
| 問題 | No.2465 Dilated Water Simulation |
| ユーザー |
 hitonanode
|
| 提出日時 | 2023-09-08 23:19:22 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,452 bytes |
| コンパイル時間 | 2,548 ms |
| コンパイル使用メモリ | 195,972 KB |
| 実行使用メモリ | 11,444 KB |
| 最終ジャッジ日時 | 2024-06-26 16:43:20 |
| 合計ジャッジ時間 | 5,330 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | AC | 2 ms
5,376 KB |
| testcase_02 | AC | 2 ms
5,376 KB |
| testcase_03 | AC | 2 ms
5,376 KB |
| testcase_04 | WA | - |
| testcase_05 | AC | 45 ms
11,260 KB |
| testcase_06 | WA | - |
| testcase_07 | AC | 44 ms
11,196 KB |
| testcase_08 | WA | - |
| testcase_09 | AC | 45 ms
11,264 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 43 ms
11,136 KB |
| testcase_12 | WA | - |
| testcase_13 | AC | 44 ms
11,196 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | AC | 44 ms
11,236 KB |
| testcase_17 | WA | - |
| testcase_18 | AC | 43 ms
11,196 KB |
| testcase_19 | WA | - |
| testcase_20 | AC | 57 ms
11,260 KB |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif
#include <atcoder/segtree>
using S = pint;
S op(S l, S r) { return min(l, r); }
S e() { return {(1 << 30) - 1, -1}; }
struct rand_int_ {
using lint = long long;
std::mt19937 mt;
rand_int_() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
lint operator()(lint l, lint r) {
std::uniform_int_distribution<lint> d(l, r - 1);
return d(mt);
}
} rnd;
vector<int> simulate(const vector<int> &V, vector<int> state, lint T) {
const int N = V.size();
int from = 0, to = 1;
for (lint t = 0; t < T; ++t) {
int cap = min(state.at(from), V.at(to) - state.at(to));
if (t <= 100) dbg(make_tuple(state, t, cap));
state.at(from) -= cap;
state.at(to) += cap;
++from, ++to;
if (from == N) from = 0;
if (to == N) to = 0;
}
return state;
}
vector<int> solve(const vector<int> &V, lint T) {
const int N = V.size();
const int h0 = *min_element(ALL(V));
const int argmin = std::find(ALL(V), h0) - V.begin();
vector<pint> hi;
REP(i, N) hi.emplace_back(V.at(i), i);
atcoder::segtree<S, op, e> seg(hi);
dbg(h0);
dbg(hi);
vector<int> ret(N);
ret.at(T % N) += h0;
const lint nloop = T / N;
auto subsolve = [&](auto &&self, int l, int r, int reduced, int initval) -> void {
if (l >= r) return;
dbg(make_tuple(l, r, reduced, initval, nloop));
auto [hlo, ilo] = seg.prod(l, r);
lint area = hlo - reduced;
if (__int128(area) * nloop >= initval) {
lint rem = initval;
dbg(make_tuple(rem, V, reduced, l, r));
IFOR(i, l, r) {
lint supply = min<lint>(rem, V.at(i) - reduced);
ret.at(i) += supply;
rem -= supply;
if (!rem) break;
}
dbg(rem);
} else {
lint rem = initval;
lint used = 0;
IFOR(i, l + 1, r) {
const lint a = seg.prod(l, i).first - reduced;
__int128 ub = a * nloop;
if (ub > initval) ub = initval;
lint can_use = std::min<__int128>(ub - used, V.at(i) - reduced);
used += can_use;
rem -= can_use;
ret.at(i) += can_use;
}
ret.at(l) += rem;
}
};
// [0, argmin)
{
subsolve(subsolve, 0, argmin, h0, V.at(0) - h0);
}
dbg(ret);
return simulate(V, ret, T % N);
}
int main() {
map<unsigned long long, lint> memo;
int N;
lint T;
cin >> N;
vector<int> V(N);
cin >> V >> T;
dbg(V);
auto state = solve(V, T);
// assert(T <= 6e8);
// vector<int> state(N);
// vector<unsigned long long> hashw(N);
// for (auto &v : hashw) v = rnd(1LL << 61);
// unsigned long long current = hashw.at(0) * (unsigned)state.at(0);
// memo[current] = 0;
// state.at(0) = V.at(0);
// int from = 0, to = 1;
// for (lint t = 0; t < T; ++t) {
// int cap = min(state.at(from), V.at(to) - state.at(to));
// if (t <= 100) dbg(make_tuple(state, t, cap));
// state.at(from) -= cap;
// state.at(to) += cap;
// current += (hashw.at(to) - hashw.at(from)) * (unsigned)cap;
// ++from, ++to;
// if (from == N) from = 0;
// if (to == N) to = 0;
// if (T - t > 100 and memo.count(current)) {
// const lint loop = t + 1 - memo[current];
// dbg(make_tuple(T, t, loop));
// lint rem = (T - t - 10) / loop;
// t += rem * loop;
// } else {
// memo[current] = t + 1;
// }
// }
for (auto x : state) cout << x << ' ';
cout << '\n';
}