oj.uz

Submission #345357

# Submission time Handle Problem Language Result Execution time Memory
345357 2021-01-07T07:57:21 Z mohamedsobhi777 Hacker (BOI15_hac) C++14
100 / 100
 882 ms 190796 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")

using namespace std;
using namespace __gnu_pbds;

#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int, int>>
#define vvi vector<vi>
#define vvii vector<vii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
#define f first
#define s second
#define sz(_) ((int)_.size())
#define all(_) _.begin(), _.end()
#define uni(_) unique(_)
#define lb lower_bound
#define ub upper_bound
#define si set<int>
#define ms multiset<int>
#define qi queue<int>
#define pq prioriry_queue<int>
#define mi map<int, int>
#define inc(i, l, r) for (int i = l; i <= r; i++)
#define dec(i, l, r) for (int i = l; i >= r; i--)

using lll = __int128;
using ll = long long;
using ld = long double;

const int N = 1e6 + 7;
const ll mod = 1e9 + 7;
const ll inf = 2e18;

auto ra = [] {char *p = new char ; delete p ; return ll(p) ; };
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count() * (ra() | 1));
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> os;

__int128 read()
{
       __int128 x = 0, f = 1;
       char ch = getchar();
       while (ch < '0' || ch > '9')
       {
              if (ch == '-')
                     f = -1;
              ch = getchar();
       }
       while (ch >= '0' && ch <= '9')
       {
              x = x * 10 + ch - '0';
              ch = getchar();
       }
       return x * f;
}
void print(__int128 x)
{
       if (x < 0)
       {
              putchar('-');
              x = -x;
       }
       if (x > 9)
              print(x / 10);
       putchar(x % 10 + '0');
}
bool cmp(__int128 x, __int128 y) { return x > y; }

int n;

multiset<ll> add[N], rem[N];

