oj.uz

답안 #172325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
172325 2020-01-01T08:18:39 Z ho94949 유괴 2 (JOI17_abduction2) C++17
44 / 100
 454 ms 35576 KB 
#include<bits/stdc++.h>
using namespace std;

enum {UP, LEFT, DOWN, RIGHT};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int MAXN = 65536;
const int lgMAXN = 16;
int H, W, Q;
int A[MAXN], B[MAXN];

//Am[i][j]: max of [i, i+2^j)
int Am[MAXN][lgMAXN], Bm[MAXN][lgMAXN];

int lg(int a)
{
    return 31 - __builtin_clz(a);
}

void spinit()
{
    for(int i=0; i<H; ++i) Am[i][0] = A[i];
    for(int i=0; i<W; ++i) Bm[i][0] = B[i];
    for(int j=1; j<lgMAXN; ++j)
    {
        for(int i=0; i<=H-(1<<j); ++i)
            Am[i][j] = max(Am[i][j-1], Am[i+(1<<(j-1))][j-1]);
        for(int i=0; i<=W-(1<<j); ++i)
            Bm[i][j] = max(Bm[i][j-1], Bm[i+(1<<(j-1))][j-1]);
    }
}

int MA(int s, int e)
{
    int q = lg(e-s+1);
    return max(Am[s][q], Am[e+1-(1<<q)][q]);
}
int MB(int s, int e)
{
    int q = lg(e-s+1);
    return max(Bm[s][q], Bm[e+1-(1<<q)][q]);
}


bool ins(int x, int y){ return 0<=x&&x<H&&0<=y&&y<W; }
map<tuple<int, int, int>, int > M;
int solve(int x, int y, int d)
{
    auto it = M.find(make_tuple(x, y, d));
    if(it != M.end()) return it->second;
    if(d==UP)
    {
        int lo = -1; //pos
        int hi = x; //imp
        while(lo+1!=hi)
        {
            int mi  = (lo+hi)>>1;
            if(MA(mi, x-1) > B[y]) lo = mi;
            else hi = mi;
        }
        //printf("%d %d UP -> %d %d\n", x, y, lo, y);
        if(lo==-1) return M[{x, y, d}] = x;
        else return M[{x, y, d}] = (x-lo) +
            max(solve(lo, y, LEFT), solve(lo, y, RIGHT));
    }
    if(d==DOWN)
    {
        int lo = x; //imp
        int hi = H; //pos
        while(lo+1!=hi)
        {
            int mi = (lo+hi)>>1;
            if(MA(x+1, mi) > B[y]) hi = mi;
            else lo = mi;
        }
        //printf("%d %d DOWN -> %d %d\n", x, y, hi, y);
        if(hi == H) return M[{x, y, d}] = H-1-x;
        else return M[{x, y, d}] = (hi-x) +
            max(solve(hi, y, LEFT), solve(hi, y, RIGHT));
    }
    if(d==LEFT)
    {
        int lo = -1; //pos
        int hi = y; //imp
        while(lo+1!=hi)
        {
            int mi = (lo+hi)>>1;
            if(MB(mi, y-1) > A[x]) lo = mi;
            else hi = mi;
        }
        //printf("%d %d LEFT -> %d %d\n", x, y, x, lo);
        if(lo == -1) return M[{x, y, d}] = y;
        else return M[{x, y, d}] = (y-lo) +
            max(solve(x, lo, UP), solve(x, lo, DOWN));
    }
    if(d==RIGHT)
    {
        //puts("HELLO!");
        int lo = y; //imp
        int hi = W; //pos
        while(lo+1!=hi)
        {
            int mi = (lo+hi)>>1;
            if(MB(y+1, mi) > A[x]) hi = mi;
            else lo = mi;
        }
        //printf("%d %d RIGHT -> %d %d\n", x, y, x, hi);
        //puts("BYE!");
        if(hi == W) return M[{x, y, d}] = W-1-y;
        else return M[{x, y, d}] = (hi-y) +
            max(solve(x, hi, UP), solve(x, hi, DOWN));
    }
}
int main()
{
    scanf("%d%d%d", &H, &W, &Q);
    for(int i=0; i<H; ++i)
        scanf("%d", A+i);
    for(int i=0; i<W; ++i)
        scanf("%d", B+i);
    spinit();
    while(Q--)
    {
        int S, T; scanf("%d%d", &S, &T); --S; --T;
        int ans = 0;
        for(int d=0; d<4; ++d)
            ans = max(ans, solve(S, T, d));
        printf("%d\n", ans);
    }
}

