oj.uz

Submission #64784

# Submission time Handle Problem Language Result Execution time Memory
64784 2018-08-05T16:09:23 Z TadijaSebez Tropical Garden (IOI11_garden) C++11
100 / 100
 139 ms 27320 KB 
#include "garden.h"
#include "gardenlib.h"
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define pb push_back
const int N=150050;
const int M=2*N;
//---------------------//
/*
void answer(int x){ printf("%i\n",x);}
*/
//---------------------//
int go[M],deg[M],dep[M],cnt[M],sol[M];
vector<int> E[M];
pair<int,int> Qs[M];
void DFS(int u, int d)
{
	dep[u]=d;
	for(int i=0;i<E[u].size();i++)
	{
		int v=E[u][i];
		if(dep[v]==-1) DFS(v,d+1);
	}
}
bool was[M];
int Cycle(int u, int n)
{
	int i,ret=0;
	for(i=0;i<n*2;i++) was[i]=0;
	for(i=u;!was[i];i=go[i]) was[i]=1,ret++;
	if(i==u) return ret;
	return 0;
}
void count_routes(int n, int m, int p, int r[][2], int q, int k[])
{
	int i,j,cyc;
	for(i=0;i<q;i++) Qs[i].first=k[i],Qs[i].second=i;
	sort(Qs,Qs+q);
	for(i=0;i<n*2;i++) go[i]=-1;
	for(i=0;i<m;i++)
	{
		int u=r[i][0],v=r[i][1];
		int f1=0,f2=0;
		if(!~go[u<<1]) f1=1;
		else if(!~go[u<<1|1]) f1=2;
		if(!~go[v<<1]) f2=1;
		else if(!~go[v<<1|1]) f2=2;
		if(f1==1) go[u<<1]=f2==1?v<<1|1:v<<1;
		if(f1==2) go[u<<1|1]=f2==1?v<<1|1:v<<1;
		if(f2==1) go[v<<1]=f1==1?u<<1|1:u<<1;
		if(f2==2) go[v<<1|1]=f1==1?u<<1|1:u<<1;
	}
	for(i=0;i<n*2;i++) if(!~go[i]) go[i]=go[i^1];
	for(i=0;i<n*2;i++) E[go[i]].pb(i);//,printf("%i -> %i\n",go[i],i);
	for(i=0;i<n*2;i++) dep[i]=-1;
	for(i=0;i<=n*2;i++) cnt[i]=0;
	DFS(p<<1,0);
	cyc=Cycle(p<<1,n);
	//printf("-> %i\n",cyc);
	if(!cyc)
	{
		for(i=0;i<n*2;i+=2) if(dep[i]>=0) cnt[dep[i]]++;
		for(i=0;i<q;i++) if(k[i]<=2*n) sol[i]+=cnt[k[i]];
	}
	else
	{
		vector<int> Ds;
		for(i=0;i<n*2;i+=2) if(dep[i]>=0) Ds.pb(dep[i]);
		sort(Ds.begin(),Ds.end());
		j=0;
		for(i=0;i<q;i++)
		{
			while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
			sol[Qs[i].second]+=cnt[Qs[i].first%cyc];
		}
	}
	//for(i=0;i<q;i++) printf("%i ",sol[i]);printf("\n");
	for(i=0;i<n*2;i++) dep[i]=-1;
	for(i=0;i<=n*2;i++) cnt[i]=0;
	DFS(p<<1|1,0);
	cyc=Cycle(p<<1|1,n);
	//printf("-> %i\n",cyc);
	if(!cyc)
	{
		for(i=0;i<n*2;i+=2) if(dep[i]>=0) cnt[dep[i]]++;
		for(i=0;i<q;i++) if(k[i]<=2*n) sol[i]+=cnt[k[i]];
	}
	else
	{
		vector<int> Ds;
		for(i=0;i<n*2;i+=2) if(dep[i]>=0) Ds.pb(dep[i]);
		sort(Ds.begin(),Ds.end());
		j=0;
		for(i=0;i<q;i++)
		{
			while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
			sol[Qs[i].second]+=cnt[Qs[i].first%cyc];
		}
	}
	for(i=0;i<q;i++) answer(sol[i]);
}
/*int go[M],lo[M],dep[M];
vector<int> E[M];
void DFS(int u, int p)
{
	for(int i=0;i<E[u].size();i++)
	{
		int v=E[u][i];
		dep[v]=dep[u]+1;
		if(v!=p) DFS(v,p);
	}
}
pair<int,int> Qs[N];
int cnt[M],sol[N];
void count_routes(int n, int m, int p, int r[][2], int q, int k[])
{
	int i,j;
	for(i=0;i<q;i++) Qs[i].first=k[i],Qs[i].second=i;
	sort(Qs,Qs+q);
	for(i=0;i<n*2;i++) lo[i]=-1;
	for(i=0;i<n*2;i++) go[i]=-1;
	for(i=0;i<m;i++)
	{
		if(lo[r[i][0]<<1]==-1) lo[r[i][0]<<1]=i;
		else if(lo[r[i][0]<<1|1]==-1) lo[r[i][0]<<1|1]=i;
		if(lo[r[i][1]<<1]==-1) lo[r[i][1]<<1]=i;
		else if(lo[r[i][1]<<1|1]==-1) lo[r[i][1]<<1|1]=i;
	}
	for(i=0;i<n*2;i++)
	{
		int x=lo[i];
		if(lo[i]==-1) x=lo[i^1];
		int v=r[x][0];
		if(v==i/2) v=r[x][1];
		if(x==lo[v<<1]) go[i]=v<<1|1;
		else go[i]=v<<1;
	}
	for(i=0;i<2*n;i++)
	{
		E[go[i]].pb(i);
		//printf("%i -> %i\n",go[i],i);
		dep[i]=-1;
	}
	dep[p<<1]=0;
	DFS(p<<1,p<<1);
	if(dep[p<<1]==0)
	{
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) cnt[dep[i]]++;
		for(i=0;i<q;i++) if(k[i]<M) sol[i]+=cnt[k[i]];
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) cnt[dep[i]]--;
	}
	else
	{
		int cyc=dep[p<<1];
		dep[p<<1]=0;
		j=0;
		vector<int> Ds;
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) Ds.pb(dep[i]);
		sort(Ds.begin(),Ds.end());
		for(i=0;i<q;i++)
		{
			while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
			sol[Qs[i].second]+=cnt[Qs[i].first%cyc];
		}
		for(i=0;i<cyc;i++) cnt[i]=0;
	}
	for(i=0;i<2*n;i++) dep[i]=-1;
	dep[p<<1|1]=0;
	DFS(p<<1|1,p<<1|1);
	if(dep[p<<1|1]==0)
	{
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) cnt[dep[i]]++;
		for(i=0;i<q;i++) if(k[i]<M) sol[i]+=cnt[k[i]];
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) cnt[dep[i]]--;
	}
	else
	{
		int cyc=dep[p<<1|1];
		dep[p<<1|1]=0;
		//printf("%i :D\n",cyc);
		j=0;
		vector<int> Ds;
		for(i=0;i<2*n;i+=2) if(dep[i]>=0) Ds.pb(dep[i]);
		sort(Ds.begin(),Ds.end());
		for(i=0;i<q;i++)
		{
			while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
			sol[Qs[i].second]+=cnt[Qs[i].first%cyc];
		}
		for(i=0;i<cyc;i++) cnt[i]=0;
	}
	for(i=0;i<q;i++) answer(sol[i]);
}*/
//---------------------//
/*
int r[N][2],k[N];
int main()
{
	int n,m,p,q,i;
	scanf("%i %i %i",&n,&m,&p);
	for(i=0;i<m;i++) scanf("%i %i",&r[i][0],&r[i][1]);
	scanf("%i",&q);
	for(i=0;i<q;i++) scanf("%i",&k[i]);
	count_routes(n,m,p,r,q,k);
	return 0;
}
*/
//---------------------//

