oj.uz

답안 #241188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241188 2020-06-23T08:52:11 Z osaaateiasavtnl 유괴 2 (JOI17_abduction2) C++14
44 / 100
 147 ms 44048 KB 
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 1e5+7;

int a[N], b[N];

struct State {
    int x, y, t;
    int val() {
        if (t&1)
            return a[x];
        else
            return b[y];
    };
    bool operator <(State s) {
        return val() < s.val();
    }
};  

struct SegTree {

int mx[N << 2];
void build(int v, int tl, int tr, int a[N]) {
    if (tl == tr) {
        mx[v] = a[tl];
        return;
    }   
    int tm = (tl + tr) >> 1;
    build(v * 2 + 1, tl, tm, a);
    build(v * 2 + 2, tm + 1, tr, a);
    mx[v] = max(mx[v * 2 + 1], mx[v * 2 + 2]);
}   
int getl(int v, int tl, int tr, int l, int r, int x) {
    if (mx[v] <= x || tr < l || r < tl)
        return -1;
    if (tl == tr)
        return tl;
    int tm = (tl + tr) >> 1;
    int t = getl(v * 2 + 1, tl, tm, l, r, x);
    if (t != -1)
        return t;
    return getl(v * 2 + 2, tm + 1, tr, l, r, x);
}   
int getr(int v, int tl, int tr, int l, int r, int x) {
    if (mx[v] <= x || tr < l || r < tl)
        return -1;
    if (tl == tr)
        return tl;
    int tm = (tl + tr) >> 1;
    int t = getr(v * 2 + 2, tm + 1, tr, l, r, x);
    if (t != -1)    
        return t;
    return getr(v * 2 + 1, tl, tm, l, r, x);
}   

} dx, dy;  

