oj.uz

Submission #51956

# Submission time Handle Problem Language Result Execution time Memory
51956 2018-06-22T17:52:58 Z mareksom Hacker (BOI15_hac) C++17
100 / 100
 108 ms 31328 KB 
#ifndef LOCAL
#pragma GCC optimize ("O3")
#endif

#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, int b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

struct Kol {
  list<int> kol;

  void Add(int val) {
    while (!kol.empty() and kol.back() > val) {
      kol.pop_back();
    }
    kol.push_back(val);
  }

  void Remove(int val) {
    assert(!kol.empty());
    if (kol.front() == val) {
      kol.pop_front();
    }
  }

  int Smallest() const {
    assert(!kol.empty());
    return kol.front();
  }
};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> v(n);
  for (int& x : v) cin >> x;
  vector<int> sum(n);
  int suma = 0;
  const int k = (n + 1) / 2;
  for (int i = 0; i < k; i++) {
    suma += v[i];
  }
  for (int i = 0; i < n; i++) {
    sum[i] = suma;
    suma += v[(i + k) % n] - v[i];
  }
  debug() << imie(sum);
  Kol kol;
  for (int i = 0; i < k; i++) {
    kol.Add(sum[i]);
  }
  int wyn = 0;
  for (int i = 0; i < n; i++) {
    Maxi(wyn, kol.Smallest());
    kol.Add(sum[(i + k) % n]);
    kol.Remove(sum[i]);
  }
  cout << wyn << endl;
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 828 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 828 KB Output is correct
19 Correct 2 ms 828 KB Output is correct
20 Correct 3 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 3 ms 828 KB Output is correct
23 Correct 3 ms 828 KB Output is correct
24 Correct 3 ms 828 KB Output is correct
25 Correct 4 ms 960 KB Output is correct
26 Correct 3 ms 1168 KB Output is correct
27 Correct 3 ms 1168 KB Output is correct
28 Correct 2 ms 1168 KB Output is correct
29 Correct 3 ms 1168 KB Output is correct
30 Correct 3 ms 1168 KB Output is correct
31 Correct 3 ms 1168 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1168 KB Output is correct
2 Correct 2 ms 1168 KB Output is correct
3 Correct 3 ms 1168 KB Output is correct
4 Correct 19 ms 1956 KB Output is correct
5 Correct 42 ms 3712 KB Output is correct
6 Correct 51 ms 5240 KB Output is correct
7 Correct 59 ms 6968 KB Output is correct
8 Correct 99 ms 10768 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 2 ms 672 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 2 ms 768 KB Output is correct
18 Correct 2 ms 828 KB Output is correct
19 Correct 2 ms 828 KB Output is correct
20 Correct 3 ms 828 KB Output is correct
21 Correct 2 ms 828 KB Output is correct
22 Correct 3 ms 828 KB Output is correct
23 Correct 3 ms 828 KB Output is correct
24 Correct 3 ms 828 KB Output is correct
25 Correct 4 ms 960 KB Output is correct
26 Correct 3 ms 1168 KB Output is correct
27 Correct 3 ms 1168 KB Output is correct
28 Correct 2 ms 1168 KB Output is correct
29 Correct 3 ms 1168 KB Output is correct
30 Correct 3 ms 1168 KB Output is correct
31 Correct 3 ms 1168 KB Output is correct
32 Correct 2 ms 1168 KB Output is correct
33 Correct 2 ms 1168 KB Output is correct
34 Correct 3 ms 1168 KB Output is correct
35 Correct 19 ms 1956 KB Output is correct
36 Correct 42 ms 3712 KB Output is correct
37 Correct 51 ms 5240 KB Output is correct
38 Correct 59 ms 6968 KB Output is correct
39 Correct 99 ms 10768 KB Output is correct
40 Correct 6 ms 10768 KB Output is correct
41 Correct 8 ms 10768 KB Output is correct
42 Correct 9 ms 10768 KB Output is correct
43 Correct 40 ms 10768 KB Output is correct
44 Correct 97 ms 14196 KB Output is correct
45 Correct 21 ms 14196 KB Output is correct
46 Correct 61 ms 14196 KB Output is correct
47 Correct 108 ms 17904 KB Output is correct
48 Correct 104 ms 28056 KB Output is correct
49 Correct 90 ms 29836 KB Output is correct
50 Correct 105 ms 31328 KB Output is correct