oj.uz

Submission #954976

# Submission time Handle Problem Language Result Execution time Memory
954976 2024-03-29T04:01:07 Z GrindMachine Tropical Garden (IOI11_garden) C++17
69 / 100
 5000 ms 47992 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int LOG = 30;

#include "garden.h"
#include "gardenlib.h"

void count_routes(int n, int m, int p, int R[][2], int q, int a[])
{
    vector<int> adj[n];
    rep(i,m){
        int u = R[i][0], v = R[i][1];
        adj[u].pb(v), adj[v].pb(u);
    }

    int up[n*2][LOG];
    memset(up,0,sizeof up);

    rep(u,n){
        auto edges = adj[u];
        if(sz(edges) >= 2){
            {
                int v = edges[1];
                if(u == adj[v][0]){
                    up[u*2][0] = v*2;
                }
                else{
                    up[u*2][0] = v*2+1;
                }
            }

            {
                int v = edges[0];
                if(u == adj[v][0]){
                    up[u*2+1][0] = v*2;
                }
                else{
                    up[u*2+1][0] = v*2+1;
                }
            }
        }
        else{
            int v = edges[0];
            if(u == adj[v][0]){
                up[u*2][0] = v*2;
            }
            else{
                up[u*2][0] = v*2+1;
            }
        }
    }

    rep1(j,LOG-1){
        rep(i,2*n){
            up[i][j] = up[up[i][j-1]][j-1];
        }
    }

    rep(id,q){
        int k = a[id];
        int ans = 0;
        rep(i,n){
            int u = i*2+1;
            if(sz(adj[i]) == 1) u--;
            
            rep(j,LOG){
                if(k&(1<<j)){
                    u = up[u][j];
                }
            }

            if((u/2) == p){
                ans++;
            }
        }

        answer(ans);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 760 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 860 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 760 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 15 ms 9400 KB Output is correct
12 Correct 27 ms 14004 KB Output is correct
13 Correct 90 ms 28252 KB Output is correct
14 Correct 149 ms 43588 KB Output is correct
15 Correct 155 ms 44112 KB Output is correct
16 Correct 101 ms 31060 KB Output is correct
17 Correct 82 ms 26964 KB Output is correct
18 Correct 26 ms 14168 KB Output is correct
19 Correct 145 ms 43348 KB Output is correct
20 Correct 154 ms 44124 KB Output is correct
21 Correct 102 ms 31052 KB Output is correct
22 Correct 81 ms 26972 KB Output is correct
23 Correct 167 ms 47992 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 760 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 15 ms 9400 KB Output is correct
12 Correct 27 ms 14004 KB Output is correct
13 Correct 90 ms 28252 KB Output is correct
14 Correct 149 ms 43588 KB Output is correct
15 Correct 155 ms 44112 KB Output is correct
16 Correct 101 ms 31060 KB Output is correct
17 Correct 82 ms 26964 KB Output is correct
18 Correct 26 ms 14168 KB Output is correct
19 Correct 145 ms 43348 KB Output is correct
20 Correct 154 ms 44124 KB Output is correct
21 Correct 102 ms 31052 KB Output is correct
22 Correct 81 ms 26972 KB Output is correct
23 Correct 167 ms 47992 KB Output is correct
24 Correct 8 ms 348 KB Output is correct
25 Correct 3387 ms 9412 KB Output is correct
26 Execution timed out 5052 ms 14280 KB Time limit exceeded
27 Halted 0 ms 0 KB -