oj.uz

Submission #1070212

# Submission time Handle Problem Language Result Execution time Memory
1070212 2024-08-22T12:17:32 Z BigBadBully Sprinklers (CEOI24_sprinklers) C++17
9 / 100
 238 ms 14352 KB 
// Online C++ compiler to run C++ program online
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int,int>
pii bad = {-1,-1};
const int jonkler = 1e15;
signed main() {
    int n,m;
    cin >> n >> m;
    vector<int> a(n),b(m);
    for (int i = 0; i < n; i++)
        cin >> a[i];

    for (int i = 0; i < m; i++)
        cin >> b[i];
    set<int> as,bs;
    for (int i = 0; i < n; i++)
    {
        as.insert(a[i]);
    }
    for (int i = 0; i < m; i++)
        if (as.find(b[i]) == as.end())
            bs.insert(b[i]);
    vector<int> neu;
    for (int i : bs)
        neu.push_back(i);
    b = neu;
    auto solve = [&](int k)
    {
        queue<pii> all;
        int i = 0,  j = 0;
        
        while(i < n && j < m)
        {
            if (a[i] < b[j])
                all.push({a[i++],1});
            else 
                all.push({b[j++],0});
            
        }
       while (i<n) all.push({a[i++],1});
        while (j<m) all.push({b[j++],0});
        int prev = jonkler;
        int range = -1;
       
        while (all.size())
        {
            auto cur = all.front();
            if (cur.ss)
            {
                if (prev == jonkler)
                    range = cur.ff+k;
                else
                {
                    if (prev < cur.ff - k)
                    {
                        return 0;
                    }
                    else
                        prev = jonkler;
                }
            }
            else
            {
                if (cur.ff>range)
                prev = min(prev,cur.ff);
            }
            all.pop();
        }
        if (prev > range && prev != jonkler)
            return 0;
        return 1;
    };
    int l = 0, r = jonkler;
    while(r-l>1)
    {
        int mid = (l+r)/2;
        if (solve(mid))
            r = mid;
        else
            l = mid;
    }
    string ans;
    auto fillstr = [&](int k)
    {
        queue<pii> all;
        int i = 0,  j = 0;
        while(i < n && j < m)
        {
            if (a[i] < b[j])
                all.push({a[i++],1});
            else
                all.push({b[j++],0});
        }
       while (i<n) all.push({a[i++],1});
        while (j<m) all.push({b[j++],0});
        int prev = jonkler;
        int range = -1;
       
        while (all.size())
        {
            auto cur = all.front();
            if (cur.ss)
            {
                if (prev == jonkler)
                {
                    range = cur.ff+k;
                    ans.push_back('R');
                }
                else
                {
                    
                    prev = jonkler;
                    ans.push_back('L');
                }
            }
            else
            {
                if (cur.ff>range)
                prev = min(prev,cur.ff);
            }
            all.pop();
        }
        
    };
    if (r == jonkler)
        cout << "-1\n";
    else
    {
    if (solve(l))
    {
        cout << l << '\n';
        fillstr(l);
        cout << ans << '\n';
      
    }
    else
    {
        cout << r << '\n';
        fillstr(r);
         cout << ans << '\n';
    }
    }
    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 96 ms 6080 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 108 ms 8588 KB Correct
5 Correct 108 ms 8416 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 21 ms 2160 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 113 ms 6472 KB Correct
3 Correct 15 ms 1320 KB Correct
4 Correct 235 ms 14352 KB Correct
5 Correct 237 ms 14312 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 193 ms 8704 KB Correct
9 Correct 195 ms 9144 KB Correct
10 Correct 238 ms 12324 KB Correct
11 Correct 109 ms 5392 KB Correct
12 Correct 147 ms 10312 KB Correct
13 Correct 186 ms 9620 KB Correct
14 Correct 195 ms 10944 KB Correct
15 Correct 194 ms 11176 KB Correct
16 Correct 173 ms 8040 KB Correct

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 Correct 1 ms 348 KB Correct
4 Correct 1 ms 348 KB Correct
5 Incorrect 2 ms 348 KB User solution is worse than jury's solution
6 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 128 ms 6568 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 96 ms 6080 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 108 ms 8588 KB Correct
6 Correct 108 ms 8416 KB Correct
7 Correct 0 ms 344 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 21 ms 2160 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 113 ms 6472 KB Correct
12 Correct 15 ms 1320 KB Correct
13 Correct 235 ms 14352 KB Correct
14 Correct 237 ms 14312 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 0 ms 348 KB Correct
17 Correct 193 ms 8704 KB Correct
18 Correct 195 ms 9144 KB Correct
19 Correct 238 ms 12324 KB Correct
20 Correct 109 ms 5392 KB Correct
21 Correct 147 ms 10312 KB Correct
22 Correct 186 ms 9620 KB Correct
23 Correct 195 ms 10944 KB Correct
24 Correct 194 ms 11176 KB Correct
25 Correct 173 ms 8040 KB Correct
26 Correct 1 ms 348 KB Correct
27 Correct 1 ms 348 KB Correct
28 Incorrect 2 ms 348 KB User solution is worse than jury's solution
29 Halted 0 ms 0 KB -