oj.uz

Submission #898692

# Submission time Handle Problem Language Result Execution time Memory
898692 2024-01-05T03:19:39 Z Faisal_Saqib Tropical Garden (IOI11_garden) C++17
0 / 100
 7 ms 4680 KB 
// #pragma once 
#include "gardenlib.h"
#include "garden.h"
#include <vector>
#include <iostream>
using namespace std;
const int N1=1e5;
vector<int> ma[N1];
int in=0;
int fin=-1;
int wnt;
bool vis[N1];
void dfs(int x)
{
	vis[x]=1;
	if(in==wnt)
		fin=x;
	for(int y:ma[x])
	{
		if(!vis[y])
		{
			in++;
			dfs(y);
		}
	}
	in++;
}
void count_routes(int n, int m, int p, int r[][2], int q, int g[])
{
	int ans=0;
	for(int i=0;i<m;i++)
	{
		ma[r[i][0]].push_back(r[i][1]);
		ma[r[i][1]].push_back(r[i][0]);
	}
	wnt=g[0];
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
			vis[j]=0;
		in=0;
		fin=-1;
		dfs(i);
		ans+=(fin==p);
	}
	answer(ans);
}

Subtask #1
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4680 KB Output isn't correct
2 Halted 0 ms 0 KB -