oj.uz

Submission #724033

# Submission time Handle Problem Language Result Execution time Memory
724033 2023-04-14T15:50:30 Z groshi Swimming competition (LMIO18_plaukimo_varzybos) C++17
20 / 100
 169 ms 23252 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int> Q;
int n,a,b;
int mam[600000];
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(Q[l]+x<Q[i-1])
        {
            suma-=mam[l];
            l++;
        }
        while(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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 19 ms 2640 KB Output is correct
3 Correct 3 ms 684 KB Output is correct
4 Runtime error 169 ms 23252 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 19 ms 2640 KB Output is correct
3 Correct 3 ms 684 KB Output is correct
4 Runtime error 169 ms 23252 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 19 ms 2640 KB Output is correct
3 Correct 3 ms 684 KB Output is correct
4 Runtime error 169 ms 23252 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -