oj.uz

Submission #64773

# Submission time Handle Problem Language Result Execution time Memory
64773 2018-08-05T15:13:56 Z TadijaSebez Tropical Garden (IOI11_garden) C++11
69 / 100
 149 ms 24944 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],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];
		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];
		//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:19: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:74: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 7484 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7556 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 9 ms 7596 KB Output is correct
7 Correct 8 ms 7368 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7516 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7484 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7556 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 9 ms 7596 KB Output is correct
7 Correct 8 ms 7368 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7516 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct
11 Correct 18 ms 9184 KB Output is correct
12 Correct 35 ms 10136 KB Output is correct
13 Correct 74 ms 24944 KB Output is correct
14 Correct 106 ms 16464 KB Output is correct
15 Correct 144 ms 17556 KB Output is correct
16 Correct 111 ms 14712 KB Output is correct
17 Correct 97 ms 13800 KB Output is correct
18 Correct 34 ms 10592 KB Output is correct
19 Correct 110 ms 17620 KB Output is correct
20 Correct 149 ms 18260 KB Output is correct
21 Correct 113 ms 15636 KB Output is correct
22 Correct 103 ms 14756 KB Output is correct
23 Correct 108 ms 18316 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7484 KB Output is correct
2 Correct 9 ms 7544 KB Output is correct
3 Correct 9 ms 7556 KB Output is correct
4 Correct 8 ms 7396 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Correct 9 ms 7596 KB Output is correct
7 Correct 8 ms 7368 KB Output is correct
8 Correct 9 ms 7544 KB Output is correct
9 Correct 11 ms 7516 KB Output is correct
10 Correct 8 ms 7416 KB Output is correct
11 Correct 18 ms 9184 KB Output is correct
12 Correct 35 ms 10136 KB Output is correct
13 Correct 74 ms 24944 KB Output is correct
14 Correct 106 ms 16464 KB Output is correct
15 Correct 144 ms 17556 KB Output is correct
16 Correct 111 ms 14712 KB Output is correct
17 Correct 97 ms 13800 KB Output is correct
18 Correct 34 ms 10592 KB Output is correct
19 Correct 110 ms 17620 KB Output is correct
20 Correct 149 ms 18260 KB Output is correct
21 Correct 113 ms 15636 KB Output is correct
22 Correct 103 ms 14756 KB Output is correct
23 Correct 108 ms 18316 KB Output is correct
24 Incorrect 9 ms 7388 KB Output isn't correct
25 Halted 0 ms 0 KB -