oj.uz

Submission #551939

# Submission time Handle Problem Language Result Execution time Memory
551939 2022-04-21T23:05:43 Z Lobo Abduction 2 (JOI17_abduction2) C++17
44 / 100
 234 ms 103284 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
// #define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 5e4+10;

int n, m, q, a[maxn], b[maxn];
map<int,int> mark[maxn][5], dp[maxn][5];
pair<int,int> mxalf[maxn][25], mxarg[maxn][25], mxblf[maxn][25], mxbrg[maxn][25];

//ver com 32 tambem
int mxblr(int l, int r) {
    if(l > r) return -1;
    int lg = 31-__builtin_clz(r-l+1);
    auto ans = max(mxbrg[l][lg],mxblf[r][lg]);
    return ans.fr;
}
int mxalr(int l, int r) {
    if(l > r) return -1;
    int lg = 31-__builtin_clz(r-l+1);
    auto ans = max(mxarg[l][lg],mxalf[r][lg]);
    return ans.fr;
}
    
//0 -> x aumenta, 1 -> x diminui e dobra para vertical
//2 -> y aumenta, 3 -> y diminui
//x -> M e y-> N
int cnt = 0;
int sol(int y, int x, int dir) {
    if(mark[y][dir][x]) return dp[y][dir][x];
    mark[y][dir][x] = 1;


    if(dir == 0) {
        //vou para um (x1,y) que b[x1] > a[y] e x1 > x
        if(mxblr(x+1,m) < a[y]) {
            return dp[y][dir][x] = m-x;
        }

        int l = x+1;
        int r = m;
        int ans = -1;

        while(l <= r) {
            int mid = (l+r)/2;

            if(mxblr(x+1,mid) >= a[y]) {
                ans = mid;
                r = mid-1;
            }
            else {
                l = mid+1;
            }
        }

        return dp[y][dir][x] = ans-x+max(sol(y,ans,2),sol(y,ans,3));
    }
    else if(dir == 1) {
        //vou para um (x1,y) que b[x1] > a[y] e x1 < x
        if(mxblr(1,x-1) < a[y]) {
            return dp[y][dir][x] = x-1;
        }

        int l = 1;
        int r = x-1;
        int ans = -1;

        while(l <= r) {
            int mid = (l+r)/2;

            if(mxblr(mid,x-1) >= a[y]) {
                ans = mid;
                l = mid+1;
            }
            else {
                r = mid-1;
            }
        }

        return dp[y][dir][x] = x-ans+max(sol(y,ans,2),sol(y,ans,3));
    }
    else if(dir == 2) {
        //vou para um (x,y1) que a[y1] > b[x] e y1 > y
        if(mxalr(y+1,n) < b[x]) {
            return dp[y][dir][x] = n-y;
        }

        int l = y+1;
        int r = n;
        int ans = -1;

        while(l <= r) {
            int mid = (l+r)/2;

            if(mxalr(y+1,mid) >= b[x]) {
                ans = mid;
                r = mid-1;
            }
            else {
                l = mid+1;
            }
        }

        return dp[y][dir][x] = ans-y+max(sol(ans,x,0),sol(ans,x,1));
    }
    else {
        //vou para um (x,y1) que a[y1] > b[x] e y1 < y
        if(mxalr(1,y-1) < b[x]) {
            return dp[y][dir][x] = y-1;
        }

        int l = 1;
        int r = y-1;
        int ans = -1;

        while(l <= r) {
            int mid = (l+r)/2;

            if(mxalr(mid,y-1) >= b[x]) {
                ans = mid;
                l = mid+1;
            }
            else {
                r = mid-1;
            }
        }

        return dp[y][dir][x] = y-ans+max(sol(ans,x,0),sol(ans,x,1));
    }
}



