제출 #1310252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310252		Nonoze	Tropical Garden (IOI11_garden)	C++20	100 / 100	57 ms	25096 KiB

garden

#include "garden.h"
#include "gardenlib.h"
/*
*	Author: Nonoze
*	Created: Sunday 11/01/2026
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef DEBUG
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

// #define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

int n, root;

void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
	n=N, root=P;
	vector<vector<int>> adj(n);
	for (int i=0; i<M; i++) {
		int u=R[i][0], v=R[i][1];
		if (sz(adj[u])<2) adj[u].push_back(v);
		if (sz(adj[v])<2) adj[v].push_back(u);
	}
	vector<int> nxt(2*n, -1);
	for (int u=0; u<n; u++) {
		for (int i=0; i<sz(adj[u]); i++) {
			int v=adj[u][i];
			nxt[u*2+i]=v*2+(adj[v][0]==u&&sz(adj[v])>1);
		}
	}
	// for (int i=0; i<n; i++) {
		// 	cout << "Node " << i << ": ";
		// 	cout << nxt[i*2] << " " << nxt[i*2+1] << endl;
	// }
	vector<vector<int>> dist(2, vector<int>(2*n, -1)); dist[0][root*2]=dist[1][root*2+1]=0;
	for (int t=0; t<2; t++) {
		for (int i=0; i<2*n; i++) if (nxt[i]!=-1) {
			int start=i, cur=start, len=0;
			while (dist[t][cur]==-1) {
				dist[t][cur]=-3;
				cur=nxt[cur];
				len++;
			}
			if (dist[t][cur]<=-2) {
				cur=start;
				while (dist[t][cur]==-3) {
					dist[t][cur]=-2;
					cur=nxt[cur];
				}
			} else {
				int add=dist[t][cur]+len;
				cur=start;
				while (dist[t][cur]==-3) {
					dist[t][cur]=add;
					add--;
					cur=nxt[cur];
				}
			}
		}
	}
	// for (int i=0; i<n; i++) {
	// 	cout << dist[0][i*2] << " " << dist[1][i*2] << endl;
	// }
	int cycle0=-1, cycle1=-1;
	{
		int cur=root*2, len=0;
		vector<bool> already(2*n, 0);
		while (!already[cur]) {
			already[cur]=1;
			cur=nxt[cur], len++;
		}
		if (cur==root*2) cycle0=len;
	}
	{
		int cur=root*2+1, len=0;
		vector<bool> already(2*n, 0);
		while (!already[cur] && cur!=-1) {
			already[cur]=1;
			cur=nxt[cur], len++;
		}
		if (cur==root*2+1) cycle1=len;
	}
	// cout << "Cycles: " << cycle0 << " " << cycle1 << endl;
	vector<int> cnt0(4*n+1, 0), cnt1(4*n+1, 0);
	for (int i=0; i<n; i++) {
		int d0=dist[0][i*2], d1=dist[1][i*2];
		if (d0<0 && d1<0) continue;

		if (d0<0) d0=inf;
		if (d1<0) d1=inf;
		assert(d0!=d1);
		if (d0<d1) cnt0[d0]++;
		else cnt1[d1]++;
	}

	vector<int> pref0=cnt0, pref1=cnt1; pref0.resize(4*n+1), pref1.resize(4*n+1, 0);
	vector<int> modif0(2*n+1, 0), modif1(2*n+1, 0);
	for (int i=0; i<=4*n; i++) {
		if (cycle0!=-1 && cycle1!=-1 && dist[1][root*2]>0) {
			if (i+dist[1][root*2]<=4*n) pref1[i+dist[1][root*2]]+=pref0[i];
			if (i+dist[0][root*2+1]<=4*n) pref0[i+dist[0][root*2+1]]+=pref1[i];

			modif0[i%cycle0]+=cnt0[i];
			modif1[i%cycle1]+=cnt1[i];
			continue;
		}
		if (cycle0!=-1) modif0[i%cycle0]+=cnt0[i];
		else if (cycle1!=-1 && dist[1][root*2]>0 && i<=2*n) {
			pref1[i+dist[1][root*2]]+=cnt0[i];
			modif1[(i+dist[1][root*2])%cycle1]+=cnt0[i];
		}
		if (cycle1!=-1) modif1[i%cycle1]+=cnt1[i];
		else if (cycle0!=-1 && dist[0][root*2+1]>0 && i<=2*n) {
			pref0[i+dist[0][root*2+1]]+=cnt1[i];
			modif0[(i+dist[0][root*2+1])%cycle0]+=cnt1[i];
		}
		if (i+cycle0<=4*n && cycle0!=-1) pref0[i+cycle0]+=pref0[i];
		if (i+cycle1<=4*n && cycle1!=-1) pref1[i+cycle1]+=pref1[i];
	}

	for (int t=0; t<Q; t++) {
		int k=G[t], res=0;
		if (cycle0==-1 && cycle1==-1) {
			if (k<=2*n) res=cnt0[k]+cnt1[k];
			answer(res);
			continue;
		}
		if (k<=4*n) {
			res=pref0[k]+pref1[k];
			answer(res);
			continue;
		}
		if (cycle0!=-1 && cycle1!=-1 && dist[1][root*2]>0) {
			res+=modif0[k%cycle0];
			res+=modif1[k%cycle1];
			if (k%cycle0!=(k-dist[0][root*2+1])%cycle0) res+=modif1[(k-dist[0][root*2+1])%cycle1];
			if (k%cycle1!=(k-dist[1][root*2])%cycle1) res+=modif0[(k-dist[1][root*2])%cycle0];
			answer(res);
			continue;
		}

		if (cycle0!=-1) {
			res+=modif0[k%cycle0];
		}
		if (cycle1!=-1) {
			res+=modif1[k%cycle1];
		}
		answer(res);
	}
	// cout << "OK"<< endl;
}

• Subtask 1: 49 / 49
• Subtask 2: 20 / 20
• Subtask 3: 31 / 31