Submission #363349

#	Time	Username	Problem	Language	Result	Execution time	Memory
363349		ACmachine	Traffic (CEOI11_tra)	C++17	0 / 100	1064 ms	62208 KiB

tra

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m, A, B;
    cin >> n >> m >> A >> B;
    vector<vi> g(n);
    vector<vi> tg(n); // transposed
    vector<int> ans(n);
    vector<int> l;
    vector<int> r;
    vector<int> Y(n);
    REP(i, n){
        int x, y; cin >> x >> y;
        Y[i] = y;
        if(x == 0){
            l.pb(i);
        }
        else if(x == A){
            r.pb(i);
        }
    }
    auto cmp = [&](int f, int s){
        return Y[f] > Y[s];
    };
    sort(all(l), cmp);
    sort(all(r), cmp);
    REP(i, m){
        int c, d, k;
        cin >> c >> d >> k;
        c--; d--;
        if(k == 1){
            g[c].pb(d);
            tg[d].pb(c);
        }
        else{
            g[c].pb(d);
            g[d].pb(c);
            tg[c].pb(d);
            tg[d].pb(c);
        }
    }

    vector<int> irrelevantL;
    auto bfs = [&](vector<int> s, vector<vi> &adj){
        vector<int> dist(n, -1);
        queue<int> q;
        REP(i, s.size()){
            dist[s[i]] = 0;
            q.push(s[i]);
        }
        while(!q.empty()){
            int v = q.front();
            q.pop();
            for(int x : adj[v]){
                if(dist[x] == -1){
                    dist[x] = dist[v] + 1;
                    q.push(x);
                }
            }
        }
        return dist;
    };
    vector<int> southness(n, -1); // excludes irrelevant right nodes
    vi dist1 = bfs(l, g);
    vi dist2 = bfs(r, tg);
    int np = 0;
    REP(i, r.size()){
        if(dist1[r[i]] != -1){
            southness[r[i]] = np++;
        } 
    }
    REP(i, l.size()){
        if(dist2[l[i]] == -1){
            irrelevantL.pb(l[i]);
        }
    }

    vector<bool> visited(n, false);
    vector<int> to_process;
    function<void(int)> go_forward = [&](int v){
        visited[v] =  true;
        for(int x : g[v]){
            if(!visited[x]) 
                go_forward(x);
        }
        to_process.pb(v);
    };
    REP(i, n){
        if(!visited[i]) 
            go_forward(i);
    }
    vector<int> scc_id(n, -1);
    int curr = 0;
    function<void(int, int)> go_backward = [&](int v, int id){
        scc_id[v] = id;
        for(int x : tg[v]){
            if(scc_id[x] == -1)
                go_backward(x, id);
        }
    };
    while(!to_process.empty()){
        if(scc_id[to_process.back()] == -1){
            go_backward(to_process.back(), curr);
            curr++;
        }
        to_process.pop_back();
    }
    vector<vi> compressed_graph(curr);
    REP(i, n){
        for(int x : g[i]){
            if(scc_id[i] != scc_id[x])
                compressed_graph[scc_id[i]].pb(scc_id[x]);
        }
    }
    vi order;
    fill(all(visited), false);
    function<void(int)> dfstop = [&](int v){
        visited[v] = true;
        for(int x : compressed_graph[v]){
            if(!visited[x])
                dfstop(x);
        }
        order.pb(v);
    };
    REP(i, curr){
        if(!visited[i])
            dfstop(i);
    }
    vector<array<int, 2>> dp(curr, {-1, -1});
    auto upd = [](array<int, 2> f, int v){
        array<int, 2> tm = {-1, -1};
        if(f == tm){
            f = {v, v};
        }
        else{
            f[0] = min(f[0], v);
            f[1] = max(f[1], v);
        }
        return f;
    };
    REP(i, n){
        if(southness[i] != -1){
            int id = scc_id[i];
            dp[id] = upd(dp[id], southness[i]);
        }
    }
    REP(i, order.size()){
        int C = order[i];
        for(int x : compressed_graph[C]){
            dp[C] = upd(dp[C], dp[x][0]);
            dp[C] = upd(dp[C], dp[x][1]);
        }
    }
    int pp = 0;
    REP(i, l.size()){
        if(pp < irrelevantL.size() && l[i] == irrelevantL[pp]){
            cout << 0 << "\n";
            pp++;
        }
        else{
            int cid = scc_id[l[i]];
            cout << dp[cid][1] - dp[cid][0] + 1 << "\n";
        }
    }
    return 0;
}

Compilation message (stderr)

tra.cpp: In lambda function:
tra.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
tra.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
tra.cpp:131:9: note: in expansion of macro 'REP'
  131 |         REP(i, s.size()){
      |         ^~~
tra.cpp: In function 'int main()':
tra.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
tra.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
tra.cpp:151:5: note: in expansion of macro 'REP'
  151 |     REP(i, r.size()){
      |     ^~~
tra.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
tra.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
tra.cpp:156:5: note: in expansion of macro 'REP'
  156 |     REP(i, l.size()){
      |     ^~~
tra.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
tra.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
tra.cpp:231:5: note: in expansion of macro 'REP'
  231 |     REP(i, order.size()){
      |     ^~~
tra.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
tra.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
tra.cpp:239:5: note: in expansion of macro 'REP'
  239 |     REP(i, l.size()){
      |     ^~~
tra.cpp:240:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |         if(pp < irrelevantL.size() && l[i] == irrelevantL[pp]){
      |            ~~~^~~~~~~~~~~~~~~~~~~~

• 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