oj.uz

Submission #1067201

# Submission time Handle Problem Language Result Execution time Memory
1067201 2024-08-20T12:43:24 Z Unforgettablepl Abduction 2 (JOI17_abduction2) C++17
100 / 100
 1827 ms 143468 KB 
#pragma GCC optimize("Ofast","unroll-all-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int long long


int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int H,W,Q;
    cin >> H >> W >> Q;
    vector<int> A(H+1);
    vector liftmaxH(H+1,vector(16,0ll));
    for(int i=1;i<=H;i++) {
        cin>>A[i];
        liftmaxH[i][0]=A[i];
    }
    for(int bit=1;bit<16;bit++) {
        for(int i=1;i<=H;i++) {
            if(i+(1<<bit)-1>H)continue;
            liftmaxH[i][bit]=max(liftmaxH[i][bit-1],liftmaxH[i+(1<<(bit-1))][bit-1]);
        }
    }
    vector<int> B(W+1);
    vector liftmaxW(W+1,vector(16,0ll));
    for(int i=1;i<=W;i++){
        cin>>B[i];
        liftmaxW[i][0]=B[i];
    }
    for(int bit=1;bit<16;bit++) {
        for(int i=1;i<=W;i++) {
            if(i+(1<<bit)-1>W)continue;
            liftmaxW[i][bit]=max(liftmaxW[i][bit-1],liftmaxW[i+(1<<(bit-1))][bit-1]);
        }
    }
    vector visited(5,map<pair<int,int>,long long>());
    for(int i=1;i<=Q;i++) {
        int s,t;
        cin>>s>>t;
        long long bestans = 0;
        function<long long(int,int,int,int)> dfs = [&](int x,int y, int parx, int pary) {
            if(x<1 or x>H or y<1 or y>W)return -1ll;
            int pedge = 0;
            if(x>parx)pedge=1;
            else if(x<parx)pedge=2;
            else if(y>pary)pedge=3;
            else if(y<pary)pedge=4;
            if(visited[pedge].count({x,y}))return visited[pedge][{x,y}];
            long long ans=0;
            if(A[x]>B[y]) {
                if(x!=parx or y-1!=pary) {
                    int newy = y;
                    for(int bit=15;bit>=0;bit--) {
                        if(newy-(1<<bit)<=0)continue;
                        if(liftmaxW[newy-(1<<bit)+1][bit]<A[x]) {
                            newy-=(1<<bit);
                        }
                    }
                    if(newy!=y)ans = max(dfs(x,newy,x,newy+1)+y-newy,ans);
                }
                if(x!=parx or y+1!=pary) {
                    int newy = y;
                    for(int bit=15;bit>=0;bit--) {
                        if(newy+(1<<bit)>W)continue;
                        if(liftmaxW[newy][bit]<A[x]) {
                            newy+=(1<<bit);
                        }
                    }
                    if(newy!=y)ans = max(dfs(x,newy,x,newy-1)+newy-y,ans);
                }
            } else {
                if(x+1!=parx or y!=pary) {
                    int newx = x;
                    for(int bit=15;bit>=0;bit--) {
                        if(newx+(1<<bit)>H)continue;
                        if(liftmaxH[newx][bit]<B[y]) {
                            newx+=(1<<bit);
                        }
                    }
                    if(newx!=x)ans = max(dfs(newx,y,newx-1,y)+newx-x,ans);
                }
                if(x-1!=parx or y!=pary) {
                    int newx = x;
                    for(int bit=15;bit>=0;bit--) {
                        if(newx-(1<<bit)<=0)continue;
                        if(liftmaxH[newx-(1<<bit)+1][bit]<B[y]) {
                            newx-=(1<<bit);
                        }
                    }
                    if(newx!=x)ans = max(dfs(newx,y,newx+1,y)+x-newx,ans);
                }
            }
            return visited[pedge][{x,y}]=ans;
        };
        bestans = max(bestans,dfs(s,t,s,t));
        if(A[s]>B[t]) {
            bestans=max(bestans,dfs(s-1,t,s,t)+1);
            bestans=max(bestans,dfs(s+1,t,s,t)+1);
        } else {
            bestans=max(bestans,dfs(s,t-1,s,t)+1);
            bestans=max(bestans,dfs(s,t+1,s,t)+1);
        }
        cout << bestans << '\n';
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 22 ms 18268 KB Output is correct
24 Correct 22 ms 18212 KB Output is correct
25 Correct 25 ms 18144 KB Output is correct
26 Correct 21 ms 18268 KB Output is correct
27 Correct 22 ms 18264 KB Output is correct
28 Correct 45 ms 27732 KB Output is correct
29 Correct 25 ms 19544 KB Output is correct
30 Correct 74 ms 25684 KB Output is correct
31 Correct 89 ms 27732 KB Output is correct
32 Correct 24 ms 18264 KB Output is correct
33 Correct 35 ms 20564 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 2 ms 1112 KB Output is correct
4 Correct 2 ms 1116 KB Output is correct
5 Correct 2 ms 1248 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 4 ms 1628 KB Output is correct
9 Correct 4 ms 1624 KB Output is correct
10 Correct 4 ms 1588 KB Output is correct
11 Correct 4 ms 1628 KB Output is correct

Subtask #5
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 2 ms 1372 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 22 ms 18268 KB Output is correct
24 Correct 22 ms 18212 KB Output is correct
25 Correct 25 ms 18144 KB Output is correct
26 Correct 21 ms 18268 KB Output is correct
27 Correct 22 ms 18264 KB Output is correct
28 Correct 45 ms 27732 KB Output is correct
29 Correct 25 ms 19544 KB Output is correct
30 Correct 74 ms 25684 KB Output is correct
31 Correct 89 ms 27732 KB Output is correct
32 Correct 24 ms 18264 KB Output is correct
33 Correct 35 ms 20564 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 2 ms 1116 KB Output is correct
36 Correct 2 ms 1112 KB Output is correct
37 Correct 2 ms 1116 KB Output is correct
38 Correct 2 ms 1248 KB Output is correct
39 Correct 2 ms 1372 KB Output is correct
40 Correct 2 ms 1372 KB Output is correct
41 Correct 4 ms 1628 KB Output is correct
42 Correct 4 ms 1624 KB Output is correct
43 Correct 4 ms 1588 KB Output is correct
44 Correct 4 ms 1628 KB Output is correct
45 Correct 25 ms 18512 KB Output is correct
46 Correct 25 ms 18516 KB Output is correct
47 Correct 30 ms 18520 KB Output is correct
48 Correct 27 ms 18508 KB Output is correct
49 Correct 25 ms 18508 KB Output is correct
50 Correct 48 ms 26964 KB Output is correct
51 Correct 54 ms 27988 KB Output is correct
52 Correct 131 ms 29268 KB Output is correct
53 Correct 123 ms 28644 KB Output is correct
54 Correct 115 ms 28432 KB Output is correct
55 Correct 175 ms 34388 KB Output is correct
56 Correct 1827 ms 143468 KB Output is correct
57 Correct 409 ms 50772 KB Output is correct
58 Correct 392 ms 49232 KB Output is correct
59 Correct 399 ms 48980 KB Output is correct