oj.uz

Submission #910632

# Submission time Handle Problem Language Result Execution time Memory
910632 2024-01-18T06:32:20 Z gaga999 Traffic (CEOI11_tra) C++17
100 / 100
 764 ms 82608 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 3e5 + 5;
int xr[N], yr[N], scc[N], l[N], r[N], ll[N], rr[N], ctc;
vector<int> e1[N], e2[N], sk, SCC[N], v1, v2;
bool vd[N];

bool cmp(int a, int b)
{
    return yr[a] > yr[b];
}

void rdfs(int u)
{
    vd[u] = 1;
    for (int v : e2[u])
        if (!vd[v])
            rdfs(v);
    sk.pb(u);
}

void dfs(int u)
{
    scc[u] = ctc, SCC[ctc].pb(u);
    tmax(r[ctc], rr[u]), tmin(l[ctc], ll[u]);
    for (int v : e1[u])
        if (!scc[v])
            dfs(v);
}

void ddd(int u)
{
    vd[u] = 1;
    for (int v : e1[u])
        if (!vd[v])
            ddd(v);
}

signed main()
{
    int n, m, a, b, x, y, w;
    rd(n, m, a, b);
    for (int i = 1; i <= n; i++)
    {
        rd(xr[i], yr[i]);
        if (!xr[i])
            v1.pb(i);
        if (xr[i] == a)
            v2.pb(i);
    }
    sort(iter(v1), cmp), sort(iter(v2), cmp);
    init(l, INF), init(r, -1);
    init(ll, INF), init(rr, -1);
    while (m--)
    {
        rd(x, y, w);
        e1[x].pb(y), e2[y].pb(x);
        if (w == 2)
            e1[y].pb(x), e2[x].pb(y);
    }
    for (int i : v1)
        if (!vd[i])
            ddd(i);
    for (int i : v2)
        if (vd[i])
            ll[i] = rr[i] = ++ctc;
    ctc = 0, init(vd, 0);
    for (int i = 1; i <= n; i++)
        if (!vd[i])
            rdfs(i);
    reverse(iter(sk));
    for (int i : sk)
        if (!scc[i])
            ctc++, dfs(i);
    for (int p = 1; p <= ctc; p++)
    {
        for (int u : SCC[p])
            for (int v : e1[u])
                tmax(r[p], r[scc[v]]), tmin(l[p], l[scc[v]]);
    }
    for (int i : v1)
        prt(max(0, r[scc[i]] - l[scc[i]] + 1)), putchar('\n');
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 29272 KB Output is correct
2 Correct 8 ms 29396 KB Output is correct
3 Correct 10 ms 29276 KB Output is correct
4 Correct 9 ms 29276 KB Output is correct
5 Correct 10 ms 29272 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29532 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 9 ms 29276 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29272 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 9 ms 29440 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 29532 KB Output is correct
2 Correct 11 ms 29788 KB Output is correct
3 Correct 10 ms 29788 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31708 KB Output is correct
2 Correct 33 ms 35548 KB Output is correct
3 Correct 21 ms 32336 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 33832 KB Output is correct
2 Correct 39 ms 37216 KB Output is correct
3 Correct 29 ms 35288 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 38612 KB Output is correct
2 Correct 63 ms 42592 KB Output is correct
3 Correct 80 ms 41672 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 40396 KB Output is correct
2 Correct 66 ms 42188 KB Output is correct
3 Correct 89 ms 42400 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 48048 KB Output is correct
2 Correct 154 ms 53580 KB Output is correct
3 Correct 313 ms 54228 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 60072 KB Output is correct
2 Correct 351 ms 68668 KB Output is correct
3 Correct 340 ms 57152 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 715 ms 71292 KB Output is correct
2 Correct 384 ms 69772 KB Output is correct
3 Correct 739 ms 70588 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 53704 KB Output is correct
2 Correct 462 ms 70504 KB Output is correct
3 Correct 604 ms 68120 KB Output is correct
4 Correct 764 ms 82608 KB Output is correct