| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 57413 |
2018-07-15T00:49:50 Z |
Benq |
K blocks (IZhO14_blocks) |
C++14 |
|
352 ms |
50968 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int N,K, dp[101][MX],A[MX];
vpi bes;
void ins(int x, int y) {
if (x == 0 && y > 0) return;
while (sz(bes) && bes.back().f >= dp[x][y]) bes.pop_back();
bes.pb({dp[x][y],-MOD});
}
void process(int x) {
int mn = MOD;
while (sz(bes) && bes.back().s <= x) {
mn = bes.back().f;
bes.pop_back();
}
if (!sz(bes) || bes.back().f+bes.back().s > mn+x) bes.pb({mn,x});
}
void solve(int x) {
bes.clear();
FOR(i,x,N+1) {
ins(x-1,i-1);
process(A[i]);
dp[x][i] = bes.back().f+bes.back().s;
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> K;
FOR(i,1,N+1) cin >> A[i];
FOR(i,1,K+1) solve(i);
cout << dp[K][N];
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
3 ms |
552 KB |
Output is correct |
| 4 |
Correct |
2 ms |
552 KB |
Output is correct |
| 5 |
Correct |
3 ms |
644 KB |
Output is correct |
| 6 |
Correct |
2 ms |
648 KB |
Output is correct |
| 7 |
Correct |
3 ms |
700 KB |
Output is correct |
| 8 |
Correct |
2 ms |
764 KB |
Output is correct |
| 9 |
Correct |
2 ms |
764 KB |
Output is correct |
| 10 |
Correct |
3 ms |
784 KB |
Output is correct |
| 11 |
Correct |
3 ms |
792 KB |
Output is correct |
| 12 |
Correct |
3 ms |
880 KB |
Output is correct |
| 13 |
Correct |
2 ms |
880 KB |
Output is correct |
| 14 |
Correct |
3 ms |
880 KB |
Output is correct |
| 15 |
Correct |
3 ms |
880 KB |
Output is correct |
| 16 |
Correct |
2 ms |
880 KB |
Output is correct |
| 17 |
Correct |
2 ms |
880 KB |
Output is correct |
| 18 |
Correct |
2 ms |
880 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
880 KB |
Output is correct |
| 2 |
Correct |
2 ms |
880 KB |
Output is correct |
| 3 |
Correct |
2 ms |
1092 KB |
Output is correct |
| 4 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 5 |
Correct |
2 ms |
1092 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1092 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 8 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 9 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 11 |
Correct |
2 ms |
1092 KB |
Output is correct |
| 12 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1092 KB |
Output is correct |
| 15 |
Correct |
2 ms |
1144 KB |
Output is correct |
| 16 |
Correct |
2 ms |
1144 KB |
Output is correct |
| 17 |
Correct |
3 ms |
1144 KB |
Output is correct |
| 18 |
Correct |
2 ms |
1144 KB |
Output is correct |
| 19 |
Correct |
3 ms |
1144 KB |
Output is correct |
| 20 |
Correct |
3 ms |
1144 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1316 KB |
Output is correct |
| 2 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 4 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 5 |
Correct |
4 ms |
1316 KB |
Output is correct |
| 6 |
Correct |
2 ms |
1316 KB |
Output is correct |
| 7 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 8 |
Correct |
2 ms |
1316 KB |
Output is correct |
| 9 |
Correct |
2 ms |
1316 KB |
Output is correct |
| 10 |
Correct |
2 ms |
1316 KB |
Output is correct |
| 11 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 12 |
Correct |
3 ms |
1316 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1364 KB |
Output is correct |
| 14 |
Correct |
3 ms |
1364 KB |
Output is correct |
| 15 |
Correct |
2 ms |
1624 KB |
Output is correct |
| 16 |
Correct |
3 ms |
1756 KB |
Output is correct |
| 17 |
Correct |
3 ms |
1756 KB |
Output is correct |
| 18 |
Correct |
4 ms |
1756 KB |
Output is correct |
| 19 |
Correct |
3 ms |
1756 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
2412 KB |
Output is correct |
| 2 |
Correct |
14 ms |
2412 KB |
Output is correct |
| 3 |
Correct |
21 ms |
3360 KB |
Output is correct |
| 4 |
Correct |
117 ms |
15940 KB |
Output is correct |
| 5 |
Correct |
291 ms |
42596 KB |
Output is correct |
| 6 |
Correct |
26 ms |
42596 KB |
Output is correct |
| 7 |
Correct |
148 ms |
42596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
42596 KB |
Output is correct |
| 9 |
Correct |
3 ms |
42596 KB |
Output is correct |
| 10 |
Correct |
3 ms |
42596 KB |
Output is correct |
| 11 |
Correct |
4 ms |
42596 KB |
Output is correct |
| 12 |
Correct |
3 ms |
42596 KB |
Output is correct |
| 13 |
Correct |
3 ms |
42596 KB |
Output is correct |
| 14 |
Correct |
35 ms |
42596 KB |
Output is correct |
| 15 |
Correct |
4 ms |
42596 KB |
Output is correct |
| 16 |
Correct |
10 ms |
42596 KB |
Output is correct |
| 17 |
Correct |
10 ms |
42596 KB |
Output is correct |
| 18 |
Correct |
16 ms |
42596 KB |
Output is correct |
| 19 |
Correct |
98 ms |
42596 KB |
Output is correct |
| 20 |
Correct |
293 ms |
45660 KB |
Output is correct |
| 21 |
Correct |
34 ms |
45660 KB |
Output is correct |
| 22 |
Correct |
192 ms |
45660 KB |
Output is correct |
| 23 |
Correct |
20 ms |
45660 KB |
Output is correct |
| 24 |
Correct |
42 ms |
45660 KB |
Output is correct |
| 25 |
Correct |
322 ms |
49140 KB |
Output is correct |
| 26 |
Correct |
3 ms |
49140 KB |
Output is correct |
| 27 |
Correct |
3 ms |
49140 KB |
Output is correct |
| 28 |
Correct |
38 ms |
49140 KB |
Output is correct |
| 29 |
Correct |
5 ms |
49140 KB |
Output is correct |
| 30 |
Correct |
14 ms |
49140 KB |
Output is correct |
| 31 |
Correct |
7 ms |
49140 KB |
Output is correct |
| 32 |
Correct |
23 ms |
49140 KB |
Output is correct |
| 33 |
Correct |
129 ms |
49140 KB |
Output is correct |
| 34 |
Correct |
352 ms |
50968 KB |
Output is correct |
| 35 |
Correct |
33 ms |
50968 KB |
Output is correct |
| 36 |
Correct |
161 ms |
50968 KB |
Output is correct |
| 37 |
Correct |
5 ms |
50968 KB |
Output is correct |
| 38 |
Correct |
44 ms |
50968 KB |
Output is correct |
| 39 |
Correct |
3 ms |
50968 KB |
Output is correct |
| 40 |
Correct |
3 ms |
50968 KB |
Output is correct |
| 41 |
Correct |
2 ms |
50968 KB |
Output is correct |
| 42 |
Correct |
3 ms |
50968 KB |
Output is correct |
