oj.uz

Submission #770761

# Submission time Handle Problem Language Result Execution time Memory
770761 2023-07-01T21:43:21 Z adrilen Tropical Garden (IOI11_garden) C++17
69 / 100
 5000 ms 87800 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, maxq = 2e3 + 5, 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]];
            }
        }
    }

    vector <arr> queries(Q);

    for (int i = 0; i < Q; i++) queries[i] = { G[i], i };
    sort(queries.begin(), queries.end());

    arr pos;



    map<arr, int> pos_count, next_count;
    for (int i = 0; i < n; i++) pos_count[{i, 0}] = 1;

    int last = 0;
    int diff;


    vector <int> output(Q);


    for (int y = 0; y < Q; y++)     // 2e3
    {
        diff = queries[y][0] - last;

        for (auto pa : pos_count)
        {
            pos = pa.first;
            for (int j = 0; j < bit; j++) // 30
            {
                if (diff & (1 << j)) pos = jump[j][pos[0]][pos[1]];
            }
            next_count[pos] += pa.second;
        }
        output[queries[y][1]] = next_count[{P, 0}] + next_count[{P, 1}];
        last = queries[y][0];

        pos_count.swap(next_count);
        next_count.clear();
    }


    for (int i: output) answer(i);
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 2 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5972 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 2 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5972 KB Output is correct
10 Correct 2 ms 5204 KB Output is correct
11 Correct 18 ms 18260 KB Output is correct
12 Correct 34 ms 26360 KB Output is correct
13 Correct 67 ms 56412 KB Output is correct
14 Correct 99 ms 78984 KB Output is correct
15 Correct 95 ms 79932 KB Output is correct
16 Correct 82 ms 56520 KB Output is correct
17 Correct 62 ms 48648 KB Output is correct
18 Correct 29 ms 26112 KB Output is correct
19 Correct 99 ms 79040 KB Output is correct
20 Correct 94 ms 79820 KB Output is correct
21 Correct 74 ms 56380 KB Output is correct
22 Correct 63 ms 48552 KB Output is correct
23 Correct 134 ms 87800 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5588 KB Output is correct
2 Correct 3 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 2 ms 5204 KB Output is correct
5 Correct 2 ms 5204 KB Output is correct
6 Correct 3 ms 5844 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 3 ms 5716 KB Output is correct
9 Correct 4 ms 5972 KB Output is correct
10 Correct 2 ms 5204 KB Output is correct
11 Correct 18 ms 18260 KB Output is correct
12 Correct 34 ms 26360 KB Output is correct
13 Correct 67 ms 56412 KB Output is correct
14 Correct 99 ms 78984 KB Output is correct
15 Correct 95 ms 79932 KB Output is correct
16 Correct 82 ms 56520 KB Output is correct
17 Correct 62 ms 48648 KB Output is correct
18 Correct 29 ms 26112 KB Output is correct
19 Correct 99 ms 79040 KB Output is correct
20 Correct 94 ms 79820 KB Output is correct
21 Correct 74 ms 56380 KB Output is correct
22 Correct 63 ms 48552 KB Output is correct
23 Correct 134 ms 87800 KB Output is correct
24 Correct 21 ms 5332 KB Output is correct
25 Correct 4032 ms 18276 KB Output is correct
26 Correct 1657 ms 26488 KB Output is correct
27 Execution timed out 5052 ms 57692 KB Time limit exceeded
28 Halted 0 ms 0 KB -