Compilation message

abduction2.cpp: In function 'int solve(int, int, int)':
abduction2.cpp:113:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
abduction2.cpp: In function 'int main()':
abduction2.cpp:116:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &H, &W, &Q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:118:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", A+i);
         ~~~~~^~~~~~~~~~~
abduction2.cpp:120:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", B+i);
         ~~~~~^~~~~~~~~~~
abduction2.cpp:124:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int S, T; scanf("%d%d", &S, &T); --S; --T;
                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 8 ms 1148 KB Output is correct
21 Correct 7 ms 1016 KB Output is correct
22 Correct 9 ms 1528 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 8 ms 1148 KB Output is correct
21 Correct 7 ms 1016 KB Output is correct
22 Correct 9 ms 1528 KB Output is correct
23 Correct 32 ms 7800 KB Output is correct
24 Correct 32 ms 7948 KB Output is correct
25 Correct 32 ms 7928 KB Output is correct
26 Correct 32 ms 8056 KB Output is correct
27 Correct 32 ms 8056 KB Output is correct
28 Correct 69 ms 15736 KB Output is correct
29 Correct 34 ms 9208 KB Output is correct
30 Correct 152 ms 19264 KB Output is correct
31 Correct 192 ms 22528 KB Output is correct
32 Correct 35 ms 8568 KB Output is correct
33 Correct 61 ms 11484 KB Output is correct

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 888 KB Output is correct
2 Correct 6 ms 992 KB Output is correct
3 Correct 6 ms 1016 KB Output is correct
4 Correct 6 ms 1016 KB Output is correct
5 Correct 6 ms 1016 KB Output is correct
6 Correct 5 ms 1016 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 11 ms 1528 KB Output is correct
9 Correct 11 ms 1468 KB Output is correct
10 Correct 10 ms 1400 KB Output is correct
11 Correct 12 ms 1656 KB Output is correct

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 6 ms 1016 KB Output is correct
20 Correct 8 ms 1148 KB Output is correct
21 Correct 7 ms 1016 KB Output is correct
22 Correct 9 ms 1528 KB Output is correct
23 Correct 32 ms 7800 KB Output is correct
24 Correct 32 ms 7948 KB Output is correct
25 Correct 32 ms 7928 KB Output is correct
26 Correct 32 ms 8056 KB Output is correct
27 Correct 32 ms 8056 KB Output is correct
28 Correct 69 ms 15736 KB Output is correct
29 Correct 34 ms 9208 KB Output is correct
30 Correct 152 ms 19264 KB Output is correct
31 Correct 192 ms 22528 KB Output is correct
32 Correct 35 ms 8568 KB Output is correct
33 Correct 61 ms 11484 KB Output is correct
34 Correct 6 ms 888 KB Output is correct
35 Correct 6 ms 992 KB Output is correct
36 Correct 6 ms 1016 KB Output is correct
37 Correct 6 ms 1016 KB Output is correct
38 Correct 6 ms 1016 KB Output is correct
39 Correct 5 ms 1016 KB Output is correct
40 Correct 5 ms 1016 KB Output is correct
41 Correct 11 ms 1528 KB Output is correct
42 Correct 11 ms 1468 KB Output is correct
43 Correct 10 ms 1400 KB Output is correct
44 Correct 12 ms 1656 KB Output is correct
45 Correct 38 ms 8696 KB Output is correct
46 Correct 38 ms 8560 KB Output is correct
47 Correct 38 ms 8696 KB Output is correct
48 Correct 38 ms 8592 KB Output is correct
49 Correct 38 ms 8536 KB Output is correct
50 Correct 84 ms 15608 KB Output is correct
51 Correct 88 ms 16632 KB Output is correct
52 Correct 271 ms 27820 KB Output is correct
53 Correct 259 ms 26832 KB Output is correct
54 Correct 249 ms 25976 KB Output is correct
55 Incorrect 454 ms 35576 KB Output isn't correct
56 Halted 0 ms 0 KB -