oj.uz

Submission #1113766

# Submission time Handle Problem Language Result Execution time Memory
1113766 2024-11-17T11:33:50 Z EfeBabagil Sprinklers (CEOI24_sprinklers) C++14
3 / 100
 30 ms 1220 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int32_t main()
{
    int n,m;
    cin>>n>>m;
    vector<int> spr(n),flo(m);
    
    for(int i=0;i<n;i++)
    {
        cin>>spr[i];
    }
    int mn=LLONG_MAX;
    int mx=0;
    for(int i=0;i<m;i++)
    {
        cin>>flo[i];
        mn=min(mn,flo[i]);
        mx=max(mx,flo[i]);
    }
    if(spr[0]>=mx&&n==1)
    {
        cout<<spr[0]-mn;
        cout<<endl;
        cout<<"L";
    }
    else if(spr[0]<=mn&&n==1)
    {
        cout<<mx-spr[0];
        cout<<endl;
        cout<<"R";
    }
    else if(n==1){
    cout<<"-1";
    return 0;
    }
    if(n==1)
    return 0;
    int dif=0;
    for(int i=0;i<m;i++)
    {
        auto it= lower_bound(spr.begin(),spr.end(),flo[i]);
        if(*it==flo[i])
        continue;
        if(it!=spr.end())
        dif=max(dif,abs(*it-flo[i]));
        if(it!=spr.begin())
        {
            it--;
            dif=max(dif,abs(*it-flo[i]));
        }
    }
    
    cout<<dif<<endl;
    for(int i=0;i<n;i++)
    {
        if(i%3)
        cout<<"R";
        else
        cout<<"L";
        
        
    }
    
    
    return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Correct 1 ms 336 KB Correct

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Correct 23 ms 848 KB Correct
3 Correct 1 ms 336 KB Correct
4 Correct 26 ms 1220 KB Correct
5 Correct 25 ms 1104 KB Correct
6 Correct 1 ms 336 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 6 ms 440 KB Correct
9 Correct 1 ms 504 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Incorrect 30 ms 1216 KB User solution is worse than jury's solution
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

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

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Incorrect 30 ms 1104 KB User solution is worse than jury's solution
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Correct 1 ms 336 KB Correct
3 Correct 23 ms 848 KB Correct
4 Correct 1 ms 336 KB Correct
5 Correct 26 ms 1220 KB Correct
6 Correct 25 ms 1104 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 1 ms 336 KB Correct
9 Correct 6 ms 440 KB Correct
10 Correct 1 ms 504 KB Correct
11 Incorrect 30 ms 1216 KB User solution is worse than jury's solution
12 Halted 0 ms 0 KB -