제출 #546902

#제출 시각아이디문제언어결과실행 시간메모리
546902BungmintHacker (BOI15_hac)C++17
0 / 100
1 ms340 KiB
//Copyright © 2022 Youngmin Park. All rights reserved. //#pragma GCC optimize("O3") //#pragma GCC target("avx2") #include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using pii = pair<int, int>; using vpi = vector<pii>; using pll = pair<ll, ll>; using vl = vector<ll>; using vpl = vector<pll>; using ld = long double; template <typename T, size_t SZ> using ar = array<T, SZ>; #define all(v) (v).begin(), (v).end() #define pb push_back #define sz(x) (int)(x).size() #define fi first #define se second #define lb lower_bound #define ub upper_bound #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define F0R(i, a) FOR(i, 0, a) #define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i) #define R0F(i, a) ROF(i, 0, a) #define REP(a) F0R(_, a) const int INF = 1e9; const ll LINF = 1e18; const int MOD = 1e9 + 7; //998244353; const ld PI = acos((ld)-1.0); const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template <typename T> using pqg = priority_queue<T, vector<T>, greater<T>>; template <typename T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; } template <typename T> bool ckmax(T &a, const T &b) { return b > a ? a = b, 1 : 0; } template <typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; } template <typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream &operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; } void dbg_out() { cerr << endl; } template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); } #ifdef LOCAL #define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__) #else #define dbg(...) 42 #endif inline namespace RecursiveLambda{ template <typename Fun> struct y_combinator_result{ Fun fun_; template <typename T> explicit y_combinator_result(T &&fun): fun_(forward<T>(fun)){} template <typename...Args> decltype(auto) operator()(Args &&...args){ return fun_(ref(*this), forward<Args>(args)...); } }; template <typename Fun> decltype(auto) y_combinator(Fun &&fun){ return y_combinator_result<decay_t<Fun>>(forward<Fun>(fun)); } }; void setIO(string s) // USACO { #ifndef LOCAL freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); #endif } const int N = 5e5 + 100; int a[2 * N]; int pref[2 * N]; deque<int> q; int n, B; int ans{0}; int calc(int i, int j) { return pref[j] - pref[i - 1]; }; void add(int i) { int z = calc(i, i + B - 1); dbg(i, z); while (sz(q) && calc(q.back(), q.back() + B - 1) > z) q.pop_back(); q.push_back(i); } void remove(int i) { while (sz(q) && q.front() <= i) q.pop_back(); } void chk() { ckmax(ans, calc(q.front(), q.front() + B - 1)); } void solve() { cin >> n; FOR(i, 1, n + 1) cin >> a[i]; FOR(i, n + 1, 2 * n + 1) a[i] = a[i - n]; FOR(i, 1, 2 * n + 1) pref[i] = pref[i - 1] + a[i]; B = (n + 1) / 2; FOR(i, 1, B + 1) { add(i); } chk(); FOR(i, B + 1, n + B) { remove(i - B); add(i); chk(); } cout << ans << "\n"; } int main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); int testcase=1; // cin >> testcase; while (testcase--) { solve(); } }

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

hac.cpp: In function 'void add(int)':
hac.cpp:71:18: warning: statement has no effect [-Wunused-value]
   71 | #define dbg(...) 42
      |                  ^~
hac.cpp:111:2: note: in expansion of macro 'dbg'
  111 |  dbg(i, z);
      |  ^~~
hac.cpp: In function 'void setIO(std::string)':
hac.cpp:94:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hac.cpp:95:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...