Submission #59861

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
59861	2018-07-23T08:12:37 Z	윤교준(#1726)	Sparklers (JOI17_sparklers)	C++11	100 / 100	54 ms	1132 KB

sparklers

#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define sz(V) ((int)(V).size())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;

const int MAXN = 100005;

int A[MAXN];

int N, K, T, P;

ll f(int P, int i) { return ll(A[i]) - 2ll * P * T * i; }
ll g(int P, int i) { return -f(P, i); }
ll g(int i) { return g(P, i); }

bool isp(int P) {
	::P = P;
	if(g(1) > g(N)) return false;

	int pl = K, pr = K, l = K, r = K;
	for(int i = 1; i <= K; i++) if(g(i) < g(pl)) pl = i;
	for(int i = K; i <= N; i++) if(g(pr) <= g(i)) pr = i;

	for(;;) {
		bool flag = false;
		int i = l;
		for(; pl < i;) {
			if(g(i-1) <= g(r)) {
				i--;
				if(g(i) <= g(l)) break;
				continue;
			}
			break;
		}
		if(i < l && g(i) <= g(l)) {
			flag = true;
			l = i;
		}
		for(i = r; i < pr;) {
			if(g(l) <= g(i+1)) {
				i++;
				if(g(r) <= g(i)) break;
				continue;
			}
			break;
		}
		if(r < i && g(r) <= g(i)) {
			flag = true;
			r = i;
		}
		if(!flag) break;
	}
	
	if(l != pl || r != pr) return false;

	l = 1; r = N;
	for(;;) {
		bool flag = false;
		int i = l;
		for(; i < pl;) {
			if(g(i+1) <= g(r)) {
				i++;
				if(g(i) <= g(l)) break;
				continue;
			}
			break;
		}
		if(l < i && g(i) <= g(l)) {
			flag = true;
			l = i;
		}
		for(i = r; pr < i;) {
			if(g(l) <= g(i-1)) {
				i--;
				if(g(r) <= g(i)) break;
				continue;
			}
			break;
		}
		if(i < r && g(r) <= g(i)) {
			flag = true;
			r = i;
		}
		if(!flag) break;
	}

	return l == pl && r == pr;
}

int getAns() {
	int s = 0, e = INF/T+2; for(int m; s < e;) {
		m = (s+e) >> 1;
		if(isp(m)) e = m;
		else s = m+1;
	}
	return s;
}

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> K >> T;
	for(int i = 1; i <= N; i++) cin >> A[i];

	cout << getAns() << endl;
	return 0;
}

