oj.uz

답안 #1075395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075395 2024-08-26T05:27:13 Z ProtonDecay314 Sprinklers (CEOI24_sprinklers) C++17
3 / 100
 2000 ms 1640 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef set<ll> sll;
#define IOS cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false)
#define INF(dtype) numeric_limits<dtype>::max()
#define NINF(dtype) numeric_limits<dtype>::min()

typedef pair<int, vb> pib;

pib solve(int n, int m, const vi& s, const vi& f) {
    vb config(n, false);
    if(n == 1) {
        // Case 1: n == 1

        bool less_exists = false;
        bool greater_exists = false;

        int spos = s[0];

        int ans = 0;

        for(int fv : f) {
            if(fv < spos) {
                less_exists = true;
                ans = max(ans, spos - fv);
            } else if(fv > spos) {
                greater_exists = true;
                ans = max(ans, fv - spos);
            }
        }

        config[0] = greater_exists;

        if(less_exists && greater_exists) return {-1, config};
        return {ans, config};
    }
}

int main() {
    IOS;

    int n, m;
    cin >> n >> m;

    vi s(n, 0);
    vi f(m, 0);

    for(int& sv : s) cin >> sv;
    for(int& fv : f) cin >> fv;

    auto [ans, config] = solve(n, m, s, f);

    cout << ans << "\n";

    if(ans != -1) {
        for(const bool& b : config) cout << (b ? 'R' : 'L');
        cout << "\n";
    }
    cout << flush;

    return 0;
}

Compilation message

Main.cpp: In function 'pib solve(int, int, const vi&, const vi&)':
Main.cpp:21:23: warning: control reaches end of non-void function [-Wreturn-type]
   21 |     vb config(n, false);
      |                       ^

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 10 ms 800 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 8 ms 1608 KB Correct
5 Correct 9 ms 1640 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 604 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2041 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -