#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
#define ALL(i) i.begin(),i.end()
#define SZ(i) int(i.size())
#define X first
#define Y second
#define eb emplace_back
#define pb push_back
#ifdef tmd
#define debug(...) fprintf(stderr,"#%d-(%s)=",__LINE__,#__VA_ARGS__);_do(__VA_ARGS__);
template<typename T> void _do(T &&x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y) {cerr<<x<<",";_do(y...);}
template<typename IT> ostream& printRng (ostream& os, IT bg, IT ed) {
os << "{";
for (IT it=bg; it!=ed; it++) {
if (it == bg) os << *it;
else os << "," << *it;
}
return os << "}";
}
template<typename T> ostream& operator << (ostream& os, const vector<T>& v) {return printRng(os,ALL(v));}
#else
#define debug(...)
#endif
#include "garden.h"
#include "gardenlib.h"
const int INF = 0x3f3f3f3f;
int n, m, p;
struct Edge {
int to, w, id;
bool operator < (const Edge &e) const {
return w < e.w;
}
};
vector<vector<Edge>> edge;
vector<int> to, csz, dis, dfn;
int tme = 0;
int init;
void make_csz (int nd) {
dfn[nd] = tme++;
csz[nd] = INF;
if (csz[to[nd]] == -1) make_csz(to[nd]);
else if (csz[to[nd]] == INF) {
if (dfn[to[nd]] >= init) {
csz[to[nd]] = tme - dfn[to[nd]];
}
}
csz[nd] = csz[to[nd]];
}
void make_dis (int nd) {
dis[nd] = INF;
if (dis[to[nd]] == -1) make_dis(to[nd]);
dis[nd] = dis[to[nd]] + 1;
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
edge.resize(N);
n = N;
m = N;
p = P;
int cnt = 0;
for (int i=0; i<M; i++) {
int u = R[i][0], v = R[i][1];
edge[u].pb({v, i, cnt++});
edge[v].pb({u, i, cnt++});
}
to.resize(cnt), csz.resize(cnt, -1), dis.resize(cnt, -1);
dfn.resize(cnt, 0);
for (int i=0; i<n; i++) {
sort(ALL(edge));
}
vector<int> start;
for (int i=0; i<n; i++) {
for (const Edge &e : edge[i]) {
int x = e.to;
if (x == p) dis[e.id] = 0;
if (SZ(edge[x]) == 1) {
to[e.id] = edge[x][0].id;
} else {
to[e.id] = edge[x][edge[x][0].w == e.w ? 1 : 0].id;
}
}
start.eb(edge[i][0].id);
}
for (int i=0; i<cnt; i++) {
if (csz[i] == -1) {
init = tme;
make_csz(i);
}
}
for (int i=0; i<cnt; i++) {
if (dis[i] == -1) {
make_dis(i);
}
}
for (int i=0; i<Q; i++) {
int ans = 0;
for (int x : start) {
if (dis[x] < INF) {
ans += (G[i] - 1 - dis[x]) % csz[i] == 0;
}
}
answer(ans);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