int main()
{
       ios_base::sync_with_stdio(0);
       cin.tie(0);

       cin >> n;
       vll a(n);
       for (auto &u : a)
              cin >> u;
       ll ans = 0;
       int t = (n + 1) / 2;
       for (int i = 0; i < n; ++i)
              a.pb(a[i]);
       for (int i = 1; i < 2 * n; ++i)
              a[i] += a[i - 1];
       auto get = [&](int l, int r) -> ll {
              return a[r] - (l ? a[l - 1] : 0);
       };
       vll dp(n, 1e18);
       for (int i = t - 1; i < 2 * n; ++i)
       {
              add[i - t + 1].insert(get(i - t + 1, i));
              rem[i + 1].insert(get(i - t + 1, i));
       }
       multiset<ll> mul;
       for (int i = 0; i < 2 * n; ++i)
       {
              for (auto u : add[i])
                     mul.insert(u);
              for (auto u : rem[i])
                     mul.erase(mul.find(u));
              if (sz(mul))
                     dp[i % n] = min(dp[i % n], *(mul.begin()));
       }
       cout << *max_element(all(dp));
       return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:93:11: warning: unused variable 'ans' [-Wunused-variable]
   93 |        ll ans = 0;
      |           ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 94316 KB Output is correct
2 Correct 63 ms 94316 KB Output is correct
3 Correct 95 ms 94316 KB Output is correct
4 Correct 64 ms 94444 KB Output is correct
5 Correct 74 ms 94448 KB Output is correct
6 Correct 63 ms 94316 KB Output is correct
7 Correct 68 ms 94316 KB Output is correct
8 Correct 69 ms 94316 KB Output is correct
9 Correct 69 ms 94316 KB Output is correct
10 Correct 73 ms 94316 KB Output is correct
11 Correct 67 ms 94292 KB Output is correct
12 Correct 63 ms 94316 KB Output is correct
13 Correct 68 ms 94316 KB Output is correct
14 Correct 77 ms 94248 KB Output is correct
15 Correct 67 ms 94320 KB Output is correct
16 Correct 67 ms 94320 KB Output is correct
17 Correct 63 ms 94316 KB Output is correct
18 Correct 65 ms 94316 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 94316 KB Output is correct
2 Correct 63 ms 94316 KB Output is correct
3 Correct 95 ms 94316 KB Output is correct
4 Correct 64 ms 94444 KB Output is correct
5 Correct 74 ms 94448 KB Output is correct
6 Correct 63 ms 94316 KB Output is correct
7 Correct 68 ms 94316 KB Output is correct
8 Correct 69 ms 94316 KB Output is correct
9 Correct 69 ms 94316 KB Output is correct
10 Correct 73 ms 94316 KB Output is correct
11 Correct 67 ms 94292 KB Output is correct
12 Correct 63 ms 94316 KB Output is correct
13 Correct 68 ms 94316 KB Output is correct
14 Correct 77 ms 94248 KB Output is correct
15 Correct 67 ms 94320 KB Output is correct
16 Correct 67 ms 94320 KB Output is correct
17 Correct 63 ms 94316 KB Output is correct
18 Correct 65 ms 94316 KB Output is correct
19 Correct 90 ms 94380 KB Output is correct
20 Correct 60 ms 94444 KB Output is correct
21 Correct 83 ms 94444 KB Output is correct
22 Correct 95 ms 94828 KB Output is correct
23 Correct 115 ms 95212 KB Output is correct
24 Correct 70 ms 94828 KB Output is correct
25 Correct 66 ms 95212 KB Output is correct
26 Correct 78 ms 95212 KB Output is correct
27 Correct 95 ms 94316 KB Output is correct
28 Correct 61 ms 94328 KB Output is correct
29 Correct 97 ms 94216 KB Output is correct
30 Correct 100 ms 95212 KB Output is correct
31 Correct 98 ms 95212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 94268 KB Output is correct
2 Correct 75 ms 94400 KB Output is correct
3 Correct 81 ms 95212 KB Output is correct
4 Correct 135 ms 109304 KB Output is correct
5 Correct 425 ms 132600 KB Output is correct
6 Correct 354 ms 142328 KB Output is correct
7 Correct 398 ms 152008 KB Output is correct
8 Correct 852 ms 190372 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 94316 KB Output is correct
2 Correct 63 ms 94316 KB Output is correct
3 Correct 95 ms 94316 KB Output is correct
4 Correct 64 ms 94444 KB Output is correct
5 Correct 74 ms 94448 KB Output is correct
6 Correct 63 ms 94316 KB Output is correct
7 Correct 68 ms 94316 KB Output is correct
8 Correct 69 ms 94316 KB Output is correct
9 Correct 69 ms 94316 KB Output is correct
10 Correct 73 ms 94316 KB Output is correct
11 Correct 67 ms 94292 KB Output is correct
12 Correct 63 ms 94316 KB Output is correct
13 Correct 68 ms 94316 KB Output is correct
14 Correct 77 ms 94248 KB Output is correct
15 Correct 67 ms 94320 KB Output is correct
16 Correct 67 ms 94320 KB Output is correct
17 Correct 63 ms 94316 KB Output is correct
18 Correct 65 ms 94316 KB Output is correct
19 Correct 90 ms 94380 KB Output is correct
20 Correct 60 ms 94444 KB Output is correct
21 Correct 83 ms 94444 KB Output is correct
22 Correct 95 ms 94828 KB Output is correct
23 Correct 115 ms 95212 KB Output is correct
24 Correct 70 ms 94828 KB Output is correct
25 Correct 66 ms 95212 KB Output is correct
26 Correct 78 ms 95212 KB Output is correct
27 Correct 95 ms 94316 KB Output is correct
28 Correct 61 ms 94328 KB Output is correct
29 Correct 97 ms 94216 KB Output is correct
30 Correct 100 ms 95212 KB Output is correct
31 Correct 98 ms 95212 KB Output is correct
32 Correct 66 ms 94268 KB Output is correct
33 Correct 75 ms 94400 KB Output is correct
34 Correct 81 ms 95212 KB Output is correct
35 Correct 135 ms 109304 KB Output is correct
36 Correct 425 ms 132600 KB Output is correct
37 Correct 354 ms 142328 KB Output is correct
38 Correct 398 ms 152008 KB Output is correct
39 Correct 852 ms 190372 KB Output is correct
40 Correct 75 ms 96236 KB Output is correct
41 Correct 110 ms 98088 KB Output is correct
42 Correct 88 ms 100096 KB Output is correct
43 Correct 472 ms 132708 KB Output is correct
44 Correct 882 ms 190372 KB Output is correct
45 Correct 197 ms 113372 KB Output is correct
46 Correct 403 ms 151976 KB Output is correct
47 Correct 666 ms 190372 KB Output is correct
48 Correct 484 ms 190796 KB Output is correct
49 Correct 566 ms 189780 KB Output is correct
50 Correct 542 ms 189792 KB Output is correct