Submission #3767923
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
} else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
/*
typedef __int128_t Int;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
*/
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct SCC {
int V;
vector<vector<int>> G, rG, SC;
vector<int> vs, cmp; // post order, topological order
vector<bool> used;
SCC() {}
SCC(int V) : V(V), G(V), rG(V), used(V), cmp(V) {}
void add_arc(int s, int t) {
G[s].push_back(t);
rG[t].push_back(s);
}
void dfs(int v) {
used[v] = true;
for (int i : G[v]) {
if (not used[i])
dfs(i);
}
vs.push_back(v);
}
void rdfs(int v, int k) {
used[v] = true;
cmp[v] = k;
for (int i : rG[v]) {
if (not used[i])
rdfs(i, k);
}
}
int scc() {
fill(all(used), false);
vs.clear();
SC.clear();
rep(v, 0, V) {
if (not used[v])
dfs(v);
}
fill(all(used), false);
int k = 0;
rrep(i, 0, vs.size()) {
if (not used[vs[i]])
rdfs(vs[i], k++);
}
SC.resize(k);
rep(i, 0, V) { SC[cmp[i]].emplace_back(i); }
rep(i, 0, SC.size()) { sort(all(SC[i])); }
return k;
}
void fill_dist(int v, int d, vector<int> &dist) {
if (used[v])
return;
used[v] = true;
dist[v] = d;
for (auto u : G[v]) {
fill_dist(u, d + 1, dist);
}
}
void solve() {
scc();
fill(all(used), false);
vector<int> dist(V, -1);
fill_dist(SC[0][0], 0, dist);
int ans = *max_element(all(dist));
for (auto u : SC[0]) {
ans += not used[u];
}
cout << ans << endl;
}
};
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N;
cin >> N;
SCC g(N);
rep(i, 0, N - 1) {
int a, b, t;
cin >> a >> b >> t;
a--, b--;
g.add_arc(a, b);
if (t == 2) {
g.add_arc(b, a);
}
}
g.solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Longest Path |
User |
norma |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4337 Byte |
Status |
WA |
Exec Time |
104 ms |
Memory |
21752 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00-sample-00.txt, 00-sample-01.txt, 10-path-00.txt, 10-path-01.txt, 10-path-02.txt, 10-path-03.txt, 10-path-04.txt, 20-path_special-00.txt, 20-path_special-01.txt, 20-path_special-02.txt, 30-star-00.txt, 30-star-01.txt, 30-star-02.txt, 30-star-03.txt, 40-binary-00.txt, 40-binary-01.txt, 40-binary-02.txt, 40-binary-03.txt, 40-binary-04.txt, 50-random-00.txt, 50-random-01.txt, 50-random-02.txt, 50-random-03.txt, 50-random-04.txt, 50-random-05.txt, 50-random-06.txt, 50-random-07.txt, 50-random-08.txt, 50-random-09.txt, 50-random-10.txt, 50-random-11.txt, 50-random-12.txt |
Case Name |
Status |
Exec Time |
Memory |
00-sample-00.txt |
AC |
1 ms |
256 KB |
00-sample-01.txt |
AC |
1 ms |
256 KB |
10-path-00.txt |
WA |
1 ms |
256 KB |
10-path-01.txt |
WA |
68 ms |
16248 KB |
10-path-02.txt |
WA |
16 ms |
4220 KB |
10-path-03.txt |
WA |
22 ms |
5756 KB |
10-path-04.txt |
WA |
45 ms |
10996 KB |
20-path_special-00.txt |
WA |
74 ms |
21752 KB |
20-path_special-01.txt |
WA |
104 ms |
16376 KB |
20-path_special-02.txt |
WA |
55 ms |
17524 KB |
30-star-00.txt |
WA |
52 ms |
16360 KB |
30-star-01.txt |
WA |
2 ms |
640 KB |
30-star-02.txt |
WA |
21 ms |
7280 KB |
30-star-03.txt |
WA |
22 ms |
7536 KB |
40-binary-00.txt |
WA |
69 ms |
16500 KB |
40-binary-01.txt |
WA |
68 ms |
14968 KB |
40-binary-02.txt |
WA |
3 ms |
640 KB |
40-binary-03.txt |
WA |
52 ms |
12536 KB |
40-binary-04.txt |
WA |
4 ms |
896 KB |
50-random-00.txt |
WA |
70 ms |
16500 KB |
50-random-01.txt |
WA |
22 ms |
5880 KB |
50-random-02.txt |
WA |
41 ms |
10232 KB |
50-random-03.txt |
WA |
30 ms |
7672 KB |
50-random-04.txt |
WA |
38 ms |
8572 KB |
50-random-05.txt |
WA |
73 ms |
15476 KB |
50-random-06.txt |
WA |
5 ms |
1280 KB |
50-random-07.txt |
WA |
10 ms |
2816 KB |
50-random-08.txt |
WA |
58 ms |
14580 KB |
50-random-09.txt |
WA |
42 ms |
10360 KB |
50-random-10.txt |
WA |
39 ms |
9976 KB |
50-random-11.txt |
WA |
11 ms |
2940 KB |
50-random-12.txt |
WA |
61 ms |
15480 KB |