Submission #1067173

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067173		Unforgettablepl	Abduction 2 (JOI17_abduction2)	C++17	44 / 100	322 ms	105256 KiB

abduction2

#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,vector(H+1,map<int,int>()));
    for(int i=1;i<=Q;i++) {
        int s,t;
        cin>>s>>t;
        int bestans = 0;
        function<int(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 -1;
            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][x].count(y))return visited[pedge][x][y];
            int ans=0;
            if(A[x]>B[y]) {
                if(x!=parx or y-1!=pary) {
                    for(int bit=15;bit>=0;bit--) {
                        if(y-(1<<bit)<=0)continue;
                        if(liftmaxW[y-(1<<bit)+1][bit]<A[x]) {
                            ans = max(dfs(x,y-(1<<bit),x,y-(1<<bit)+1)+(1<<bit),ans);
                            break;
                        }
                    }
                }
                if(x!=parx or y+1!=pary) {
                    for(int bit=15;bit>=0;bit--) {
                        if(y+(1<<bit)>W)continue;
                        if(liftmaxW[y][bit]<A[x]) {
                            ans = max(dfs(x,y+(1<<bit),x,y+(1<<bit)-1)+(1<<bit),ans);
                            break;
                        }
                    }
                }
            } else {
                if(x+1!=parx or y!=pary) {
                    for(int bit=15;bit>=0;bit--) {
                        if(x+(1<<bit)>H)continue;
                        if(liftmaxH[x][bit]<B[y]) {
                            ans = max(dfs(x+(1<<bit),y,x+(1<<bit)-1,y)+(1<<bit),ans);
                            break;
                        }
                    }
                }
                if(x-1!=parx or y!=pary) {
                    for(int bit=15;bit>=0;bit--) {
                        if(x-(1<<bit)<=0)continue;
                        if(liftmaxH[x-(1<<bit)+1][bit]<B[y]) {
                            ans = max(dfs(x-(1<<bit),y,x-(1<<bit)+1,y)+(1<<bit),ans);
                            break;
                        }
                    }
                }
            }
            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 / 13
• Subtask 2: 10 / 10
• Subtask 3: 17 / 17
• Subtask 4: 4 / 4
• Subtask 5: 0 / 56