oj.uz

Submission #1039769

# Submission time Handle Problem Language Result Execution time Memory
1039769 2024-07-31T08:41:15 Z 변재우(#10994) Sprinklers (CEOI24_sprinklers) C++17
26 / 100
 103 ms 8020 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(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:32:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   32 |             while(i<=M && B[i].first<=A[j].first+K) i++; i--;
      |             ^~~~~
Main.cpp:32:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   32 |             while(i<=M && B[i].first<=A[j].first+K) i++; i--;
      |                                                          ^
Main.cpp:40:13: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   40 |             while(i<=M && B[i].first<=A[j].first) i++; i--;
      |             ^~~~~
Main.cpp:40:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   40 |             while(i<=M && B[i].first<=A[j].first) i++; i--;
      |                                                        ^
Main.cpp:48:17: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   48 |                 while(i<=M && B[i].first<=A[l].first+K) i++; i--;
      |                 ^~~~~
Main.cpp:48:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   48 |                 while(i<=M && B[i].first<=A[l].first+K) i++; i--;
      |                                                              ^
Main.cpp:53:17: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   53 |                 while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |                 ^~~~~
Main.cpp:53:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   53 |                 while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |                                                              ^
Main.cpp:59:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   59 |         while(i<=M && B[i].first<=A[r].first+K) i++; i--;
      |         ^~~~~
Main.cpp:59:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   59 |         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 348 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 13 ms 2908 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 16 ms 3604 KB Correct
5 Correct 11 ms 4956 KB Correct
6 Correct 0 ms 348 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 3 ms 2908 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 348 KB Correct
2 Correct 12 ms 2620 KB Correct
3 Correct 8 ms 600 KB Correct
4 Correct 103 ms 2908 KB Correct
5 Correct 101 ms 2904 KB Correct
6 Correct 0 ms 344 KB Correct
7 Correct 1 ms 2396 KB Correct
8 Correct 24 ms 2908 KB Correct
9 Correct 32 ms 2908 KB Correct
10 Correct 61 ms 3160 KB Correct
11 Correct 23 ms 1364 KB Correct
12 Correct 57 ms 2216 KB Correct
13 Correct 66 ms 2392 KB Correct
14 Correct 75 ms 4148 KB Correct
15 Correct 79 ms 4180 KB Correct
16 Correct 62 ms 4692 KB Correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 0 ms 348 KB Correct
4 Correct 1 ms 2392 KB Correct
5 Correct 1 ms 2392 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 Correct 0 ms 348 KB Correct
12 Correct 1 ms 2396 KB Correct
13 Correct 0 ms 344 KB Correct
14 Correct 0 ms 512 KB Correct
15 Correct 0 ms 348 KB Correct
16 Correct 1 ms 344 KB Correct
17 Correct 0 ms 344 KB Correct
18 Correct 0 ms 344 KB Correct
19 Correct 1 ms 600 KB Correct
20 Correct 1 ms 2396 KB Correct

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 16 ms 3672 KB Correct
3 Correct 48 ms 7888 KB Correct
4 Correct 47 ms 8020 KB Correct
5 Correct 45 ms 8016 KB Correct
6 Correct 51 ms 7908 KB Correct
7 Correct 51 ms 7960 KB Correct
8 Correct 51 ms 7872 KB Correct
9 Correct 49 ms 7760 KB Correct
10 Correct 51 ms 7768 KB Correct
11 Correct 47 ms 7876 KB Correct
12 Correct 0 ms 344 KB Correct
13 Correct 1 ms 2396 KB Correct
14 Correct 24 ms 3420 KB Correct
15 Correct 17 ms 3932 KB Correct
16 Correct 17 ms 3932 KB Correct
17 Correct 16 ms 5212 KB Correct
18 Correct 19 ms 3672 KB Correct
19 Correct 38 ms 3920 KB Correct
20 Correct 39 ms 7488 KB Correct
21 Correct 40 ms 7508 KB Correct
22 Correct 42 ms 6828 KB Correct
23 Incorrect 40 ms 6740 KB User solution is worse than jury's solution
24 Halted 0 ms 0 KB -

Subtask #5
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Correct
2 Correct 0 ms 348 KB Correct
3 Correct 13 ms 2908 KB Correct
4 Correct 0 ms 348 KB Correct
5 Correct 16 ms 3604 KB Correct
6 Correct 11 ms 4956 KB Correct
7 Correct 0 ms 348 KB Correct
8 Correct 0 ms 348 KB Correct
9 Correct 3 ms 2908 KB Correct
10 Correct 0 ms 348 KB Correct
11 Correct 12 ms 2620 KB Correct
12 Correct 8 ms 600 KB Correct
13 Correct 103 ms 2908 KB Correct
14 Correct 101 ms 2904 KB Correct
15 Correct 0 ms 344 KB Correct
16 Correct 1 ms 2396 KB Correct
17 Correct 24 ms 2908 KB Correct
18 Correct 32 ms 2908 KB Correct
19 Correct 61 ms 3160 KB Correct
20 Correct 23 ms 1364 KB Correct
21 Correct 57 ms 2216 KB Correct
22 Correct 66 ms 2392 KB Correct
23 Correct 75 ms 4148 KB Correct
24 Correct 79 ms 4180 KB Correct
25 Correct 62 ms 4692 KB Correct
26 Correct 0 ms 348 KB Correct
27 Correct 1 ms 2392 KB Correct
28 Correct 1 ms 2392 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 Correct 0 ms 348 KB Correct
35 Correct 1 ms 2396 KB Correct
36 Correct 0 ms 344 KB Correct
37 Correct 0 ms 512 KB Correct
38 Correct 0 ms 348 KB Correct
39 Correct 1 ms 344 KB Correct
40 Correct 0 ms 344 KB Correct
41 Correct 0 ms 344 KB Correct
42 Correct 1 ms 600 KB Correct
43 Correct 1 ms 2396 KB Correct
44 Correct 16 ms 3672 KB Correct
45 Correct 48 ms 7888 KB Correct
46 Correct 47 ms 8020 KB Correct
47 Correct 45 ms 8016 KB Correct
48 Correct 51 ms 7908 KB Correct
49 Correct 51 ms 7960 KB Correct
50 Correct 51 ms 7872 KB Correct
51 Correct 49 ms 7760 KB Correct
52 Correct 51 ms 7768 KB Correct
53 Correct 47 ms 7876 KB Correct
54 Correct 0 ms 344 KB Correct
55 Correct 1 ms 2396 KB Correct
56 Correct 24 ms 3420 KB Correct
57 Correct 17 ms 3932 KB Correct
58 Correct 17 ms 3932 KB Correct
59 Correct 16 ms 5212 KB Correct
60 Correct 19 ms 3672 KB Correct
61 Correct 38 ms 3920 KB Correct
62 Correct 39 ms 7488 KB Correct
63 Correct 40 ms 7508 KB Correct
64 Correct 42 ms 6828 KB Correct
65 Incorrect 40 ms 6740 KB User solution is worse than jury's solution
66 Halted 0 ms 0 KB -