Compilation message

garden.cpp: In function 'void DFS(int, int)':
garden.cpp:21:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<E[u].size();i++)
              ~^~~~~~~~~~~~
garden.cpp: In function 'void count_routes(int, int, int, int (*)[2], int, int*)':
garden.cpp:75:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
          ~^~~~~~~~~~
garden.cpp:98:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(j<Ds.size() && Ds[j]<=Qs[i].first) cnt[Ds[j]%cyc]++,j++;
          ~^~~~~~~~~~

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 9 ms 7516 KB Output is correct
4 Correct 8 ms 7388 KB Output is correct
5 Correct 8 ms 7460 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7536 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 9 ms 7516 KB Output is correct
4 Correct 8 ms 7388 KB Output is correct
5 Correct 8 ms 7460 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7536 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct
11 Correct 19 ms 9336 KB Output is correct
12 Correct 32 ms 10228 KB Output is correct
13 Correct 67 ms 21688 KB Output is correct
14 Correct 100 ms 16712 KB Output is correct
15 Correct 135 ms 17876 KB Output is correct
16 Correct 106 ms 14892 KB Output is correct
17 Correct 97 ms 13992 KB Output is correct
18 Correct 34 ms 10120 KB Output is correct
19 Correct 100 ms 16732 KB Output is correct
20 Correct 134 ms 17372 KB Output is correct
21 Correct 104 ms 14900 KB Output is correct
22 Correct 93 ms 13688 KB Output is correct
23 Correct 104 ms 17504 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7552 KB Output is correct
2 Correct 7 ms 7416 KB Output is correct
3 Correct 9 ms 7516 KB Output is correct
4 Correct 8 ms 7388 KB Output is correct
5 Correct 8 ms 7460 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7536 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct
11 Correct 19 ms 9336 KB Output is correct
12 Correct 32 ms 10228 KB Output is correct
13 Correct 67 ms 21688 KB Output is correct
14 Correct 100 ms 16712 KB Output is correct
15 Correct 135 ms 17876 KB Output is correct
16 Correct 106 ms 14892 KB Output is correct
17 Correct 97 ms 13992 KB Output is correct
18 Correct 34 ms 10120 KB Output is correct
19 Correct 100 ms 16732 KB Output is correct
20 Correct 134 ms 17372 KB Output is correct
21 Correct 104 ms 14900 KB Output is correct
22 Correct 93 ms 13688 KB Output is correct
23 Correct 104 ms 17504 KB Output is correct
24 Correct 9 ms 7416 KB Output is correct
25 Correct 20 ms 9476 KB Output is correct
26 Correct 42 ms 10744 KB Output is correct
27 Correct 70 ms 22748 KB Output is correct
28 Correct 98 ms 17912 KB Output is correct
29 Correct 133 ms 19140 KB Output is correct
30 Correct 109 ms 16464 KB Output is correct
31 Correct 91 ms 15428 KB Output is correct
32 Correct 33 ms 10716 KB Output is correct
33 Correct 99 ms 18268 KB Output is correct
34 Correct 139 ms 19448 KB Output is correct
35 Correct 107 ms 16272 KB Output is correct
36 Correct 104 ms 15448 KB Output is correct
37 Correct 104 ms 19192 KB Output is correct
38 Correct 103 ms 27320 KB Output is correct