oj.uz

Submission #1039772

# Submission time Handle Problem Language Result Execution time Memory
1039772 2024-07-31T08:48:27 Z 변재우(#10994) Sprinklers (CEOI24_sprinklers) C++17
9 / 100
 98 ms 5968 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int Nmax=100010;
int N, M, ans=-1, Nt, Mt, At[Nmax], Bt[Nmax];
pair<int, int> A[Nmax], B[Nmax];
int X[Nmax];
char ret[Nmax];

bool chk(int K, bool op) {
    N=M=0, fill(X+1, X+Mt+1, 0);
    for(int i=1; i<=Nt; i++) {
        if(i>1 && At[i]==At[i-1]) {
            if(i==2 || At[i-1]!=At[i-2]) {
                N--;
                auto p=lower_bound(Bt+1, Bt+Mt+1, At[i]-K);
                auto q=upper_bound(Bt+1, Bt+Mt+1, At[i]+K);
                X[p-Bt]++, X[q-Bt]--;
                ret[i-1]='L', ret[i]='R';
            }
        }
        else A[++N]={At[i], i};
    }
    for(int i=1; i<=Mt; i++) {
        X[i]+=X[i-1];
        if(!X[i]) B[++M]={Bt[i], i};
    }
    for(int i=1, j=1; i<=M; i++) {
        if(j>N) return false;
        if(A[j].first<=B[i].first) {
            while(j<=N && A[j].first<B[i].first-K) j++;
            if(j>N) return false;
            if(A[j].first>B[i].first) continue;
            while(i<=M && B[i].first<=A[j].first+K) i++; i--;
            ret[A[j].second]='R';
            j++; continue;
        }
        int l=j, r=j;
        while(r<N && A[r+1].first<=B[i].first+K) ++r;
        if(A[l].first>B[i].first+K) return false;
        if(r-l+1==1) {
            while(i<=M && B[i].first<=A[j].first) i++; i--;
            ret[A[j].second]='L';
            j++;
            continue;
        }
        if(r-l+1==2) {
            auto p=upper_bound(B+1, B+M+1, make_pair(A[l].first, (int)INT_MAX));
            if(p<=B+M && (*p).first<A[r].first) {
                while(i<=M && B[i].first<=A[l].first+K) i++; i--;
                ret[A[j].second]='R', ret[A[j+1].second]='L';
                j+=2; continue;
            }
            else {
                while(i<=M && B[i].first<=A[r].first+K) i++; i--;
                ret[A[j].second]='L', ret[A[j+1].second]='R';
                j+=2; continue;
            }
        }
        ret[A[l].second]='R', ret[A[l+1].second]='L', ret[A[r].second]='R';
        while(i<=M && B[i].first<=A[r].first+K) i++; i--;
        j=r+1;
    }
    if(op) for(int i=1; i<=Nt; i++) cout<<ret[i];
    return true;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>Nt>>Mt;
    for(int i=1; i<=Nt; i++) cin>>At[i];
    for(int i=1; i<=Mt; i++) cin>>Bt[i];
    fill(ret+1, ret+Nt+1, 'L');
    for(int s=0, e=1e9; s<=e; ) {
        int mid=(s+e)/2;
        if(chk(mid, false)) ans=mid, e=mid-1;
        else s=mid+1;
    }
    if(ans>=0) cout<<ans<<"\n", chk(ans, true);
    else cout<<-1;
    return 0;
}

Compilation message

Main.cpp: In function 'bool chk(long long int, bool)':
Main.cpp:35:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   35 |             while(i<=M && B[i].first<=A[j].first+K) i++; i--;
      |             ^~~~~
Main.cpp:35:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   35 |             while(i<=M && B[i].first<=A[j].first+K) i++; i--;
      |                                                          ^
Main.cpp:43:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   43 |             while(i<=M && B[i].first<=A[j].first) i++; i--;
      |             ^~~~~
Main.cpp:43:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   43 |             while(i<=M && B[i].first<=A[j].first) i++; i--;
      |                                                        ^
Main.cpp:51:17: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   51 |                 while(i<=M && B[i].first<=A[l].first+K) i++; i--;
      |                 ^~~~~
Main.cpp:51:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   51 |                 while(i<=M && B[i].first<=A[l].first+K) i++; i--;
      |                                                              ^
Main.cpp:56:17: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   56 |                 while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |                 ^~~~~
Main.cpp:56:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   56 |                 while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |                                                              ^
Main.cpp:62:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   62 |         while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |         ^~~~~
Main.cpp:62:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   62 |         while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |                                                      ^

Subtask #0
0.0 / 0.0

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Correct
2 Correct 10 ms 2844 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 12 ms 3420 KB Correct
5 Correct 11 ms 3580 KB Correct
6 Correct 1 ms 2392 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 2 ms 860 KB Correct
9 Correct 0 ms 348 KB Correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Correct
2 Correct 11 ms 2652 KB Correct
3 Correct 8 ms 2652 KB Correct
4 Correct 98 ms 4688 KB Correct
5 Correct 95 ms 2904 KB Correct
6 Correct 1 ms 344 KB Correct
7 Correct 0 ms 2396 KB Correct
8 Correct 21 ms 4756 KB Correct
9 Correct 30 ms 2908 KB Correct
10 Correct 43 ms 3160 KB Correct
11 Correct 22 ms 1360 KB Correct
12 Correct 47 ms 3820 KB Correct
13 Correct 65 ms 2400 KB Correct
14 Correct 74 ms 2512 KB Correct
15 Correct 90 ms 4148 KB Correct
16 Correct 74 ms 2896 KB Correct

Subtask #3
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Correct
2 Correct 0 ms 344 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 0 ms 392 KB Correct
5 Correct 0 ms 348 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 0 ms 348 KB Correct
10 Correct 0 ms 348 KB Correct
11 Incorrect 0 ms 348 KB User solution is incorrect
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Correct
2 Correct 17 ms 3672 KB Correct
3 Incorrect 44 ms 5968 KB User solution is incorrect
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Correct
2 Correct 0 ms 344 KB Correct
3 Correct 10 ms 2844 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 12 ms 3420 KB Correct
6 Correct 11 ms 3580 KB Correct
7 Correct 1 ms 2392 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 2 ms 860 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 11 ms 2652 KB Correct
12 Correct 8 ms 2652 KB Correct
13 Correct 98 ms 4688 KB Correct
14 Correct 95 ms 2904 KB Correct
15 Correct 1 ms 344 KB Correct
16 Correct 0 ms 2396 KB Correct
17 Correct 21 ms 4756 KB Correct
18 Correct 30 ms 2908 KB Correct
19 Correct 43 ms 3160 KB Correct
20 Correct 22 ms 1360 KB Correct
21 Correct 47 ms 3820 KB Correct
22 Correct 65 ms 2400 KB Correct
23 Correct 74 ms 2512 KB Correct
24 Correct 90 ms 4148 KB Correct
25 Correct 74 ms 2896 KB Correct
26 Correct 0 ms 348 KB Correct
27 Correct 0 ms 392 KB Correct
28 Correct 0 ms 348 KB Correct
29 Correct 0 ms 348 KB Correct
30 Correct 0 ms 348 KB Correct
31 Correct 0 ms 348 KB Correct
32 Correct 0 ms 348 KB Correct
33 Correct 0 ms 348 KB Correct
34 Incorrect 0 ms 348 KB User solution is incorrect
35 Halted 0 ms 0 KB -