oj.uz

Submission #551212

# Submission time Handle Problem Language Result Execution time Memory
551212 2022-04-20T05:45:52 Z Keshi Tropical Garden (IOI11_garden) C++17
100 / 100
 130 ms 52636 KB 
//In the name of God
#include "garden.h"
#include "gardenlib.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll maxn = 5e5 + 100;
const ll mod = 1e9 + 7;
const ll INF = 1e18;

#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()

ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}

int n, a[maxn], dis[maxn];
int cnt[2][maxn], dor[2];
bool vis[maxn];
vector<int> g[maxn], gp[maxn];

void dfs(int v){
	vis[v] = 1;
	for(int u : gp[v]){
		if(vis[u]) continue;
		dis[u] = dis[v] + 1;
		dfs(u);
	}
	return;
}

void Do(int x, int f){
	memset(dis, -1, sizeof dis);
	memset(vis, 0, sizeof vis);
	dis[x] = 0;
	dfs(x);
	for(int i = 0; i < (n << 1); i += 2){
		if(~dis[i]) cnt[f][dis[i]]++;
	}
	dor[f] = -1;
	if(dis[a[x]] == -1) return;
	int t = dis[a[x]] + 1;
	dor[f] = t;
	for(int i = t; i < maxn; i++){
		cnt[f][i] += cnt[f][i - t];
	}
	return;
}

void count_routes(int N, int m, int p, int R[][2], int Q, int G[]){
	n = N;
	for(int i = 0; i < m; i++){
		int v = R[i][0], u = R[i][1];
		g[v].pb(u);
		g[u].pb(v);
	}
	for(int i = 0; i < n; i++){
		int v = g[i][0];
		if(g[v][0] == i) a[i << 1] = (v << 1) | 1;
		else a[i << 1] = v << 1;
		if(Sz(g[i]) == 1){
			a[i << 1 | 1] = a[i << 1];
			continue;
		}
		v = g[i][1];
		if(g[v][0] == i) a[i << 1 | 1] = (v << 1) | 1;
		else a[i << 1 | 1] = v << 1;
	}
	for(int i = 0; i < (n << 1); i++){
		gp[a[i]].pb(i);
	}
	Do(p << 1, 0);
	Do(p << 1 | 1, 1);
	for(int i = 0; i < Q; i++){
		int x = G[i];
		int ans = 0;
		if(dor[0] == -1){
			if(x < maxn) ans += cnt[0][x];
		}
		else{
			if(x >= maxn) x = (maxn - (maxn % dor[0])) + (dor[0] << 2) + (x % dor[0]);
			while(x >= maxn) x -= dor[0];
			ans += cnt[0][x];
		}
		x = G[i];
		if(dor[1] == -1){
			if(x < maxn) ans += cnt[1][x];
		}
		else{
			if(x >= maxn) x = (maxn - (maxn % dor[1])) + (dor[1] << 2) + (x % dor[1]);
			while(x >= maxn) x -= dor[1];
			ans += cnt[1][x];
		}
		answer(ans);
	}
	return;
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30292 KB Output is correct
2 Correct 19 ms 30164 KB Output is correct
3 Correct 20 ms 30292 KB Output is correct
4 Correct 18 ms 28128 KB Output is correct
5 Correct 19 ms 28116 KB Output is correct
6 Correct 20 ms 30300 KB Output is correct
7 Correct 18 ms 30188 KB Output is correct
8 Correct 20 ms 30188 KB Output is correct
9 Correct 21 ms 30420 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30292 KB Output is correct
2 Correct 19 ms 30164 KB Output is correct
3 Correct 20 ms 30292 KB Output is correct
4 Correct 18 ms 28128 KB Output is correct
5 Correct 19 ms 28116 KB Output is correct
6 Correct 20 ms 30300 KB Output is correct
7 Correct 18 ms 30188 KB Output is correct
8 Correct 20 ms 30188 KB Output is correct
9 Correct 21 ms 30420 KB Output is correct
10 Correct 19 ms 30164 KB Output is correct
11 Correct 27 ms 32188 KB Output is correct
12 Correct 46 ms 33460 KB Output is correct
13 Correct 61 ms 43600 KB Output is correct
14 Correct 109 ms 41228 KB Output is correct
15 Correct 128 ms 41432 KB Output is correct
16 Correct 85 ms 38452 KB Output is correct
17 Correct 85 ms 35436 KB Output is correct
18 Correct 39 ms 29692 KB Output is correct
19 Correct 112 ms 41168 KB Output is correct
20 Correct 115 ms 41400 KB Output is correct
21 Correct 91 ms 36504 KB Output is correct
22 Correct 92 ms 37392 KB Output is correct
23 Correct 117 ms 42348 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 30292 KB Output is correct
2 Correct 19 ms 30164 KB Output is correct
3 Correct 20 ms 30292 KB Output is correct
4 Correct 18 ms 28128 KB Output is correct
5 Correct 19 ms 28116 KB Output is correct
6 Correct 20 ms 30300 KB Output is correct
7 Correct 18 ms 30188 KB Output is correct
8 Correct 20 ms 30188 KB Output is correct
9 Correct 21 ms 30420 KB Output is correct
10 Correct 19 ms 30164 KB Output is correct
11 Correct 27 ms 32188 KB Output is correct
12 Correct 46 ms 33460 KB Output is correct
13 Correct 61 ms 43600 KB Output is correct
14 Correct 109 ms 41228 KB Output is correct
15 Correct 128 ms 41432 KB Output is correct
16 Correct 85 ms 38452 KB Output is correct
17 Correct 85 ms 35436 KB Output is correct
18 Correct 39 ms 29692 KB Output is correct
19 Correct 112 ms 41168 KB Output is correct
20 Correct 115 ms 41400 KB Output is correct
21 Correct 91 ms 36504 KB Output is correct
22 Correct 92 ms 37392 KB Output is correct
23 Correct 117 ms 42348 KB Output is correct
24 Correct 20 ms 30104 KB Output is correct
25 Correct 32 ms 32212 KB Output is correct
26 Correct 45 ms 33508 KB Output is correct
27 Correct 52 ms 43492 KB Output is correct
28 Correct 103 ms 41204 KB Output is correct
29 Correct 130 ms 43240 KB Output is correct
30 Correct 101 ms 40012 KB Output is correct
31 Correct 92 ms 37076 KB Output is correct
32 Correct 38 ms 30136 KB Output is correct
33 Correct 113 ms 42884 KB Output is correct
34 Correct 114 ms 43252 KB Output is correct
35 Correct 105 ms 38120 KB Output is correct
36 Correct 98 ms 37048 KB Output is correct
37 Correct 104 ms 44132 KB Output is correct
38 Correct 114 ms 52636 KB Output is correct