oj.uz

Submission #260185

# Submission time Handle Problem Language Result Execution time Memory
260185 2020-08-09T14:33:50 Z amiratou Tropical Garden (IOI11_garden) C++14
100 / 100
 3971 ms 49388 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sz(x) (int)(x.size())
#define pb push_back
const int MX = 450005,L=30;

vector<pair<int,int> > vec[150005];
vector<int> res[MX],queries[MX],dp,anc;
int nxt[MX],d[MX],rf[MX],g[2002],ans[2002],edge[150005][2],r,no,m,Tar;
bitset<MX> vis;

void dfs(int node){
	rf[node]=r;
	vis[node]=1;
	if(node>=(2*m))
		dp.pb(node);
	for(auto it:res[node])
		if(it!=no)d[it]=d[node]+1,dfs(it);
}
void solve(int node){
	for(auto it:queries[node]){
		assert(sz(anc)>=g[it]);
		int final=anc[sz(anc)-g[it]];
		ans[it]+=(((final>=m)?edge[final-m][0]:edge[final][1])==Tar);
	}
	anc.pb(node);
	for(auto it:res[node])
		if(it!=no)solve(it);
	anc.pop_back();
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
	m=M,Tar=P;
	for (int i = 0; i < Q; ++i)
		g[i]=G[i];
	for (int i = 0; i < M; ++i)
	{
		edge[i][0]=R[i][0];
		edge[i][1]=R[i][1];
		vec[R[i][0]].pb({R[i][1],i});
		vec[R[i][1]].pb({R[i][0],M+i});
	}
	for (int i = 0; i < N; ++i)
	{
		multiset<pair<int,int> > myset;
		for (int j = 0; j < sz(vec[i]); ++j)
		{
			int val=vec[i][j].se-((vec[i][j].se>=M)?M:0);
			myset.insert({val,j});
		}
		for (int j = 0; j < sz(vec[i]); ++j)
		{
			int val=vec[i][j].se-((vec[i][j].se>=M)?M:0);
			int c=val+((vec[i][j].se>=M)?0:M);
			myset.erase(myset.find({val,j}));
			if(!sz(myset))nxt[c]=vec[i][j].se;
			else nxt[c]=vec[i][myset.begin()->se].se;
			myset.insert({val,j});
		}
		nxt[i+2*M]=vec[i][myset.begin()->se].se;
	}
	for (int i = 0; i < 2*M+N; ++i)
		if(nxt[i]!=-1)res[nxt[i]].pb(i);
	for (int i = 0; i < N; ++i)
	{
		if(vis[i+2*M])continue;
		int node=i+2*M,st,p;
		while(1){
			vis[node]=1;
			node=nxt[node];
			if(vis[node])break;
		}
		vector<int> cycle={node};
		p=node,st=nxt[node];
		while(st!=node){
			cycle.pb(st);
			no=p,r=sz(cycle)-1,dfs(st);
			p=st;
			st=nxt[st];
		}
		no=cycle.back(),r=0,dfs(node);
		for(auto it:dp){
			for (int j = 0; j < Q; ++j)
			{
				if(d[it]>G[j])
					queries[it].pb(j);
				else{
					int rm=G[j]-d[it];
					int final=cycle[(rf[it]+rm)%sz(cycle)];
					assert(final<(2*M));
					ans[j]+=(((final>=M)?R[final-M][0]:R[final][1])==P);
				}
			}
		}
		for (int j = 0; j < sz(cycle); ++j)
		{
			no=cycle[(j+sz(cycle)-1)%sz(cycle)];
			solve(cycle[j]);
		}
		dp.clear();
	}
	for (int i = 0; i < Q; ++i)
		answer(ans[i]);
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25216 KB Output is correct
2 Correct 18 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 17 ms 25088 KB Output is correct
5 Correct 17 ms 25088 KB Output is correct
6 Correct 19 ms 25344 KB Output is correct
7 Correct 17 ms 25088 KB Output is correct
8 Correct 18 ms 25216 KB Output is correct
9 Correct 27 ms 25728 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25216 KB Output is correct
2 Correct 18 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 17 ms 25088 KB Output is correct
5 Correct 17 ms 25088 KB Output is correct
6 Correct 19 ms 25344 KB Output is correct
7 Correct 17 ms 25088 KB Output is correct
8 Correct 18 ms 25216 KB Output is correct
9 Correct 27 ms 25728 KB Output is correct
10 Correct 18 ms 25088 KB Output is correct
11 Correct 39 ms 28408 KB Output is correct
12 Correct 95 ms 32244 KB Output is correct
13 Correct 89 ms 39276 KB Output is correct
14 Correct 314 ms 46200 KB Output is correct
15 Correct 320 ms 47784 KB Output is correct
16 Correct 275 ms 43544 KB Output is correct
17 Correct 251 ms 42744 KB Output is correct
18 Correct 94 ms 32248 KB Output is correct
19 Correct 290 ms 46200 KB Output is correct
20 Correct 306 ms 47348 KB Output is correct
21 Correct 274 ms 43516 KB Output is correct
22 Correct 270 ms 42360 KB Output is correct
23 Correct 288 ms 47728 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 25216 KB Output is correct
2 Correct 18 ms 25216 KB Output is correct
3 Correct 17 ms 25216 KB Output is correct
4 Correct 17 ms 25088 KB Output is correct
5 Correct 17 ms 25088 KB Output is correct
6 Correct 19 ms 25344 KB Output is correct
7 Correct 17 ms 25088 KB Output is correct
8 Correct 18 ms 25216 KB Output is correct
9 Correct 27 ms 25728 KB Output is correct
10 Correct 18 ms 25088 KB Output is correct
11 Correct 39 ms 28408 KB Output is correct
12 Correct 95 ms 32244 KB Output is correct
13 Correct 89 ms 39276 KB Output is correct
14 Correct 314 ms 46200 KB Output is correct
15 Correct 320 ms 47784 KB Output is correct
16 Correct 275 ms 43544 KB Output is correct
17 Correct 251 ms 42744 KB Output is correct
18 Correct 94 ms 32248 KB Output is correct
19 Correct 290 ms 46200 KB Output is correct
20 Correct 306 ms 47348 KB Output is correct
21 Correct 274 ms 43516 KB Output is correct
22 Correct 270 ms 42360 KB Output is correct
23 Correct 288 ms 47728 KB Output is correct
24 Correct 18 ms 25088 KB Output is correct
25 Correct 371 ms 28536 KB Output is correct
26 Correct 663 ms 32376 KB Output is correct
27 Correct 1960 ms 39276 KB Output is correct
28 Correct 3004 ms 46328 KB Output is correct
29 Correct 2981 ms 47504 KB Output is correct
30 Correct 1861 ms 43636 KB Output is correct
31 Correct 2184 ms 42740 KB Output is correct
32 Correct 699 ms 33144 KB Output is correct
33 Correct 2904 ms 46344 KB Output is correct
34 Correct 2927 ms 47876 KB Output is correct
35 Correct 2066 ms 43648 KB Output is correct
36 Correct 2323 ms 42612 KB Output is correct
37 Correct 2828 ms 47856 KB Output is correct
38 Correct 3971 ms 49388 KB Output is correct