oj.uz

Submission #1072784

# Submission time Handle Problem Language Result Execution time Memory
1072784 2024-08-24T04:47:45 Z jer033 Sprinklers (CEOI24_sprinklers) C++17
3 / 100
 149 ms 3620 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> in_between;

bool possible(int K, vector<int> (&sprinks), vector<int> (&flowers))
{
    int N = sprinks.size();
    int M = flowers.size();
    int covered = -1;
    int towater = 0;
    int i = 0;
    while (i<N)
    {
        if (towater<M)
        {
            int loc = sprinks[i];
            if (flowers[towater]<loc)
            {
                if (flowers[towater] < (loc-K))
                    return 0;
                if (((i+1)<N) and (flowers[towater] >= (sprinks[i+1]-K)) and (in_between[i]>0))
                {
                    i++;
                    covered = loc+K;
                }
                else
                    covered = loc;
            }
            else
                covered = loc+K;

            while ((towater<M) and (flowers[towater]<=covered))
                towater++;
        }
        i++;
    }
    if (towater==M)
        return 1;
    return 0;
}

void report(int K, vector<int> (&sprinks), vector<int> (&flowers))
{
    cout << K << '\n';
    int N = sprinks.size();
    int M = flowers.size();
    int covered = -1;
    int towater = 0;
    int i = 0;
    while (i<N)
    {
        if (towater<M)
        {
            int loc = sprinks[i];
            if (flowers[towater]<loc)
            {
                if (((i+1)<N) and (flowers[towater] >= (sprinks[i+1]-K)) and (in_between[i]>0))
                {
                    i++;
                    covered = loc+K;
                    cout << "RL";
                }
                else
                {
                    covered = loc;
                    cout << 'L';
                }
            }
            else
            {
                covered = loc+K;
                cout << 'R';
            }

            while ((towater<M) and (flowers[towater]<=covered))
                towater++;
        }
        else
            cout << 'R';
        i++;
    }
    cout << '\n';
}

int main()
{
    int N, M;
    cin >> N >> M;
    vector<int> sprinks(N);
    vector<int> flowers(M);
    for (int i=0; i<N; i++)
        cin >> sprinks[i];
    for (int i=0; i<M; i++)
        cin >> flowers[i];
    if (N==1)
    {
        int left = flowers[0]-sprinks[0];
        int righ = flowers[M-1]-sprinks[0];
        if ((left<0) and (righ>0))
            cout << "-1\n";
        else
        {
            cout << max(abs(left), abs(righ)) << '\n';
            if (left<0)
                cout << "L\n";
            else
                cout << "R\n";
        }
    }
    else
    {
        in_between = vector<int> (N-1, 0);
        int curr = 0;
        for (int i=0; i<M; i++)
        {
            while (((curr+1)<N) and (flowers[i]>=sprinks[curr+1]))
                curr++;
            if (((curr+1)<N) and (flowers[i]>sprinks[curr]) and (flowers[i]<sprinks[curr+1]))
                in_between[curr]++;
        }

        bool tapos = 0;
        for (int guess = 0; guess<=8; guess++)
        {
            if ((!tapos) and possible(guess, sprinks, flowers))
            {
                report(guess, sprinks, flowers);
                tapos = 1;
            }
        }
        /*int lo = 0;
        int hi = 1'000'000'005;
        while (lo!=hi)
        {
            int mid = (lo+hi)/2;
            if (possible(mid, sprinks, flowers))
                hi = mid;
            else
                lo = mid+1;
        }
        report(lo, sprinks, flowers);*/
    }
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 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 1396 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 24 ms 1584 KB Correct
5 Correct 24 ms 1628 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 5 ms 692 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Correct
2 Incorrect 25 ms 1628 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Correct
2 Correct 0 ms 348 KB Correct
3 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Correct
2 Correct 27 ms 1884 KB Correct
3 Correct 56 ms 3544 KB Correct
4 Correct 56 ms 3412 KB Correct
5 Correct 55 ms 3540 KB Correct
6 Correct 59 ms 3492 KB Correct
7 Correct 53 ms 3412 KB Correct
8 Correct 149 ms 3620 KB Correct
9 Correct 52 ms 3408 KB Correct
10 Correct 54 ms 3408 KB Correct
11 Correct 52 ms 3412 KB Correct
12 Correct 1 ms 348 KB Correct
13 Correct 0 ms 344 KB Correct
14 Correct 27 ms 2224 KB Correct
15 Correct 29 ms 2224 KB Correct
16 Correct 27 ms 2132 KB Correct
17 Correct 34 ms 2108 KB Correct
18 Correct 28 ms 2392 KB Correct
19 Correct 32 ms 2640 KB Correct
20 Correct 44 ms 3156 KB Correct
21 Correct 53 ms 3120 KB Correct
22 Correct 41 ms 2900 KB Correct
23 Incorrect 38 ms 2900 KB Unexpected end of file - int32 expected
24 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 21 ms 1396 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 24 ms 1584 KB Correct
6 Correct 24 ms 1628 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 5 ms 692 KB Correct
10 Correct 0 ms 348 KB Correct
11 Incorrect 25 ms 1628 KB Unexpected end of file - int32 expected
12 Halted 0 ms 0 KB -