int n, m, q;
map <int, int> dp[4][N];
int get(int x, int y, int t) {
    if (x < 0 || x >= n || y < 0 || y >= m) 
        return -1;

    if (dp[t][x].find(y) != dp[t][x].end())
        return dp[t][x][y];

    int &d = dp[t][x][y];
    d = 0;

    if (t&1) {
        if (t == 1) {
            int to = dy.getl(0, 0, m - 1, y, m - 1, a[x]);
            if (to == -1) {
                d = m - 1 - y;
            }
            else {
                d = max(d, get(x, to, 0));
                d = max(d, get(x, to, 2));
                d += to - y;
            }   
        }
        else {
            int to = dy.getr(0, 0, m - 1, 0, y, a[x]);
            if (to == -1) {
                d = y;
            }   
            else {
                d = max(d, get(x, to, 0));
                d = max(d, get(x, to, 2));
                d += y - to;
            }   
        }
    }   
    else {
        if (t == 2) {
            int to = dx.getl(0, 0, n - 1, x, n - 1, b[y]);
            if (to == -1) {
                d = n - 1 - x;
            }
            else {
                d = max(d, get(to, y, 1));
                d = max(d, get(to, y, 3));
                d += abs(x-to);
            }   
        }   
        else {
            int to = dx.getr(0, 0, n - 1, 0, x, b[y]);
            if (to == -1) {
                d = x;
            }   
            else {
                d = max(d, get(to, y, 1));
                d = max(d, get(to, y, 3));
                d += abs(x-to);
            }   
        }   
    }

    return d;
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    cin >> n >> m >> q;
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    for (int i = 0; i < m; ++i)
        cin >> b[i];
    
    dx.build(0, 0, n - 1, a);
    dy.build(0, 0, m - 1, b);

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

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19072 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 15 ms 19072 KB Output is correct
9 Correct 19 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19072 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 15 ms 19072 KB Output is correct
9 Correct 19 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19328 KB Output is correct
16 Correct 17 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19328 KB Output is correct
19 Correct 20 ms 19584 KB Output is correct
20 Correct 19 ms 19712 KB Output is correct
21 Correct 18 ms 19712 KB Output is correct
22 Correct 21 ms 19968 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19072 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 15 ms 19072 KB Output is correct
9 Correct 19 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19328 KB Output is correct
16 Correct 17 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19328 KB Output is correct
19 Correct 20 ms 19584 KB Output is correct
20 Correct 19 ms 19712 KB Output is correct
21 Correct 18 ms 19712 KB Output is correct
22 Correct 21 ms 19968 KB Output is correct
23 Correct 33 ms 20984 KB Output is correct
24 Correct 30 ms 20984 KB Output is correct
25 Correct 33 ms 21112 KB Output is correct
26 Correct 30 ms 20984 KB Output is correct
27 Correct 33 ms 20992 KB Output is correct
28 Correct 48 ms 30200 KB Output is correct
29 Correct 34 ms 22784 KB Output is correct
30 Correct 80 ms 31480 KB Output is correct
31 Correct 95 ms 34296 KB Output is correct
32 Correct 34 ms 22144 KB Output is correct
33 Correct 43 ms 24696 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19456 KB Output is correct
2 Correct 17 ms 19456 KB Output is correct
3 Correct 18 ms 19584 KB Output is correct
4 Correct 18 ms 19456 KB Output is correct
5 Correct 20 ms 19456 KB Output is correct
6 Correct 17 ms 19584 KB Output is correct
7 Correct 17 ms 19584 KB Output is correct
8 Correct 20 ms 19968 KB Output is correct
9 Correct 22 ms 19968 KB Output is correct
10 Correct 20 ms 19840 KB Output is correct
11 Correct 23 ms 19968 KB Output is correct

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 19200 KB Output is correct
2 Correct 19 ms 19200 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 16 ms 19200 KB Output is correct
5 Correct 16 ms 19072 KB Output is correct
6 Correct 15 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 15 ms 19072 KB Output is correct
9 Correct 19 ms 19200 KB Output is correct
10 Correct 16 ms 19200 KB Output is correct
11 Correct 16 ms 19200 KB Output is correct
12 Correct 16 ms 19200 KB Output is correct
13 Correct 16 ms 19200 KB Output is correct
14 Correct 16 ms 19200 KB Output is correct
15 Correct 16 ms 19328 KB Output is correct
16 Correct 17 ms 19200 KB Output is correct
17 Correct 18 ms 19200 KB Output is correct
18 Correct 16 ms 19328 KB Output is correct
19 Correct 20 ms 19584 KB Output is correct
20 Correct 19 ms 19712 KB Output is correct
21 Correct 18 ms 19712 KB Output is correct
22 Correct 21 ms 19968 KB Output is correct
23 Correct 33 ms 20984 KB Output is correct
24 Correct 30 ms 20984 KB Output is correct
25 Correct 33 ms 21112 KB Output is correct
26 Correct 30 ms 20984 KB Output is correct
27 Correct 33 ms 20992 KB Output is correct
28 Correct 48 ms 30200 KB Output is correct
29 Correct 34 ms 22784 KB Output is correct
30 Correct 80 ms 31480 KB Output is correct
31 Correct 95 ms 34296 KB Output is correct
32 Correct 34 ms 22144 KB Output is correct
33 Correct 43 ms 24696 KB Output is correct
34 Correct 18 ms 19456 KB Output is correct
35 Correct 17 ms 19456 KB Output is correct
36 Correct 18 ms 19584 KB Output is correct
37 Correct 18 ms 19456 KB Output is correct
38 Correct 20 ms 19456 KB Output is correct
39 Correct 17 ms 19584 KB Output is correct
40 Correct 17 ms 19584 KB Output is correct
41 Correct 20 ms 19968 KB Output is correct
42 Correct 22 ms 19968 KB Output is correct
43 Correct 20 ms 19840 KB Output is correct
44 Correct 23 ms 19968 KB Output is correct
45 Correct 34 ms 22016 KB Output is correct
46 Correct 33 ms 22008 KB Output is correct
47 Correct 33 ms 22016 KB Output is correct
48 Correct 33 ms 22016 KB Output is correct
49 Correct 34 ms 22008 KB Output is correct
50 Correct 51 ms 29048 KB Output is correct
51 Correct 51 ms 30072 KB Output is correct
52 Correct 120 ms 37368 KB Output is correct
53 Correct 129 ms 36728 KB Output is correct
54 Correct 116 ms 36216 KB Output is correct
55 Incorrect 147 ms 44048 KB Output isn't correct
56 Halted 0 ms 0 KB -