oj.uz

답안 #538997

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538997 2022-03-18T07:20:59 Z 79brue 던전 (IOI21_dungeons) C++17
100 / 100
 4313 ms 1561244 KB 
#include "dungeons.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int LIM = 25;

int n;
int arr[400002], power[400002];
int w[400002], l[400002];

int nxt[350][400002]; /// 계속 지기만 했을 때의 최종 위치
int sum[350][400002]; /// 계속 지기만 했을 때의 체력 변화
int lim[350][400002]; /// 계속 지기만 할 수 있기 위한 최초 체력의 최댓값
ll bonus[400002];

int idxArr[30];
inline int idx(int A, int B){
    return idxArr[A] + B;
}

void init(int N, vector<int> s, vector<int> p, vector<int> W, vector<int> L){
    for(int i=1; i<=26; i++) idxArr[i] = idxArr[i-1] + i;

	n = N;
	for(int i=0; i<n; i++) arr[i] = s[i];
	for(int i=0; i<n; i++) power[i] = p[i], w[i]=W[i], l[i]=L[i];
	l[n]=w[n]=n;
	arr[n] = 1e9, power[n]=1e9;

    for(int f=0; f<LIM; f++){
        for(int i=0; i<=n; i++){
            int tmp = idx(f,0);
            if((1<<f) <= arr[i]){
                nxt[tmp][i] = l[i];
                sum[tmp][i] = power[i];
                lim[tmp][i] = arr[i]-1;
            }
            else{
                nxt[tmp][i] = w[i];
                sum[tmp][i] = arr[i];
                lim[tmp][i] = 1e9;
            }
        }
        for(int d=1; d<=f; d++){
            for(int i=0; i<=n; i++){
                int tmp = idx(f,d);
                nxt[tmp][i] = nxt[tmp-1][nxt[tmp-1][i]];
                sum[tmp][i] = min(1000000000, sum[tmp-1][i] + sum[tmp-1][nxt[tmp-1][i]]);
                lim[tmp][i] = min(lim[tmp-1][i], lim[tmp-1][nxt[tmp-1][i]] - sum[tmp-1][i]);
            }
        }
    }

    for(int i=n-1; i>=0; i--){
        bonus[i] = ll(arr[i]) + bonus[w[i]];
    }
}

