답안 #308406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308406	2020-10-01T05:43:54 Z	thecodingwizard	유괴 2 (JOI17_abduction2)	C++11	44 / 100	426 ms	35192 KB

abduction2

#include <bits/stdc++.h>

using namespace std;

#define ii pair<int, int>
#define f first
#define s second
#define mp make_pair

int h, w, q; 
int A[50000], B[50000];
int stH[16][50000];
int stW[16][50000];

int rmq(const int st[16][50000], int L, int R) {
    int maxLen = 31 - __builtin_clz(R-L+1);
    return max(st[maxLen][L], st[maxLen][R - (1 << maxLen)+1]);
}

map<pair<int, ii>, int> memo;
int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};
int dp(int i, int j, int d) {
    auto memoIdx = mp(i, mp(j, d));
    if (memo.count(memoIdx)) {
        return memo[memoIdx];
    }

    int maxTravel;
    if (d == 0) maxTravel = i;
    else if (d == 1) maxTravel = w-j-1;
    else if (d == 2) maxTravel = h-i-1;
    else if (d == 3) maxTravel = j;

    int ans = 0;
    int lo = 1, hi = maxTravel+1, mid, k = 0;
    while (lo < hi) {
        mid = (lo + hi)/2;
        int a = i + dx[d]*mid, b = j + dy[d]*mid;
        if (a < 0 || a >= h || b < 0 || b >= w) {
            hi = mid;
            continue;
        }
        if (d == 0 || d == 2) {
            if (rmq(stH, min(i+dx[d], a), max(i+dx[d], a)) > B[j]) {
                k = mid;
                hi = mid;
            } else {
                lo = mid + 1;
            }
        }
        if (d == 1 || d == 3) {
            if (rmq(stW, min(j+dy[d], b), max(j+dy[d], b)) > A[i]) {
                k = mid;
                hi = mid;
            } else {
                lo = mid + 1;
            }
        }
    }

    if (k > 0) {
        ans += k;
        int a = i + dx[d]*k, b = j + dy[d]*k;
        if (d == 0 || d == 2) {
            ans += max(dp(a, b, 1), dp(a, b, 3));
        }
        if (d == 1 || d == 3) {
            ans += max(dp(a, b, 0), dp(a, b, 2));
        }
    } else {
        ans += maxTravel;
    }

    return memo[memoIdx] = ans;
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cin >> h >> w >> q;
    for (int i = 0; i < h; i++) cin >> A[i];
    for (int i = 0; i < w; i++) cin >> B[i];

    for (int i = 0; i < h; i++) {
        stH[0][i] = A[i];
    }
    for (int len = 1; len < 16; len++) {
        for (int i = 0; i <= h - (1 << len); i++) {
            stH[len][i] = max(stH[len-1][i], stH[len-1][i + (1<<(len-1))]);
        }
    }
    for (int i = 0; i < w; i++) {
        stW[0][i] = B[i];
    }
    for (int len = 1; len < 16; len++) {
        for (int i = 0; i <= w - (1 << len); i++) {
            stW[len][i] = max(stW[len-1][i], stW[len-1][i + (1<<(len-1))]);
        }
    }

    for (int i = 0; i < q; i++) {
        int s, t; cin >> s >> t; --s; --t;
        int best = 0;
        for (int j = 0; j < 4; j++) {
            best = max(best, dp(s, t, j));
        }
        cout << best << "\n";
    }

    return 0;
}

Compilation message

abduction2.cpp: In function 'int dp(int, int, int)':
abduction2.cpp:29:9: warning: 'maxTravel' may be used uninitialized in this function [-Wmaybe-uninitialized]
   29 |     int maxTravel;
      |         ^~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	2 ms	640 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	1 ms	640 KB	Output is correct
