oj.uz

Submission #1036545

# Submission time Handle Problem Language Result Execution time Memory
1036545 2024-07-27T13:45:55 Z model_code Sprinklers (CEOI24_sprinklers) C++17
3 / 100
 28 ms 856 KB 
// Author: Robert Jaworski
#include <bits/stdc++.h>

using namespace std;

int main() {
    int N, M;
    cin >> N >> M;

    vector<int> s(N, 0), f(M, 0);
    for (auto&& x : s) {
        cin >> x;
    }
    for (auto&& x : f) {
        cin >> x;
    }

    if (N == 1) {
        if (s.back() <= f[0]) {
            cout << (f.back() - s.back()) << endl << "R" << endl;
        }
        else if (s[0] >= f.back()) {
            cout << (s[0] - f[0]) << endl << "L" << endl;
        }
        else {
            cout << -1 << endl;
        }
        return 0;
    }

    int K = max(f.back() - s[0], s[1] - f[0]);

    cout << K << endl << "RL";
    for (int x = 2; x < N; x++) {
        cout << 'L';
    }
    cout << endl;

    return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 21 ms 604 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 24 ms 600 KB Correct
5 Correct 24 ms 604 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 5 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Incorrect 28 ms 604 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 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Incorrect 0 ms 348 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 0 ms 344 KB Correct
2 Incorrect 27 ms 856 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 0 ms 344 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 21 ms 604 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 24 ms 600 KB Correct
6 Correct 24 ms 604 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 0 ms 344 KB Correct
9 Correct 5 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Incorrect 28 ms 604 KB User solution is worse than jury's solution
12 Halted 0 ms 0 KB -