#include "garden.h"
#include "gardenlib.h"
#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pb push_back
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
#define sp <<' '<<
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) {for(auto el:x) cout<<el<<' ';cout<<endl;}
#define contp(x) {for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;}
#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define carp(x,y) (((x)%mod)*((y)%mod))%mod
#define topla(x,y) (((x)%mod)+((y)%mod))%mod
const int MAXN=2e5+4;
const int MAXK=25;
#define mid (l+r)/2
#define endl '\n'
int n,m,p;
vii adj[MAXN];
int suc[MAXN][MAXK][3];
int gir[MAXN][MAXK][3];
int cik[MAXN][MAXK][3];
//suc[n][k][b]={a,c} --> n.nodedan k kez ilerlersem a.ya ulaşırım b.edgei kullanarak
void calc(){
FORE(k,1,MAXK){
FORE(nd,1,n+1){
/*
suc[nd][k-1][1]--> 1 routeunda nd den 2^(k-1) ilerle
bu nodedan da 2^(k-1) ilerle
hangi routta? cikis[nd][k-1][1] routunda
cikis[nd][k][1] neye eşit? yarıdaki nodeun k-1 gez ilerledikten sonra belirlenen routta
ulaştığı nodeun ciki
*/
suc[nd][k][1]=suc[suc[nd][k-1][1]][k-1][cik[nd][k-1][1]];//min edge i kullan da gel
cik[nd][k][1]=cik[suc[nd][k-1][1]][k-1][cik[nd][k-1][1]];
gir[nd][k][1]=2;
suc[nd][k][2]=suc[suc[nd][k-1][2]][k-1][cik[nd][k-1][2]];//min edge i kullan da gel
cik[nd][k][2]=cik[suc[nd][k-1][2]][k-1][cik[nd][k-1][2]];
gir[nd][k][2]=1;
}
}
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
n=N;
m=M;
p=P;
FORE(i,1,m+1){
int from=R[i][0];
int to=R[i][1];
adj[from].pb({i-1,to});
adj[to].pb({i-1,from});
}
FORE(i,1,n+1){
sort(all(adj[i]));
while(adj[i].size()>2) adj[i].pop_back();
//route if i go from the min edge
int kom=adj[i][0].se;
suc[i][0][1]=kom; //1--> min edgele cik
gir[i][0][1]=2; // maxla gir
if(adj[kom][0].se==i and adj[kom].size()>1){ //komsumun min edge i de benle aramdakiyse
cik[i][0][1]=2;//adj[kom][1].fi;
//cik su an üstünde bulunduğum nodeun kullanılmasını
//istediğim edgei
}
else{
cik[i][0][1]=1;//adj[kom][0].fi;
}
if(adj[i].size()>=2){ //2.bir route varsa
//try calculating the other edge
kom=adj[i][1].se;
suc[i][0][2]=kom; //1-->max edgele cik
gir[i][0][2]=1; //minle gir
if(adj[kom][0].se==i and adj[kom].size()>1){ //komsumun min edge i de benle aramdakiyse
cik[i][0][2]=2;//adj[kom][1].fi;
}
else{
cik[i][0][2]=1;//adj[kom][0].fi;
}
}
}
//calculate successor of each node
calc();
int q=Q;
vi qq, cc;
while(q--){
int deg;
cin>>deg;
qq.pb(deg);
cc.pb(deg);
}
sort(all(qq));
vi cur(n+1);
map<int,int> cev;
FORE(i,1,n+1) cur[i]=i;
int once=0;
for(auto el:qq){
//el kadar tüm nodeları ilerlet
el-=once;
FORE(i,1,MAXK){
if((1<<i)>el) break;
if(el&(1<<i)){
FORE(nd,1,n+1){
cur[nd]=suc[nd][i][1];
}
}
}
FORE(nd,1,n+1){
if(cur[nd]==p) cev[el]++;
}
once+=el;
}
for(auto el:cc){
answer(cev[el]);
}
}
Compilation message
/usr/bin/ld: /tmp/ccOD51EU.o: in function `read_input()':
grader.cpp:(.text+0x0): multiple definition of `read_input()'; /tmp/cccf1GvW.o:garden.cpp:(.text+0xa20): first defined here
/usr/bin/ld: /tmp/ccOD51EU.o: in function `answer(int)':
grader.cpp:(.text+0x130): multiple definition of `answer(int)'; /tmp/cccf1GvW.o:garden.cpp:(.text+0xb50): first defined here
/usr/bin/ld: /tmp/ccOD51EU.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/cccf1GvW.o:garden.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