void solve() {
    cin >> n >> m >> q;

    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        mxalf[i][0] = mxarg[i][0] = mp(a[i],i);
    }
    for(int i = 1; i <= m; i++) {
        cin >> b[i];
        mxblf[i][0] = mxbrg[i][0] = mp(b[i],i);
    }

    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= n; i++) {
            mxalf[i][pt] = max(mxalf[i][pt-1],mxalf[max(1,i-(1<<(pt-1)))][pt-1]);
        }
    }

    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= n; i++) {
            mxarg[i][pt] = max(mxarg[i][pt-1],mxarg[min(n,i+(1<<(pt-1)))][pt-1]);
        }
    }

    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= m; i++) {
            mxblf[i][pt] = max(mxblf[i][pt-1],mxblf[max(1,i-(1<<(pt-1)))][pt-1]);
        }
    }

    for(int pt = 1; pt <= 20; pt++) {
        for(int i = 1; i <= m; i++) {
            mxbrg[i][pt] = max(mxbrg[i][pt-1],mxbrg[min(m,i+(1<<(pt-1)))][pt-1]);
        }
    }

    while(q--) {
        int y,x;
        cin >> y >> x;
        cout << max({sol(y,x,0),sol(y,x,1),sol(y,x,2),sol(y,x,3)}) << endl;
    }

}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23844 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23768 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 14 ms 23852 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 13 ms 23844 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23844 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23768 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 14 ms 23852 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 13 ms 23844 KB Output is correct
12 Correct 14 ms 25428 KB Output is correct
13 Correct 14 ms 25396 KB Output is correct
14 Correct 13 ms 25428 KB Output is correct
15 Correct 15 ms 25428 KB Output is correct
16 Correct 14 ms 25496 KB Output is correct
17 Correct 14 ms 25428 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 16 ms 25928 KB Output is correct
20 Correct 16 ms 26132 KB Output is correct
21 Correct 17 ms 25940 KB Output is correct
22 Correct 19 ms 26544 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23844 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23768 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 14 ms 23852 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 13 ms 23844 KB Output is correct
12 Correct 14 ms 25428 KB Output is correct
13 Correct 14 ms 25396 KB Output is correct
14 Correct 13 ms 25428 KB Output is correct
15 Correct 15 ms 25428 KB Output is correct
16 Correct 14 ms 25496 KB Output is correct
17 Correct 14 ms 25428 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 16 ms 25928 KB Output is correct
20 Correct 16 ms 26132 KB Output is correct
21 Correct 17 ms 25940 KB Output is correct
22 Correct 19 ms 26544 KB Output is correct
23 Correct 74 ms 63220 KB Output is correct
24 Correct 57 ms 63328 KB Output is correct
25 Correct 54 ms 63316 KB Output is correct
26 Correct 62 ms 63328 KB Output is correct
27 Correct 73 ms 63308 KB Output is correct
28 Correct 89 ms 73164 KB Output is correct
29 Correct 65 ms 64736 KB Output is correct
30 Correct 128 ms 79340 KB Output is correct
31 Correct 151 ms 83916 KB Output is correct
32 Correct 64 ms 63668 KB Output is correct
33 Correct 90 ms 68196 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25940 KB Output is correct
2 Correct 17 ms 25944 KB Output is correct
3 Correct 16 ms 25916 KB Output is correct
4 Correct 16 ms 25940 KB Output is correct
5 Correct 17 ms 25940 KB Output is correct
6 Correct 16 ms 25992 KB Output is correct
7 Correct 17 ms 25936 KB Output is correct
8 Correct 22 ms 26640 KB Output is correct
9 Correct 24 ms 26640 KB Output is correct
10 Correct 17 ms 26564 KB Output is correct
11 Correct 19 ms 26864 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23844 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 11 ms 23768 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 14 ms 23852 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 13 ms 23844 KB Output is correct
12 Correct 14 ms 25428 KB Output is correct
13 Correct 14 ms 25396 KB Output is correct
14 Correct 13 ms 25428 KB Output is correct
15 Correct 15 ms 25428 KB Output is correct
16 Correct 14 ms 25496 KB Output is correct
17 Correct 14 ms 25428 KB Output is correct
18 Correct 14 ms 25428 KB Output is correct
19 Correct 16 ms 25928 KB Output is correct
20 Correct 16 ms 26132 KB Output is correct
21 Correct 17 ms 25940 KB Output is correct
22 Correct 19 ms 26544 KB Output is correct
23 Correct 74 ms 63220 KB Output is correct
24 Correct 57 ms 63328 KB Output is correct
25 Correct 54 ms 63316 KB Output is correct
26 Correct 62 ms 63328 KB Output is correct
27 Correct 73 ms 63308 KB Output is correct
28 Correct 89 ms 73164 KB Output is correct
29 Correct 65 ms 64736 KB Output is correct
30 Correct 128 ms 79340 KB Output is correct
31 Correct 151 ms 83916 KB Output is correct
32 Correct 64 ms 63668 KB Output is correct
33 Correct 90 ms 68196 KB Output is correct
34 Correct 16 ms 25940 KB Output is correct
35 Correct 17 ms 25944 KB Output is correct
36 Correct 16 ms 25916 KB Output is correct
37 Correct 16 ms 25940 KB Output is correct
38 Correct 17 ms 25940 KB Output is correct
39 Correct 16 ms 25992 KB Output is correct
40 Correct 17 ms 25936 KB Output is correct
41 Correct 22 ms 26640 KB Output is correct
42 Correct 24 ms 26640 KB Output is correct
43 Correct 17 ms 26564 KB Output is correct
44 Correct 19 ms 26864 KB Output is correct
45 Correct 71 ms 64096 KB Output is correct
46 Correct 82 ms 64052 KB Output is correct
47 Correct 92 ms 64228 KB Output is correct
48 Correct 68 ms 64224 KB Output is correct
49 Correct 61 ms 64140 KB Output is correct
50 Correct 93 ms 73816 KB Output is correct
51 Correct 112 ms 74848 KB Output is correct
52 Correct 209 ms 92080 KB Output is correct
53 Correct 199 ms 90436 KB Output is correct
54 Correct 181 ms 88932 KB Output is correct
55 Incorrect 234 ms 103284 KB Output isn't correct
56 Halted 0 ms 0 KB -