제출 #794461

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794461		mathematik	던전 (IOI21_dungeons)	C++17	89 / 100	7146 ms	1429544 KiB

dungeons

        #include "dungeons.h"
        #include <bits/stdc++.h>
        #define ll long long
         
        using namespace std;
         
        uint binary[12][400001][25][3];//index, +, max excluded
         
        uint safe_add(uint a, uint b) {
         	if (a > a + b)
         		return UINT_MAX;
         	return a + b;
        }
         
        uint safe_sub(uint a, uint b) {
         	if (a >= b)
        		return a - b;
        	return 0;
        }
         
        int N;
        vector<int> S, P, W, L;
         
        void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
        	s.push_back(0);
        	p.push_back(0);
        	w.push_back(n);
        	l.push_back(n);
        	n++;
         
        	N = n;
        	S = s, P = p, W = w, L = l;
         
        	for (int range = 0; range < 12; range++)
        	{
        		ll r = 1 << (range + 13);
         
        		for (int i = 0; i < n; i++)
        		{
        			if (s[i] <= r) {
        				binary[range][i][0][0] = w[i];
        				binary[range][i][0][1] = s[i];
        				binary[range][i][0][2] = UINT_MAX;
        			} else {
        				binary[range][i][0][0] = l[i];
        				binary[range][i][0][1] = p[i];
        				binary[range][i][0][2] = s[i];
        			}
        		}
        		
        		for (int i = 1; i < 25; i++)
        		{
        			for (int ind = 0; ind < n; ind++)
        			{
        				int pointer = binary[range][ind][i - 1][0];
        				binary[range][ind][i][0] = binary[range][pointer][i - 1][0];
        				binary[range][ind][i][1] = safe_add(binary[range][ind][i - 1][1], binary[range][pointer][i - 1][1]);
        				binary[range][ind][i][2] = min(binary[range][ind][i - 1][2], safe_sub(binary[range][pointer][i - 1][2], binary[range][ind][i - 1][1]));
        			}
        		}
        	}
        }
         
        long long simulate(int x, int z) {
        	ll t = z;
         
        	while (t < 8192 && x != N - 1) {
        		if (t >= S[x]) {
        			t += S[x];
        			x = W[x];
        		} else {
        			t += P[x];
        			x = L[x];
        		}
        	}
         
        	for (int r = 0; r < 12; r++)
        	{
        		for (int s = 24; s >= 0; s--)
        		{
        			while ((binary[r][x][s][2] > t || binary[r][x][s][2] == UINT_MAX) && x != N - 1 && binary[r][x][s][1] != UINT_MAX) {
        				t += binary[r][x][s][1];
        				x = binary[r][x][s][0];
        			}
        		}
        	}
        	return t;
        }

• Subtask 1: 11 / 11
• Subtask 2: 26 / 26
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 27 / 27
• Subtask 6: 0 / 11