oj.uz

Submission #770748

# Submission time Handle Problem Language Result Execution time Memory
770748 2023-07-01T21:09:02 Z adrilen Tropical Garden (IOI11_garden) C++17
49 / 100
 11 ms 12008 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, bit = 32 - __builtin_clz(maxn), 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]];
            }
            if (pos[0] == P) output++;
        }
        answer(output);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5332 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5144 KB Output is correct
6 Correct 3 ms 5408 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5400 KB Output is correct
9 Correct 4 ms 5664 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5332 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5144 KB Output is correct
6 Correct 3 ms 5408 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5400 KB Output is correct
9 Correct 4 ms 5664 KB Output is correct
10 Correct 2 ms 5076 KB Output is correct
11 Incorrect 11 ms 12008 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5332 KB Output is correct
3 Correct 3 ms 5460 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5144 KB Output is correct
6 Correct 3 ms 5408 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5400 KB Output is correct
9 Correct 4 ms 5664 KB Output is correct
10 Correct 2 ms 5076 KB Output is correct
11 Incorrect 11 ms 12008 KB Output isn't correct
12 Halted 0 ms 0 KB -