ybtoj:强连通分量
A:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , f[N] , ans , a[N] , x[N] , y[N];
int head[N] , cnt;
struct node { int to , nxt; } e[N];
void add ( int u , int v ) { e[++cnt] = { v , head[u] }; head[u] = cnt; }
int dfn[N] , low[N] , timer;
int scc[N] , id[N] , tot;
int in[N] , sta[100000000] , tp;
int rd[N] , res[N] , tmp;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] += a[x];
if ( x == u ) break;
}
}
}
void init()
{
memset ( head , 0 , sizeof head );
cnt = 0;
}
void tuopu ()
{
tp = 0;
for ( int i = 1 ; i <= tot ; i ++ ) if ( !rd[i] ) sta[++tp] = i , res[++tmp] = i;
while ( tp )
{
int u = sta[tp--];
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
rd[v] --;
if ( !rd[v] ) sta[++tp] = v , res[++tmp] = v;
}
}
}
void dp ()
{
for ( int i = 1 ; i <= tot ; i ++ ) f[i] = scc[i];
for ( int k = 1 ; k <= tmp ; k ++ )
{
int u = res[k];
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
f[v] = max ( f[v] , f[u] + scc[v] );
}
}
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
n = read() , m = read();
for ( int i = 1 ; i <= n ; i ++ ) a[i] = read();
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , add ( x[i] , y[i] );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
init();
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) add ( id[x[i]] , id[y[i]] ) , rd[id[y[i]]] ++;
tuopu();
dp();
for ( int i = 1 ; i <= tot ; i ++ ) ans = max ( ans , f[i] );
cout << ans << endl;
return 0;
}
B:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , f[N] , ans , a[N] , x[N] , y[N] , temp = 0 , cd[N];
int head[N] , cnt;
struct node { int to , nxt; } e[N];
void add ( int u , int v ) { e[++cnt] = { v , head[u] }; head[u] = cnt; }
int dfn[N] , low[N] , timer;
int scc[N] , id[N] , tot;
int in[N] , sta[100000000] , tp;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] ++;
if ( x == u ) break;
}
}
}
signed main ()
{
n = read() , m = read();
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , add ( x[i] , y[i] );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) cd[id[x[i]]] ++;
for ( int i = 1 ; i <= tot ; i ++ )
if ( !cd[i] )
{
if ( temp ) { cout << "0" << endl; return 0; }
temp = i;
}
cout << scc[temp] << endl;
return 0;
}
C:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , mod , f[N] , g[N] , x[N] , y[N] , no[N] , used[N] , maxf , maxg;//f[i][j]表示以i为根的子树中 背包容量为j的情况下的的最大价值 那么最后答案就是f[0][m]
int head[N] , cnt;
struct node { int to , nxt , w; } e[N];
void add ( int u , int v , int w = 0 ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
void init()
{
memset ( head , 0 , sizeof head );
cnt = 0;
}
int dfn[N] , low[N] , timer;
int sta[N] , in[N] , tp;
int scc[N] , id[N] , tot;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] ++;
if ( x == u ) break;
}
}
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
n = read() , m = read() , mod = read();
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , add ( x[i] , y[i] );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
init();
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) add ( id[x[i]] , id[y[i]] );
for ( int i = 1 ; i <= tot ; i ++ ) f[i] = scc[i] , g[i] = 1;
for ( int u = tot ; u ; u -- )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( used[v] == u ) continue;
used[v] = u;
if ( f[v] < f[u] + scc[v] )
{
f[v] = f[u] + scc[v];
g[v] = g[u];
}
else if ( f[v] == f[u] + scc[v] )
{
g[v] += g[u];
g[v] %= mod;
}
}
for ( int i = 1 ; i <= tot ; i ++ )
{
if ( maxf < f[i] )
{
maxf = f[i];
maxg = g[i];
}
else if ( maxf == f[i] ) maxg += g[i] , maxg %= mod;
}
cout << maxf << endl << maxg << endl;
return 0;
}
D:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , val[N] , ans;
int head[N] , cnt;
int head1[N] , cnt1;
struct node { int to , nxt , w ; } e[N] , e1[N];
void add ( int u , int v , int w ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
void add1 ( int u , int v , int w ) { e1[++cnt1] = { v , head1[u] , w }; head1[u] = cnt1; }
int dfn[N] , low[N] , timer;
int scc[N] , id[N] , tot;
int in[N] , sta[100000000] , tp;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] ++;
if ( x == u ) break;
}
}
}
signed main ()
{
n = read() , m = read();
for ( int i = 1 , op , a , b ; i <= m ; i ++ )
{
op = read() , a = read() , b = read();
if ( op == 1 ) add ( a , b , 0 ) , add ( b , a , 0 );
else if ( op == 2 ) add ( a , b , 1 );
else if ( op == 3 ) add ( b , a , 0 );
else if ( op == 4 ) add ( b , a , 1 );
else add ( a , b , 0 );
}
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
for ( int u = 1 ; u <= n ; u ++ )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( id[u] != id[v] ) add1 ( id[u] , id[v] , e[i].w );
else if ( e[i].w == 1 ) { cout << "-1" << endl; return 0; }//自己和自己的差为1显然不合法
}
for ( int i = 1 ; i <= tot ; i ++ ) val[i] = 1;//
for ( int u = tot ; u ; u -- )
{
ans += val[u] * scc[u];
for ( int i = head1[u] ; i ; i = e1[i].nxt )
{
int v = e1[i].to;
val[v] = max ( val[v] , val[u] + e1[i].w );
}
}
cout << ans << endl;
return 0;
}
E:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , dis[N] , ans , x[N] , y[N] , w[N];
int head[N] , cnt;
struct node { int to , nxt , w; } e[N];
void add ( int u , int v , int w ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
int dfn[N] , low[N] , timer;
int id[N] , scc[N] , tot;
int sta[N] , in[N] , tp;
void tarjan ( int u )
{
low[u] = dfn[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , scc[tot] ++ , in[x] = 0;
if ( x == u ) break;
}
}
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
n = read() , m = read();
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , w[i] = read() , add ( x[i] , y[i] , w[i] );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
memset ( head , 0 , sizeof head ) , cnt = 0;
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) add ( id[x[i]] , id[y[i]] , w[i] );
memset ( dis , inf , sizeof dis );
dis[id[1]] = 0;
for ( int u = tot ; u ; u -- )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
dis[v] = min ( dis[v] , dis[u] + e[i].w );
}
cout << dis[id[n]] << endl;
return 0;
}
F:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , minv[N] , ans , x[N] , y[N] , w[N];
int head[N] , cnt;
struct node { int to , nxt , w; } e[N];
void add ( int u , int v , int w ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
int dfn[N] , low[N] , timer;
int id[N] , scc[N] , tot;
int sta[N] , in[N] , tp;
void tarjan ( int u )
{
low[u] = dfn[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , scc[tot] ++ , in[x] = 0;
if ( x == u ) break;
}
}
}
void init()
{
memset ( head , 0 , sizeof head );
cnt = 0;
memset ( dfn , 0 , sizeof dfn );
memset ( low , 0 , sizeof low );
timer = 0;
memset ( id , 0 , sizeof id );
memset ( scc , 0 , sizeof scc );
tot = 0;
memset ( sta , 0 , sizeof sta );
memset ( in , 0 , sizeof in );
tp = 0;
memset ( minv , inf , sizeof minv );
ans = 0;
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
while(1)
{
init();
n = read() , m = read();
if ( n == 0 && m == 0 ) break;
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , w[i] = read() , add ( x[i] , y[i] , w[i] );
for ( int i = 0 ; i < n ; i ++ ) if ( !dfn[i] ) tarjan(i);
memset ( head , 0 , sizeof head ) , cnt = 0;
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) add ( id[x[i]] , id[y[i]] , w[i] );
minv[id[0]] = 0;
for ( int u = tot ; u ; u -- )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
minv[v] = min ( minv[v] , e[i].w );
}
for ( int i = 1 ; i <= tot ; i ++ ) ans += minv[i];
cout << ans << endl;
}
return 0;
}
G:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , dis[N] , x[N] , y[N] , rd[N] , ans;
int head[N] , cnt;
struct node { int to , nxt , w ; } e[N] , e1[N];
void add ( int u , int v , int w = 0 ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
int dfn[N] , low[N] , timer;
int sta[N] , in[N] , tp;
int id[N] , scc[N] , tot;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( low[u] == dfn[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] ++;
if ( x == u ) break;
}
}
}
void init()
{
memset ( head , 0 , sizeof head );
cnt = 0;
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
n = read() , m = read();
for ( int i = 1 ; i <= m ; i ++ ) x[i] = read() , y[i] = read() , add ( x[i] , y[i] );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
init();
for ( int i = 1 ; i <= m ; i ++ ) if ( id[x[i]] != id[y[i]] ) add ( id[x[i]] , id[y[i]] );
for ( int i = 1 ; i <= tot ; i ++ ) dis[i] = scc[i];
for ( int u = tot ; u ; u -- )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
dis[v] = max ( dis[v] , dis[u] + scc[v] );
}
for ( int i = 1 ; i <= tot ; i ++ ) ans = max ( ans , dis[i] );
cout << ans << endl;
return 0;
}
H:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
const int inf = 0x3f3f3f3f;
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , dis[N] , ans , vv[N] , ww[N] , f[N][N] , rd[N];
int head[N] , cnt;
int head1[N] , cnt1;
struct node { int to , nxt , w; } e[N] , e1[N];
void add ( int u , int v , int w = 0 ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
void add1 ( int u , int v , int w = 0 ) { e1[++cnt1] = { v , head1[u] , w }; head1[u] = cnt1; }
int dfn[N] , low[N] , timer;
int id[N] , val[N] , wei[N] , tot;
int sta[N] , in[N] , tp;
void tarjan ( int u )
{
low[u] = dfn[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , val[tot] += vv[x] , wei[tot] += ww[x];
if ( x == u ) break;
}
}
}
void dfs ( int u )
{
for ( int i = head1[u] ; i ; i = e1[i].nxt )
{
int v = e1[i].to;
dfs(v);
for ( int j = m ; j >= wei[u] ; j -- )
for ( int k = wei[v] ; k <= j - wei[u] ; k ++ )
f[u][j] = max ( f[u][j] , f[u][j-k] + f[v][k] );
}
}
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
n = read() , m = read();
for ( int i = 1 ; i <= n ; i ++ ) ww[i] = read();
for ( int i = 1 ; i <= n ; i ++ ) vv[i] = read();
for ( int i = 1 , u ; i <= n ; i ++ ) if ( u = read() ) add ( u , i );
for ( int i = 1 ; i <= n ; i ++ ) if ( !dfn[i] ) tarjan(i);
for ( int u = 1 ; u <= n ; u ++ )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( id[u] != id[v] ) add1 ( id[u] , id[v] ) , rd[id[v]] ++;
}
for ( int i = 1 ; i <= tot ; i ++ ) if ( !rd[i] ) add1 ( 0 , i );
for ( int i = 1 ; i <= tot ; i ++ ) f[i][wei[i]] = val[i];
dfs(0);
cout << f[0][m] << endl;
return 0;
}
I:
点击查看代码
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mkp make_pair
const int N = 1e7 + 5;
const int inf = 0x3f3f3f3f;
const int dx[9] = { 0 , 0 , 0 , 1 , -1 , 1 , 1 , -1 , -1 };
const int dy[9] = { 0 , 1 , -1 , 0 , 0 , 1 , -1 , 1 , -1 };
int read ()
{
int x = 0 , f = 1;
char ch = cin.get();
while ( !isdigit ( ch ) ) { if ( ch == '-' ) f = -1; ch = cin.get(); }
while ( isdigit ( ch ) ) { x = ( x << 1 ) + ( x << 3 ) + ( ch ^ 48 ); ch = cin.get(); }
return x * f;
}
int n , m , q , f[N] , maxx , num[N] , xx[N] , yy[N];//f[i][j]表示以i为根的子树中 背包容量为j的情况下的的最大价值 那么最后答案就是f[0][m]
int head[N] , cnt;
int head1[N] , cnt1;
struct node { int to , nxt , w; } e[N] , e1[N];
void add ( int u , int v , int w = 0 ) { e[++cnt] = { v , head[u] , w }; head[u] = cnt; }
void add1 ( int u , int v , int w = 0 ) { e1[++cnt1] = { v , head1[u] , w }; head1[u] = cnt1; }
int dfn[N] , low[N] , timer;
int sta[N] , in[N] , tp;
int scc[N] , id[N] , tot;
void tarjan ( int u )
{
dfn[u] = low[u] = ++timer;
sta[++tp] = u , in[u] = 1;
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( !dfn[v] ) tarjan(v) , low[u] = min ( low[u] , low[v] );
else if ( in[v] ) low[u] = min ( low[u] , dfn[v] );
}
if ( dfn[u] == low[u] )
{
tot ++;
while ( tp )
{
int x = sta[tp--];
id[x] = tot , in[x] = 0 , scc[tot] += num[x];
if ( x == u ) break;
}
}
}
map < pii , int > mp;
int heng ( int x ) { return x; }
int zong ( int x ) { return x + n; }
int bao ( int x ) { return x + n + m; }
int check ( int x , int y ) { return 1 <= x && x <= n && 1 <= y && y <= m && mp[mkp(x,y)]; }
signed main ()
{
ios::sync_with_stdio(false);
cin.tie(0) , cout.tie(0);
q = read() , n = read() , m = read();
for ( int i = 1 ; i <= q ; i ++ )
{
int x = read() , y = read() , op = read();
num[bao(i)] = 1;
add ( heng(x) , bao(i) ) , add ( zong(y) , bao(i) );
if ( op == 1 ) add ( bao(i) , heng(x) );
if ( op == 2 ) add ( bao(i) , zong(y) );
if ( op == 3 ) xx[i] = x , yy[i] = y;
mp[mkp(x,y)] = i;
}
for ( int i = 1 ; i <= q ; i ++ )
if ( xx[i] && yy[i] )
for ( int j = 1 , x , y ; j <= 8 ; j ++ )
if ( check ( x = xx[i] + dx[j] , y = yy[i] + dy[j] ) )
add ( bao(i) , bao(mp[mkp(x,y)]) );
for ( int i = 1 ; i <= n + m + q ; i ++ ) if ( !dfn[i] ) tarjan(i);
for ( int u = 1 ; u <= n + m + q ; u ++ )
for ( int i = head[u] ; i ; i = e[i].nxt )
{
int v = e[i].to;
if ( id[u] != id[v] ) add1 ( id[u] , id[v] );
}
for ( int i = 1 ; i <= tot ; i ++ ) f[i] = scc[i];
for ( int u = tot ; u ; u -- )
for ( int i = head1[u] ; i ; i = e1[i].nxt )
{
int v = e1[i].to;
f[v] = max ( f[v] , f[u] + scc[v] );
}
for ( int i = 1 ; i <= tot ; i ++ ) maxx = max ( maxx , f[i] );
cout << maxx << endl;
return 0;
}
//如果代码有误，欢迎踹死我咩_
