답안 #548194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548194	2022-04-12T16:52:12 Z	getac	Sparklers (JOI17_sparklers)	C++14	100 / 100	148 ms	6392 KB

sparklers

//InTheNameOfGOD
//PRS;)
#pragma GCC optimize("no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i < r; ++i)
#define per(i, l, r) for(int i = r - 1; i >= l; --i)
#define Fast cin.tie(0) -> sync_with_stdio(0);
#define X first
#define Y second
typedef long double ld;
typedef long long ll;
using namespace std;
typedef pair<int, int> pi;
constexpr int inf = 1e9;
vector<int> a;
int cnt, k, md, n;
inline bool ig(vector<ld> x, vector<ld> y)
{
    pi pl = {0, 0}, pr = {0, 0};
    int s1 = x.size() - 1, s2 = y.size() - 1;
    bool f = 1;
    while(f)
	{
        f = 0;
        while(pl.Y < s1 && x[pl.Y + 1] <= y[pr.X])
		{
            f = 1;
            if(x[++pl.Y] < x[pl.X]) pl.X = pl.Y;
        }
        while(pr.Y < s2 && x[pl.X] <= y[pr.Y + 1])
		{
            f = 1;
            if(y[++pr.Y] > y[pr.X]) pr.X = pr.Y;
        }
    }
    return pl.Y == s1 && pr.Y == s2;
}
inline bool doj()
{
    vector<ld> x, y;
    per(i, 0, k + 1) x.push_back((ld)2 * md * cnt * i - a[i]);
    rep(i, k, n) y.push_back((ld)2 * md * cnt * i - a[i]);
    if(!ig(x, y)) return 0;
    reverse(x.begin(), x.end()), reverse(y.begin(), y.end());
    if(!ig(x, y)) return 0;
    return 1;
}
int main()
{
	Fast
    cin >> n >> k >> cnt;
	a.resize(n), k--;
    rep(i, 0, n) cin >> a[i];
    int l = 0, r = inf;
    while(l < r)
	{
        md = l + r >> 1;
        if(doj()) r = md;
        else l = md + 1;
    }
    cout << l << '\n';
}

Compilation message

sparklers.cpp: In function 'int main()':
sparklers.cpp:58:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |         md = l + r >> 1;
      |              ~~^~~

Subtask #1
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	2 ms	344 KB	Output is correct
28	Correct	2 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	2 ms	356 KB	Output is correct
31	Correct	1 ms	356 KB	Output is correct
32	Correct	1 ms	356 KB	Output is correct
33	Correct	2 ms	356 KB	Output is correct
34	Correct	2 ms	356 KB	Output is correct
35	Correct	3 ms	356 KB	Output is correct
36	Correct	2 ms	340 KB	Output is correct
37	Correct	2 ms	356 KB	Output is correct
38	Correct	2 ms	356 KB	Output is correct
39	Correct	2 ms	356 KB	Output is correct
40	Correct	1 ms	356 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	300 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	328 KB	Output is correct
27	Correct	2 ms	344 KB	Output is correct
28	Correct	2 ms	356 KB	Output is correct
29	Correct	1 ms	356 KB	Output is correct
30	Correct	2 ms	356 KB	Output is correct
31	Correct	1 ms	356 KB	Output is correct
32	Correct	1 ms	356 KB	Output is correct
33	Correct	2 ms	356 KB	Output is correct
34	Correct	2 ms	356 KB	Output is correct
35	Correct	3 ms	356 KB	Output is correct
36	Correct	2 ms	340 KB	Output is correct
37	Correct	2 ms	356 KB	Output is correct
38	Correct	2 ms	356 KB	Output is correct
39	Correct	2 ms	356 KB	Output is correct
40	Correct	1 ms	356 KB	Output is correct
41	Correct	88 ms	3864 KB	Output is correct
42	Correct	3 ms	476 KB	Output is correct
43	Correct	22 ms	1448 KB	Output is correct
44	Correct	111 ms	5404 KB	Output is correct
45	Correct	109 ms	5288 KB	Output is correct
46	Correct	122 ms	5420 KB	Output is correct
47	Correct	131 ms	5416 KB	Output is correct
48	Correct	104 ms	4964 KB	Output is correct
49	Correct	108 ms	5384 KB	Output is correct
50	Correct	115 ms	5204 KB	Output is correct
51	Correct	135 ms	5496 KB	Output is correct
52	Correct	148 ms	6392 KB	Output is correct
53	Correct	109 ms	5468 KB	Output is correct
54	Correct	116 ms	6312 KB	Output is correct
55	Correct	113 ms	5244 KB	Output is correct
56	Correct	117 ms	5528 KB	Output is correct
57	Correct	118 ms	5220 KB	Output is correct
58	Correct	138 ms	4988 KB	Output is correct
59	Correct	116 ms	4496 KB	Output is correct
60	Correct	120 ms	6324 KB	Output is correct
61	Correct	118 ms	5960 KB	Output is correct
62	Correct	117 ms	5492 KB	Output is correct
63	Correct	121 ms	5972 KB	Output is correct
64	Correct	106 ms	5356 KB	Output is correct
65	Correct	105 ms	4984 KB	Output is correct
66	Correct	121 ms	5140 KB	Output is correct
67	Correct	107 ms	4892 KB	Output is correct
68	Correct	121 ms	6272 KB	Output is correct
69	Correct	114 ms	6312 KB	Output is correct

답안 #548194

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