이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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');
}
# | 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... |