| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 348313 | amunduzbaev | Tropical Garden (IOI11_garden) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/** made by amunduzbaev **/
#include "garden.h"
#include "gardenlib.h"
#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Pi acos(-1);
#define mod 1e9+7
#define inf 1e18
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
const int NN = 3e5+5;
vii edges[NN], gg[NN];
stack<int> ss;
int goal, oncyc[NN], last, used[NN], len[NN], in[NN];
int comp[NN], pos[NN], bup[NN], dd[NN], ddn[NN];
int nn;
void dfs(int u){
if(used[u] && in[u]){
oncyc[u] = ++last;
len[last]++;
while(!ss.empty() && ss.top() != u){
oncyc[ss.top()] = last;
len[last]++;
ss.pop();
}
return;
}
if(used[u]) return;
used[u] = 1;
ss.push(u);
in[u] = 1;
dfs(bup[u]);
in[u] = 0;
}
int tin[NN], tout[NN], tim;
int rr[NN], ddr[NN];
void treepr(int u, int root){
comp[u] = comp[root];
rr[u] = root;
tin[u] = ++tim;
for(auto x:edges[u]){
if(oncyc[x]) continue;
ddr[x] = ddr[u]+1;
treepr(x, root);
}
tout[u] = tim;
}
bool check(int u, int k, int goal){
if(comp[u] != comp[goal]) return 0;
if(oncyc[u] && !oncyc[goal]) return 0;
if(!oncyc[u]){
if(!oncyc[goal]){
return (tin[goal] <= tin[u] && tout[goal] >= tout[u] ? ddr[u] - ddr[goal] == k : 0);
}
else{
if(goal >= nn){
k -= ddr[u];
k -= ddn[rr[u]];
return (k >=0 && k%len[oncyc[goal]] == 0);
}else{
k -= ddr[u];
k -= dd[rr[u]];
return (k >=0 && k%len[oncyc[goal]] == 0);
}
}
}
else{
if(goal >= nn){
k -= ddn[u];
return (k >=0 && k%len[oncyc[goal]] == 0);
}else{
k -= dd[u];
return (k >=0 && k%len[oncyc[goal]] == 0);
}
}
}
void count_routes(int n, int m, int p, int R[][2], int q, int kk[]){
nn = n;
for(int i=0; i<m; i++){
int a = R[i][0], b = R[i][1];
if(sz(gg[a]) < 2) gg[a].pb(b);
if(sz(gg[b]) < 2) gg[b].pb(a);
}
memset(rr, -1, sizeof rr);
memset(bup, -1, sizeof bup);
memset(dd, -1, sizeof dd);
memset(ddn, -1, sizeof ddn);
for(int i=0;i<n;i++){
for(int j=0;j<sz(gg[i]);j++){
int to = gg[i][j];
if(gg[to][0] == i && sz(gg[to]) > 1){
bup[i + j * n] = to+n;
edges[to+n].pb(i + j*n);
}else{
bup[i + j * n] = to;
edges[to].pb(i + j*n);
}
}
}
goal = p;
for(int i=0;i<2*n;i++){
if(used[i]) continue;
while(!ss.empty()) ss.pop();
dfs(i);
}
for(int i=0;i<2*n;i++){
if(oncyc[i]){
comp[i] = oncyc[i];
rr[i] = i;
treepr(i, i);
}
}
if(oncyc[p]){
int dis = len[oncyc[p]] -1, cur = bup[p];
while(cur != p){
dd[cur] = dis;
cur = bup[cur], dis--;
}
}
if(oncyc[p+n]){
int dis = len[oncyc[p+n]] -1, cur = bup[p+n];
while(cur != p+n){
ddn[cur] = dis;
cur = bup[cur], dis--;
}
}
/*
for(int i=0;i<2*n;i++) cout<<dd[i]<<" ";
cout<<"\n\n";
for(int i=0;i<2*n;i++) cout<<ddn[i]<<" ";
cout<<"\n";
*/
//cout<<"\n";
for(int i=0;i<q;i++){
int cnt = 0;
for(int j=0;j<n;j++){
cnt += ( check(j, kk[i], p) | check(j, kk[i], p+n) );
//cout<<j<<" "<<cnt<<"\n";
}
//cout<<"\n";
answer(cnt);
}
}
/*
6 6 0
1 2
0 1
0 3
3 4
4 5
1 5
1
3
2
5 5 2
1 0
1 2
3 2
1 3
4 2
2
3 1
1 2
*/