Submission #1285254

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285254		d1mk	Traffic (CEOI11_tra)	C++20	0 / 100	700 ms	42828 KiB

tra

/// 407!3 +/ \!<07!\*
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvpi = vector<vpi>;
using va3 = vector<array<int, 3>>;
using va4 = vector<array<int, 4>>;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define er erase
#define ub upper_bound
#define lb lower_bound

// loops
#define FOR(i,a,b) for (ll i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (ll i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 3e5+5;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!
const char nl = '\n';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

template<typename T>
using indexed_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fbo find_by_order

void _input() {return;}
template <typename T, typename... V>
void _input(T &t, V&... v) {cin >> (t); if (sizeof...(v))  _input(v...);}
void __input(vi &v, const int n){F0R(i, n)cin >> v[i];}
void __input(vvi &v, const int n, const int m){F0R(i, n)F0R(j, m)cin>>v[i][j];}

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

int n, m, a, b;
vi x, y, vis, l, r, up, dn, chk;
vpi ans;
vvi g, rg;

void dfs(int u, int ind, int tp){
    //_print(u, vis);
    vis[u] = ind;
    if(tp) {
        trav(v, g[u]) {
            if(vis[v] >= 0)continue;
            dfs(v, ind, tp);
        }
    }
    else {
        trav(v, rg[u]) {
            if(vis[v] >= 0)continue;
            dfs(v, ind, tp);
        }
    }
}

void solve(){
    cin >> n >> m >> a >> b;
    x.rsz(n + 1);
    y.rsz(n + 1);
    g.rsz(n + 1);
    rg.rsz(n + 1);
    FOR(i, 1, 1 + n) cin >> x[i] >> y[i];
    F0R(i, m){
        int u, v, k;
        cin >> u >> v >> k;
        g[u].pb(v);
        rg[v].pb(u);
        if(k == 2){
            g[v].pb(u);
            rg[u].pb(v);
        }
    }
    //_print(g, rg);
    vis.rsz(n + 1, -1);
    chk.rsz(n + 1);
    FOR(i, 1, n + 1)if(x[i] == a && vis[i] == -1)dfs(i, i, 0);
    FOR(i, 1, n + 1){
        if(vis[i] >= 0 && x[i] == 0){
            l.pb(i);
            chk[i] = 1;
        }
    }
    //_print(vis);
    sor(l);
    up.rsz(sz(l) + 1, -1);
    dn.rsz(sz(l) + 1);
    vis.clear();
    vis.rsz(n + 1, -1);
    trav(el, l)if(vis[el] == -1)dfs(el, el, 1);
    FOR(i, 1, n + 1){
        if(vis[i] >= 0 && x[i] == a)r.pb(i);
    }
    //_print(vis);
    sor(r);
    //_print(l, r, chk);
    vis.clear();
    vis.rsz(n + 1, -1);
    F0R(i, sz(l)){
        if(vis[l[i]] >= 0)continue;
        dfs(l[i], i, 1);
    }
    F0R(i, sz(r)) up[vis[r[i]]] = i;
    FOR(i, 1, sz(l))if(up[i] < up[i - 1])up[i] = up[i - 1];
    vis.clear();
    vis.rsz(n + 1, -1);
    R0F(i, sz(l)){
        if(vis[l[i]] >= 0)continue;
        dfs(l[i], i, 1);
    }
    F0R(i, sz(r)) up[vis[r[i]]] = i;
    R0F(i, sz(l) - 1)if(dn[i] > dn[i + 1])dn[i] = dn[i + 1];
    FOR(i, 1, n + 1) if(x[i] == 0 && !chk[i])ans.pb({y[i], 0});
    F0R(i, sz(l))ans.pb({y[l[i]], up[i] - dn[i] + 1});
    sort(rall(ans));
    trav(el, ans)cout << el.s << nl;
}


/*


*/

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t; t = 1;while(t--){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9