# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
724037 | 2023-04-14T15:51:50 Z | groshi | Swimming competition (LMIO18_plaukimo_varzybos) | C++17 | 419 ms | 22836 KB |
#include<bits/stdc++.h> #define int long long using namespace std; vector<int> Q; int n,a,b; int mam[1200000]; bool git(int x) { for(int i=0;i<=n;i++) mam[i]=0; int suma=1; mam[0]=1; int l=0,r=0; for(int i=1;i<=n;i++) { while(l<Q.size() && Q[l]+x<Q[i-1]) { suma-=mam[l]; l++; } while(r<Q.size() && Q[r]+x<Q[i-1]) { suma+=mam[r+1]; r++; } while(l+b<i) { suma-=mam[l]; l++; } while(r+a<i) { suma+=mam[r+1]; r++; } if(suma>0 && i-l>=a) mam[i]=1; } return mam[n]; } int32_t main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); int x; cin>>n>>a>>b; for(int i=1;i<=n;i++) { cin>>x; Q.push_back(x); } sort(Q.begin(),Q.end()); int pocz=0,kon=1e6,sre,ostd=1e9; while(pocz<kon) { sre=(pocz+kon)/2; if(git(sre)) { ostd=sre; kon=sre; } else pocz=sre+1; } cout<<ostd; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 17 ms | 2008 KB | Output is correct |
3 | Correct | 2 ms | 596 KB | Output is correct |
4 | Correct | 246 ms | 16092 KB | Output is correct |
5 | Correct | 248 ms | 22836 KB | Output is correct |
6 | Correct | 23 ms | 2636 KB | Output is correct |
7 | Correct | 241 ms | 20520 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 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 | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 17 ms | 2008 KB | Output is correct |
3 | Correct | 2 ms | 596 KB | Output is correct |
4 | Correct | 246 ms | 16092 KB | Output is correct |
5 | Correct | 248 ms | 22836 KB | Output is correct |
6 | Correct | 23 ms | 2636 KB | Output is correct |
7 | Correct | 241 ms | 20520 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 1 ms | 212 KB | Output is correct |
13 | Correct | 1 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 0 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 | 0 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 8 ms | 988 KB | Output is correct |
22 | Correct | 8 ms | 1364 KB | Output is correct |
23 | Correct | 13 ms | 1780 KB | Output is correct |
24 | Correct | 18 ms | 2192 KB | Output is correct |
25 | Correct | 112 ms | 13388 KB | Output is correct |
26 | Correct | 205 ms | 18264 KB | Output is correct |
27 | Correct | 27 ms | 2200 KB | Output is correct |
28 | Correct | 17 ms | 1868 KB | Output is correct |
29 | Correct | 1 ms | 324 KB | Output is correct |
30 | Correct | 330 ms | 22740 KB | Output is correct |
31 | Correct | 330 ms | 22832 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 17 ms | 2008 KB | Output is correct |
3 | Correct | 2 ms | 596 KB | Output is correct |
4 | Correct | 246 ms | 16092 KB | Output is correct |
5 | Correct | 248 ms | 22836 KB | Output is correct |
6 | Correct | 23 ms | 2636 KB | Output is correct |
7 | Correct | 241 ms | 20520 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 212 KB | Output is correct |
11 | Correct | 8 ms | 988 KB | Output is correct |
12 | Correct | 8 ms | 1364 KB | Output is correct |
13 | Correct | 13 ms | 1780 KB | Output is correct |
14 | Correct | 18 ms | 2192 KB | Output is correct |
15 | Correct | 112 ms | 13388 KB | Output is correct |
16 | Correct | 205 ms | 18264 KB | Output is correct |
17 | Correct | 27 ms | 2200 KB | Output is correct |
18 | Correct | 17 ms | 1868 KB | Output is correct |
19 | Correct | 1 ms | 324 KB | Output is correct |
20 | Correct | 330 ms | 22740 KB | Output is correct |
21 | Correct | 330 ms | 22832 KB | Output is correct |
22 | Correct | 0 ms | 212 KB | Output is correct |
23 | Correct | 1 ms | 212 KB | Output is correct |
24 | Correct | 1 ms | 212 KB | Output is correct |
25 | Correct | 0 ms | 212 KB | Output is correct |
26 | Correct | 1 ms | 212 KB | Output is correct |
27 | Correct | 0 ms | 212 KB | Output is correct |
28 | Correct | 1 ms | 212 KB | Output is correct |
29 | Correct | 1 ms | 212 KB | Output is correct |
30 | Correct | 0 ms | 212 KB | Output is correct |
31 | Correct | 0 ms | 212 KB | Output is correct |
32 | Correct | 10 ms | 1568 KB | Output is correct |
33 | Correct | 130 ms | 12424 KB | Output is correct |
34 | Correct | 116 ms | 12632 KB | Output is correct |
35 | Correct | 419 ms | 22828 KB | Output is correct |
36 | Correct | 419 ms | 22836 KB | Output is correct |
37 | Correct | 376 ms | 22832 KB | Output is correct |
38 | Correct | 159 ms | 15048 KB | Output is correct |