This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<pii> adj[N];
vector<bool> vis(N);
void dfs1(int u){
vis[u] = 1;
for(auto [v,t] : adj[u]){
if(vis[v] or t == 2) conts;
dfs1(v);
}
}
vector<int> mn_reach(N,inf1), mx_reach(N,-inf1);
void dfs2(int u, int id){
vis[u] = 1;
amin(mn_reach[u],id);
for(auto [v,t] : adj[u]){
if(vis[v] or t == 1) conts;
dfs2(v,id);
}
}
void dfs3(int u, int id){
vis[u] = 1;
amax(mx_reach[u],id);
for(auto [v,t] : adj[u]){
if(vis[v] or t == 1) conts;
dfs3(v,id);
}
}
void solve(int test_case)
{
int n,m,A,B; cin >> n >> m >> A >> B;
vector<pii> a(n+5);
rep1(i,n) cin >> a[i].ff >> a[i].ss;
rep1(i,m){
int u,v,t; cin >> u >> v >> t;
if(t == 1){
adj[u].pb({v,1}), adj[v].pb({u,2});
}
else{
adj[u].pb({v,3}), adj[v].pb({u,3});
}
}
rep1(i,n){
if(!vis[i] and a[i].ff == 0){
dfs1(i);
}
}
vector<pii> right_good;
rep1(i,n){
if(vis[i]){
if(a[i].ff == A){
right_good.pb({a[i].ss,i});
}
}
}
sort(all(right_good));
int siz = sz(right_good);
right_good.insert(right_good.begin(),{0,0});
fill(all(vis),0);
rep1(i,siz){
if(!vis[i]){
dfs2(right_good[i].ss,i);
}
}
fill(all(vis),0);
rev(i,siz,1){
if(!vis[i]){
dfs3(right_good[i].ss,i);
}
}
vector<pii> ans;
rep1(i,n){
if(a[i].ff == 0){
int mn = mn_reach[i], mx = mx_reach[i];
int cnt = max(mx-mn+1,0);
ans.pb({a[i].ss,cnt});
}
}
sort(rall(ans));
for(auto [y,c] : ans){
cout << c << endl;
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |