oj.uz

답안 #1046166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046166 2024-08-06T10:52:50 Z c2zi6 Sprinklers (CEOI24_sprinklers) C++14
26 / 100
 2000 ms 2212 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<bool> VB;
typedef vector<VB> VVB;
 
bool checkcover(VI& a, VPI& ranges) {
    /* khamarem or erkusn el sortavorac en*/
    int i = 0;
    for (auto[L, R] : ranges) {
        if (a[i] < L) return false;
        while (i < a.size() && a[i] <= R) i++;
        if (i == a.size()) break;
    }
    return i == a.size();
}

void solve() {
    int n, m;
    cin >> n >> m;
    VI a(n);
    VI b(m);
    for (int& x : a) cin >> x;
    for (int& x : b) cin >> x;

    bool test2 = true;
    for (int i = 0; i < a.size(); i += 3) {
        if (i+2 >= a.size() || a[i] != a[i+1] || a[i] != a[i+2]) {
            test2 = false;
            break;
        }
    }
    
    function<bool(ll)> can;
    string ans(n, 'R');
    if (test2) {
        for (int i = 0; i < a.size(); i += 3) ans[i] = 'L';
        can = [&](ll d) {
            VPI ranges;
            for (int i = 0; i < a.size(); i += 3) {
                ranges.pb({a[i]-d, a[i]+d});
            }
            return checkcover(b, ranges);
        };
    } else {
        can = [&](ll d) {
            rep(s, 1<<n) {
                VPI ranges;
                rep(i, n) {
                    if (s & (1<<i)) {
                        ans[i] = 'L';
                        ranges.pb({a[i]-d, a[i]});
                    } else {
                        ans[i] = 'R';
                        ranges.pb({a[i], a[i]+d});
                    }
                }
                sort(all(ranges));
                if (checkcover(b, ranges)) return true;
            }
            return false;
        };
    }


    ll l = -1, r = 2e9;
    while (l + 1 < r) {
        ll m = (l + r) / 2;
        if (can(m)) r = m;
        else l = m;
    }
    if (r == 2e9) cout << -1 << endl;
    else {
        can(r);
        cout << r << endl;
        cout << ans << endl;
    }
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
	/*freopen("mincross.in", "r", stdin); */
	/*freopen("test.out", "w", stdout); */
	int t = 1;
	/*cin >> t; */
	while (t--) solve();
}

Compilation message

Main.cpp: In function 'bool checkcover(VI&, VPI&)':
Main.cpp:40:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |     for (auto[L, R] : ranges) {
      |              ^
Main.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         while (i < a.size() && a[i] <= R) i++;
      |                ~~^~~~~~~~~~
Main.cpp:43:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         if (i == a.size()) break;
      |             ~~^~~~~~~~~~~
Main.cpp:45:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     return i == a.size();
      |            ~~^~~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i = 0; i < a.size(); i += 3) {
      |                     ~~^~~~~~~~~~
Main.cpp:58:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         if (i+2 >= a.size() || a[i] != a[i+1] || a[i] != a[i+2]) {
      |             ~~~~^~~~~~~~~~~
Main.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (int i = 0; i < a.size(); i += 3) ans[i] = 'L';
      |                         ~~^~~~~~~~~~
Main.cpp: In lambda function:
Main.cpp:70:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for (int i = 0; i < a.size(); i += 3) {
      |                             ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct

Subtask #1
3.0 / 3.0

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

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 7 ms 856 KB Correct
3 Correct 2 ms 348 KB Correct
4 Correct 28 ms 2116 KB Correct
5 Correct 35 ms 2188 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 22 ms 2212 KB Correct
9 Correct 22 ms 2208 KB Correct
10 Correct 29 ms 2112 KB Correct
11 Correct 22 ms 1816 KB Correct
12 Correct 14 ms 1236 KB Correct
13 Correct 23 ms 1996 KB Correct
14 Correct 24 ms 2068 KB Correct
15 Correct 27 ms 2076 KB Correct
16 Correct 22 ms 2076 KB Correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 2 ms 348 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 4 ms 348 KB Correct
6 Correct 4 ms 348 KB Correct
7 Correct 2 ms 348 KB Correct
8 Correct 6 ms 456 KB Correct
9 Correct 6 ms 348 KB Correct
10 Correct 4 ms 460 KB Correct
11 Correct 4 ms 448 KB Correct
12 Correct 3 ms 348 KB Correct
13 Correct 3 ms 348 KB Correct
14 Correct 1 ms 348 KB Correct
15 Correct 2 ms 348 KB Correct
16 Correct 2 ms 344 KB Correct
17 Correct 3 ms 348 KB Correct
18 Correct 1 ms 348 KB Correct
19 Correct 0 ms 348 KB Correct
20 Correct 0 ms 348 KB Correct

Subtask #4
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Execution timed out 2059 ms 1360 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 5 ms 604 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 7 ms 860 KB Correct
6 Correct 6 ms 604 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 344 KB Correct
9 Correct 1 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 7 ms 856 KB Correct
12 Correct 2 ms 348 KB Correct
13 Correct 28 ms 2116 KB Correct
14 Correct 35 ms 2188 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 22 ms 2212 KB Correct
18 Correct 22 ms 2208 KB Correct
19 Correct 29 ms 2112 KB Correct
20 Correct 22 ms 1816 KB Correct
21 Correct 14 ms 1236 KB Correct
22 Correct 23 ms 1996 KB Correct
23 Correct 24 ms 2068 KB Correct
24 Correct 27 ms 2076 KB Correct
25 Correct 22 ms 2076 KB Correct
26 Correct 2 ms 348 KB Correct
27 Correct 0 ms 348 KB Correct
28 Correct 4 ms 348 KB Correct
29 Correct 4 ms 348 KB Correct
30 Correct 2 ms 348 KB Correct
31 Correct 6 ms 456 KB Correct
32 Correct 6 ms 348 KB Correct
33 Correct 4 ms 460 KB Correct
34 Correct 4 ms 448 KB Correct
35 Correct 3 ms 348 KB Correct
36 Correct 3 ms 348 KB Correct
37 Correct 1 ms 348 KB Correct
38 Correct 2 ms 348 KB Correct
39 Correct 2 ms 344 KB Correct
40 Correct 3 ms 348 KB Correct
41 Correct 1 ms 348 KB Correct
42 Correct 0 ms 348 KB Correct
43 Correct 0 ms 348 KB Correct
44 Execution timed out 2059 ms 1360 KB Time limit exceeded
45 Halted 0 ms 0 KB -