oj.uz

Submission #1044334

# Submission time Handle Problem Language Result Execution time Memory
1044334 2024-08-05T08:55:55 Z imarn Sprinklers (CEOI24_sprinklers) C++14
0 / 100
 6 ms 604 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define ub(a,b) upper_bound(a.begin(),a.end(),b)-a.begin();
#define lb(a,b) lower_bound(a.begin(),a.end(),b)-a.begin();
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define sz(x) x.size()
#define T pair<double,string>
using namespace std;
const int mxn=2e5+5;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m;cin>>n>>m;
    int s[n+1]={0},f[m+1]={0};
    for(int i=1;i<=n;i++)cin>>s[i];for(int i=1;i<=m;i++)cin>>f[i];
    ll l=0,r=1e12+1;
    int lr[n+1]={0};
    while(l<r){
        ll k=(l+r)>>1;
        int idx=1;memset(lr,0,sizeof lr);
        for(int i=1;i<=n;i++){
            while(idx<=m&&s[i]-k<=f[idx]&&f[idx]<=s[i])idx++,lr[i]=1;
            while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+k&&lr[i]!=1)idx++,lr[i]=2;
        }if(idx!=m+1)l=k+1;
        else r=k;
    }if(l==1e12+1){cout<<-1;return 0;}
    if(f[m]<=s[1])cout<<s[1]-f[1]<<'\n'<<'L';
    else if(s[1]<=f[1])cout<<f[m]-s[1]<<'\n'<<'R';
    else cout<<-1;
    return 0;
    /*memset(lr,0,sizeof lr);int idx=1;
    for(int i=1;i<=n;i++){
        while(idx<=m&&s[i]-l<=f[idx]&&f[idx]<=s[i])idx++,lr[i]=1;
        while(idx<=m&&s[i]<=f[idx]&&f[idx]<=s[i]+l&&lr[i]!=1)idx++,lr[i]=2;
    }cout<<l<<'\n';
    for(int i=1;i<=n;i++)cout<<(lr[i]==1?"L":"R");*/
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:21:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   21 |     for(int i=1;i<=n;i++)cin>>s[i];for(int i=1;i<=m;i++)cin>>f[i];
      |     ^~~
Main.cpp:21:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   21 |     for(int i=1;i<=n;i++)cin>>s[i];for(int i=1;i<=m;i++)cin>>f[i];
      |                                    ^~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 6 ms 604 KB Correct
3 Incorrect 0 ms 348 KB User solution is worse than jury's solution
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -