oj.uz

Submission #140444

# Submission time Handle Problem Language Result Execution time Memory
140444 2019-08-03T04:19:19 Z dndhk Sparklers (JOI17_sparklers) C++14
100 / 100
 41 ms 3052 KB 
#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL

const int MAX_N = 100000;

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int N, K;
ll T;
vector<ll> v;

ll D[MAX_N+1];

bool chk(ll x){
	for(int i=0; i<N; i++)	D[i] = (ll)2 * T * (ll)i * x - v[i];
	int pl=K, pr=K, nl=K-1, nr=K+1;
	while(1){
		while(D[nl]>D[pl] && D[nl]<=D[pr] && nl>0)	nl--;
		while(D[nr]<D[pr] && D[nr]>=D[pl] && nr<N-1)	nr++;
		bool ch = false;
		if(nl>=0 && D[nl]<=D[pl]){
			pl = nl; nl--;
			ch = true;
		}
		if(nr<N && D[nr]>=D[pr]){
			pr = nr; nr++;
			ch = true;
		}
		if(!ch)	break;
	}
	if((nr<N && D[pl]>D[nr]) || (nl>=0 && D[pr]<D[nl]))	return false;
	int l = 0, r = N-1; nl = 1; nr = N-2;
	while(1){
		while(D[l]<D[nl] && D[nl]<=D[r] && nl<K)	nl++;
		while(D[l]<=D[nr] && D[nr]<D[r] && K<nr)	nr--;
		bool ch = false;
		if(nl<=K && D[nl]<=D[l]){
			l = nl; nl++;
			ch = true;
		}
		if(nr>=K && D[nr]>=D[r]){
			r = nr; nr--;
			ch = true;
		}
		if(!ch)	break;
	}
	return ((pl<=l) && (r<=pr));
}

int main(){
	scanf("%d%d%lld", &N, &K, &T);
	K--;
	for(int i=0; i<N; i++){
		ll x; scanf("%lld", &x);
		v.pb(x);
	}
	ll s = 0, e = INF, m;
	while(s<e){
		m = (s+e)/2;
		if(chk(m)){
			e = m;
		}else{
			s = m+1;
		}
	}
	printf("%lld", s);
	return 0;
}

Compilation message

sparklers.cpp: In function 'int main()':
sparklers.cpp:68:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%lld", &N, &K, &T);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sparklers.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   ll x; scanf("%lld", &x);
         ~~~~~^~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 20 ms 2292 KB Output is correct
42 Correct 3 ms 504 KB Output is correct
43 Correct 8 ms 888 KB Output is correct
44 Correct 31 ms 3048 KB Output is correct
45 Correct 28 ms 2920 KB Output is correct
46 Correct 31 ms 2920 KB Output is correct
47 Correct 32 ms 2924 KB Output is correct
48 Correct 30 ms 2924 KB Output is correct
49 Correct 31 ms 2928 KB Output is correct
50 Correct 29 ms 2920 KB Output is correct
51 Correct 31 ms 2924 KB Output is correct
52 Correct 29 ms 2924 KB Output is correct
53 Correct 32 ms 2924 KB Output is correct
54 Correct 30 ms 2924 KB Output is correct
55 Correct 29 ms 2924 KB Output is correct
56 Correct 30 ms 2924 KB Output is correct
57 Correct 30 ms 2924 KB Output is correct
58 Correct 30 ms 2920 KB Output is correct
59 Correct 23 ms 2152 KB Output is correct
60 Correct 28 ms 2920 KB Output is correct
61 Correct 28 ms 2924 KB Output is correct
62 Correct 28 ms 2924 KB Output is correct
63 Correct 41 ms 3052 KB Output is correct
64 Correct 29 ms 3052 KB Output is correct
65 Correct 27 ms 2920 KB Output is correct
66 Correct 27 ms 2920 KB Output is correct
67 Correct 27 ms 2928 KB Output is correct
68 Correct 29 ms 3048 KB Output is correct
69 Correct 27 ms 2924 KB Output is correct