oj.uz

답안 #403790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403790 2021-05-13T12:59:01 Z donghwa722 유괴 2 (JOI17_abduction2) C++14
0 / 100
 360 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<pair<int,int>,int> piii;
map<piii,ll> dp;
int A[50010],B[50010];
int a1[50010][17],a2[50010][17],b1[50010][17],b2[50010][17];
int h,w,q;

ll dfs(int a,int b,int d){
    if(dp.find({{a,b},d})!=dp.end()) return dp[{{a,b},d}];
    int c=(d>=2?A[a]:B[b]);
    if(d==0){
        int x=a+1;
        for(int i=16;i>=0;i--){
            if(x>=h) break;
            if(a1[x][i]<c) x+=(1<<i);
        }
        if(x>=h) return dp[{{a,b},d}]=h-1-a;
        return dp[{{a,b},d}]=max(dfs(x,b,2),dfs(x,b,3))+x-a;
    }
    else if(d==1){
        int x=h-a;
        for(int i=16;i>=0;i--){
            if(x>=h) break;
            if(a2[x][i]<c) x+=(1<<i);
        }
        if(x>=h) return dp[{{a,b},d}]=a;
        return dp[{{a,b},d}]=max(dfs(x,b,2),dfs(x,b,3))+a-(h-1-x);
    }
    else if(d==2){
        int x=b+1;
        for(int i=16;i>=0;i--){
            if(x>=w) break;
            if(b1[x][i]<c) x+=(1<<i);
        }
        if(x>=w) return dp[{{a,b},d}]=w-1-b;
        return dp[{{a,b},d}]=max(dfs(a,x,0),dfs(a,x,1))+x-b;
    }
    else{
        int x=w-b;
        for(int i=16;i>=0;i--){
            if(x>=w) break;
            if(b2[x][i]<c) x+=(1<<i);
        }
        if(x>=w) return dp[{{a,b},d}]=b;
        return dp[{{a,b},d}]=max(dfs(a,x,0),dfs(a,x,1))+b-(w-1-x);
    }
}

int main()
{
    scanf("%d %d %d",&h,&w,&q);
    for(int i=0;i<h;i++){scanf("%d",&A[i]); a1[i][0]=a2[h-1-i][0]=A[i];}
    for(int i=0;i<w;i++){scanf("%d",&B[i]); b1[i][0]=b2[w-1-i][0]=B[i];}
    for(int i=1;i<17;i++){
        for(int j=0;j<h;j++){
            a1[j][i]=max(a1[j][i-1],a1[min(j+(1<<(i-1)),h)][i-1]);
            a2[j][i]=max(a2[j][i-1],a2[min(j+(1<<(i-1)),h)][i-1]);
        }
        for(int j=0;j<w;j++){
            b1[j][i]=max(b1[j][i-1],b1[min(j+(1<<(i-1)),w)][i-1]);
            b2[j][i]=max(b2[j][i-1],b2[min(j+(1<<(i-1)),w)][i-1]);
        }
    }
    for(int i=0;i<q;i++){
        int a,b; scanf("%d %d",&a,&b);
        ll re=0;
        for(int j=0;j<4;j++) re=max(re,dfs(a-1,b-1,j));
        printf("%lld\n",re);
    }
    return 0;
}

Compilation message

abduction2.cpp: In function 'int main()':
abduction2.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d %d %d",&h,&w,&q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:54:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     for(int i=0;i<h;i++){scanf("%d",&A[i]); a1[i][0]=a2[h-1-i][0]=A[i];}
      |                          ~~~~~^~~~~~~~~~~~
abduction2.cpp:55:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     for(int i=0;i<w;i++){scanf("%d",&B[i]); b1[i][0]=b2[w-1-i][0]=B[i];}
      |                          ~~~~~^~~~~~~~~~~~
abduction2.cpp:67:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         int a,b; scanf("%d %d",&a,&b);
      |                  ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 358 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 358 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 358 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 360 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 358 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -