oj.uz

답안 #770752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770752 2023-07-01T21:15:27 Z adrilen 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
69 / 100
 5000 ms 79308 KB 
#include "garden.h"
#include "gardenlib.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<int, 2>;
using arrr = array<int, 3>;

constexpr int maxn = 1.5e5, maxg = 1e9, bit = 32 - __builtin_clz(maxg), siz = 1 << bit;
int goal;

basic_string <int> adj[maxn];

// Jumping (1 << i) steps from each node, taking the best way or the second
// store whether we need to use the best or second best route
arr jump[bit][maxn][2] = { 0 };




void count_routes(int n, int m, int P, int R[][2], int Q, int G[])
{
    goal = P;

    for (int i = 0; i < m; i++)
    {
        adj[R[i][0]].push_back(R[i][1]);
        adj[R[i][1]].push_back(R[i][0]);
    }

    // Making the only way a second way if needed
    for (int i = 0; i < n; i++)
    {
        if (adj[i].size() == 1) adj[i].push_back(adj[i][0]);
    }


    for (int i = 0; i < n; i++)
    {
        for (int y = 0; y < 2; y++)
        {
            jump[0][i][y] = {adj[i][y], adj[adj[i][y]][0] == i};
        }
    }

    for (int b = 1; b < bit; b++)
    {
        for (int i = 0; i < n; i++)
        {
            for (int y = 0; y < 2; y++)
            {
                jump[b][i][y] = jump[b - 1][jump[b - 1][i][y][0]][jump[b - 1][i][y][1]];
            }
        }
    }

    arr pos;
    for (int y = 0; y < Q; y++)
    {
        int output = 0;

        for (int i = 0; i < n; i++)
        {
            pos = { i, 0 };
            for (int j = 0; j < bit; j++)
            {
                if (G[y] & (1 << j)) pos = jump[j][pos[0]][pos[1]];
            }
            // cout << i << " " << pos[0] << "\n";
            if (pos[0] == P) output++;
        }
        answer(output);
    }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5588 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 2 ms 5204 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 4 ms 5924 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5588 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 2 ms 5204 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 4 ms 5924 KB Output is correct
10 Correct 2 ms 5204 KB Output is correct
11 Correct 12 ms 15956 KB Output is correct
12 Correct 27 ms 24276 KB Output is correct
13 Correct 35 ms 46792 KB Output is correct
14 Correct 65 ms 72172 KB Output is correct
15 Correct 66 ms 73144 KB Output is correct
16 Correct 52 ms 52132 KB Output is correct
17 Correct 47 ms 45320 KB Output is correct
18 Correct 26 ms 24420 KB Output is correct
19 Correct 66 ms 72156 KB Output is correct
20 Correct 66 ms 73040 KB Output is correct
21 Correct 50 ms 52140 KB Output is correct
22 Correct 48 ms 45360 KB Output is correct
23 Correct 74 ms 79308 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5588 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 2 ms 5204 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 4 ms 5924 KB Output is correct
10 Correct 2 ms 5204 KB Output is correct
11 Correct 12 ms 15956 KB Output is correct
12 Correct 27 ms 24276 KB Output is correct
13 Correct 35 ms 46792 KB Output is correct
14 Correct 65 ms 72172 KB Output is correct
15 Correct 66 ms 73144 KB Output is correct
16 Correct 52 ms 52132 KB Output is correct
17 Correct 47 ms 45320 KB Output is correct
18 Correct 26 ms 24420 KB Output is correct
19 Correct 66 ms 72156 KB Output is correct
20 Correct 66 ms 73040 KB Output is correct
21 Correct 50 ms 52140 KB Output is correct
22 Correct 48 ms 45360 KB Output is correct
23 Correct 74 ms 79308 KB Output is correct
24 Correct 10 ms 5276 KB Output is correct
25 Correct 2975 ms 16312 KB Output is correct
26 Execution timed out 5045 ms 24348 KB Time limit exceeded
27 Halted 0 ms 0 KB -