oj.uz

Submission #377262

# Submission time Handle Problem Language Result Execution time Memory
377262 2021-03-13T15:18:15 Z maomao90 Discharging (NOI20_discharging) C++14
100 / 100
 186 ms 18668 KB 
#include <bits/stdc++.h>
using namespace std;

#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 1000005

// make t[i] non-decreasing
// define dp[i] as the minimum sum of waiting time up to i with the group ending at i
// dp[i] = for all 0 <= j <= i min(dp[j - 1] + t[i] * (n - j) = (-t[i] * j + dp[j - 1]) + t[i] * n

int n;
int t[MAXN];
stack<int> stk;
ll dp[MAXN];

struct line {
	ll m, c;
	line() {}
	line(ll m, ll c): m(m), c(c) {}
	ll eval(ll x) {
		return m * x + c;
	}
};

ld intersect(line a, line b) {
	return ((ld) a.c - b.c) / (b.m - a.m);
}

deque<line> dq;
void insert(line cur) {
	while (dq.size() > 1 && intersect(dq.back(), cur) <= intersect(dq[dq.size() - 2], cur)) {
		dq.pop_back();
	}
	dq.push_back(cur);
}
ll query(ll x) {
	while (dq.size() > 1 && intersect(dq.front(), dq[1]) < x) {
		dq.pop_front();
	}
	return dq.front().eval(x);
}

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 1) scanf("%d", &t[i]);
	int mx = 0;
	REP (i, 1, n + 1) {
		mxto(mx, t[i]);
		t[i] = mx;
	}
	insert(line(0, 0));
	REP (i, 1, n + 1) {
		dp[i] = query(t[i]) + (ll) t[i] * n;
		insert(line(-i, dp[i]));
	}
	printf("%lld\n", dp[n]);
	return 0;
}

Compilation message

Discharging.cpp: In function 'int main()':
Discharging.cpp:64:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Discharging.cpp:65:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |  REP (i, 1, n + 1) scanf("%d", &t[i]);
      |                    ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 157 ms 17132 KB Output is correct
17 Correct 167 ms 17900 KB Output is correct
18 Correct 156 ms 16492 KB Output is correct
19 Correct 168 ms 17840 KB Output is correct
20 Correct 163 ms 17772 KB Output is correct
21 Correct 169 ms 17900 KB Output is correct
22 Correct 160 ms 17516 KB Output is correct
23 Correct 170 ms 18540 KB Output is correct
24 Correct 167 ms 18028 KB Output is correct
25 Correct 168 ms 18284 KB Output is correct
26 Correct 175 ms 18668 KB Output is correct
27 Correct 157 ms 17132 KB Output is correct
28 Correct 168 ms 18028 KB Output is correct
29 Correct 170 ms 18284 KB Output is correct
30 Correct 171 ms 18608 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 12140 KB Output is correct
2 Correct 179 ms 12140 KB Output is correct
3 Correct 178 ms 12012 KB Output is correct
4 Correct 180 ms 12140 KB Output is correct
5 Correct 178 ms 12012 KB Output is correct
6 Correct 178 ms 12140 KB Output is correct
7 Correct 178 ms 12012 KB Output is correct
8 Correct 180 ms 12140 KB Output is correct
9 Correct 178 ms 12012 KB Output is correct
10 Correct 183 ms 12012 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 157 ms 17132 KB Output is correct
31 Correct 167 ms 17900 KB Output is correct
32 Correct 156 ms 16492 KB Output is correct
33 Correct 168 ms 17840 KB Output is correct
34 Correct 163 ms 17772 KB Output is correct
35 Correct 169 ms 17900 KB Output is correct
36 Correct 160 ms 17516 KB Output is correct
37 Correct 170 ms 18540 KB Output is correct
38 Correct 167 ms 18028 KB Output is correct
39 Correct 168 ms 18284 KB Output is correct
40 Correct 175 ms 18668 KB Output is correct
41 Correct 157 ms 17132 KB Output is correct
42 Correct 168 ms 18028 KB Output is correct
43 Correct 170 ms 18284 KB Output is correct
44 Correct 171 ms 18608 KB Output is correct
45 Correct 186 ms 12140 KB Output is correct
46 Correct 179 ms 12140 KB Output is correct
47 Correct 178 ms 12012 KB Output is correct
48 Correct 180 ms 12140 KB Output is correct
49 Correct 178 ms 12012 KB Output is correct
50 Correct 178 ms 12140 KB Output is correct
51 Correct 178 ms 12012 KB Output is correct
52 Correct 180 ms 12140 KB Output is correct
53 Correct 178 ms 12012 KB Output is correct
54 Correct 183 ms 12012 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 492 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 166 ms 18028 KB Output is correct
77 Correct 168 ms 18156 KB Output is correct
78 Correct 163 ms 17644 KB Output is correct
79 Correct 169 ms 17772 KB Output is correct
80 Correct 169 ms 18540 KB Output is correct
81 Correct 166 ms 17772 KB Output is correct
82 Correct 172 ms 17644 KB Output is correct
83 Correct 165 ms 18156 KB Output is correct
84 Correct 162 ms 17900 KB Output is correct
85 Correct 166 ms 18140 KB Output is correct
86 Correct 160 ms 17516 KB Output is correct
87 Correct 160 ms 17520 KB Output is correct
88 Correct 166 ms 17772 KB Output is correct
89 Correct 162 ms 17644 KB Output is correct
90 Correct 163 ms 17644 KB Output is correct
91 Correct 158 ms 17388 KB Output is correct
92 Correct 172 ms 18668 KB Output is correct
93 Correct 163 ms 17900 KB Output is correct
94 Correct 160 ms 17004 KB Output is correct
95 Correct 165 ms 18412 KB Output is correct
96 Correct 163 ms 17388 KB Output is correct
97 Correct 165 ms 17644 KB Output is correct
98 Correct 162 ms 17900 KB Output is correct
99 Correct 168 ms 17644 KB Output is correct
100 Correct 166 ms 17644 KB Output is correct