15	Correct	1 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	5 ms	1024 KB	Output is correct
20	Correct	6 ms	1152 KB	Output is correct
21	Correct	5 ms	1024 KB	Output is correct
22	Correct	10 ms	1536 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	2 ms	640 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	1 ms	640 KB	Output is correct
15	Correct	1 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	5 ms	1024 KB	Output is correct
20	Correct	6 ms	1152 KB	Output is correct
21	Correct	5 ms	1024 KB	Output is correct
22	Correct	10 ms	1536 KB	Output is correct
23	Correct	16 ms	6528 KB	Output is correct
24	Correct	16 ms	6528 KB	Output is correct
25	Correct	21 ms	6520 KB	Output is correct
26	Correct	16 ms	6528 KB	Output is correct
27	Correct	16 ms	6528 KB	Output is correct
28	Correct	51 ms	14712 KB	Output is correct
29	Correct	22 ms	8704 KB	Output is correct
30	Correct	137 ms	19072 KB	Output is correct
31	Correct	178 ms	22428 KB	Output is correct
32	Correct	23 ms	8064 KB	Output is correct
33	Correct	58 ms	11000 KB	Output is correct

Subtask #4
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	1024 KB	Output is correct
2	Correct	5 ms	1024 KB	Output is correct
3	Correct	5 ms	1024 KB	Output is correct
4	Correct	6 ms	1024 KB	Output is correct
5	Correct	5 ms	896 KB	Output is correct
6	Correct	4 ms	1024 KB	Output is correct
7	Correct	3 ms	1024 KB	Output is correct
8	Correct	10 ms	1536 KB	Output is correct
9	Correct	11 ms	1536 KB	Output is correct
10	Correct	10 ms	1408 KB	Output is correct
11	Correct	12 ms	1664 KB	Output is correct

Subtask #5
0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	2 ms	640 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	1 ms	640 KB	Output is correct
15	Correct	1 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	5 ms	1024 KB	Output is correct
20	Correct	6 ms	1152 KB	Output is correct
21	Correct	5 ms	1024 KB	Output is correct
22	Correct	10 ms	1536 KB	Output is correct
23	Correct	16 ms	6528 KB	Output is correct
24	Correct	16 ms	6528 KB	Output is correct
25	Correct	21 ms	6520 KB	Output is correct
26	Correct	16 ms	6528 KB	Output is correct
27	Correct	16 ms	6528 KB	Output is correct
28	Correct	51 ms	14712 KB	Output is correct
29	Correct	22 ms	8704 KB	Output is correct
30	Correct	137 ms	19072 KB	Output is correct
31	Correct	178 ms	22428 KB	Output is correct
32	Correct	23 ms	8064 KB	Output is correct
33	Correct	58 ms	11000 KB	Output is correct
34	Correct	6 ms	1024 KB	Output is correct
35	Correct	5 ms	1024 KB	Output is correct
36	Correct	5 ms	1024 KB	Output is correct
37	Correct	6 ms	1024 KB	Output is correct
38	Correct	5 ms	896 KB	Output is correct
39	Correct	4 ms	1024 KB	Output is correct
40	Correct	3 ms	1024 KB	Output is correct
41	Correct	10 ms	1536 KB	Output is correct
42	Correct	11 ms	1536 KB	Output is correct
43	Correct	10 ms	1408 KB	Output is correct
44	Correct	12 ms	1664 KB	Output is correct
45	Correct	27 ms	8056 KB	Output is correct
46	Correct	25 ms	8184 KB	Output is correct
47	Correct	25 ms	8080 KB	Output is correct
48	Correct	25 ms	8064 KB	Output is correct
49	Correct	24 ms	8056 KB	Output is correct
50	Correct	60 ms	15472 KB	Output is correct
51	Correct	64 ms	16376 KB	Output is correct
52	Correct	239 ms	27408 KB	Output is correct
53	Correct	239 ms	26616 KB	Output is correct
54	Correct	231 ms	25540 KB	Output is correct
55	Incorrect	426 ms	35192 KB	Output isn't correct
56	Halted	0 ms	0 KB	-

답안 #308406

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 10.0 / 10.0

Subtask #3 17.0 / 17.0

Subtask #4 4.0 / 4.0

Subtask #5 0 / 56.0

Subtask #1
13.0 / 13.0

Subtask #2
10.0 / 10.0

Subtask #3
17.0 / 17.0

Subtask #4
4.0 / 4.0

Subtask #5
0 / 56.0