Subtask #1
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	252 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	392 KB	Output is correct
5	Correct	3 ms	468 KB	Output is correct
6	Correct	3 ms	544 KB	Output is correct
7	Correct	3 ms	544 KB	Output is correct
8	Correct	3 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	4 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	3 ms	624 KB	Output is correct
14	Correct	3 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	3 ms	624 KB	Output is correct
18	Correct	2 ms	624 KB	Output is correct
19	Correct	2 ms	624 KB	Output is correct
20	Correct	2 ms	624 KB	Output is correct
21	Correct	2 ms	624 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	252 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	392 KB	Output is correct
5	Correct	3 ms	468 KB	Output is correct
6	Correct	3 ms	544 KB	Output is correct
7	Correct	3 ms	544 KB	Output is correct
8	Correct	3 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	4 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	3 ms	624 KB	Output is correct
14	Correct	3 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	3 ms	624 KB	Output is correct
18	Correct	2 ms	624 KB	Output is correct
19	Correct	2 ms	624 KB	Output is correct
20	Correct	2 ms	624 KB	Output is correct
21	Correct	2 ms	624 KB	Output is correct
22	Correct	3 ms	624 KB	Output is correct
23	Correct	3 ms	624 KB	Output is correct
24	Correct	3 ms	624 KB	Output is correct
25	Correct	4 ms	624 KB	Output is correct
26	Correct	3 ms	624 KB	Output is correct
27	Correct	3 ms	624 KB	Output is correct
28	Correct	2 ms	624 KB	Output is correct
29	Correct	4 ms	636 KB	Output is correct
30	Correct	3 ms	636 KB	Output is correct
31	Correct	3 ms	636 KB	Output is correct
32	Correct	3 ms	636 KB	Output is correct
33	Correct	3 ms	636 KB	Output is correct
34	Correct	3 ms	636 KB	Output is correct
35	Correct	3 ms	636 KB	Output is correct
36	Correct	2 ms	636 KB	Output is correct
37	Correct	2 ms	636 KB	Output is correct
38	Correct	3 ms	636 KB	Output is correct
39	Correct	3 ms	636 KB	Output is correct
40	Correct	3 ms	636 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	252 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	392 KB	Output is correct
4	Correct	3 ms	392 KB	Output is correct
5	Correct	3 ms	468 KB	Output is correct
6	Correct	3 ms	544 KB	Output is correct
7	Correct	3 ms	544 KB	Output is correct
8	Correct	3 ms	620 KB	Output is correct
9	Correct	2 ms	620 KB	Output is correct
10	Correct	2 ms	620 KB	Output is correct
11	Correct	4 ms	624 KB	Output is correct
12	Correct	2 ms	624 KB	Output is correct
13	Correct	3 ms	624 KB	Output is correct
14	Correct	3 ms	624 KB	Output is correct
15	Correct	2 ms	624 KB	Output is correct
16	Correct	2 ms	624 KB	Output is correct
17	Correct	3 ms	624 KB	Output is correct
18	Correct	2 ms	624 KB	Output is correct
19	Correct	2 ms	624 KB	Output is correct
20	Correct	2 ms	624 KB	Output is correct
21	Correct	2 ms	624 KB	Output is correct
22	Correct	3 ms	624 KB	Output is correct
23	Correct	3 ms	624 KB	Output is correct
24	Correct	3 ms	624 KB	Output is correct
25	Correct	4 ms	624 KB	Output is correct
26	Correct	3 ms	624 KB	Output is correct
27	Correct	3 ms	624 KB	Output is correct
28	Correct	2 ms	624 KB	Output is correct
29	Correct	4 ms	636 KB	Output is correct
30	Correct	3 ms	636 KB	Output is correct
31	Correct	3 ms	636 KB	Output is correct
32	Correct	3 ms	636 KB	Output is correct
33	Correct	3 ms	636 KB	Output is correct
34	Correct	3 ms	636 KB	Output is correct
35	Correct	3 ms	636 KB	Output is correct
36	Correct	2 ms	636 KB	Output is correct
37	Correct	2 ms	636 KB	Output is correct
38	Correct	3 ms	636 KB	Output is correct
39	Correct	3 ms	636 KB	Output is correct
40	Correct	3 ms	636 KB	Output is correct
41	Correct	26 ms	876 KB	Output is correct
42	Correct	5 ms	876 KB	Output is correct
43	Correct	9 ms	876 KB	Output is correct
44	Correct	54 ms	1016 KB	Output is correct
45	Correct	41 ms	1036 KB	Output is correct
46	Correct	39 ms	1036 KB	Output is correct
47	Correct	40 ms	1036 KB	Output is correct
48	Correct	40 ms	1036 KB	Output is correct
49	Correct	54 ms	1036 KB	Output is correct
50	Correct	34 ms	1036 KB	Output is correct
51	Correct	49 ms	1036 KB	Output is correct
52	Correct	40 ms	1036 KB	Output is correct
53	Correct	40 ms	1036 KB	Output is correct
54	Correct	48 ms	1116 KB	Output is correct
55	Correct	44 ms	1116 KB	Output is correct
56	Correct	42 ms	1116 KB	Output is correct
57	Correct	39 ms	1116 KB	Output is correct
58	Correct	43 ms	1116 KB	Output is correct
59	Correct	34 ms	1116 KB	Output is correct
60	Correct	35 ms	1116 KB	Output is correct
61	Correct	46 ms	1132 KB	Output is correct
62	Correct	33 ms	1132 KB	Output is correct
63	Correct	33 ms	1132 KB	Output is correct
64	Correct	39 ms	1132 KB	Output is correct
65	Correct	39 ms	1132 KB	Output is correct
66	Correct	38 ms	1132 KB	Output is correct
67	Correct	35 ms	1132 KB	Output is correct
68	Correct	38 ms	1132 KB	Output is correct
69	Correct	39 ms	1132 KB	Output is correct

Submission #59861

Compilation message

Subtask #1 30.0 / 30.0

Subtask #2 20.0 / 20.0

Subtask #3 50.0 / 50.0

Subtask #1
30.0 / 30.0

Subtask #2
20.0 / 20.0

Subtask #3
50.0 / 50.0