oj.uz

Submission #377263

# Submission time Handle Problem Language Result Execution time Memory
377263 2021-03-13T15:18:54 Z maomao90 Discharging (NOI20_discharging) C++14
100 / 100
 179 ms 13164 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 -1 <= j < i min(dp[j] + t[i] * (n - j - 1)) = (-t[i] * j + dp[j]) + t[i] * (n - 1)

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, 0, n) scanf("%d", &t[i]);
	int mx = 0;
	REP (i, 0, n) {
		mxto(mx, t[i]);
		t[i] = mx;
	}
	insert(line(1, 0));
	REP (i, 0, n) {
		dp[i] = query(t[i]) + (ll) t[i] * (n - 1);
		insert(line(-i, dp[i]));
	}
	printf("%lld\n", dp[n - 1]);
	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:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |  REP (i, 0, n) 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 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

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 158 ms 12908 KB Output is correct
17 Correct 167 ms 13036 KB Output is correct
18 Correct 149 ms 12908 KB Output is correct
19 Correct 165 ms 13036 KB Output is correct
20 Correct 160 ms 12908 KB Output is correct
21 Correct 167 ms 12908 KB Output is correct
22 Correct 159 ms 12960 KB Output is correct
23 Correct 177 ms 12908 KB Output is correct
24 Correct 164 ms 12908 KB Output is correct
25 Correct 173 ms 13036 KB Output is correct
26 Correct 169 ms 12908 KB Output is correct
27 Correct 159 ms 13036 KB Output is correct
28 Correct 168 ms 12908 KB Output is correct
29 Correct 165 ms 12908 KB Output is correct
30 Correct 165 ms 12780 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 13040 KB Output is correct
2 Correct 171 ms 12908 KB Output is correct
3 Correct 171 ms 12900 KB Output is correct
4 Correct 170 ms 12908 KB Output is correct
5 Correct 175 ms 12908 KB Output is correct
6 Correct 179 ms 13164 KB Output is correct
7 Correct 173 ms 12908 KB Output is correct
8 Correct 174 ms 12908 KB Output is correct
9 Correct 174 ms 12908 KB Output is correct
10 Correct 174 ms 12908 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 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 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 364 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 492 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 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 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 158 ms 12908 KB Output is correct
31 Correct 167 ms 13036 KB Output is correct
32 Correct 149 ms 12908 KB Output is correct
33 Correct 165 ms 13036 KB Output is correct
34 Correct 160 ms 12908 KB Output is correct
35 Correct 167 ms 12908 KB Output is correct
36 Correct 159 ms 12960 KB Output is correct
37 Correct 177 ms 12908 KB Output is correct
38 Correct 164 ms 12908 KB Output is correct
39 Correct 173 ms 13036 KB Output is correct
40 Correct 169 ms 12908 KB Output is correct
41 Correct 159 ms 13036 KB Output is correct
42 Correct 168 ms 12908 KB Output is correct
43 Correct 165 ms 12908 KB Output is correct
44 Correct 165 ms 12780 KB Output is correct
45 Correct 178 ms 13040 KB Output is correct
46 Correct 171 ms 12908 KB Output is correct
47 Correct 171 ms 12900 KB Output is correct
48 Correct 170 ms 12908 KB Output is correct
49 Correct 175 ms 12908 KB Output is correct
50 Correct 179 ms 13164 KB Output is correct
51 Correct 173 ms 12908 KB Output is correct
52 Correct 174 ms 12908 KB Output is correct
53 Correct 174 ms 12908 KB Output is correct
54 Correct 174 ms 12908 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 364 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 492 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 12836 KB Output is correct
77 Correct 161 ms 12652 KB Output is correct
78 Correct 158 ms 12652 KB Output is correct
79 Correct 159 ms 12908 KB Output is correct
80 Correct 163 ms 12684 KB Output is correct
81 Correct 157 ms 12800 KB Output is correct
82 Correct 156 ms 12652 KB Output is correct
83 Correct 173 ms 12652 KB Output is correct
84 Correct 169 ms 12652 KB Output is correct
85 Correct 164 ms 12652 KB Output is correct
86 Correct 159 ms 12780 KB Output is correct
87 Correct 156 ms 12652 KB Output is correct
88 Correct 162 ms 12652 KB Output is correct
89 Correct 157 ms 12780 KB Output is correct
90 Correct 159 ms 12652 KB Output is correct
91 Correct 162 ms 12780 KB Output is correct
92 Correct 173 ms 12744 KB Output is correct
93 Correct 165 ms 12524 KB Output is correct
94 Correct 155 ms 12524 KB Output is correct
95 Correct 167 ms 12524 KB Output is correct
96 Correct 159 ms 12652 KB Output is correct
97 Correct 157 ms 12524 KB Output is correct
98 Correct 163 ms 12524 KB Output is correct
99 Correct 156 ms 12524 KB Output is correct
100 Correct 162 ms 12560 KB Output is correct