oj.uz

Submission #1042337

# Submission time Handle Problem Language Result Execution time Memory
1042337 2024-08-02T21:39:25 Z Edu175 Tropical Garden (IOI11_garden) C++17
49 / 100
 5000 ms 9048 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,hgfmdg=b;i<hgfmdg;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto sldhg:v)cout<<sldhg<<" ";cout<<"\n";}
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MAXN=300005;

vector<ll> g[MAXN];

ll n,p;
ll go(ll u, ll v){
	if(SZ(g[v])==1)return 2*v;
	if(g[v][0]==u)return 2*v+1;
	return 2*v;
}
ll a[MAXN];

void count_routes(int N, int m, int P, int R[][2], int q, int qs[])
{
	n=N,p=P;
	fore(i,0,m){
		ll u=R[i][0],v=R[i][1];
		g[u].pb(v);
		g[v].pb(u);
	}
	fore(x,0,n){
		a[2*x]=go(x,g[x][0]);
		if(SZ(g[x])>1)a[2*x+1]=go(x,g[x][1]);
	}
	fore(_,0,q){
		ll res=0;
		ll k=qs[_];
		fore(x,0,2*n)if(!(x&1)){
			ll y=x;
			fore(__,0,k)y=a[y];
			res+=y/2==p;
		}
		answer(res);
	}
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 1 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 2 ms 7512 KB Output is correct
7 Correct 1 ms 7620 KB Output is correct
8 Correct 1 ms 7516 KB Output is correct
9 Correct 2 ms 7772 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 1 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 2 ms 7512 KB Output is correct
7 Correct 1 ms 7620 KB Output is correct
8 Correct 1 ms 7516 KB Output is correct
9 Correct 2 ms 7772 KB Output is correct
10 Correct 3 ms 7512 KB Output is correct
11 Execution timed out 5021 ms 9048 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 1 ms 7516 KB Output is correct
4 Correct 3 ms 7516 KB Output is correct
5 Correct 3 ms 7260 KB Output is correct
6 Correct 2 ms 7512 KB Output is correct
7 Correct 1 ms 7620 KB Output is correct
8 Correct 1 ms 7516 KB Output is correct
9 Correct 2 ms 7772 KB Output is correct
10 Correct 3 ms 7512 KB Output is correct
11 Execution timed out 5021 ms 9048 KB Time limit exceeded
12 Halted 0 ms 0 KB -