oj.uz

답안 #1066243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066243 2024-08-19T16:54:35 Z Unforgettablepl 유괴 2 (JOI17_abduction2) C++17
13 / 100
 5000 ms 7764 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);
    for(int i=1;i<=H;i++)cin>>A[i];
    vector<int> B(W+1);
    for(int i=1;i<=W;i++)cin>>B[i];
    for(int i=1;i<=Q;i++) {
        int s,t;cin>>s>>t;
        int ans = 0;
        function<void(int,int,int,int&,int&)> dfs = [&](int x,int y,int dist,int &parx,int &pary) {
            if(x<1 or x>H or y<1 or y>W)return;
            ans=max(ans,dist);
            if(A[x]>B[y]) {
                if(x!=parx or y-1!=pary)dfs(x,y-1,dist+1,x,y);
                if(x!=parx or y+1!=pary)dfs(x,y+1,dist+1,x,y);
            } else {
                if(x+1!=parx or y!=pary)dfs(x+1,y,dist+1,x,y);
                if(x-1!=parx or y!=pary)dfs(x-1,y,dist+1,x,y);
            }
        };
        dfs(s,t,0,s,t);
        if(A[s]>B[t]) {
            dfs(s-1,t,1,s,t);
            dfs(s+1,t,1,s,t);
        } else {
            dfs(s,t-1,1,s,t);
            dfs(s,t+1,1,s,t);
        }
        cout << ans << '\n';
    }
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 3 ms 860 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 2 ms 1000 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 15 ms 860 KB Output is correct
19 Execution timed out 5094 ms 7764 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 3 ms 860 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 2 ms 1000 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 15 ms 860 KB Output is correct
19 Execution timed out 5094 ms 7764 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4009 ms 1396 KB Output is correct
2 Correct 2204 ms 1116 KB Output is correct
3 Correct 2780 ms 1260 KB Output is correct
4 Correct 3083 ms 1380 KB Output is correct
5 Correct 4180 ms 1492 KB Output is correct
6 Correct 2850 ms 1360 KB Output is correct
7 Correct 2570 ms 1460 KB Output is correct
8 Execution timed out 5071 ms 7252 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 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 3 ms 860 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 2 ms 1000 KB Output is correct
16 Correct 2 ms 876 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 15 ms 860 KB Output is correct
19 Execution timed out 5094 ms 7764 KB Time limit exceeded
20 Halted 0 ms 0 KB -