oj.uz

Submission #1113750

# Submission time Handle Problem Language Result Execution time Memory
1113750 2024-11-17T10:23:00 Z EfeBabagil Sprinklers (CEOI24_sprinklers) C++14
3 / 100
 28 ms 2128 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)
    {
        cout<<spr[0]-mn;
        cout<<endl;
        cout<<"L";
    }
    else if(spr[0]<=mn)
    {
        cout<<mx-spr[0];
        cout<<endl;
        cout<<"R";
    }
    else
    cout<<"-1";
    return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Correct
2 Correct 21 ms 1872 KB Correct
3 Correct 1 ms 504 KB Correct
4 Correct 28 ms 1972 KB Correct
5 Correct 26 ms 2128 KB Correct
6 Correct 1 ms 336 KB Correct
7 Correct 1 ms 336 KB Correct
8 Correct 6 ms 592 KB Correct
9 Correct 1 ms 336 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 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 1 ms 336 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 1 ms 336 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 1 ms 336 KB User solution is worse than jury's solution
2 Halted 0 ms 0 KB -