ll simulate(int x, int z){
    for(int f=0; f<LIM; f++){
        if((1<<(f+1)) <= z || x==n) continue;

        /// 1. 계속 지다가 결국 탈출하기
        int tx = x, cnt1 = 0;
        int tz = z;
        for(int d=f; d>=0; d--){
            int tmp = idx(f,d);
            if(tz + sum[tmp][tx] < (1<<(f+1))){
                tz += sum[tmp][tx];
                tx = nxt[tmp][tx];
                cnt1 += (1<<d);
            }
        }

        /// 2. 이겨서 탈출하기
        int cnt2 = 0;
        tx = x;
        tz = z;
        for(int d=f; d>=0; d--){
            int tmp = idx(f,d);
            if(lim[tmp][tx] >= tz){
                tz += sum[tmp][tx];
                tx = nxt[tmp][tx];
                cnt2 += (1<<d);
            }
        }

        int cnt = min(cnt1, cnt2);
        for(int d=0; d<LIM; d++){
            if((cnt>>d)&1){
                int tmp = idx(f,d);
                z += sum[tmp][x];
                x = nxt[tmp][x];
            }
        }

        if(x==n) break;

        assert(z < (1<<(f+1)));
        if(z >= arr[x]) z += arr[x], x = w[x];
        else z += power[x], x = l[x];
        assert(z >= (1<<(f+1)));
    }

    return ll(z) + bonus[x];
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7124 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 9 ms 14924 KB Output is correct
4 Correct 144 ms 200288 KB Output is correct
5 Correct 11 ms 14932 KB Output is correct
6 Correct 171 ms 200272 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11092 KB Output is correct
2 Correct 1451 ms 1549468 KB Output is correct
3 Correct 1408 ms 1556292 KB Output is correct
4 Correct 1740 ms 1556180 KB Output is correct
5 Correct 1369 ms 1553472 KB Output is correct
6 Correct 3590 ms 1549344 KB Output is correct
7 Correct 3259 ms 1554516 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11092 KB Output is correct
2 Correct 305 ms 201128 KB Output is correct
3 Correct 373 ms 201136 KB Output is correct
4 Correct 251 ms 201164 KB Output is correct
5 Correct 250 ms 201100 KB Output is correct
6 Correct 1182 ms 201268 KB Output is correct
7 Correct 1446 ms 201068 KB Output is correct
8 Correct 946 ms 201088 KB Output is correct
9 Correct 231 ms 201124 KB Output is correct
10 Correct 758 ms 201108 KB Output is correct
11 Correct 1189 ms 201088 KB Output is correct
12 Correct 3487 ms 201056 KB Output is correct
13 Correct 3574 ms 201080 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11092 KB Output is correct
2 Correct 305 ms 201128 KB Output is correct
3 Correct 373 ms 201136 KB Output is correct
4 Correct 251 ms 201164 KB Output is correct
5 Correct 250 ms 201100 KB Output is correct
6 Correct 1182 ms 201268 KB Output is correct
7 Correct 1446 ms 201068 KB Output is correct
8 Correct 946 ms 201088 KB Output is correct
9 Correct 231 ms 201124 KB Output is correct
10 Correct 758 ms 201108 KB Output is correct
11 Correct 1189 ms 201088 KB Output is correct
12 Correct 3487 ms 201056 KB Output is correct
13 Correct 3574 ms 201080 KB Output is correct
14 Correct 6 ms 11092 KB Output is correct
15 Correct 291 ms 201068 KB Output is correct
16 Correct 338 ms 201136 KB Output is correct
17 Correct 476 ms 201052 KB Output is correct
18 Correct 437 ms 201164 KB Output is correct
19 Correct 1127 ms 201108 KB Output is correct
20 Correct 1012 ms 201196 KB Output is correct
21 Correct 1249 ms 201164 KB Output is correct
22 Correct 969 ms 201164 KB Output is correct
23 Correct 1514 ms 201164 KB Output is correct
24 Correct 1969 ms 201068 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11092 KB Output is correct
2 Correct 305 ms 201128 KB Output is correct
3 Correct 373 ms 201136 KB Output is correct
4 Correct 251 ms 201164 KB Output is correct
5 Correct 250 ms 201100 KB Output is correct
6 Correct 1182 ms 201268 KB Output is correct
7 Correct 1446 ms 201068 KB Output is correct
8 Correct 946 ms 201088 KB Output is correct
9 Correct 231 ms 201124 KB Output is correct
10 Correct 758 ms 201108 KB Output is correct
11 Correct 1189 ms 201088 KB Output is correct
12 Correct 3487 ms 201056 KB Output is correct
13 Correct 3574 ms 201080 KB Output is correct
14 Correct 6 ms 11092 KB Output is correct
15 Correct 291 ms 201068 KB Output is correct
16 Correct 338 ms 201136 KB Output is correct
17 Correct 476 ms 201052 KB Output is correct
18 Correct 437 ms 201164 KB Output is correct
19 Correct 1127 ms 201108 KB Output is correct
20 Correct 1012 ms 201196 KB Output is correct
21 Correct 1249 ms 201164 KB Output is correct
22 Correct 969 ms 201164 KB Output is correct
23 Correct 1514 ms 201164 KB Output is correct
24 Correct 1969 ms 201068 KB Output is correct
25 Correct 170 ms 200332 KB Output is correct
26 Correct 314 ms 201048 KB Output is correct
27 Correct 284 ms 201104 KB Output is correct
28 Correct 236 ms 201132 KB Output is correct
29 Correct 386 ms 201052 KB Output is correct
30 Correct 959 ms 201164 KB Output is correct
31 Correct 1261 ms 201040 KB Output is correct
32 Correct 1592 ms 201084 KB Output is correct
33 Correct 1976 ms 200980 KB Output is correct
34 Correct 2773 ms 201036 KB Output is correct
35 Correct 1722 ms 201168 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11092 KB Output is correct
2 Correct 1451 ms 1549468 KB Output is correct
3 Correct 1408 ms 1556292 KB Output is correct
4 Correct 1740 ms 1556180 KB Output is correct
5 Correct 1369 ms 1553472 KB Output is correct
6 Correct 3590 ms 1549344 KB Output is correct
7 Correct 3259 ms 1554516 KB Output is correct
8 Correct 7 ms 11092 KB Output is correct
9 Correct 305 ms 201128 KB Output is correct
10 Correct 373 ms 201136 KB Output is correct
11 Correct 251 ms 201164 KB Output is correct
12 Correct 250 ms 201100 KB Output is correct
13 Correct 1182 ms 201268 KB Output is correct
14 Correct 1446 ms 201068 KB Output is correct
15 Correct 946 ms 201088 KB Output is correct
16 Correct 231 ms 201124 KB Output is correct
17 Correct 758 ms 201108 KB Output is correct
18 Correct 1189 ms 201088 KB Output is correct
19 Correct 3487 ms 201056 KB Output is correct
20 Correct 3574 ms 201080 KB Output is correct
21 Correct 6 ms 11092 KB Output is correct
22 Correct 291 ms 201068 KB Output is correct
23 Correct 338 ms 201136 KB Output is correct
24 Correct 476 ms 201052 KB Output is correct
25 Correct 437 ms 201164 KB Output is correct
26 Correct 1127 ms 201108 KB Output is correct
27 Correct 1012 ms 201196 KB Output is correct
28 Correct 1249 ms 201164 KB Output is correct
29 Correct 969 ms 201164 KB Output is correct
30 Correct 1514 ms 201164 KB Output is correct
31 Correct 1969 ms 201068 KB Output is correct
32 Correct 170 ms 200332 KB Output is correct
33 Correct 314 ms 201048 KB Output is correct
34 Correct 284 ms 201104 KB Output is correct
35 Correct 236 ms 201132 KB Output is correct
36 Correct 386 ms 201052 KB Output is correct
37 Correct 959 ms 201164 KB Output is correct
38 Correct 1261 ms 201040 KB Output is correct
39 Correct 1592 ms 201084 KB Output is correct
40 Correct 1976 ms 200980 KB Output is correct
41 Correct 2773 ms 201036 KB Output is correct
42 Correct 1722 ms 201168 KB Output is correct
43 Correct 3 ms 7124 KB Output is correct
44 Correct 8 ms 11092 KB Output is correct
45 Correct 1860 ms 1561080 KB Output is correct
46 Correct 1318 ms 1556408 KB Output is correct
47 Correct 1327 ms 1556748 KB Output is correct
48 Correct 1543 ms 1558916 KB Output is correct
49 Correct 1776 ms 1561244 KB Output is correct
50 Correct 2472 ms 1558572 KB Output is correct
51 Correct 1655 ms 1559032 KB Output is correct
52 Correct 2701 ms 1556712 KB Output is correct
53 Correct 3532 ms 1557532 KB Output is correct
54 Correct 3590 ms 1558628 KB Output is correct
55 Correct 4313 ms 1557656 KB Output is correct
56 Correct 4065 ms 1557872 KB Output is correct
57 Correct 4100 ms 1556232 KB Output is correct
58 Correct 3852 ms 1554464 KB Output is correct
59 Correct 3911 ms 1552548 KB Output is correct
60 Correct 3186 ms 1551128 KB Output is correct
61 Correct 2981 ms 1549568 KB Output is correct