Submission #952987

# Submission time Handle Problem Language Result Execution time Memory
952987 2024-03-25T08:59:39 Z Isam Swimming competition (LMIO18_plaukimo_varzybos) C++17
100 / 100
353 ms 13140 KB
#include<bits/stdc++.h>
using namespace std;

int n, l, r, t[1000001];

bool check(int dif){
	deque<int> q = {0};
	int i(l);
	while(i <= n && !q.empty()){
		if(i - q.front() >= l){
			if(i - q.front() <= r && t[i] - t[q.front()+1] <= dif){
				q.push_back(i), ++i;
			}else{
				q.pop_front();
			}
		}else{
			++i;
		}
	}
	return (!q.empty() && q.back() == n);
}

signed main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> l >> r;
	for(register int i = 1; i <= n; ++i) cin >> t[i];
	sort(t+1,t+n+1);
	int lo(0), hi(t[n]), mid, ans;
	while(lo <= hi){
		mid = lo + ((hi - lo) >> 1);
		if(check(mid)){
			hi = mid - 1, ans = mid;
		}else{
			lo = mid + 1;
		}
	}
	cout << ans << '\n';
}

Compilation message

plaukimo_varzybos.cpp: In function 'int main()':
plaukimo_varzybos.cpp:26:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   26 |  for(register int i = 1; i <= n; ++i) cin >> t[i];
      |                   ^
plaukimo_varzybos.cpp:37:17: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |  cout << ans << '\n';
      |                 ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 10 ms 3192 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 169 ms 11268 KB Output is correct
5 Correct 152 ms 11328 KB Output is correct
6 Correct 16 ms 3164 KB Output is correct
7 Correct 138 ms 9812 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 10 ms 3192 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 169 ms 11268 KB Output is correct
5 Correct 152 ms 11328 KB Output is correct
6 Correct 16 ms 3164 KB Output is correct
7 Correct 138 ms 9812 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 6 ms 604 KB Output is correct
22 Correct 4 ms 2652 KB Output is correct
23 Correct 9 ms 2908 KB Output is correct
24 Correct 15 ms 3236 KB Output is correct
25 Correct 64 ms 5220 KB Output is correct
26 Correct 156 ms 8784 KB Output is correct
27 Correct 20 ms 3160 KB Output is correct
28 Correct 10 ms 2908 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 275 ms 11076 KB Output is correct
31 Correct 269 ms 10836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 10 ms 3192 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 169 ms 11268 KB Output is correct
5 Correct 152 ms 11328 KB Output is correct
6 Correct 16 ms 3164 KB Output is correct
7 Correct 138 ms 9812 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 604 KB Output is correct
12 Correct 4 ms 2652 KB Output is correct
13 Correct 9 ms 2908 KB Output is correct
14 Correct 15 ms 3236 KB Output is correct
15 Correct 64 ms 5220 KB Output is correct
16 Correct 156 ms 8784 KB Output is correct
17 Correct 20 ms 3160 KB Output is correct
18 Correct 10 ms 2908 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 275 ms 11076 KB Output is correct
21 Correct 269 ms 10836 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 436 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 6 ms 2904 KB Output is correct
33 Correct 99 ms 6240 KB Output is correct
34 Correct 83 ms 5972 KB Output is correct
35 Correct 353 ms 13140 KB Output is correct
36 Correct 173 ms 13140 KB Output is correct
37 Correct 179 ms 12612 KB Output is correct
38 Correct 111 ms 6740 KB Output is correct