problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long int
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
int dp[1000005];
int dfs(vector<int> adj[], bool vis[], int i) {
if (vis[i])
return 0;
if (dp[i] != -1)
return dp[i];
vis[i] = true;
int ans = 0;
for (int j : adj[i])
ans = max(ans, 1 + dfs(adj, vis, j));
vis[i] = false;
return ans;
}
int main() {
Fast
int v,
e;
cin >> v >> e;
vector<int> adj[v + 1];
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= v; i++) {
bool vis[v];
memset(vis, false, sizeof(vis));
dp[i] = max(dp[i], dfs(adj, vis, i));
// cout<<"ans: "<<ans<<endl;
}
int ans = 0;
for (int i = 0; i <= v; i++)
ans = max(ans, dp[i]);
cout << ans;
// 5 5 1 2 1 3 2 3 3 2 2 4 ans 3
}
|
#include <bits/stdc++.h>
#define ll long long int
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
int dp[1000005];
int dfs(vector<int> adj[], bool vis[], int i) {
if (vis[i])
return 0;
if (dp[i] != -1)
return dp[i];
vis[i] = true;
int ans = 0;
for (int j : adj[i])
ans = max(ans, 1 + dfs(adj, vis, j));
vis[i] = false;
dp[i] = ans;
return ans;
}
int main() {
Fast
int v,
e;
cin >> v >> e;
vector<int> adj[v + 1];
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= v; i++) {
bool vis[v];
memset(vis, false, sizeof(vis));
dp[i] = max(dp[i], dfs(adj, vis, i));
// cout<<"ans: "<<ans<<endl;
}
int ans = 0;
for (int i = 0; i <= v; i++)
ans = max(ans, dp[i]);
cout << ans;
// 5 5 1 2 1 3 2 3 3 2 2 4 ans 3
}
|
insert
| 21 | 21 | 21 | 22 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/*
created by Sanyam Singhal
/*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define triplet pair<int, pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
#define loop2(i, k, n) for (ll i = k; i >= n; i--)
const ll inf = 1e18;
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
ll dfs(vector<vector<ll>> &adj, vector<ll> &dp, int src) {
if (dp[src] != -1)
return dp[src];
ll ans = 1;
for (int neigh : adj[src]) {
ans = max(ans, dfs(adj, dp, neigh) + 1);
}
dp[src] = ans;
return ans;
}
void solve() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<ll> dp(n + 1, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
// for(int i=0; i<n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
ll ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, dfs(adj, dp, i));
}
cout << ans - 1 << endl;
// for(int i=0; i<=n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
return;
}
int main() {
fastIO;
take_fileIO();
solve();
return 0;
}
|
/*
created by Sanyam Singhal
/*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define triplet pair<int, pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
#define loop2(i, k, n) for (ll i = k; i >= n; i--)
const ll inf = 1e18;
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
ll dfs(vector<vector<ll>> &adj, vector<ll> &dp, int src) {
if (dp[src] != -1)
return dp[src];
ll ans = 1;
for (int neigh : adj[src]) {
ans = max(ans, dfs(adj, dp, neigh) + 1);
}
dp[src] = ans;
return ans;
}
void solve() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<ll> dp(n + 1, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
// for(int i=0; i<n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
ll ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, dfs(adj, dp, i));
}
cout << ans - 1 << endl;
// for(int i=0; i<=n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
return;
}
int main() {
fastIO;
// take_fileIO();
solve();
return 0;
}
|
replace
| 81 | 82 | 81 | 82 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
/*------- Constants---- */
#define LL long long
#define Ulong unsigned long long
#define REP(i, n) for (long long i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define PI acos(-1.0)
#define EPS 1e-14
#define F first
#define S second
#define di(x) \
int x; \
input(x)
#define in(x) input(x)
#define in2(x, y) in(x), in(y)
#define in3(x, y, z) in(x), in2(y, z)
#define lc ((n) << 1)
#define rc ((n) << 1 | 1)
#define db(x) cout << #x << " -> " << x << endl
#define nl cout << endl
#define ms(ara_name, value) memset(ara_name, value, sizeof(ara_name))
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define READ freopen("/home/matrixcode/Desktop/in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
template <class T> inline void input(T &x) {
register char c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg)
x = -x;
}
inline long long bigmod(long long p, long long e, long long M) {
long long ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
/***************************** END OF TEMPLATE *******************************/
const int N = 3e3 + 5;
vector<int> G[N];
vector<int> top;
bool vis[N];
int dp[N];
void dfs(int u) {
if (vis[u])
return;
vis[u] = 1;
for (auto x : G[u])
dfs(x);
top.push_back(u);
}
int main() {
int n, m;
in2(n, m);
for (int i = 0; i < m; i++) {
int x, y;
in2(x, y);
G[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
dfs(i);
}
}
reverse(top.begin(), top.end());
memset(dp, 0, sizeof dp);
for (auto x : top) {
for (auto v : G[x]) {
dp[v] = max(dp[v], 1 + dp[x]);
}
}
cout << *max_element(dp + 1, dp + n + 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
/*------- Constants---- */
#define LL long long
#define Ulong unsigned long long
#define REP(i, n) for (long long i = 0; i < n; i++)
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define PI acos(-1.0)
#define EPS 1e-14
#define F first
#define S second
#define di(x) \
int x; \
input(x)
#define in(x) input(x)
#define in2(x, y) in(x), in(y)
#define in3(x, y, z) in(x), in2(y, z)
#define lc ((n) << 1)
#define rc ((n) << 1 | 1)
#define db(x) cout << #x << " -> " << x << endl
#define nl cout << endl
#define ms(ara_name, value) memset(ara_name, value, sizeof(ara_name))
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define READ freopen("/home/matrixcode/Desktop/in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
template <class T> inline void input(T &x) {
register char c = getchar();
x = 0;
int neg = 0;
for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg)
x = -x;
}
inline long long bigmod(long long p, long long e, long long M) {
long long ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
/***************************** END OF TEMPLATE *******************************/
const int N = 3e5 + 5;
vector<int> G[N];
vector<int> top;
bool vis[N];
int dp[N];
void dfs(int u) {
if (vis[u])
return;
vis[u] = 1;
for (auto x : G[u])
dfs(x);
top.push_back(u);
}
int main() {
int n, m;
in2(n, m);
for (int i = 0; i < m; i++) {
int x, y;
in2(x, y);
G[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
dfs(i);
}
}
reverse(top.begin(), top.end());
memset(dp, 0, sizeof dp);
for (auto x : top) {
for (auto v : G[x]) {
dp[v] = max(dp[v], 1 + dp[x]);
}
}
cout << *max_element(dp + 1, dp + n + 1) << endl;
}
|
replace
| 64 | 65 | 64 | 65 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long dp[1000000];
vector<vector<int>> G;
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
int main() {
int n, m;
cin >> n >> m;
G.assign(n, vector<int>());
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
int res = 0;
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int v = 0; v < n; v++)
chmax(res, rec(v));
cout << res << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long dp[1000000];
vector<vector<int>> G;
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
int main() {
int n, m;
cin >> n >> m;
G.assign(n, vector<int>());
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
int res = 0;
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int v = 0; v < n; v++)
chmax(res, rec(v));
cout << res << endl;
}
|
replace
| 38 | 39 | 38 | 39 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x " = " << x << endl)
#define PRINT(x) TRACE(printf(x))
#define WATCHR(a, b) \
TRACE(for (auto c = a; c != b;) cout << *(c++) << " "; cout << endl)
#define WATCHC(V) \
TRACE({ \
cout << #V " = "; \
WATCHR(V.begin(), V.end()); \
})
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
#define rep(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define trav(a, x) for (auto &a : x)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define shandom_ruffle random_shuffle
#define funoredered_map __fast_unordered_map
template <class Key, class Value, class Hash = std::hash<Key>>
using funordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xc0c0c0c0;
constexpr double EPS = 1e-8;
constexpr ll MOD = 1000000007LL;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
inline ll modPow(ll a, ll b, ll mod = MOD) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
}
return res;
}
inline int cmp_double(double x, double y, double tol = EPS) {
return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
constexpr int ms = 1e5 + 13;
vi ans;
vi g[ms];
void xablau(int node = 0) {
ans[node] = 0;
for (const int &x : g[node]) {
xablau(x);
ans[node] = max(ans[node], 1 + ans[x]);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, m;
cin >> n >> m;
ans.assign(n, -1);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
g[a - 1].pb(b - 1);
}
for (int i = 0; i < n; ++i)
if (ans[i] == -1)
xablau(i);
int acc = accumulate(all(ans), 0, [](int a, int b) { return max(a, b); });
cout << acc << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x " = " << x << endl)
#define PRINT(x) TRACE(printf(x))
#define WATCHR(a, b) \
TRACE(for (auto c = a; c != b;) cout << *(c++) << " "; cout << endl)
#define WATCHC(V) \
TRACE({ \
cout << #V " = "; \
WATCHR(V.begin(), V.end()); \
})
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
#define rep(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define trav(a, x) for (auto &a : x)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define shandom_ruffle random_shuffle
#define funoredered_map __fast_unordered_map
template <class Key, class Value, class Hash = std::hash<Key>>
using funordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int INF = 0x3f3f3f3f;
constexpr int NINF = 0xc0c0c0c0;
constexpr double EPS = 1e-8;
constexpr ll MOD = 1000000007LL;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
inline ll modPow(ll a, ll b, ll mod = MOD) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
}
return res;
}
inline int cmp_double(double x, double y, double tol = EPS) {
return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
constexpr int ms = 1e5 + 13;
vi ans;
vi g[ms];
void xablau(int node = 0) {
ans[node] = 0;
for (const int &x : g[node]) {
if (ans[x] == -1)
xablau(x);
ans[node] = max(ans[node], 1 + ans[x]);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n, m;
cin >> n >> m;
ans.assign(n, -1);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
g[a - 1].pb(b - 1);
}
for (int i = 0; i < n; ++i)
if (ans[i] == -1)
xablau(i);
int acc = accumulate(all(ans), 0, [](int a, int b) { return max(a, b); });
cout << acc << endl;
}
|
replace
| 74 | 75 | 74 | 76 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// KALAM
#include <bits/stdc++.h>
using namespace std;
const int N = 3000 + 77;
int n, m, d[N], A;
vector<int> a[N];
bool M[N];
void dfs(int v) {
M[v] = 1;
d[v] = 1;
for (int u : a[v]) {
if (!M[u])
dfs(u);
d[v] = max(d[v], d[u] + 1);
}
A = max(A, d[v]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int u, v, i = 1; i <= m; ++i) {
cin >> v >> u;
a[v].push_back(u);
}
for (int i = 1; i <= n; ++i)
if (!M[i])
dfs(i);
cout << A - 1;
return 0;
}
|
// KALAM
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 77;
int n, m, d[N], A;
vector<int> a[N];
bool M[N];
void dfs(int v) {
M[v] = 1;
d[v] = 1;
for (int u : a[v]) {
if (!M[u])
dfs(u);
d[v] = max(d[v], d[u] + 1);
}
A = max(A, d[v]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int u, v, i = 1; i <= m; ++i) {
cin >> v >> u;
a[v].push_back(u);
}
for (int i = 1; i <= n; ++i)
if (!M[i])
dfs(i);
cout << A - 1;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
// If there is no outward edge then ,length of longest path=0
#include <bits/stdc++.h>
#define ll long long
using namespace std;
map<ll, list<ll>> graph;
ll dp[100003];
ll solve(ll y) {
if (dp[y] != -1)
return dp[y];
if (graph[y].size() == 0) {
return 0;
}
ll ans = 0;
for (auto it : graph[y]) {
ans = max(ans, solve(it));
}
return 1 + ans;
}
int main() {
ll n, m;
cin >> n >> m;
for (ll p = 0; p < m; p++) {
ll x, y;
cin >> x >> y;
graph[x].push_back(y);
}
ll ans = 0;
for (ll p = 1; p <= n; p++)
dp[p] = -1;
for (ll r = 1; r <= n; r++) {
ans = max(ans, solve(r));
}
cout << ans << endl;
}
|
// If there is no outward edge then ,length of longest path=0
#include <bits/stdc++.h>
#define ll long long
using namespace std;
map<ll, list<ll>> graph;
ll dp[100003];
ll solve(ll y) {
if (dp[y] != -1)
return dp[y];
if (graph[y].size() == 0) {
return 0;
}
ll ans = 0;
for (auto it : graph[y]) {
ans = max(ans, solve(it));
}
return dp[y] = 1 + ans;
}
int main() {
ll n, m;
cin >> n >> m;
for (ll p = 0; p < m; p++) {
ll x, y;
cin >> x >> y;
graph[x].push_back(y);
}
ll ans = 0;
for (ll p = 1; p <= n; p++)
dp[p] = -1;
for (ll r = 1; r <= n; r++) {
ans = max(ans, solve(r));
}
cout << ans << endl;
}
|
replace
| 16 | 17 | 16 | 17 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> child;
vector<int> parent;
rep(i, n) parent[i] = 0;
int x, y;
rep(i, m) {
cin >> x >> y;
x--;
y--;
parent[y]++;
child[x].push_back(y);
}
vector<int> dp(n);
queue<int> nodes;
rep(i, n) {
if (parent[i] == 0)
nodes.push(i);
dp[i] = 0;
}
while (nodes.size()) {
int j = nodes.front();
nodes.pop();
if (child[j].size() > 0)
rep(k, child[j].size()) {
int c = child[j][k];
dp[c] = max(dp[j] + 1, dp[c]);
parent[c]--;
if (parent[c] == 0)
nodes.push(c);
}
}
int max = 0;
rep(i, n) if (max < dp[i]) max = dp[i];
cout << max << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> child(n);
vector<int> parent(n);
rep(i, n) parent[i] = 0;
int x, y;
rep(i, m) {
cin >> x >> y;
x--;
y--;
parent[y]++;
child[x].push_back(y);
}
vector<int> dp(n);
queue<int> nodes;
rep(i, n) {
if (parent[i] == 0)
nodes.push(i);
dp[i] = 0;
}
while (nodes.size()) {
int j = nodes.front();
nodes.pop();
if (child[j].size() > 0)
rep(k, child[j].size()) {
int c = child[j][k];
dp[c] = max(dp[j] + 1, dp[c]);
parent[c]--;
if (parent[c] == 0)
nodes.push(c);
}
}
int max = 0;
rep(i, n) if (max < dp[i]) max = dp[i];
cout << max << endl;
}
|
replace
| 9 | 11 | 9 | 11 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb push_back
#define ll long long
#define ff first
#define ss second
using namespace std;
int n, m;
vector<int> v[100001];
vector<int> sink;
vector<int> src[100001];
int dp[100001];
int fun(int i) {
for (int j = 0; j < sink.size(); j++) {
if (i == sink[j]) {
return 0;
}
}
if (dp[i] != -1) {
return dp[i];
}
dp[i] = 0;
for (int j = 0; j < v[i].size(); j++) {
dp[i] = max(dp[i], fun(v[i][j]) + 1);
}
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
v[x].pb(y);
src[y].pb(x);
}
for (int i = 1; i <= n; i++) {
if (v[i].size() == 0) {
sink.pb(i);
}
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++) {
if (src[i].size() == 0 && v[i].size() != 0) {
ans = max(ans, fun(i));
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define pb push_back
#define ll long long
#define ff first
#define ss second
using namespace std;
int n, m;
vector<int> v[100001];
vector<int> sink;
vector<int> src[100001];
int dp[100001];
int fun(int i) {
for (int j = 0; j < sink.size(); j++) {
if (i == sink[j]) {
return 0;
}
}
if (dp[i] != -1) {
return dp[i];
}
dp[i] = 0;
for (int j = 0; j < v[i].size(); j++) {
dp[i] = max(dp[i], fun(v[i][j]) + 1);
}
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
v[x].pb(y);
src[y].pb(x);
}
for (int i = 1; i <= n; i++) {
if (v[i].size() == 0 && src[i].size() != 0) {
sink.pb(i);
}
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++) {
if (src[i].size() == 0 && v[i].size() != 0) {
ans = max(ans, fun(i));
}
}
cout << ans << endl;
return 0;
}
|
replace
| 48 | 49 | 48 | 49 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
VI dp(101010, -1);
map<int, VI> g;
int dfs(int cur) {
int ret = 0;
for (auto x : g[cur]) {
chmax(ret, 1 + dfs(x));
}
dp[cur] = ret;
return ret;
}
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
rep(i, n) {
if (dp[i] == -1) {
dfs(i);
}
}
int ans = -1;
rep(i, n) ans = chmax(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const int IINF = 1 << 30;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
VI dp(101010, -1);
map<int, VI> g;
int dfs(int cur) {
if (dp[cur] != -1)
return dp[cur];
int ret = 0;
for (auto x : g[cur]) {
chmax(ret, 1 + dfs(x));
}
dp[cur] = ret;
return ret;
}
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
rep(i, n) {
if (dp[i] == -1) {
dfs(i);
}
}
int ans = -1;
rep(i, n) ans = chmax(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
insert
| 24 | 24 | 24 | 26 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
vector<vector<int>> e;
int f(int x) {
int r = 0;
if (e[x].size())
for (auto p : e[x])
r = max(r, f(p) + 1);
else
r = 0;
dp[x] = r;
return r;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
dp = vector<int>(n, -1);
e = vector<vector<int>>(n);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
e[--x].push_back(--y);
}
int o = 0;
for (int i = 0; i < n; i++)
if (dp[i] == -1)
o = max(o, f(i));
printf("%d\n", o);
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
vector<vector<int>> e;
int f(int x) {
if (dp[x] != -1)
return dp[x];
int r = 0;
if (e[x].size())
for (auto p : e[x])
r = max(r, f(p) + 1);
else
r = 0;
dp[x] = r;
return r;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
dp = vector<int>(n, -1);
e = vector<vector<int>>(n);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
e[--x].push_back(--y);
}
int o = 0;
for (int i = 0; i < n; i++)
if (dp[i] == -1)
o = max(o, f(i));
printf("%d\n", o);
}
|
insert
| 7 | 7 | 7 | 9 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int n, m, vis[100005], dp[100005];
vi v, a[100005];
void dfs(int node) {
for (auto i : a[node]) {
if (!vis[i])
dfs(i);
}
v.pb(node);
}
void solve() {
cin >> n >> m;
rep(i, 1, m + 1) {
int x, y;
cin >> x >> y;
a[x].pb(y);
}
rep(i, 1, n + 1) {
if (vis[i] == 0) {
dfs(i);
}
}
int ans = 0;
for (auto i : v) {
for (auto j : a[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int n, m, vis[100005], dp[100005];
vi v, a[100005];
void dfs(int node) {
vis[node] = 1;
for (auto i : a[node]) {
if (!vis[i])
dfs(i);
}
v.pb(node);
}
void solve() {
cin >> n >> m;
rep(i, 1, m + 1) {
int x, y;
cin >> x >> y;
a[x].pb(y);
}
rep(i, 1, n + 1) {
if (vis[i] == 0) {
dfs(i);
}
}
int ans = 0;
for (auto i : v) {
for (auto j : a[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
insert
| 20 | 20 | 20 | 21 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define pb push_back
// #all(x) (x).begin(),(x).end()
// int const N = 1;
int const MOD = 1e9 + 7;
ll bigmod(ll a, ll b) {
if (b == 0)
return 1 % MOD;
ll x = bigmod(a, b / 2);
x = (x * x) % MOD;
if (b % 2)
x = (x * a) % MOD;
return x;
}
int const N = 3e3 + 10;
vector<int> g[N];
int dp[N];
int n, m;
int dfs(int node) {
int &r = dp[node];
if (r != -1)
return r;
r = 1;
int mx = 0;
for (auto v : g[node]) {
mx = max(mx, dfs(v));
}
r += mx;
return r;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(dp, -1, sizeof dp);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
memset(dp, -1, sizeof dp);
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dfs(i) - 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define pb push_back
// #all(x) (x).begin(),(x).end()
// int const N = 1;
int const MOD = 1e9 + 7;
ll bigmod(ll a, ll b) {
if (b == 0)
return 1 % MOD;
ll x = bigmod(a, b / 2);
x = (x * x) % MOD;
if (b % 2)
x = (x * a) % MOD;
return x;
}
int const N = 3e5 + 10;
vector<int> g[N];
int dp[N];
int n, m;
int dfs(int node) {
int &r = dp[node];
if (r != -1)
return r;
r = 1;
int mx = 0;
for (auto v : g[node]) {
mx = max(mx, dfs(v));
}
r += mx;
return r;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(dp, -1, sizeof dp);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
memset(dp, -1, sizeof dp);
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dfs(i) - 1);
cout << ans << endl;
return 0;
}
|
replace
| 21 | 22 | 21 | 22 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Vaidik Patel(India)
// DA-IICT
#include <bits/stdc++.h>
using namespace std;
//********************************************
#include <ext/pb_ds/assoc_container.hpp> // include the associative containers or group of templates such as set, multimap, map etc.
#include <ext/pb_ds/tree_policy.hpp> // include the tree_order_statistics_node update
using namespace __gnu_pbds; // necessary for the GNU based Policy based data
// structures.
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//********************************************
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int INF = (int)1e9;
ll INFINF = (ll)1e18 + 10;
const ld PI = 3.14159265358979323846;
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minheap priority_queue<ll, vector<ll>, greater<ll>>
#define maxheap priority_queue<ll, vector<ll>, less<ll>>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rFOR(i, a, b) for (ll i = a; i >= b; i--)
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << endl;
#define deb4(x, y, z, w) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << "\t" << #w << " : " << w << endl;
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define checkbit(n, b) ((n >> b) & 1)
#define mkp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define TIME \
cerr << "Time Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
#define lc 2 * idx
#define rc 2 * idx + 1
ll powermodm(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return result;
}
ll GCD(ll, ll);
ll LCM(ll, ll);
ll power(ll, ll);
ll choose(ll, ll);
int ones(ll);
void extendedEuclid(ll, ll);
ll MMI(ll, ll);
void fastscan(int &);
bool checkithbit(ll, ll); // ith bit is zero or not
vector<ll> SegmentTree;
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l, ll r);
ll sum(ll idx, ll sl, ll sr, ll l, ll r);
void update(ll idx, ll sl, ll sr, ll value, ll id);
vector<ll> prime;
void findprime(void);
ll phi(ll num);
vector<int> isprime;
void precomputeprime(int N);
vector<int> prephi;
void precomputephi(int N);
int read();
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
#define pb push_back
#define M 1000000007
//////////////////////////////////////////////////////////////////////////////
ll n, m;
vvi adj;
vi dist;
vector<bool> vis;
void dfs(int s) {
// deb1(s);
vis[s] = 1;
for (auto it : adj[s]) {
dist[it] = max(dist[it], dist[s] + 1);
dfs(it);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
adj.resize(n + 1);
dist.resize(n + 1);
vis.resize(n + 1);
FOR(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y); // x ----> y
}
FOR(i, 1, n + 1) {
if (!vis[i]) {
// deb1(i)
dfs(i);
}
}
int ans = 0;
FOR(i, 1, n + 1) { ans = max(ans, dist[i]); }
cout << ans << "\n";
return 0;
}
//////////////////////////////////////////////////////////////////////////
// precomputephi()
void precomputephi(int N) {
prephi.resize(N);
FOR(i, 0, N) { prephi[i] = i; }
for (int i = 1; i < N; i++) {
if (isprime[i]) {
for (int j = i; j < N; j += i) {
prephi[j] = prephi[j] - (prephi[j] / i);
}
}
}
}
// precomputedprime()
void precomputeprime(int N) {
isprime.resize(N);
isprime.assign(N, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 2; i * i <= 500005; i++) {
if (isprime[i]) {
for (int j = i * i; j <= 500005; j += i) {
isprime[j] = 0;
}
}
}
}
//"""euler totient function""": counts the number of integers between 1 and n
//inclusive, which are coprime to n.
ll phi(ll num) // find using factorization in O(sqrt(N)).....
{
ll result = num;
for (ll i = 2; i * i <= num; i++) {
if (num % i == 0) {
while (num % i == 0) {
num /= i;
}
result -= (result / i);
}
}
if (num > 1) {
result -= (result / num);
}
return result;
}
void findprime(void) {
int N = 1e6 + 5;
vector<bool> isprime(N, 1); // up to 1e6+5 number
for (int i = 2; i * i <= N; i++) {
if (isprime[i]) {
for (int j = i * i; j <= N; j += i) {
if (isprime[j]) {
isprime[j] = 0;
}
}
}
}
for (int i = 2; i <= N; i++) {
if (isprime[i]) {
prime.pb(i);
}
}
}
bool checkithbit(ll a, ll i) {
if (a & (1 << i)) {
return true;
} else {
return false;
}
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return (max(a, b) / GCD(a, b)) * min(a, b); }
ll power(ll a, ll n) {
unsigned long long int result = 1, x = a;
while (n > 0) {
if (n % 2 == 1)
result = result * x;
x = x * x;
n = n / 2;
}
return result;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
int ones(ll n) {
int c = 0;
while (n) {
n = n & (n - 1);
c++;
}
return c;
}
// store gcd of a,b in d
// store solution of a*x + b*y = d in x,y
// if gcd(a,b)=1 then x = a^(-1)(mod b) and y = b^(-1)(mod a)
ll d, x, y;
void extendedEuclid(ll A, ll B) {
if (B == 0) {
d = A;
x = 1;
y = 0;
} else {
extendedEuclid(B, A % B);
int temp = x;
x = y;
y = temp - (A / B) * y;
}
}
// return modulo inverse of a wrt modulo p(should be prime)
// retunt -1 if modulo inverse does not exist
ll MMI(ll a, ll p) {
extendedEuclid(a, p);
if (d == 1 && p != 1)
return ((x % p) + p) % p;
else
return -1;
}
// Fastest way to read Input
void fastscan(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l,
ll r) // where l and r is query range.
{
if (l == r) {
SegmentTree[idx] = a[l];
} else {
ll mid = (l + r) / 2ll;
Build_Segment_Tree(a, (2ll * idx), l, mid);
Build_Segment_Tree(a, (2ll * idx) + 1, mid + 1, r);
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
ll sum(ll idx, ll sl, ll sr, ll l,
ll r) // here [sl...sr] segment range associate at idx index. where l and
// r is query range.
{
if (l > r) {
return 0;
}
if (sl == l && sr == r) {
return SegmentTree[idx];
}
ll mid = (sl + sr) / 2;
return sum(2ll * idx, sl, mid, l, min(r, mid)) +
sum(2ll * idx + 1, mid + 1, sr, max(mid + 1, l), r);
}
void update(ll idx, ll sl, ll sr, ll value, ll id) {
if (sl == sr && sl == id) {
SegmentTree[idx] = value;
} else {
ll mid = (sl + sr) / 2ll;
if (id <= mid) {
update(2ll * idx, sl, mid, value, id);
} else {
update(2ll * idx + 1, mid + 1, sr, value, id);
}
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
/*
note:
//a.resize(unique(a.begin(), a.end()) - a.begin()); use for create array unique
element...
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(g1.begin(), g1.end(), rng);(g1 is array name) for choose random number
//int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
//use once(num) give no of 1 in its binary form
//use give (int)log2(num)+1 give no of digits in its binary form
//bitset<64>(num).to_string() convert decimal to num64 bit binary number
//stoull(str, nullptr, 2) convert str in binary form to decimal number
// "max" priority queue: priority_queue<ll, vector<ll>, less<ll> >pq; #select
max element as top()#
// "min" priority queue: priority_queue<ll, vector<ll>, greater< ll> >pq;
#select min element as top()#
//set<int> inbuit sort accending order (set<int,less<int>>)
//set<int,greater<int>> sort element in decreasing order
// int __builtin_popcount(unsigned int)
--->It returns the numbers of set bits in an integer (the number of ones in the
binary representation of the integer).
///for finding xnor from xor
x1=Xor
x2=Xnor
ll x1=a ^ b;
ll num=max(a,b);
ll xx=log2(num)+ 1; (length of num in binary form)
****ll t=(1 << xx) - 1; (set all xx length bits to 1)
ll x2=x1 ^ t; (get xnor via xor using t)
--->Dilworth's theorem:-
this theorem says that the minimum number of non-decreasing sequences we
need to cover the whole sequence equals the length of least decreasing
subsequence.
----->a + b = (a xor b) +( 2 * (a & b)); ///very imp
*/
|
// Vaidik Patel(India)
// DA-IICT
#include <bits/stdc++.h>
using namespace std;
//********************************************
#include <ext/pb_ds/assoc_container.hpp> // include the associative containers or group of templates such as set, multimap, map etc.
#include <ext/pb_ds/tree_policy.hpp> // include the tree_order_statistics_node update
using namespace __gnu_pbds; // necessary for the GNU based Policy based data
// structures.
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//********************************************
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int INF = (int)1e9;
ll INFINF = (ll)1e18 + 10;
const ld PI = 3.14159265358979323846;
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minheap priority_queue<ll, vector<ll>, greater<ll>>
#define maxheap priority_queue<ll, vector<ll>, less<ll>>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rFOR(i, a, b) for (ll i = a; i >= b; i--)
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << endl;
#define deb4(x, y, z, w) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << "\t" << #w << " : " << w << endl;
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define checkbit(n, b) ((n >> b) & 1)
#define mkp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define TIME \
cerr << "Time Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
#define lc 2 * idx
#define rc 2 * idx + 1
ll powermodm(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return result;
}
ll GCD(ll, ll);
ll LCM(ll, ll);
ll power(ll, ll);
ll choose(ll, ll);
int ones(ll);
void extendedEuclid(ll, ll);
ll MMI(ll, ll);
void fastscan(int &);
bool checkithbit(ll, ll); // ith bit is zero or not
vector<ll> SegmentTree;
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l, ll r);
ll sum(ll idx, ll sl, ll sr, ll l, ll r);
void update(ll idx, ll sl, ll sr, ll value, ll id);
vector<ll> prime;
void findprime(void);
ll phi(ll num);
vector<int> isprime;
void precomputeprime(int N);
vector<int> prephi;
void precomputephi(int N);
int read();
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
#define pb push_back
#define M 1000000007
//////////////////////////////////////////////////////////////////////////////
ll n, m;
vvi adj;
vi dist;
vector<bool> vis;
void dfs(int s) {
// deb1(s);
vis[s] = 1;
for (auto it : adj[s]) {
if (!vis[it])
dfs(it);
dist[s] = max(dist[s], 1 + dist[it]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
adj.resize(n + 1);
dist.resize(n + 1);
vis.resize(n + 1);
FOR(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y); // x ----> y
}
FOR(i, 1, n + 1) {
if (!vis[i]) {
// deb1(i)
dfs(i);
}
}
int ans = 0;
FOR(i, 1, n + 1) { ans = max(ans, dist[i]); }
cout << ans << "\n";
return 0;
}
//////////////////////////////////////////////////////////////////////////
// precomputephi()
void precomputephi(int N) {
prephi.resize(N);
FOR(i, 0, N) { prephi[i] = i; }
for (int i = 1; i < N; i++) {
if (isprime[i]) {
for (int j = i; j < N; j += i) {
prephi[j] = prephi[j] - (prephi[j] / i);
}
}
}
}
// precomputedprime()
void precomputeprime(int N) {
isprime.resize(N);
isprime.assign(N, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 2; i * i <= 500005; i++) {
if (isprime[i]) {
for (int j = i * i; j <= 500005; j += i) {
isprime[j] = 0;
}
}
}
}
//"""euler totient function""": counts the number of integers between 1 and n
//inclusive, which are coprime to n.
ll phi(ll num) // find using factorization in O(sqrt(N)).....
{
ll result = num;
for (ll i = 2; i * i <= num; i++) {
if (num % i == 0) {
while (num % i == 0) {
num /= i;
}
result -= (result / i);
}
}
if (num > 1) {
result -= (result / num);
}
return result;
}
void findprime(void) {
int N = 1e6 + 5;
vector<bool> isprime(N, 1); // up to 1e6+5 number
for (int i = 2; i * i <= N; i++) {
if (isprime[i]) {
for (int j = i * i; j <= N; j += i) {
if (isprime[j]) {
isprime[j] = 0;
}
}
}
}
for (int i = 2; i <= N; i++) {
if (isprime[i]) {
prime.pb(i);
}
}
}
bool checkithbit(ll a, ll i) {
if (a & (1 << i)) {
return true;
} else {
return false;
}
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return (max(a, b) / GCD(a, b)) * min(a, b); }
ll power(ll a, ll n) {
unsigned long long int result = 1, x = a;
while (n > 0) {
if (n % 2 == 1)
result = result * x;
x = x * x;
n = n / 2;
}
return result;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
int ones(ll n) {
int c = 0;
while (n) {
n = n & (n - 1);
c++;
}
return c;
}
// store gcd of a,b in d
// store solution of a*x + b*y = d in x,y
// if gcd(a,b)=1 then x = a^(-1)(mod b) and y = b^(-1)(mod a)
ll d, x, y;
void extendedEuclid(ll A, ll B) {
if (B == 0) {
d = A;
x = 1;
y = 0;
} else {
extendedEuclid(B, A % B);
int temp = x;
x = y;
y = temp - (A / B) * y;
}
}
// return modulo inverse of a wrt modulo p(should be prime)
// retunt -1 if modulo inverse does not exist
ll MMI(ll a, ll p) {
extendedEuclid(a, p);
if (d == 1 && p != 1)
return ((x % p) + p) % p;
else
return -1;
}
// Fastest way to read Input
void fastscan(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l,
ll r) // where l and r is query range.
{
if (l == r) {
SegmentTree[idx] = a[l];
} else {
ll mid = (l + r) / 2ll;
Build_Segment_Tree(a, (2ll * idx), l, mid);
Build_Segment_Tree(a, (2ll * idx) + 1, mid + 1, r);
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
ll sum(ll idx, ll sl, ll sr, ll l,
ll r) // here [sl...sr] segment range associate at idx index. where l and
// r is query range.
{
if (l > r) {
return 0;
}
if (sl == l && sr == r) {
return SegmentTree[idx];
}
ll mid = (sl + sr) / 2;
return sum(2ll * idx, sl, mid, l, min(r, mid)) +
sum(2ll * idx + 1, mid + 1, sr, max(mid + 1, l), r);
}
void update(ll idx, ll sl, ll sr, ll value, ll id) {
if (sl == sr && sl == id) {
SegmentTree[idx] = value;
} else {
ll mid = (sl + sr) / 2ll;
if (id <= mid) {
update(2ll * idx, sl, mid, value, id);
} else {
update(2ll * idx + 1, mid + 1, sr, value, id);
}
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
/*
note:
//a.resize(unique(a.begin(), a.end()) - a.begin()); use for create array unique
element...
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(g1.begin(), g1.end(), rng);(g1 is array name) for choose random number
//int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
//use once(num) give no of 1 in its binary form
//use give (int)log2(num)+1 give no of digits in its binary form
//bitset<64>(num).to_string() convert decimal to num64 bit binary number
//stoull(str, nullptr, 2) convert str in binary form to decimal number
// "max" priority queue: priority_queue<ll, vector<ll>, less<ll> >pq; #select
max element as top()#
// "min" priority queue: priority_queue<ll, vector<ll>, greater< ll> >pq;
#select min element as top()#
//set<int> inbuit sort accending order (set<int,less<int>>)
//set<int,greater<int>> sort element in decreasing order
// int __builtin_popcount(unsigned int)
--->It returns the numbers of set bits in an integer (the number of ones in the
binary representation of the integer).
///for finding xnor from xor
x1=Xor
x2=Xnor
ll x1=a ^ b;
ll num=max(a,b);
ll xx=log2(num)+ 1; (length of num in binary form)
****ll t=(1 << xx) - 1; (set all xx length bits to 1)
ll x2=x1 ^ t; (get xnor via xor using t)
--->Dilworth's theorem:-
this theorem says that the minimum number of non-decreasing sequences we
need to cover the whole sequence equals the length of least decreasing
subsequence.
----->a + b = (a xor b) +( 2 * (a & b)); ///very imp
*/
|
replace
| 104 | 106 | 104 | 107 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
///...................................*****.................................................///
/// Mujahidul Islam ( [email protected] ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.................................................///
#include <bits/stdc++.h>
using namespace std;
#define FaRaBi \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define sc scanf
#define pf printf
#define scin(x) scanf("%d", &(x))
#define scin2(x, y) scanf("%d %d", &(x), &(y))
#define scin3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define scln(x) scanf("%lld", &(x))
#define scln2(x, y) scanf("%lld %lld", &(x), &(y))
#define scln3(x, y, z) scanf("%lld %lld %lld", &(x), &(y), &(z))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(d, min(a, min(b, c)))
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(d, max(a, max(b, c)))
#define ms(a, b) memset(a, b, sizeof(a))
#define mp make_pair
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * (b) / gcd(a, b))
#define input freopen("input.txt", "rt", stdin)
#define output freopen("output.txt", "wt", stdout)
#define PI acos(-1.0)
#define zero(a) memset(a, 0, sizeof a)
#define all(v) v.begin(), v.end()
#define Max(v) *max_element(all(v))
#define Min(v) *min_element(all(v))
#define Upper(c, x) (upper_bound(c.begin(), c.end(), x) - c.begin())
#define Lower(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Unique(X) (X).erase(unique(all(X)), (X).end())
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
#define segment_tree \
int Lnode = node << 1, Rnode = Lnode + 1, mid = (b + e) >> 1;
#define out(x) cout << x << " ";
/// sum accumulate( v.begin(), v.begin() + k, 0LL )///bool operator < ( const
/// Node& p ) const{ return cost < p.cost ; }
/// priority_queue<int,vector<int>,greater<int> >pq;///std::set<ll,
/// std::greater<ll> > Set;///string str =
/// "abcdefghijklmnopqrstuvwxyz";///string s2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
/// string s = bitset<64>( n ).to_string() ; ll val = bitset< 64 >( s
/// ).to_ullong() ;
///--------------Graph Moves--------------------------------------
/// const int fx[] = {+1,-1,+0,+0}; ///const int fy[] = {+0,+0,+1,-1};
/// const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move ///const int fy[]
/// = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move const int fx[] =
/// {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move ///const int fy[] =
/// {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
///---------------------------------------------------------------
///--------------------**********----------------------------------
vector<ll> v, v1, v2, v3, v4;
vector<pair<ll, pll>> vec1;
vector<pair<ll, ll>> vec;
vector<int> adj[10005];
map<int, int> Mp, Mp1, Mp2;
set<int> st, st1, st2;
queue<ll> Q;
stack<ll> Stk;
multiset<ll> S;
///---------------------**********--------------------------------
int n, m;
bool visited[100005];
int dp[100005];
void Reset() { zero(dp); }
void Input() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
}
int Fun(int u) {
if (visited[u])
return dp[u];
visited[u] = 1;
int val = 0;
for (auto v : adj[u]) {
val = max(val, 1 + Fun(v));
}
return dp[u] = val;
}
void Calculation() {
for (int i = 1; i <= n; i++) {
if (!visited[i])
Fun(i);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
void solve() {
Reset();
Input();
Calculation();
}
int main() {
FaRaBi;
int t;
// cin >> t ;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
///...................................*****.................................................///
/// Mujahidul Islam ( [email protected] ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.................................................///
#include <bits/stdc++.h>
using namespace std;
#define FaRaBi \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define sc scanf
#define pf printf
#define scin(x) scanf("%d", &(x))
#define scin2(x, y) scanf("%d %d", &(x), &(y))
#define scin3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define scln(x) scanf("%lld", &(x))
#define scln2(x, y) scanf("%lld %lld", &(x), &(y))
#define scln3(x, y, z) scanf("%lld %lld %lld", &(x), &(y), &(z))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(d, min(a, min(b, c)))
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(d, max(a, max(b, c)))
#define ms(a, b) memset(a, b, sizeof(a))
#define mp make_pair
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * (b) / gcd(a, b))
#define input freopen("input.txt", "rt", stdin)
#define output freopen("output.txt", "wt", stdout)
#define PI acos(-1.0)
#define zero(a) memset(a, 0, sizeof a)
#define all(v) v.begin(), v.end()
#define Max(v) *max_element(all(v))
#define Min(v) *min_element(all(v))
#define Upper(c, x) (upper_bound(c.begin(), c.end(), x) - c.begin())
#define Lower(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Unique(X) (X).erase(unique(all(X)), (X).end())
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
#define segment_tree \
int Lnode = node << 1, Rnode = Lnode + 1, mid = (b + e) >> 1;
#define out(x) cout << x << " ";
/// sum accumulate( v.begin(), v.begin() + k, 0LL )///bool operator < ( const
/// Node& p ) const{ return cost < p.cost ; }
/// priority_queue<int,vector<int>,greater<int> >pq;///std::set<ll,
/// std::greater<ll> > Set;///string str =
/// "abcdefghijklmnopqrstuvwxyz";///string s2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
/// string s = bitset<64>( n ).to_string() ; ll val = bitset< 64 >( s
/// ).to_ullong() ;
///--------------Graph Moves--------------------------------------
/// const int fx[] = {+1,-1,+0,+0}; ///const int fy[] = {+0,+0,+1,-1};
/// const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move ///const int fy[]
/// = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move const int fx[] =
/// {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move ///const int fy[] =
/// {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
///---------------------------------------------------------------
///--------------------**********----------------------------------
vector<ll> v, v1, v2, v3, v4;
vector<pair<ll, pll>> vec1;
vector<pair<ll, ll>> vec;
vector<int> adj[100005];
map<int, int> Mp, Mp1, Mp2;
set<int> st, st1, st2;
queue<ll> Q;
stack<ll> Stk;
multiset<ll> S;
///---------------------**********--------------------------------
int n, m;
bool visited[100005];
int dp[100005];
void Reset() { zero(dp); }
void Input() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
}
int Fun(int u) {
if (visited[u])
return dp[u];
visited[u] = 1;
int val = 0;
for (auto v : adj[u]) {
val = max(val, 1 + Fun(v));
}
return dp[u] = val;
}
void Calculation() {
for (int i = 1; i <= n; i++) {
if (!visited[i])
Fun(i);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
void solve() {
Reset();
Input();
Calculation();
}
int main() {
FaRaBi;
int t;
// cin >> t ;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
replace
| 75 | 76 | 75 | 76 |
0
| |
p03166
|
C++
|
Runtime Error
|
// Take care of mod becoming -ve
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fro(i, s, e) for (auto i = s; i <= e; ++i)
#define int long long
#define ld long double
#define fr(i, n) for (auto i = 0; i < n; i++)
#define ff first
#define pf pop_front()
#define ss second
#define mp make_pair
#define vi std::vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define vii std::vector<int, int>
#define tc \
int t; \
cin >> t; \
while (t--)
#define FILE \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define inp(a) \
int a; \
cin >> a;
#define ps(x, y) fixed << setprecision(y) << x
#define mkarr(arr, n, type) type *arr = new type[n];
#define endl "\n"
#define sz size()
#define rev(i, e, s) for (auto i = e; i >= s; --i)
const int mod = 1000000007;
#define min_pq priority_queue<int, std::vector<int>, greater<int>>
#define printclock \
cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
using namespace std;
const int N = 100005;
const int inf = 1000000000000000000;
#define fit(s, x) memset(s, x, sizeof(s));
#define out(x) cout << x << "\n"
#define deb(x) cout << #x << x << "\n"
#define pi 3.14159265358979323846264338327950
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// Use __gcd(a,b) for gcd
// find(all(x),key) to get the iterator and its index is obtained by
// find(all(x),key)-x.begin() find_if(iterator_first,iterator_last,unary
// function) returns first iterator if any element corresponding to unary
// function exists and if no such element is found it retrurns the last iterator
/*For example:
find_if(all(x),isodd) for x being a vector{10,25,40,55}; *it returns 25*/
/*search(all(v1),all(v2),pred) searches for all the elements of v2 present in v1
based on pred function the iterator correspond to the first element of sequence
if it exists and if not then th elast iterator is obtained.*/
// use substr(size_t pos,size_t len) for the substrings
// iota(forward itr,backwrd itr,val) can be used for consecutive numbers
int binsearch(int *a, int start, int end, int key) {
while (start <= end) {
int mid = start + (end - start) / 2;
if (a[mid] < key)
start = mid + 1;
else if (a[mid] > key)
end = mid - 1;
else
return mid;
}
return -1;
}
int power(int a, int b) {
long long ans = 1;
while (b > 0) {
if (b & 1LL) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b = (b >> 1LL);
}
return ans;
}
vector<int> gr[N];
int dis[N];
int in_deg[N];
bool visited[N];
void dfs(int a) {
assert(!visited[a]);
visited[a] = true;
for (int b : gr[a]) {
dis[b] = max(dis[b], dis[a] + 1);
--in_deg[b];
if (in_deg[b] == 0) {
dfs(b);
}
}
}
int32_t main() {
fio;
// indexed_set s;
// s.insert(2);
// auto y = s.find_by_order(7);
// cout << *x << " " << *y <<
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
gr[a].pb(b);
++in_deg[b];
}
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dis[i]);
}
out(ans);
printclock;
return 0;
}
|
// Take care of mod becoming -ve
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fro(i, s, e) for (auto i = s; i <= e; ++i)
#define int long long
#define ld long double
#define fr(i, n) for (auto i = 0; i < n; i++)
#define ff first
#define pf pop_front()
#define ss second
#define mp make_pair
#define vi std::vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define vii std::vector<int, int>
#define tc \
int t; \
cin >> t; \
while (t--)
#define FILE \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define inp(a) \
int a; \
cin >> a;
#define ps(x, y) fixed << setprecision(y) << x
#define mkarr(arr, n, type) type *arr = new type[n];
#define endl "\n"
#define sz size()
#define rev(i, e, s) for (auto i = e; i >= s; --i)
const int mod = 1000000007;
#define min_pq priority_queue<int, std::vector<int>, greater<int>>
#define printclock \
cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
using namespace std;
const int N = 100005;
const int inf = 1000000000000000000;
#define fit(s, x) memset(s, x, sizeof(s));
#define out(x) cout << x << "\n"
#define deb(x) cout << #x << x << "\n"
#define pi 3.14159265358979323846264338327950
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// Use __gcd(a,b) for gcd
// find(all(x),key) to get the iterator and its index is obtained by
// find(all(x),key)-x.begin() find_if(iterator_first,iterator_last,unary
// function) returns first iterator if any element corresponding to unary
// function exists and if no such element is found it retrurns the last iterator
/*For example:
find_if(all(x),isodd) for x being a vector{10,25,40,55}; *it returns 25*/
/*search(all(v1),all(v2),pred) searches for all the elements of v2 present in v1
based on pred function the iterator correspond to the first element of sequence
if it exists and if not then th elast iterator is obtained.*/
// use substr(size_t pos,size_t len) for the substrings
// iota(forward itr,backwrd itr,val) can be used for consecutive numbers
int binsearch(int *a, int start, int end, int key) {
while (start <= end) {
int mid = start + (end - start) / 2;
if (a[mid] < key)
start = mid + 1;
else if (a[mid] > key)
end = mid - 1;
else
return mid;
}
return -1;
}
int power(int a, int b) {
long long ans = 1;
while (b > 0) {
if (b & 1LL) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b = (b >> 1LL);
}
return ans;
}
vector<int> gr[N];
int dis[N];
int in_deg[N];
bool visited[N];
void dfs(int a) {
assert(!visited[a]);
visited[a] = true;
for (int b : gr[a]) {
dis[b] = max(dis[b], dis[a] + 1);
--in_deg[b];
if (in_deg[b] == 0) {
dfs(b);
}
}
}
int32_t main() {
fio;
// indexed_set s;
// s.insert(2);
// auto y = s.find_by_order(7);
// cout << *x << " " << *y <<
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
gr[a].pb(b);
++in_deg[b];
}
for (int i = 1; i <= n; i++) {
if (!visited[i] && in_deg[i] == 0) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dis[i]);
}
out(ans);
printclock;
return 0;
}
|
replace
| 121 | 122 | 121 | 122 |
0
|
Time : 42.689ms
|
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
// #define int long long
#define deb(x) cout << #x << " = " << x << "\n";
#define maxn 100005
using namespace std;
int dp[maxn];
vector<int> g[maxn];
bitset<maxn> vis;
int dfs(int s) {
vis[s] = 1;
for (int ch : g[s]) {
dfs(ch);
dp[s] = max(dp[s], 1 + dp[ch]);
}
return dp[s];
}
signed main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
memset(dp, 0, sizeof(dp));
vis.reset();
for (int i = 1; i <= n; i++) {
if (!vis[i])
int x = dfs(i);
}
int ans = *max_element(dp + 1, dp + 1 + n);
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
// #define int long long
#define deb(x) cout << #x << " = " << x << "\n";
#define maxn 100005
using namespace std;
int dp[maxn];
vector<int> g[maxn];
bitset<maxn> vis;
int dfs(int s) {
vis[s] = 1;
for (int ch : g[s]) {
if (!vis[ch])
dfs(ch);
dp[s] = max(dp[s], 1 + dp[ch]);
}
return dp[s];
}
signed main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
memset(dp, 0, sizeof(dp));
vis.reset();
for (int i = 1; i <= n; i++) {
if (!vis[i])
int x = dfs(i);
}
int ans = *max_element(dp + 1, dp + 1 + n);
cout << ans << "\n";
}
|
replace
| 11 | 12 | 11 | 13 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, m;
ll dp[100100];
vector<vector<ll>> g;
ll rec(ll i) {
if (dp[i] != -1)
return dp[i];
ll res = 0;
for (auto j : g[i]) {
res = max(res, rec(j) + 1);
}
return dp[i] = res;
}
int main() {
cin >> n >> m;
g.assign(n, vector<ll>());
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
for (int i = 0; i < 100100; i++)
dp[i] = -1;
ll res = 0;
for (int i = 0; i < n; i++) {
res = max(res, rec(i));
}
cout << res << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, m;
ll dp[100100];
vector<vector<ll>> g;
ll rec(ll i) {
if (dp[i] != -1)
return dp[i];
ll res = 0;
for (auto j : g[i]) {
res = max(res, rec(j) + 1);
}
return dp[i] = res;
}
int main() {
cin >> n >> m;
g.assign(n, vector<ll>());
for (int i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
for (int i = 0; i < 100100; i++)
dp[i] = -1;
ll res = 0;
for (int i = 0; i < n; i++) {
res = max(res, rec(i));
}
cout << res << endl;
}
|
replace
| 51 | 52 | 51 | 52 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, m;
vector<vector<ll>> g;
ll dp[100100];
ll rec(ll i) {
if (dp[i] != -1)
return dp[i];
ll res = 0;
for (auto j : g[i]) {
res = max(res, rec(j) + 1);
}
return res;
}
int main() {
cin >> n >> m;
g.assign(n, vector<ll>());
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
for (int i = 0; i < 100100; i++)
dp[i] = -1;
ll res = 0;
for (int i = 0; i < n; i++) {
res = max(res, rec(i));
}
cout << res << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, m;
vector<vector<ll>> g;
ll dp[100100];
ll rec(ll i) {
if (dp[i] != -1)
return dp[i];
ll res = 0;
for (auto j : g[i]) {
res = max(res, rec(j) + 1);
}
return dp[i] = res;
}
int main() {
cin >> n >> m;
g.assign(n, vector<ll>());
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
for (int i = 0; i < 100100; i++)
dp[i] = -1;
ll res = 0;
for (int i = 0; i < n; i++) {
res = max(res, rec(i));
}
cout << res << endl;
}
|
replace
| 45 | 46 | 45 | 46 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7; // 924844033 1000000000 + 9;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum, ans, dp[20100], a[220000],
b[220000];
string str, ss;
bool f[220000];
char c[4000][4000];
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<Edge>> vec, rvec;
vector<edge> ed;
vector<LL> v;
map<string, LL> ma;
set<LL> st;
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
vector<LL> tsort(vector<vector<Edge>> vec) {
enum { YET, VISITED, DONE };
vector<LL> res, flg(n, YET);
static const function<bool(int)> dfs = [&](int v) {
flg[v] = VISITED;
for (auto &e : vec[v]) {
int w = e.to;
if (flg[w] != DONE && (flg[w] == VISITED || !dfs(w)))
return false;
}
flg[v] = DONE;
res.push_back(v);
return true;
};
for (int i = 0; i < n; ++i)
if (flg[i] == YET && !dfs(i))
return {};
reverse(res.begin(), res.end());
return res;
}
int main() {
cin >> n >> m;
vec.resize(n);
rep(i, m) {
LL x, y;
cin >> x >> y;
x--, y--;
vec[x].push_back(Edge{y, 1});
}
vector<LL> x = tsort(vec);
rep(i, n) {
ans = max(ans, dp[x[i]]);
rep(j, vec[x[i]].size()) {
LL v = vec[x[i]][j].to;
dp[v] = max(dp[x[i]] + 1, dp[v]);
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
long long MOD = 1000000000 + 7; // 924844033 1000000000 + 9;
constexpr long long INF = numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr << #x << ": " << x << '\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll {
LL first, second, third;
};
struct Fll {
LL first, second, third, fourth;
};
typedef pair<LL, Tll> Ptll;
#define rep(i, rept) for (LL i = 0; i < rept; i++)
#define Rrep(i, mf) for (LL i = mf - 1; i >= 0; i--)
LL h, w, n, m, k, t, s, p, q, last, first, cnt, sum, ans, dp[201000], a[220000],
b[220000];
string str, ss;
bool f[220000];
char c[4000][4000];
int di[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
struct Edge {
LL to, cost;
};
struct edge {
LL from, to, cost;
};
vector<vector<Edge>> vec, rvec;
vector<edge> ed;
vector<LL> v;
map<string, LL> ma;
set<LL> st;
void YN(bool f) {
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void yn(bool f) {
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
vector<LL> tsort(vector<vector<Edge>> vec) {
enum { YET, VISITED, DONE };
vector<LL> res, flg(n, YET);
static const function<bool(int)> dfs = [&](int v) {
flg[v] = VISITED;
for (auto &e : vec[v]) {
int w = e.to;
if (flg[w] != DONE && (flg[w] == VISITED || !dfs(w)))
return false;
}
flg[v] = DONE;
res.push_back(v);
return true;
};
for (int i = 0; i < n; ++i)
if (flg[i] == YET && !dfs(i))
return {};
reverse(res.begin(), res.end());
return res;
}
int main() {
cin >> n >> m;
vec.resize(n);
rep(i, m) {
LL x, y;
cin >> x >> y;
x--, y--;
vec[x].push_back(Edge{y, 1});
}
vector<LL> x = tsort(vec);
rep(i, n) {
ans = max(ans, dp[x[i]]);
rep(j, vec[x[i]].size()) {
LL v = vec[x[i]][j].to;
dp[v] = max(dp[x[i]] + 1, dp[v]);
}
}
cout << ans << endl;
return 0;
}
|
replace
| 61 | 62 | 61 | 62 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X)
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
/* main */
ll N, M;
vll adj;
ll memo[100010];
ll dfs(ll n) {
if (adj[n].size() == 0)
return 0;
if (memo[n])
return memo[n];
ll ans = 0;
for (auto x : adj[n])
chmax(ans, dfs(x) + 1);
return ans;
}
signed main() {
cin >> N >> M;
adj.resize(N);
FOR(i, 0, M) {
ll x, y;
cin >> x >> y;
x--;
y--;
adj[x].pb(y);
}
ll ans = 0;
FOR(i, 0, N) chmax(ans, dfs(i));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* define */
#define FOR(I, X, Y) for (long long(I) = (X); (I) < (Y); (I)++)
#define REP(I, X, Y) for (long long(I) = (Y)-1; (I) >= (X); (I)--)
#define ALL(X) (X).begin(), (X).end()
#define pb push_back
#define COUNT(V, X) \
upper_bound((V).begin(), (V).end(), X) - \
lower_bound((V).begin(), (V).end(), X)
#define debug(x) cerr << #x << ':' << x << endl;
#define DEBUG(v) \
cerr << #v << ':'; \
for (auto xXx : v) \
cerr << xXx << ' '; \
cerr << endl;
#define Yes(X) \
if (X) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define YES(X) \
if (X) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define ctoi(C) (C - '0')
/* alias */
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const long long dx[] = {1, 0, -1, 0};
const long long dy[] = {0, 1, 0, -1};
const long long dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
const long long dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long dx9[] = {1, 1, 0, -1, -1, -1, 0, 1, 0};
const int INF = 1000000007;
const long long LINF = 1000000000000000007;
/* func */
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
/* main */
ll N, M;
vll adj;
ll memo[100010];
ll dfs(ll n) {
if (adj[n].size() == 0)
return 0;
if (memo[n])
return memo[n];
ll ans = 0;
for (auto x : adj[n])
chmax(ans, dfs(x) + 1);
return memo[n] = ans;
}
signed main() {
cin >> N >> M;
adj.resize(N);
FOR(i, 0, M) {
ll x, y;
cin >> x >> y;
x--;
y--;
adj[x].pb(y);
}
ll ans = 0;
FOR(i, 0, N) chmax(ans, dfs(i));
cout << ans << endl;
}
|
replace
| 84 | 85 | 84 | 85 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long cost;
int from, to;
Edge(long long c, int f, int t) {
cost = c;
from = f;
to = t;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void readGraph(Graph &g, int E, bool D,
bool C) { // E:NumofEdges, D:Directed, C:Costed
for (int i = 0; i < E; ++i) {
Edge e(0, 0, 0);
if (!C)
cin >> e.from >> e.to;
else
cin >> e.from >> e.to >> e.cost;
--e.from;
--e.to;
g[e.from].push_back(e);
if (!D) {
swap(e.from, e.to);
g[e.from].push_back(e);
}
}
}
int a[100010], ans;
int func(Graph &g, int p) {
if (a[p] != -1)
return a[p];
int res = 0;
for (int i = 0; i < g[p].size(); ++i)
res = max(res, 1 + func(g, g[p][i].to));
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
Graph g(n);
readGraph(g, m, true, false);
memset(a, -1, sizeof(a));
for (int i = 0; i < n; ++i)
ans = max(ans, func(g, i));
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long cost;
int from, to;
Edge(long long c, int f, int t) {
cost = c;
from = f;
to = t;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void readGraph(Graph &g, int E, bool D,
bool C) { // E:NumofEdges, D:Directed, C:Costed
for (int i = 0; i < E; ++i) {
Edge e(0, 0, 0);
if (!C)
cin >> e.from >> e.to;
else
cin >> e.from >> e.to >> e.cost;
--e.from;
--e.to;
g[e.from].push_back(e);
if (!D) {
swap(e.from, e.to);
g[e.from].push_back(e);
}
}
}
int a[100010], ans;
int func(Graph &g, int p) {
if (a[p] != -1)
return a[p];
int res = 0;
for (int i = 0; i < g[p].size(); ++i)
res = max(res, 1 + func(g, g[p][i].to));
return a[p] = res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
Graph g(n);
readGraph(g, m, true, false);
memset(a, -1, sizeof(a));
for (int i = 0; i < n; ++i)
ans = max(ans, func(g, i));
cout << ans << "\n";
}
|
replace
| 40 | 41 | 40 | 41 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SORT(vector) sort(vector.begin(), vector.end())
const ll MOD = 1e9 + 7;
vector<vector<int>> e;
vector<int> dp;
int DFS(int n) {
if (dp[n] != -1) {
return dp[n];
}
int ret = -1;
for (auto to : e[n]) {
ret = max(ret, DFS(to) + 1);
}
return ret;
}
void solve(istream &cin, ostream &cout) {
int n, m;
cin >> n >> m;
e = vector<vector<int>>(n, vector<int>(0));
dp = vector<int>(n, -1);
REP(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
e[x].push_back(y);
}
int ans = 0;
REP(i, n) { ans = max(ans, DFS(i) + 1); }
cout << ans << endl;
}
#ifndef TEST
int main() { solve(cin, cout); }
#endif
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var < (end); var++)
#define RFOR(var, begin, end) for (int var = (begin)-1; var >= (end); var--)
#define REP(var, length) FOR(var, 0, length)
#define RREP(var, length) RFOR(var, length, 0)
#define SORT(vector) sort(vector.begin(), vector.end())
const ll MOD = 1e9 + 7;
vector<vector<int>> e;
vector<int> dp;
int DFS(int n) {
if (dp[n] != -1) {
return dp[n];
}
int ret = -1;
for (auto to : e[n]) {
ret = max(ret, DFS(to) + 1);
}
dp[n] = ret;
return ret;
}
void solve(istream &cin, ostream &cout) {
int n, m;
cin >> n >> m;
e = vector<vector<int>>(n, vector<int>(0));
dp = vector<int>(n, -1);
REP(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
e[x].push_back(y);
}
int ans = 0;
REP(i, n) { ans = max(ans, DFS(i) + 1); }
cout << ans << endl;
}
#ifndef TEST
int main() { solve(cin, cout); }
#endif
|
insert
| 23 | 23 | 23 | 24 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int N, M; // input
vector<vector<int>> G; // graph
// メモ化再帰
// int dp[100100];
int dp[30];
int rec(int v) {
if (dp[v] != -1)
return dp[v]; // if it's updated, use the value
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res; // memo and return
}
int main() {
cin >> N >> M;
G.assign(N, vector<int>());
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
--x, --y;
G[x].push_back(y);
}
// init(not visted)
for (int v = 0; v < N; ++v)
dp[v] = -1;
// memosaiki
int res = 0;
for (int v = 0; v < N; ++v) {
res = max(res, rec(v));
}
cout << res << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int N, M; // input
vector<vector<int>> G; // graph
// メモ化再帰
int dp[100100];
int rec(int v) {
if (dp[v] != -1)
return dp[v]; // if it's updated, use the value
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res; // memo and return
}
int main() {
cin >> N >> M;
G.assign(N, vector<int>());
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
--x, --y;
G[x].push_back(y);
}
// init(not visted)
for (int v = 0; v < N; ++v)
dp[v] = -1;
// memosaiki
int res = 0;
for (int v = 0; v < N; ++v) {
res = max(res, rec(v));
}
cout << res << endl;
}
|
replace
| 11 | 13 | 11 | 12 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
template <typename T> struct TopologicalSort {
struct Edge {
int src, dst;
T cost;
Edge(int dst_, T cost_ = 0) : src(-1), dst(dst_), cost(cost_) {}
Edge(int src_, int dst_, T cost_) : src(src_), dst(dst_), cost(cost_) {}
inline bool operator<(const Edge &rhs) { return cost < rhs.cost; }
inline bool operator<=(const Edge &rhs) { return cost <= rhs.cost; }
inline bool operator>(const Edge &rhs) { return cost > rhs.cost; }
inline bool operator>=(const Edge &rhs) { return cost >= rhs.cost; }
};
vector<vector<Edge>> graph;
vector<int> order;
TopologicalSort(int sz_) : sz(sz_), graph(sz) {}
void add(int src, int dst, T cost = 0) {
graph[src].emplace_back(Edge(dst, cost));
}
bool build() {
order.clear();
vector<int> state(sz, 0);
REP(i, sz) if (state[i] == 0 && !dfs(i, state)) return false;
reverse(ALL(order));
return true;
}
private:
int sz;
bool dfs(int ver, vector<int> &state) {
state[ver] = 1;
for (Edge e : graph[ver]) {
if (state[e.dst] == 1)
return false;
if (state[e.dst] == 0 && !dfs(e.dst, state))
return false;
}
order.emplace_back(ver);
state[ver] = -1;
return true;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, m;
cin >> n >> m;
TopologicalSort<int> ts(n);
REP(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
ts.add(x, y);
}
ts.build();
vector<int> toposo = ts.order;
reverse(ALL(toposo));
vector<int> dp(n, 0);
for (int i : toposo) {
for (auto e : ts.graph[i])
dp[i] = max(dp[i], dp[e.dst] + 1);
}
int ans = 0;
REP(i, n) ans = max(ans, dp[i]);
cout << ans << '\n';
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
template <typename T> struct TopologicalSort {
struct Edge {
int src, dst;
T cost;
Edge(int dst_, T cost_ = 0) : src(-1), dst(dst_), cost(cost_) {}
Edge(int src_, int dst_, T cost_) : src(src_), dst(dst_), cost(cost_) {}
inline bool operator<(const Edge &rhs) { return cost < rhs.cost; }
inline bool operator<=(const Edge &rhs) { return cost <= rhs.cost; }
inline bool operator>(const Edge &rhs) { return cost > rhs.cost; }
inline bool operator>=(const Edge &rhs) { return cost >= rhs.cost; }
};
vector<vector<Edge>> graph;
vector<int> order;
TopologicalSort(int sz_) : sz(sz_), graph(sz_) {}
void add(int src, int dst, T cost = 0) {
graph[src].emplace_back(Edge(dst, cost));
}
bool build() {
order.clear();
vector<int> state(sz, 0);
REP(i, sz) if (state[i] == 0 && !dfs(i, state)) return false;
reverse(ALL(order));
return true;
}
private:
int sz;
bool dfs(int ver, vector<int> &state) {
state[ver] = 1;
for (Edge e : graph[ver]) {
if (state[e.dst] == 1)
return false;
if (state[e.dst] == 0 && !dfs(e.dst, state))
return false;
}
order.emplace_back(ver);
state[ver] = -1;
return true;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, m;
cin >> n >> m;
TopologicalSort<int> ts(n);
REP(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
ts.add(x, y);
}
ts.build();
vector<int> toposo = ts.order;
reverse(ALL(toposo));
vector<int> dp(n, 0);
for (int i : toposo) {
for (auto e : ts.graph[i])
dp[i] = max(dp[i], dp[e.dst] + 1);
}
int ans = 0;
REP(i, n) ans = max(ans, dp[i]);
cout << ans << '\n';
}
|
replace
| 45 | 46 | 45 | 46 |
-6
|
terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define jmp cout << "\n"
#define vl vector<ll>
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define printv(v) \
for (auto x : v) \
cout << x << " "; \
jmp;
#define endll "\n"
#define SORT(v) sort(v.begin(), v.end())
#define REV(x) reverse(x.begin(), x.end())
#define UNI(a) a.erase(unique(a.begin(), a.end()), a.end())
#define si(x) x.size()
#define ff first
#define ss second
#define iin insert
using namespace std;
ll ctr, mx;
ll dp[100005];
ll dfs(vector<vector<ll>> &g, ll s) {
// cout << ctr << " ";
if (dp[s] != -1)
return dp[s];
bool k = 0;
ll ms = 0;
for (auto x : g[s]) {
k = 0;
ms = max(ms, dfs(g, x));
}
return dp[s] = (k) ? 0 : (1 + ms);
}
void solve() {
ll n, m, l, r;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
for (ll i = 0; i < m; i++) {
cin >> l >> r;
adj[l].pb(r);
}
ll res = 0;
memset(dp, -1, sizeof(dp));
for (ll i = 1; i <= n; i++) {
res = max(res, dfs(adj, i));
}
cout << res - 1 << endll;
}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// ll t;
// cin >> t;
// while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ii int
#define jmp cout << "\n"
#define vl vector<ll>
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define printv(v) \
for (auto x : v) \
cout << x << " "; \
jmp;
#define endll "\n"
#define SORT(v) sort(v.begin(), v.end())
#define REV(x) reverse(x.begin(), x.end())
#define UNI(a) a.erase(unique(a.begin(), a.end()), a.end())
#define si(x) x.size()
#define ff first
#define ss second
#define iin insert
using namespace std;
ll ctr, mx;
ll dp[100005];
ll dfs(vector<vector<ll>> &g, ll s) {
// cout << ctr << " ";
if (dp[s] != -1)
return dp[s];
bool k = 0;
ll ms = 0;
for (auto x : g[s]) {
k = 0;
ms = max(ms, dfs(g, x));
}
return dp[s] = (k) ? 0 : (1 + ms);
}
void solve() {
ll n, m, l, r;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
for (ll i = 0; i < m; i++) {
cin >> l >> r;
adj[l].pb(r);
}
ll res = 0;
memset(dp, -1, sizeof(dp));
for (ll i = 1; i <= n; i++) {
res = max(res, dfs(adj, i));
}
cout << res - 1 << endll;
}
int main() {
fast;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// ll t;
// cin >> t;
// while (t--)
solve();
return 0;
}
|
replace
| 55 | 59 | 55 | 59 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define MOD 1000000007
#define endl "\n"
#define sz(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define OTP(s) cout << s << endl;
#define FOR(i, j, k, l) for (int i = j; i < k; i += l)
#define REP(i, j) FOR(i, 0, j, 1)
inline ll add(ll a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline ll sub(ll a, ll b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline ll mul(ll a, ll b) { return (ll)((ll)a * b % MOD); }
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
ll min(ll a, ll b) { return a > b ? b : a; }
ll max(ll a, ll b) { return a > b ? a : b; }
ll n, m;
vl adj[150000];
ll dp[100005];
ll val(int i) {
if (dp[i] != -1)
return dp[i];
if (sz(adj[i]) == 0) {
return 1;
}
ll ma = val(adj[i][0]);
REP(j, sz(adj[i])) { ma = max(ma, val(adj[i][j])); }
dp[i] = ma + 1;
return ma + 1;
}
int main() {
IOS cin >> n >> m;
memset(dp, -1, (n + 1) * sizeof(adj[0]));
REP(i, m) {
ll x, y;
cin >> x >> y;
adj[y].pb(x);
}
for (int i = 1; i < n + 1; i++) {
if (dp[i] == -1) {
dp[i] = val(i);
}
}
ll ma = dp[1];
REP(i, n) {
// cout<<dp[i+1]<<" ";
ma = max(ma, dp[i + 1]);
}
// cout<<endl;
cout << ma - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define MOD 1000000007
#define endl "\n"
#define sz(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define OTP(s) cout << s << endl;
#define FOR(i, j, k, l) for (int i = j; i < k; i += l)
#define REP(i, j) FOR(i, 0, j, 1)
inline ll add(ll a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline ll sub(ll a, ll b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline ll mul(ll a, ll b) { return (ll)((ll)a * b % MOD); }
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
ll min(ll a, ll b) { return a > b ? b : a; }
ll max(ll a, ll b) { return a > b ? a : b; }
ll n, m;
vl adj[150000];
ll dp[100005];
ll val(int i) {
if (dp[i] != -1)
return dp[i];
if (sz(adj[i]) == 0) {
return 1;
}
ll ma = val(adj[i][0]);
REP(j, sz(adj[i])) { ma = max(ma, val(adj[i][j])); }
dp[i] = ma + 1;
return ma + 1;
}
int main() {
IOS cin >> n >> m;
memset(dp, -1, (n + 1) * sizeof(dp[0]));
REP(i, m) {
ll x, y;
cin >> x >> y;
adj[y].pb(x);
}
for (int i = 1; i < n + 1; i++) {
if (dp[i] == -1) {
dp[i] = val(i);
}
}
ll ma = dp[1];
REP(i, n) {
// cout<<dp[i+1]<<" ";
ma = max(ma, dp[i + 1]);
}
// cout<<endl;
cout << ma - 1 << endl;
}
|
replace
| 67 | 68 | 67 | 68 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp(100001, -2);
int path(vector<vector<int>> v, int n) {
if (n == 0) {
return -1;
}
if (dp[n] != -2)
return dp[n];
vector<int> t;
for (int i = 0; i < v[n].size(); i++) {
if (dp[v[n][i]] == -2)
dp[v[n][i]] = path(v, v[n][i]);
t.push_back(dp[v[n][i]]);
}
int max = t[0];
for (int i = 1; i < t.size(); i++)
if (max < t[i])
max = t[i];
dp[n] = 1 + max;
return dp[n];
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
vector<int> t = v[x];
t.push_back(y);
v[x] = t;
}
vector<int> t;
t.push_back(0);
v[0] = t;
for (int i = 1; i <= n; i++)
(v[i]).push_back(0);
for (int i = 1; i <= n; i++)
path(v, i);
int max = dp[1];
for (int i = 2; i <= n; i++)
if (dp[i] > max)
max = dp[i];
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp(100001, -2);
int path(vector<vector<int>> &v, int n) {
if (n == 0) {
return -1;
}
if (dp[n] != -2)
return dp[n];
vector<int> t;
for (int i = 0; i < v[n].size(); i++) {
if (dp[v[n][i]] == -2)
dp[v[n][i]] = path(v, v[n][i]);
t.push_back(dp[v[n][i]]);
}
int max = t[0];
for (int i = 1; i < t.size(); i++)
if (max < t[i])
max = t[i];
dp[n] = 1 + max;
return dp[n];
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n + 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
vector<int> t = v[x];
t.push_back(y);
v[x] = t;
}
vector<int> t;
t.push_back(0);
v[0] = t;
for (int i = 1; i <= n; i++)
(v[i]).push_back(0);
for (int i = 1; i <= n; i++)
path(v, i);
int max = dp[1];
for (int i = 2; i <= n; i++)
if (dp[i] > max)
max = dp[i];
cout << max << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fr(i, n) for (int i = 0; i < n; i++)
#define rep(i, st, en) for (int i = st; i <= en; i++)
#define repn(i, st, en) for (int i = st; i >= en; i--)
#define sq(a) (a * a)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
vector<vector<int>> g;
vector<int> lp; /// longest Directed path starting at i
vector<bool> vis;
void dfs(int v) {
int &mx = lp[v];
vis[v] = 1;
for (auto u : g[v]) {
dfs(u);
mx = max(lp[u] + 1, mx);
}
}
void solve() {
int n, m, u, v;
cin >> n >> m;
g.resize(n + 1);
lp.resize(n + 1, 1);
vis.resize(n + 1, false);
fr(i, m) {
cin >> u >> v;
g[u].push_back(v);
}
rep(i, 1, n) {
if (!vis[i]) {
dfs(i);
}
}
cout << *max_element(lp.begin() + 1, lp.end()) - 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fr(i, n) for (int i = 0; i < n; i++)
#define rep(i, st, en) for (int i = st; i <= en; i++)
#define repn(i, st, en) for (int i = st; i >= en; i--)
#define sq(a) (a * a)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
vector<vector<int>> g;
vector<int> lp; /// longest Directed path starting at i
vector<bool> vis;
void dfs(int v) {
int &mx = lp[v];
vis[v] = 1;
for (auto u : g[v]) {
if (!vis[u])
dfs(u);
mx = max(lp[u] + 1, mx);
}
}
void solve() {
int n, m, u, v;
cin >> n >> m;
g.resize(n + 1);
lp.resize(n + 1, 1);
vis.resize(n + 1, false);
fr(i, m) {
cin >> u >> v;
g[u].push_back(v);
}
rep(i, 1, n) {
if (!vis[i]) {
dfs(i);
}
}
cout << *max_element(lp.begin() + 1, lp.end()) - 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 21 | 22 | 21 | 23 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
bool vist[1000001];
int dp[1000001];
void dfs(int s, vector<vector<int>> g) {
vist[s] = true;
for (auto v : g[s]) {
if (!vist[v])
dfs(v, g);
dp[s] = max(dp[s], 1 + dp[v]);
}
return;
}
int main() {
// your code goes here
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> g(n + 1);
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
g[x].push_back(y);
}
memset(vist, false, sizeof(vist));
for (int i = 1; i <= n; ++i) {
if (!vist[i])
dfs(i, g);
}
int ans = dp[1];
for (int i = 2; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool vist[1000001];
int dp[1000001];
void dfs(int s, vector<vector<int>> &g) {
vist[s] = true;
for (auto v : g[s]) {
if (!vist[v])
dfs(v, g);
dp[s] = max(dp[s], 1 + dp[v]);
}
return;
}
int main() {
// your code goes here
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> g(n + 1);
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
g[x].push_back(y);
}
memset(vist, false, sizeof(vist));
for (int i = 1; i <= n; ++i) {
if (!vist[i])
dfs(i, g);
}
int ans = dp[1];
for (int i = 2; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define maxn 5005
#define N 100000
#define inf (int)2e9
#define ll long long
#define ii pair<int, int>
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define REP(i, a, b) for (int i = a; i >= b; i--)
int n, m, run = 1;
vector<int> g[maxn];
int cl[maxn], f1[maxn];
void dfs(int u) {
cl[u] = run;
for (auto &v : g[u]) {
if (cl[v] != run)
dfs(v);
f1[u] = max(f1[u], f1[v] + 1);
}
}
int main() {
// freopen("main.inp", "r", stdin);
cin >> n >> m;
FOR(i, 1, m) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
FOR(i, 1, n)
if (cl[i] != run)
dfs(i);
int ans = 0;
FOR(i, 1, n) ans = max(ans, f1[i]);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define maxn 100005
#define N 100000
#define inf (int)2e9
#define ll long long
#define ii pair<int, int>
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define REP(i, a, b) for (int i = a; i >= b; i--)
int n, m, run = 1;
vector<int> g[maxn];
int cl[maxn], f1[maxn];
void dfs(int u) {
cl[u] = run;
for (auto &v : g[u]) {
if (cl[v] != run)
dfs(v);
f1[u] = max(f1[u], f1[v] + 1);
}
}
int main() {
// freopen("main.inp", "r", stdin);
cin >> n >> m;
FOR(i, 1, m) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
FOR(i, 1, n)
if (cl[i] != run)
dfs(i);
int ans = 0;
FOR(i, 1, n) ans = max(ans, f1[i]);
cout << ans;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<int> in_degree;
vector<int> vis;
vector<int> dist;
void dfs(vector<vector<int>> edge, int start) {
vis[start] = 1;
for (auto b : edge[start]) {
in_degree[b]--;
dist[b] = max(dist[b], dist[start] + 1);
if (in_degree[b] == 0)
dfs(edge, b);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> edge(n + 1);
in_degree.resize(n + 1, 0);
vis.resize(n + 1, 0);
dist.resize(n + 1, 0);
int aa, bb;
for (int i = 0; i < m; i++) {
cin >> aa >> bb;
edge[aa].push_back(bb);
in_degree[bb]++;
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0 && in_degree[i] == 0) {
dfs(edge, i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dist[i]);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> in_degree;
vector<int> vis;
vector<int> dist;
void dfs(vector<vector<int>> &edge, int start) {
vis[start] = 1;
for (auto b : edge[start]) {
in_degree[b]--;
dist[b] = max(dist[b], dist[start] + 1);
if (in_degree[b] == 0)
dfs(edge, b);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> edge(n + 1);
in_degree.resize(n + 1, 0);
vis.resize(n + 1, 0);
dist.resize(n + 1, 0);
int aa, bb;
for (int i = 0; i < m; i++) {
cin >> aa >> bb;
edge[aa].push_back(bb);
in_degree[bb]++;
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0 && in_degree[i] == 0) {
dfs(edge, i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dist[i]);
}
cout << ans;
return 0;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _Ty> static _Ty tp_abs(const _Ty &a) {
return ((a < 0) ? (a * -1) : a);
}
template <class _Ty> static _Ty tp_min(_Ty a, _Ty b) { return a < b ? a : b; }
template <class _Ty> static _Ty tp_max(_Ty a, _Ty b) { return a > b ? a : b; }
template <class T> static void get1int(T &a) {
const char *fmt = " %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template <class T> static void get2int(T &a, T &b) {
const char *fmt = " %d %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template <class T> static void get3int(T &a, T &b, T &c) {
const char *fmt = " %d %d %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static const int EduDp_INF = 1100000000;
static void G_task();
#if 1
int main() {
G_task();
fflush(stdout);
return 0;
}
#endif
static int dfs(std::vector<std::vector<int>> graph, int vert, int vCount,
int *dp) {
if (vert >= vCount) {
return 0;
}
if (dp[vert] >= 0) {
return dp[vert];
}
int len = 0;
int from = vert;
int pass = graph[from].size();
if (pass > 0) {
for (int i = 0; i < pass; i++) {
len = tp_max(dfs(graph, graph[from][i], vCount, dp), len);
}
len++;
}
dp[vert] = len;
return len;
}
static void G_task() {
const int GMAX = 100000;
int N, M;
get2int(N, M);
std::vector<std::vector<int>> edge(N);
for (int e = 0; e < M; e++) {
int from, to;
get2int(from, to);
edge[from - 1].push_back(to - 1);
}
auto dp = new int[N + 1];
memset(dp, -1, sizeof(dp[0]) * (N + 1));
int max = 0;
for (int n = 0; n < N; n++) {
max = tp_max(max, dfs(edge, n, N, dp));
}
printf("%d\n", max);
delete[] dp;
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#ifndef ULLONG
typedef unsigned long long ULLONG;
#endif
#ifndef LLONG
typedef long long LLONG;
#endif
template <class _Ty> static _Ty tp_abs(const _Ty &a) {
return ((a < 0) ? (a * -1) : a);
}
template <class _Ty> static _Ty tp_min(_Ty a, _Ty b) { return a < b ? a : b; }
template <class _Ty> static _Ty tp_max(_Ty a, _Ty b) { return a > b ? a : b; }
template <class T> static void get1int(T &a) {
const char *fmt = " %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld";
}
if (scanf(fmt, &a) < 0) {
printf("g1int Error\n");
}
}
template <class T> static void get2int(T &a, T &b) {
const char *fmt = " %d %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld %lld";
}
if (scanf(fmt, &a, &b) < 0) {
printf("g2int Error\n");
}
}
template <class T> static void get3int(T &a, T &b, T &c) {
const char *fmt = " %d %d %d";
if (sizeof(T) == sizeof(long long)) {
fmt = " %lld %lld %lld";
}
if (scanf(fmt, &a, &b, &c) < 0) {
printf("g3int Error\n");
}
}
static const int EduDp_INF = 1100000000;
static void G_task();
#if 1
int main() {
G_task();
fflush(stdout);
return 0;
}
#endif
static int dfs(std::vector<std::vector<int>> &graph, int vert, int vCount,
int *dp) {
if (vert >= vCount) {
return 0;
}
if (dp[vert] >= 0) {
return dp[vert];
}
int len = 0;
int from = vert;
int pass = graph[from].size();
if (pass > 0) {
for (int i = 0; i < pass; i++) {
len = tp_max(dfs(graph, graph[from][i], vCount, dp), len);
}
len++;
}
dp[vert] = len;
return len;
}
static void G_task() {
const int GMAX = 100000;
int N, M;
get2int(N, M);
std::vector<std::vector<int>> edge(N);
for (int e = 0; e < M; e++) {
int from, to;
get2int(from, to);
edge[from - 1].push_back(to - 1);
}
auto dp = new int[N + 1];
memset(dp, -1, sizeof(dp[0]) * (N + 1));
int max = 0;
for (int n = 0; n < N; n++) {
max = tp_max(max, dfs(edge, n, N, dp));
}
printf("%d\n", max);
delete[] dp;
}
|
replace
| 64 | 65 | 64 | 65 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////*kedar1514*////////////////////////////////////////////////(Template
///Start)*****
#define endl "\n"
#define ll long long
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, n) for (i = 1; i <= n; i++)
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sortAll(x) sort(all(x))
#define clearAll(arr) memset(arr, 0, sizeof(arr))
#define deb(sum) cout << "deb = " << sum << endl;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define kedar \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
ll powerMod(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
ll power(ll x, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x);
x = (x * x);
n >>= 1;
}
return res;
}
int gcd(int A, int B) {
if (B == 0)
return A;
else
return gcd(B, A % B);
}
////////////////////////////////////////////////*kedar1514*////////////////////////////////////////////////(Template
///ends)*****
// <<,
// , cout<<<<endl;
int dp[100005];
vi gp[100005];
int dfs(int a) {
int ret = 0;
if (dp[a] != -1)
return dp[a];
for (int i = 0; i < gp[a].size(); i++) {
ret = max(ret, dfs(gp[a][i]) + 1);
}
return dp[a] = ret;
}
void solve() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
--x;
--y;
gp[x].push_back(y);
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret = max(ret, dfs(i));
}
cout << ret;
}
int main() {
kedar;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// <<
// <<,
// ,
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} // <<
// <<,
// ,
|
#include <bits/stdc++.h>
using namespace std;
////////////////////////////////////////////////*kedar1514*////////////////////////////////////////////////(Template
///Start)*****
#define endl "\n"
#define ll long long
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, n) for (i = 1; i <= n; i++)
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sortAll(x) sort(all(x))
#define clearAll(arr) memset(arr, 0, sizeof(arr))
#define deb(sum) cout << "deb = " << sum << endl;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define kedar \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
ll powerMod(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
ll power(ll x, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x);
x = (x * x);
n >>= 1;
}
return res;
}
int gcd(int A, int B) {
if (B == 0)
return A;
else
return gcd(B, A % B);
}
////////////////////////////////////////////////*kedar1514*////////////////////////////////////////////////(Template
///ends)*****
// <<,
// , cout<<<<endl;
int dp[100005];
vi gp[100005];
int dfs(int a) {
int ret = 0;
if (dp[a] != -1)
return dp[a];
for (int i = 0; i < gp[a].size(); i++) {
ret = max(ret, dfs(gp[a][i]) + 1);
}
return dp[a] = ret;
}
void solve() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
--x;
--y;
gp[x].push_back(y);
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret = max(ret, dfs(i));
}
cout << ret;
}
int main() {
kedar;
// <<
// <<,
// ,
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} // <<
// <<,
// ,
|
delete
| 103 | 107 | 103 | 103 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long int;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e11;
const ll MOD = 1000000007;
typedef pair<ll, ll> P;
vector<vector<int>> to(10005);
int n, m;
int d[100005];
bool done[100005] = {0};
int len(int x) {
int res = 0;
if (done[x])
return d[x];
if (to[x].empty()) {
d[x] = 0;
done[x] = true;
return 0;
} else {
for (int i : to[x]) {
chmax(res, len(i) + 1);
}
}
d[x] = res;
done[x] = true;
return res;
}
int main() {
cin >> n >> m;
int x, y;
rep(i, m) {
cin >> x >> y;
to[x - 1].push_back(y - 1);
}
int ans = 0;
rep(i, n) { chmax(ans, len(i)); }
PRINT(ans);
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long int;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e11;
const ll MOD = 1000000007;
typedef pair<ll, ll> P;
vector<vector<int>> to(100005);
int n, m;
int d[100005];
bool done[100005] = {0};
int len(int x) {
int res = 0;
if (done[x])
return d[x];
if (to[x].empty()) {
d[x] = 0;
done[x] = true;
return 0;
} else {
for (int i : to[x]) {
chmax(res, len(i) + 1);
}
}
d[x] = res;
done[x] = true;
return res;
}
int main() {
cin >> n >> m;
int x, y;
rep(i, m) {
cin >> x >> y;
to[x - 1].push_back(y - 1);
}
int ans = 0;
rep(i, n) { chmax(ans, len(i)); }
PRINT(ans);
}
|
replace
| 28 | 29 | 28 | 29 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int nax =
1e5 + 5; // this should be const for the below values to be initialised
vector<int> edges[nax];
int indegree[nax];
int dist[nax];
bool vis[nax];
void dfs(int i) {
vis[i] = true;
for (int j : edges[i]) {
dist[j] = max(dist[j], dist[i] + 1);
dfs(j);
}
}
int main() {
int n, m, a, b;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a >> b;
edges[a].push_back(b);
indegree[b]++;
}
for (int i = 1; i <= n; i++) {
if (!vis[i] and indegree[i] == 0) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dist[i]);
}
cout << ans;
return 0;
}
// Errichto's code
|
#include <bits/stdc++.h>
using namespace std;
const int nax =
1e5 + 5; // this should be const for the below values to be initialised
vector<int> edges[nax];
int indegree[nax];
int dist[nax];
bool vis[nax];
void dfs(int i) {
vis[i] = true;
for (int j : edges[i]) {
dist[j] = max(dist[j], dist[i] + 1);
indegree[j]--; // responsible for dp else tle
if (indegree[j] == 0)
dfs(j);
}
}
int main() {
int n, m, a, b;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a >> b;
edges[a].push_back(b);
indegree[b]++;
}
for (int i = 1; i <= n; i++) {
if (!vis[i] and indegree[i] == 0) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dist[i]);
}
cout << ans;
return 0;
}
// Errichto's code
|
replace
| 13 | 14 | 13 | 16 |
TLE
| |
p03166
|
C++
|
Memory Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
const int maxn = 10e7;
vector<bool> visited(maxn, false);
vector<vector<int>> edges(maxn);
vector<long long int> dp(maxn);
void dfs(int u) {
visited[u] = 1;
for (int v : edges[u]) {
if (!visited[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++)
edges[0].push_back(i);
dfs(0);
cout << dp[0] - 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
const int maxn = 1 + 10e5;
vector<bool> visited(maxn, false);
vector<vector<int>> edges(maxn);
vector<long long int> dp(maxn);
void dfs(int u) {
visited[u] = 1;
for (int v : edges[u]) {
if (!visited[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++)
edges[0].push_back(i);
dfs(0);
cout << dp[0] - 1 << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
MLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto &x : obj)
o << " {" << x.first << " : " << x.second << "}"
<< ",";
o << " }";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "{";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "{" << obj.first << ", " << obj.second << "}";
return o;
}
template <template <class tmp> class T, class U>
ostream &operator<<(ostream &o, const T<U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
void print(void) { cout << endl; }
template <class Head> void print(Head &&head) {
cout << head;
print();
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head << " ";
print(forward<Tail>(tail)...);
}
void YN(bool flg) { cout << ((flg) ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << ((flg) ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << ((flg) ? "yes" : "no") << endl; }
int main() {
int n, m;
cin >> n >> m;
V<ll> d(n), dp(n, 0);
V<V<ll>> e(n);
REP(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
e[a].push_back(b);
d[b]++;
}
queue<int> q;
REP(i, n) if (d[i] == 0) q.push(i);
while (q.size()) {
int p = q.front();
q.pop();
for (auto j : e[p]) {
dp[j] = max(dp[p] + 1, dp[j]);
q.push(j);
}
}
cout << *max_element(ALL(dp)) << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
const ll MOD = (ll)1e9 + 7;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto &x : obj)
o << " {" << x.first << " : " << x.second << "}"
<< ",";
o << " }";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "{";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "{" << obj.first << ", " << obj.second << "}";
return o;
}
template <template <class tmp> class T, class U>
ostream &operator<<(ostream &o, const T<U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
void print(void) { cout << endl; }
template <class Head> void print(Head &&head) {
cout << head;
print();
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head << " ";
print(forward<Tail>(tail)...);
}
void YN(bool flg) { cout << ((flg) ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << ((flg) ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << ((flg) ? "yes" : "no") << endl; }
int main() {
int n, m;
cin >> n >> m;
V<ll> d(n), dp(n, 0);
V<V<ll>> e(n);
REP(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
e[a].push_back(b);
d[b]++;
}
queue<int> q;
REP(i, n) if (d[i] == 0) q.push(i);
while (q.size()) {
int p = q.front();
q.pop();
for (auto j : e[p]) {
dp[j] = max(dp[p] + 1, dp[j]);
d[j]--;
if (d[j] == 0)
q.push(j);
}
}
cout << *max_element(ALL(dp)) << endl;
return 0;
}
|
replace
| 107 | 108 | 107 | 110 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG 0
#define nl '\n'
#if DEBUG
#define trace(var) \
{ cerr << "Line " << __LINE__ << ": " << #var << "=" << var << nl; }
#else
#define trace(var) \
{}
#endif
#define fori(n) for (int i = 0; i < n; ++i)
#define forj(n) for (int j = 0; j < n; ++j)
#define fork(n) for (int k = 0; k < n; ++k)
#define forl(n) for (int l = 0; l < n; ++l)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<bool> vbool;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef long double ld;
typedef vector<vector<int>> vvi;
const ll N = 10010;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
int n, m;
void dfs(vvi &adj, vint &dist, vbool &seen, int u) {
seen[u] = true;
for (auto v : adj[u]) {
dfs(adj, dist, seen, v);
dist[u] = max(dist[u], 1 + dist[v]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int x, y;
vvi adj(n + 1);
fori(m) {
cin >> x >> y;
adj[x].push_back(y);
}
vbool seen(n + 1, false);
vint dist(n + 1, 0);
fori(n) if (!seen[i + 1]) dfs(adj, dist, seen, i + 1);
int ans = 0;
fori(n) ans = max(ans, dist[i + 1]);
cout << ans << nl;
#if DEBUG
cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << " s" << nl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG 0
#define nl '\n'
#if DEBUG
#define trace(var) \
{ cerr << "Line " << __LINE__ << ": " << #var << "=" << var << nl; }
#else
#define trace(var) \
{}
#endif
#define fori(n) for (int i = 0; i < n; ++i)
#define forj(n) for (int j = 0; j < n; ++j)
#define fork(n) for (int k = 0; k < n; ++k)
#define forl(n) for (int l = 0; l < n; ++l)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<bool> vbool;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef long double ld;
typedef vector<vector<int>> vvi;
const ll N = 10010;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
int n, m;
void dfs(vvi &adj, vint &dist, vbool &seen, int u) {
seen[u] = true;
for (auto v : adj[u]) {
if (!seen[v])
dfs(adj, dist, seen, v);
dist[u] = max(dist[u], 1 + dist[v]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int x, y;
vvi adj(n + 1);
fori(m) {
cin >> x >> y;
adj[x].push_back(y);
}
vbool seen(n + 1, false);
vint dist(n + 1, 0);
fori(n) if (!seen[i + 1]) dfs(adj, dist, seen, i + 1);
int ans = 0;
fori(n) ans = max(ans, dist[i + 1]);
cout << ans << nl;
#if DEBUG
cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << " s" << nl;
#endif
return 0;
}
|
replace
| 33 | 34 | 33 | 35 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
void pre() {}
long long int n, m, a, b;
vector<long long int> fov[100001];
long long int dp[100001]{0};
bool flag[100001]{0};
long long int dfs(long long int i) {
if (flag[i]) {
return dp[i];
}
if (fov[i].size() == 0) {
dp[i] = -1;
return dp[i];
}
dp[i] = 0;
for (auto j : fov[i]) {
dp[i] = max(dp[i], dfs(j) + 1);
}
return dp[i];
}
void solve() {
cin >> n >> m;
for (long long int i = 0; i < m; i++) {
cin >> a >> b;
fov[a].push_back(b);
}
for (long long int i = 1; i <= n; i++) {
fov[0].push_back(i);
}
cout << dfs(0) << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
pre();
long long int num = 1;
// cin>>num;
for (long long int i = 0; i < num; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
void pre() {}
long long int n, m, a, b;
vector<long long int> fov[100001];
long long int dp[100001]{0};
bool flag[100001]{0};
long long int dfs(long long int i) {
if (flag[i]) {
return dp[i];
}
if (fov[i].size() == 0) {
dp[i] = -1;
return dp[i];
}
flag[i] = 1;
dp[i] = 0;
for (auto j : fov[i]) {
dp[i] = max(dp[i], dfs(j) + 1);
}
return dp[i];
}
void solve() {
cin >> n >> m;
for (long long int i = 0; i < m; i++) {
cin >> a >> b;
fov[a].push_back(b);
}
for (long long int i = 1; i <= n; i++) {
fov[0].push_back(i);
}
cout << dfs(0) << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
pre();
long long int num = 1;
// cin>>num;
for (long long int i = 0; i < num; i++) {
solve();
}
}
|
insert
| 15 | 15 | 15 | 16 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<vector<ll>> to;
vector<ll> dp; // 初期値はマイナス1に設定
ll rec(ll i) {
if (dp[i] != -1) {
return dp[i];
}
ll res = 0; // まだrec(i)がもとまっていなかったら、今から求める
for (auto a : to[i]) {
res = max(res, rec(a) + 1);
}
return dp[i] = rec(i);
}
int main() {
cin >> N >> M;
to = vector<vector<ll>>(N);
dp = vector<ll>(N, (ll)-1);
for (ll i = 0; i < M; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
to[x].push_back(y);
} // 隣接リスト作成
ll res = 0;
for (ll i = 0; i < N; i++) {
res = max(res, rec(i));
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<vector<ll>> to;
vector<ll> dp; // 初期値はマイナス1に設定
ll rec(ll i) {
if (dp[i] != -1) {
return dp[i];
}
ll res = 0; // まだrec(i)がもとまっていなかったら、今から求める
for (auto a : to[i]) {
res = max(res, rec(a) + 1);
}
return dp[i] = res;
}
int main() {
cin >> N >> M;
to = vector<vector<ll>>(N);
dp = vector<ll>(N, (ll)-1);
for (ll i = 0; i < M; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
to[x].push_back(y);
} // 隣接リスト作成
ll res = 0;
for (ll i = 0; i < N; i++) {
res = max(res, rec(i));
}
cout << res << endl;
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
-11
| |
p03166
|
C++
|
Runtime Error
|
// srinivas
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
#define all(c) (c).begin(), (c).end()
#define endl "\n"
#define ff first
#define ss second
#define allr(c) (c).rbegin(), (c).rend()
#define fr(x, in, n, r) for (ll x = in; x < n; x += r)
#define ifr(x, n) for (ll x = 0; x < n; x++)
#define dfr(x, n) for (ll x = n - 1; x >= 0; x--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define pof(a) pop_front(a)
#define pob(a) pop_back(a)
#define eb(a) emplace_back(a)
#define ef(a) emplace_front(a)
#define fstm(m, n, r) \
m.reserve(n); \
m.max_load_factor(r)
#define os \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef map<ll, ll> mll;
typedef map<string, ll> msll;
typedef unordered_map<ll, ll> umap;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mod 1000000007
#define N 100001
vll v[N];
bool vis[N];
ll dp[N];
void dfs(ll u) {
vis[u] = 1;
ifr(i, v[u].size()) {
if (!vis[v[u][i]])
dfs(v[u][i]);
dp[u] = max(dp[u], 1 + dp[v[u][i]]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("/home/srinivas/Desktop/cp/input.txt", "r", stdin);
// freopen("/home/srinivas/Desktop/output.txt","w",stdout);
#endif
ll n, m, x, y;
cin >> n >> m;
ifr(i, m) {
cin >> x >> y;
v[x].pb(y);
}
ifr(i, n) {
if (!vis[i + 1])
dfs(i + 1);
}
ll ans = -1;
ifr(i, n) ans = max(ans, dp[i + 1]);
cout << ans << endl;
return 0;
}
|
// srinivas
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
#define all(c) (c).begin(), (c).end()
#define endl "\n"
#define ff first
#define ss second
#define allr(c) (c).rbegin(), (c).rend()
#define fr(x, in, n, r) for (ll x = in; x < n; x += r)
#define ifr(x, n) for (ll x = 0; x < n; x++)
#define dfr(x, n) for (ll x = n - 1; x >= 0; x--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define pof(a) pop_front(a)
#define pob(a) pop_back(a)
#define eb(a) emplace_back(a)
#define ef(a) emplace_front(a)
#define fstm(m, n, r) \
m.reserve(n); \
m.max_load_factor(r)
#define os \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef map<ll, ll> mll;
typedef map<string, ll> msll;
typedef unordered_map<ll, ll> umap;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
#define mod 1000000007
#define N 100001
vll v[N];
bool vis[N];
ll dp[N];
void dfs(ll u) {
vis[u] = 1;
ifr(i, v[u].size()) {
if (!vis[v[u][i]])
dfs(v[u][i]);
dp[u] = max(dp[u], 1 + dp[v[u][i]]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m, x, y;
cin >> n >> m;
ifr(i, m) {
cin >> x >> y;
v[x].pb(y);
}
ifr(i, n) {
if (!vis[i + 1])
dfs(i + 1);
}
ll ans = -1;
ifr(i, n) ans = max(ans, dp[i + 1]);
cout << ans << endl;
return 0;
}
|
delete
| 55 | 59 | 55 | 55 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int dp[1000];
void dfs(vector<int> adj[], int vis[], int node) {
if (vis[node])
return;
vis[node] = 1;
for (int i = 0; i < adj[node].size(); i++) {
int x = adj[node][i];
if (!vis[x])
dfs(adj, vis, x);
dp[node] = max(dp[node], dp[x] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
memset(dp, 0, sizeof(dp));
int vis[n + 1];
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(adj, vis, i);
}
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(dp[i], mx);
cout << mx << endl;
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int dp[1000000];
void dfs(vector<int> adj[], int vis[], int node) {
if (vis[node])
return;
vis[node] = 1;
for (int i = 0; i < adj[node].size(); i++) {
int x = adj[node][i];
if (!vis[x])
dfs(adj, vis, x);
dp[node] = max(dp[node], dp[x] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
memset(dp, 0, sizeof(dp));
int vis[n + 1];
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(adj, vis, i);
}
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(dp[i], mx);
cout << mx << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#define ll long long int
#include <bits/stdc++.h>
// #include <fstream>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define pii pair<ll, ll>
#define qi queue<ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define print(a) cout << a << '\n'
#define sorted(arr) sort(arr.begin(), arr.end())
#define gcd(a, b) gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define all(v) v.begin(), v.end()
#define read(a) scanf("%d", &a)
#define f(a, n) for (ll i = a; i < n; i++)
#define in2(n, m, arr) \
for (ll i = 0; i < n; i++) { \
for (ll j = 0; j < m; j++) \
cin >> arr[i][j]; \
}
#define debug(a) cerr << a << " ";
#define debug1(a) cerr << a << '\n'
/*typedef tree<int, null_type, less<int>, rb_tree_tag ,
* tree_order_statistics_node_update> Set;*/
const unsigned ll mod = 1e9 + 7;
const ll inf = (ll)1e18 + 2;
const ll N = (ll)1e6 + 2;
//
// template<typename... T>
// void write(T&... args)
//{
// ((cout << args << ' '), ...);
//}
// ll power ( ll x , ll y)
//{
// ll res = 1;
// while (y > 0)
// {
// if (y & 1)
// res = (res * x) ;
// y = y >> 1;
// x = (x * x) ;
// }
// return res ;
//}
//
// struct node{
// ll x , y , z;
//};
// map<pair<ll, ll>,ll> c;
// vector<set<ll>> tree;
// vector<ll> ar ;
// set<ll> s;
// ll get(ll x)
//{
// if(x == ar[x])
// return x;
// return ar[x] = get(ar[x]);
//}
// void merge(ll a ,ll b)
//{
// a = get(a);
// b = get(b);
// if(a == b)
// {
// return ;
// }
// ar[b] = ar[a];
// }
//
// ll sev[100006];
// vector<ll> pri;
// void seive()
//{
// for(ll i = 2 ; i < 100006 ; i ++)
// {
// if(!sev[i])
// {
// for(ll j = i ; j < 100006 ; j += i)
// {
// if(!sev[j])
// sev[j] = i;
// }
// }
// if(sev[i] == i)
// pri.pb(i);
// }
//}
vector<vector<ll>> graph;
ll visi[N], mx = 0;
ll nodes[N];
map<pii, ll> vis;
void bfs(ll idx) {
visi[idx] = 1;
for (auto x : graph[idx]) {
nodes[x] = max(nodes[x], nodes[idx] + 1);
bfs(x);
}
return;
}
void solve() {
ll n, m, a, b;
cin >> n >> m;
graph.resize(n);
for (ll i = 0; i < m; i++) {
cin >> a >> b;
a--, b--;
graph[a].pb(b);
}
for (ll i = 0; i < n; i++) {
if (!visi[i])
bfs(i);
}
for (ll i = 0; i < n; i++)
mx = max(mx, nodes[i]);
print(mx);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t;
t = 1;
// cin >> t;
// seive();
while (t--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#define ll long long int
#include <bits/stdc++.h>
// #include <fstream>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define pii pair<ll, ll>
#define qi queue<ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define print(a) cout << a << '\n'
#define sorted(arr) sort(arr.begin(), arr.end())
#define gcd(a, b) gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define all(v) v.begin(), v.end()
#define read(a) scanf("%d", &a)
#define f(a, n) for (ll i = a; i < n; i++)
#define in2(n, m, arr) \
for (ll i = 0; i < n; i++) { \
for (ll j = 0; j < m; j++) \
cin >> arr[i][j]; \
}
#define debug(a) cerr << a << " ";
#define debug1(a) cerr << a << '\n'
/*typedef tree<int, null_type, less<int>, rb_tree_tag ,
* tree_order_statistics_node_update> Set;*/
const unsigned ll mod = 1e9 + 7;
const ll inf = (ll)1e18 + 2;
const ll N = (ll)1e6 + 2;
//
// template<typename... T>
// void write(T&... args)
//{
// ((cout << args << ' '), ...);
//}
// ll power ( ll x , ll y)
//{
// ll res = 1;
// while (y > 0)
// {
// if (y & 1)
// res = (res * x) ;
// y = y >> 1;
// x = (x * x) ;
// }
// return res ;
//}
//
// struct node{
// ll x , y , z;
//};
// map<pair<ll, ll>,ll> c;
// vector<set<ll>> tree;
// vector<ll> ar ;
// set<ll> s;
// ll get(ll x)
//{
// if(x == ar[x])
// return x;
// return ar[x] = get(ar[x]);
//}
// void merge(ll a ,ll b)
//{
// a = get(a);
// b = get(b);
// if(a == b)
// {
// return ;
// }
// ar[b] = ar[a];
// }
//
// ll sev[100006];
// vector<ll> pri;
// void seive()
//{
// for(ll i = 2 ; i < 100006 ; i ++)
// {
// if(!sev[i])
// {
// for(ll j = i ; j < 100006 ; j += i)
// {
// if(!sev[j])
// sev[j] = i;
// }
// }
// if(sev[i] == i)
// pri.pb(i);
// }
//}
vector<vector<ll>> graph;
ll visi[N], mx = 0;
ll nodes[N];
map<pii, ll> vis;
void bfs(ll idx) {
visi[idx] = 1;
for (auto x : graph[idx]) {
if (!visi[x])
bfs(x);
nodes[idx] = max(nodes[idx], nodes[x] + 1);
}
return;
}
void solve() {
ll n, m, a, b;
cin >> n >> m;
graph.resize(n);
for (ll i = 0; i < m; i++) {
cin >> a >> b;
a--, b--;
graph[a].pb(b);
}
for (ll i = 0; i < n; i++) {
if (!visi[i])
bfs(i);
}
for (ll i = 0; i < n; i++)
mx = max(mx, nodes[i]);
print(mx);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t;
t = 1;
// cin >> t;
// seive();
while (t--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
replace
| 103 | 105 | 103 | 106 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
loop(test, 1, t + 1)
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define F first
#define S second
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define MOD 1000000007
#define all(x) x.begin(), x.end()
template <class C> void min_self(C &a, C b) { a = min(a, b); }
template <class C> void max_self(C &a, C b) { a = max(a, b); }
void mod(ll &n, ll m = MOD) { n %= m, n += m, n %= m; }
const int MAXN = 1e5 + 5;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<int> gr[MAXN];
bool vis[MAXN];
int dp[MAXN];
void dfs(int node, int par) {
vis[node] = 1;
int ans = 0;
for (auto next : gr[node]) {
dfs(next, node);
ans = max(ans, dp[next]);
}
dp[node] = ans + 1;
}
int main() {
fastio();
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
gr[u].pb(v);
}
int mx = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, -1);
mx = max(mx, dp[i]);
}
}
cout << mx - 1, nl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define test() \
int t; \
cin >> t; \
loop(test, 1, t + 1)
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define nl cout << "\n"
#define sp cout << " "
#define F first
#define S second
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<pii>
#define vll vector<pll>
#define MOD 1000000007
#define all(x) x.begin(), x.end()
template <class C> void min_self(C &a, C b) { a = min(a, b); }
template <class C> void max_self(C &a, C b) { a = max(a, b); }
void mod(ll &n, ll m = MOD) { n %= m, n += m, n %= m; }
const int MAXN = 1e5 + 5;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<int> gr[MAXN];
bool vis[MAXN];
int dp[MAXN];
void dfs(int node, int par) {
vis[node] = 1;
int ans = 0;
for (auto next : gr[node]) {
if (!vis[next])
dfs(next, node);
ans = max(ans, dp[next]);
}
dp[node] = ans + 1;
}
int main() {
fastio();
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
gr[u].pb(v);
}
int mx = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, -1);
mx = max(mx, dp[i]);
}
}
cout << mx - 1, nl;
return 0;
}
|
replace
| 47 | 48 | 47 | 49 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> to(100000);
vector<int> done;
vector<int> memo;
int dp(int i) {
if (done.at(i)) {
return memo.at(i);
} else {
int res = 0;
for (int b : to.at(i)) {
res = max(res, dp(b) + 1);
}
return res;
}
}
/*i=0 3
1 2
2 0
3 1
4 4
0(3 2)
1(2 3)
2(0)
3(2)
4(2 1 0)*/
int main() {
// 入力は同じでいい
int N, M;
cin >> N >> M;
done.resize(N);
memo.resize(N); // これはdp(i)の値をmemo.at(i)に入れる。
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
--a;
--b;
// 0番目からのスタートにしたいから。
to.at(a).push_back(b);
// これで木の入力は済んだはず
}
priority_queue<int> q;
for (int i = 0; i < N; i++) {
// cout <<dp(i)<<endl;//dpを出力させる
q.push(dp(i)); // ここでdp(i)はi番目出発の最長経路を表す数値 or
// 戻り値でそれを返す関数。
}
cout << q.top() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> to(100000);
vector<int> done;
vector<int> memo;
int dp(int i) {
if (done.at(i)) {
return memo.at(i);
} else {
int res = 0;
for (int b : to.at(i)) {
res = max(res, dp(b) + 1);
}
// 当たり前やんか、一回触ったらそれをdoneに書き込まないと
done.at(i) = 1;
memo.at(i) = res;
return res;
}
}
/*i=0 3
1 2
2 0
3 1
4 4
0(3 2)
1(2 3)
2(0)
3(2)
4(2 1 0)*/
int main() {
// 入力は同じでいい
int N, M;
cin >> N >> M;
done.resize(N);
memo.resize(N); // これはdp(i)の値をmemo.at(i)に入れる。
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
--a;
--b;
// 0番目からのスタートにしたいから。
to.at(a).push_back(b);
// これで木の入力は済んだはず
}
priority_queue<int> q;
for (int i = 0; i < N; i++) {
// cout <<dp(i)<<endl;//dpを出力させる
q.push(dp(i)); // ここでdp(i)はi番目出発の最長経路を表す数値 or
// 戻り値でそれを返す関数。
}
cout << q.top() << endl;
}
|
insert
| 13 | 13 | 13 | 16 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
unordered_map<int, list<int>> l;
int dp[10001];
int lp(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = 1;
int ans = INT_MIN;
for (auto it : l[src]) {
leaf = 0;
ans = max(ans, lp(it));
}
if (leaf == true)
return dp[src] = 0;
return dp[src] = ans + 1;
}
int main() {
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, lp(i));
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
unordered_map<int, list<int>> l;
int dp[100001];
int lp(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = 1;
int ans = INT_MIN;
for (auto it : l[src]) {
leaf = 0;
ans = max(ans, lp(it));
}
if (leaf == true)
return dp[src] = 0;
return dp[src] = ans + 1;
}
int main() {
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
l[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, lp(i));
cout << ans;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define lli long long int
#define vvi vector<vector<int>>
#define loop(n) for (int i = 0; i < n; i++)
using namespace std;
auto SpeedUp = []() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
lli dfs(int src, vvi &graph, vector<lli> &dp) {
if (dp[src] != 0)
return dp[src];
lli myans = 0;
for (int e : graph[src])
myans = max(myans, dfs(e, graph, dp) + 1);
dp[src] = myans;
}
lli solve() {
int n, m, a, b;
cin >> n >> m;
vvi graph(n + 1); // crating graph
while (m--) {
cin >> a >> b;
graph[a].push_back(b);
}
vector<lli> dp(n + 1, 0);
lli ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i, graph, dp));
}
return ans;
}
int main() {
cout << solve() << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define lli long long int
#define vvi vector<vector<int>>
#define loop(n) for (int i = 0; i < n; i++)
using namespace std;
auto SpeedUp = []() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
return 0;
}();
lli dfs(int src, vvi &graph, vector<lli> &dp) {
if (dp[src] != 0)
return dp[src];
lli myans = 0;
for (int e : graph[src])
myans = max(myans, dfs(e, graph, dp) + 1);
return dp[src] = myans;
}
lli solve() {
int n, m, a, b;
cin >> n >> m;
vvi graph(n + 1); // crating graph
while (m--) {
cin >> a >> b;
graph[a].push_back(b);
}
vector<lli> dp(n + 1, 0);
lli ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i, graph, dp));
}
return ans;
}
int main() {
cout << solve() << '\n';
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using i64 = long long;
bool used[101010];
int dp[101010];
std::deque<int> g[101010];
int dfs(int v) {
if (used[v])
return dp[v];
int ret = 0;
for (auto c : g[v]) {
ret = std::max(ret, dfs(c) + 1);
}
return dp[v] = ret;
}
int main() {
int n, m;
std::cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
std::cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ret = 0;
for (int v = 0; v < n; v++)
ret = std::max(ret, dfs(v));
std::cout << ret << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using i64 = long long;
bool used[101010];
int dp[101010];
std::deque<int> g[101010];
int dfs(int v) {
if (used[v])
return dp[v];
used[v] = true;
int ret = 0;
for (auto c : g[v]) {
ret = std::max(ret, dfs(c) + 1);
}
return dp[v] = ret;
}
int main() {
int n, m;
std::cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
std::cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ret = 0;
for (int v = 0; v < n; v++)
ret = std::max(ret, dfs(v));
std::cout << ret << std::endl;
return 0;
}
|
insert
| 10 | 10 | 10 | 12 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
const int M = 1e9 + 7;
using namespace std;
int N = 1000000 + 1;
void dfs(vector<int> *g, int st, bool *visited, vector<int> *ts) {
visited[st] = true;
for (int i = 0; i < g[st].size(); i++) {
if (visited[g[st][i]] == false) {
dfs(g, g[st][i], visited, ts);
}
}
ts->pb(st);
}
int logestPath(vector<int> *g, vector<int> *ts, int n, int m) {
int *dp = new int[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
int tss = ts->size();
dp[ts->at(tss - 1)] = 0;
// for(int i=0;i<tss;i++)
// {
// cout<<ts->at(i)<<" ";
// }
// cout<<endl;
for (int i = tss - 1; i >= 0; i--) {
int curVertex = ts->at(i);
// cout<<curVertex<<" ";
for (int j = 0; j < g[curVertex].size(); j++) {
dp[curVertex] = max(dp[curVertex], 1 + dp[g[curVertex][j]]);
}
// cout<<curVertex<<" "<<dp[curVertex]<<" ";
}
// cout<<endl;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[ts->at(i)]);
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> *g = new vector<int>[n + 1];
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
bool *visited = new bool[n + 1]();
// memset(visited,0,n+1);
vector<int> *ts = new vector<int>();
int ans = 0;
// cout<<"BREAKING POINT-1"<<endl;
for (int i = 1; i <= n; i++) {
if (visited[i] == false) {
// ts=new vector<int>();
dfs(g, i, visited, ts);
}
}
reverse(ts->begin(), ts->end());
ans = max(ans, logestPath(g, ts, n, m));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
const int M = 1e9 + 7;
using namespace std;
int N = 1000000 + 1;
void dfs(vector<int> *g, int st, bool *visited, vector<int> *ts) {
visited[st] = true;
for (int i = 0; i < g[st].size(); i++) {
if (visited[g[st][i]] == false) {
dfs(g, g[st][i], visited, ts);
}
}
ts->pb(st);
}
int logestPath(vector<int> *g, vector<int> *ts, int n, int m) {
int *dp = new int[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
int tss = ts->size();
dp[ts->at(tss - 1)] = 0;
// for(int i=0;i<tss;i++)
// {
// cout<<ts->at(i)<<" ";
// }
// cout<<endl;
for (int i = tss - 1; i >= 0; i--) {
int curVertex = ts->at(i);
// cout<<curVertex<<" ";
for (int j = 0; j < g[curVertex].size(); j++) {
dp[curVertex] = max(dp[curVertex], 1 + dp[g[curVertex][j]]);
}
// cout<<curVertex<<" "<<dp[curVertex]<<" ";
}
// cout<<endl;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> *g = new vector<int>[n + 1];
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
bool *visited = new bool[n + 1]();
// memset(visited,0,n+1);
vector<int> *ts = new vector<int>();
int ans = 0;
// cout<<"BREAKING POINT-1"<<endl;
for (int i = 1; i <= n; i++) {
if (visited[i] == false) {
// ts=new vector<int>();
dfs(g, i, visited, ts);
}
}
reverse(ts->begin(), ts->end());
ans = max(ans, logestPath(g, ts, n, m));
cout << ans << endl;
return 0;
}
|
replace
| 38 | 39 | 38 | 39 |
-6
|
terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03166
|
C++
|
Time Limit Exceeded
|
/*
quid-pro-quo: LOGIC for AC
written by: codercell07
LANG: C++ 11
Problem: random
*/
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL)
#define testcases \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sz(x) (int)x.size()
#define pq priority_queue /*maxim at top(max-heap)*/
#define pqmax \
priority_queue<int, vector<int>, greater<int>> /*minim at top(min-heap)*/
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define asc(x) sort(all(x))
#define desc(x) sort(all(x), greater<int>())
#define time_el (double)time / CLOCKS_PER_SEC
using namespace std;
const int MAX = 2e6; // dummy, make sure change as per constraints
const ll M = 1e9 + 7, inf = 1e18;
const char nl = '\n';
ll apbmc(ll a, ll b, ll c) {
a %= c;
ll res = 1;
while (b) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
ll apb(ll x, ll y) {
ll temp;
if (y == 0)
return 1;
temp = apb(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return temp * temp * x;
}
void dfs(vi &dist, int i, vvi &adj) {
dist[i] = 0;
for (int u : adj[i]) {
dfs(dist, u, adj);
dist[i] = max(dist[i], dist[u] + 1);
}
}
void solve() {
// clock_t time;
int n, m;
cin >> n >> m;
vvi adj(n, vi());
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
adj[x].pb(y);
}
vi dist(n, -1);
for (int i = 0; i < n; i++) {
dfs(dist, i, adj);
}
cout << *max_element(all(dist));
}
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// testcases;
// #endif // !DEBUG
cout << fixed << setprecision(10);
// int t; cin>>t; while(t--) solve();
solve();
return 0;
}
// points to check:
// * check for constraints, mainly array!
// * EDGE CASES
// * check for integer overflow, use long long!
// * learn, do, solve, share something, NOW!
|
/*
quid-pro-quo: LOGIC for AC
written by: codercell07
LANG: C++ 11
Problem: random
*/
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL)
#define testcases \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sz(x) (int)x.size()
#define pq priority_queue /*maxim at top(max-heap)*/
#define pqmax \
priority_queue<int, vector<int>, greater<int>> /*minim at top(min-heap)*/
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define asc(x) sort(all(x))
#define desc(x) sort(all(x), greater<int>())
#define time_el (double)time / CLOCKS_PER_SEC
using namespace std;
const int MAX = 2e6; // dummy, make sure change as per constraints
const ll M = 1e9 + 7, inf = 1e18;
const char nl = '\n';
ll apbmc(ll a, ll b, ll c) {
a %= c;
ll res = 1;
while (b) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
ll apb(ll x, ll y) {
ll temp;
if (y == 0)
return 1;
temp = apb(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else
return temp * temp * x;
}
void dfs(vi &dist, int i, vvi &adj) {
if (dist[i] != -1)
return;
dist[i] = 0;
for (int u : adj[i]) {
dfs(dist, u, adj);
dist[i] = max(dist[i], dist[u] + 1);
}
}
void solve() {
// clock_t time;
int n, m;
cin >> n >> m;
vvi adj(n, vi());
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
adj[x].pb(y);
}
vi dist(n, -1);
for (int i = 0; i < n; i++) {
dfs(dist, i, adj);
}
cout << *max_element(all(dist));
}
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// testcases;
// #endif // !DEBUG
cout << fixed << setprecision(10);
// int t; cin>>t; while(t--) solve();
solve();
return 0;
}
// points to check:
// * check for constraints, mainly array!
// * EDGE CASES
// * check for integer overflow, use long long!
// * learn, do, solve, share something, NOW!
|
insert
| 61 | 61 | 61 | 63 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 101010;
typedef struct def {
int a, b, c;
def() {}
def(int a2, int b2, int c2) {
a = a2;
b = b2;
c = c2;
}
bool operator<(def comp) const {
if (a != comp.a)
return a < comp.a;
else
return b < comp.b;
}
} generico;
typedef pair<int, int> pii;
typedef long long int ll;
#define INF 0x3f3f3f3f
#define pb push_back
#define mp make_pair
int v, e;
int memo[MAXN];
vector<int> g[MAXN];
int dfs(int x) {
if (memo[x] != -1)
return memo[x];
int ans = 0;
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
ans = max(ans, dfs(y) + 1);
}
return ans;
}
int main() {
memset(memo, -1, sizeof memo);
scanf("%d %d", &v, &e);
int a, b;
for (int i = 0; i < e; i++) {
scanf("%d %d", &a, &b);
g[a].pb(b);
}
int ans = 0;
for (int i = 1; i <= v; i++)
ans = max(ans, dfs(i));
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 101010;
typedef struct def {
int a, b, c;
def() {}
def(int a2, int b2, int c2) {
a = a2;
b = b2;
c = c2;
}
bool operator<(def comp) const {
if (a != comp.a)
return a < comp.a;
else
return b < comp.b;
}
} generico;
typedef pair<int, int> pii;
typedef long long int ll;
#define INF 0x3f3f3f3f
#define pb push_back
#define mp make_pair
int v, e;
int memo[MAXN];
vector<int> g[MAXN];
int dfs(int x) {
if (memo[x] != -1)
return memo[x];
int ans = 0;
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
ans = max(ans, dfs(y) + 1);
}
return memo[x] = ans;
}
int main() {
memset(memo, -1, sizeof memo);
scanf("%d %d", &v, &e);
int a, b;
for (int i = 0; i < e; i++) {
scanf("%d %d", &a, &b);
g[a].pb(b);
}
int ans = 0;
for (int i = 1; i <= v; i++)
ans = max(ans, dfs(i));
printf("%d\n", ans);
return 0;
}
|
replace
| 45 | 46 | 45 | 46 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
// #########################################
vector<int> g[11000];
int memo[11000];
int dp(int now) {
if (g[now].size() == 0)
return 0;
if (memo[now])
return memo[now];
int ret = 0;
for (auto next : g[now]) {
ret = max(ret, dp(next));
}
return memo[now] = ret + 1;
}
signed main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
int ret = 0;
rep(i, n) ret = max(ret, dp(i));
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
// #########################################
vector<int> g[110000];
int memo[110000];
int dp(int now) {
if (g[now].size() == 0)
return 0;
if (memo[now])
return memo[now];
int ret = 0;
for (auto next : g[now]) {
ret = max(ret, dp(next));
}
return memo[now] = ret + 1;
}
signed main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
int ret = 0;
rep(i, n) ret = max(ret, dp(i));
cout << ret << endl;
return 0;
}
|
replace
| 74 | 76 | 74 | 76 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define make_it_fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define endl "\n"
#define ff first
#define ss second
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...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...) 20
#endif
ll power(ll a, ll b, ll m = 1e9 + 7) {
a %= m;
if (b == 1)
return a;
if (b == 0)
return 1;
ll ret = power(a, b / 2);
ret = (ret % m * ret % m) % m;
if (b & 1)
ret = (ret % m * a % m) % m;
return ret;
}
ll lcm(ll a, ll b) { return (a * b) / (__gcd(a, b)); }
const int N = 2e5;
ll dp[N], vis[N];
vector<ll> e[N];
ll dfs(ll u) {
vis[u] = 1;
for (auto k : e[u]) {
ll ans = 0;
ans = dfs(k);
dp[u] = max(dp[u], ans + 1);
}
return dp[u];
}
void solve() {
ll n, m, i;
cin >> n >> m;
memset(dp, 0, sizeof(dp));
memset(vis, 0, sizeof(vis));
for (i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
e[u].pb(v);
}
for (i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
ll ans = -1;
for (i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
int main() {
make_it_fast;
int TEST_CASES = 1;
// cin>>TEST_CASES;
while (TEST_CASES--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define make_it_fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define endl "\n"
#define ff first
#define ss second
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...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...) 20
#endif
ll power(ll a, ll b, ll m = 1e9 + 7) {
a %= m;
if (b == 1)
return a;
if (b == 0)
return 1;
ll ret = power(a, b / 2);
ret = (ret % m * ret % m) % m;
if (b & 1)
ret = (ret % m * a % m) % m;
return ret;
}
ll lcm(ll a, ll b) { return (a * b) / (__gcd(a, b)); }
const int N = 2e5;
ll dp[N], vis[N];
vector<ll> e[N];
ll dfs(ll u) {
vis[u] = 1;
for (auto k : e[u]) {
if (dp[k]) {
dp[u] = max(dp[u], dp[k] + 1);
continue;
}
ll ans = 0;
ans = dfs(k);
dp[u] = max(dp[u], ans + 1);
}
return dp[u];
}
void solve() {
ll n, m, i;
cin >> n >> m;
memset(dp, 0, sizeof(dp));
memset(vis, 0, sizeof(vis));
for (i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
e[u].pb(v);
}
for (i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
ll ans = -1;
for (i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
int main() {
make_it_fast;
int TEST_CASES = 1;
// cin>>TEST_CASES;
while (TEST_CASES--) {
solve();
}
return 0;
}
|
insert
| 86 | 86 | 86 | 90 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[3001];
class Graph {
int v;
list<int> *l;
public:
Graph(int v) {
this->v = v;
l = new list<int>[v];
}
void addedge(int x, int y) { l[x].push_back(y); }
void printgraph() {
for (int i = 0; i < v; i++) {
cout << i << " --- ";
for (auto it : l[i]) {
cout << it << ", ";
}
cout << endl;
}
}
int longestpath(int src) {
bool leaf = true;
int bestchild = 0;
if (dp[src] != -1) {
return dp[src];
}
for (auto child : l[src]) {
leaf = false;
bestchild = max(bestchild, longestpath(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
};
signed main() {
int n, e;
cin >> n >> e;
Graph g(n + 1);
memset(dp, -1, sizeof dp);
for (int i = 0; i < e; i++) {
int x, y;
cin >> x >> y;
g.addedge(x, y);
}
// g.printgraph();
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, g.longestpath(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[100001];
class Graph {
int v;
list<int> *l;
public:
Graph(int v) {
this->v = v;
l = new list<int>[v];
}
void addedge(int x, int y) { l[x].push_back(y); }
void printgraph() {
for (int i = 0; i < v; i++) {
cout << i << " --- ";
for (auto it : l[i]) {
cout << it << ", ";
}
cout << endl;
}
}
int longestpath(int src) {
bool leaf = true;
int bestchild = 0;
if (dp[src] != -1) {
return dp[src];
}
for (auto child : l[src]) {
leaf = false;
bestchild = max(bestchild, longestpath(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
};
signed main() {
int n, e;
cin >> n >> e;
Graph g(n + 1);
memset(dp, -1, sizeof dp);
for (int i = 0; i < e; i++) {
int x, y;
cin >> x >> y;
g.addedge(x, y);
}
// g.printgraph();
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, g.longestpath(i));
cout << ans << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define m_p make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a, i >= b; i--)
#define sz(x) (int)x.size()
#define F first
#define S second
#define debug(x) \
for (int i = 0; i < x; i++) \
cout << "##########" << endl
#define M 1000000007
#define ll long long int
#define lMax LLONG_MAX
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define vii vector<pii>
// queue<int> , prefix_sum(a,a+n) , reverse(a,a+n) , priority_queue <int> max
// heap , priority_queue <int, vector<int>, greater<int> > min heap;
// == > != precedence gretaer then & , << precedence greater than <= == => ,
// int chk, cnt, fl, pos, in, src, tar, val, res. dummy; fill
// (myvector.begin(),myvector.begin()+4,5), freq;
vi edge[100001];
int vis[100001] = {0}, ans;
int dp[100001] = {0}, x[100001] = {0};
void dfs(int root) {
if (edge[root].size() == 0)
dp[root] = 0;
vi::iterator itr;
for (itr = edge[root].begin(); itr != edge[root].end(); itr++) {
if (!vis[*itr])
dfs(*itr);
dp[root] = max(dp[root], dp[*itr] + 1);
ans = max(ans, dp[root]);
}
}
void solve() {
int m, n;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
edge[a].pb(b);
x[b]++;
}
rep(i, 1, n + 1) {
if (x[i] == 0)
dfs(i);
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define m_p make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repr(i, a, b) for (int i = a, i >= b; i--)
#define sz(x) (int)x.size()
#define F first
#define S second
#define debug(x) \
for (int i = 0; i < x; i++) \
cout << "##########" << endl
#define M 1000000007
#define ll long long int
#define lMax LLONG_MAX
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define vii vector<pii>
// queue<int> , prefix_sum(a,a+n) , reverse(a,a+n) , priority_queue <int> max
// heap , priority_queue <int, vector<int>, greater<int> > min heap;
// == > != precedence gretaer then & , << precedence greater than <= == => ,
// int chk, cnt, fl, pos, in, src, tar, val, res. dummy; fill
// (myvector.begin(),myvector.begin()+4,5), freq;
vi edge[100001];
int vis[100001] = {0}, ans;
int dp[100001] = {0}, x[100001] = {0};
void dfs(int root) {
if (edge[root].size() == 0)
dp[root] = 0;
vi::iterator itr;
for (itr = edge[root].begin(); itr != edge[root].end(); itr++) {
if (!vis[*itr])
dfs(*itr);
dp[root] = max(dp[root], dp[*itr] + 1);
ans = max(ans, dp[root]);
}
vis[root] = 1;
}
void solve() {
int m, n;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
edge[a].pb(b);
x[b]++;
}
rep(i, 1, n + 1) {
if (x[i] == 0)
dfs(i);
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
|
insert
| 41 | 41 | 41 | 42 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100001;
vector<int> G[maxn], tsort;
bool vis[maxn];
int dp[maxn];
void dfs(int u) {
vis[u] = 1;
for (int v : G[u])
dfs(v);
tsort.push_back(u);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int V, E;
cin >> V >> E;
while (E--) {
int u, v;
cin >> u >> v;
G[u].push_back(v);
}
for (int i = 1; i <= V; i++)
if (!vis[i])
dfs(i);
int ans = 0;
for (int u : tsort) {
for (int v : G[u])
dp[u] = max(dp[v] + 1, dp[u]);
ans = max(ans, dp[u]);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100001;
vector<int> G[maxn], tsort;
bool vis[maxn];
int dp[maxn];
void dfs(int u) {
vis[u] = 1;
for (int v : G[u])
if (!vis[v])
dfs(v);
tsort.push_back(u);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int V, E;
cin >> V >> E;
while (E--) {
int u, v;
cin >> u >> v;
G[u].push_back(v);
}
for (int i = 1; i <= V; i++)
if (!vis[i])
dfs(i);
int ans = 0;
for (int u : tsort) {
for (int v : G[u])
dp[u] = max(dp[v] + 1, dp[u]);
ans = max(ans, dp[u]);
}
cout << ans;
return 0;
}
|
replace
| 14 | 15 | 14 | 16 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 5;
const int MAXNN = 1e5 + 7;
const int INF = 1e9 + 7;
#define ll long long
#define pb push_back
#define endl '\n'
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F first
#define S second
ll poww(ll a, ll b, ll md) {
return (!b ? 1
: (b & 1 ? a * poww(a * a % md, b / 2, md) % md
: poww(a * a % md, b / 2, md) % md));
}
ll MOD(ll a) { return ((a % INF) + INF) % INF; }
ll inv(ll a) { return poww(a, INF - 2, INF); }
vector<int> adjList[MAXN];
int dp[MAXN], deg[MAXN];
int main() {
fast_io;
// cout << fixed << setprecision(15);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int c, d;
cin >> c >> d;
adjList[c].pb(d);
++deg[d];
}
deque<int> dq;
for (int i = 1; i <= n; ++i)
if (!deg[i])
dq.pb(i);
while (!dq.empty()) {
int now = dq.front();
dq.pop_front();
for (auto u : adjList[now]) {
dp[u] = max(dp[u], dp[now] + 1);
--deg[u];
}
for (auto u : adjList[now])
if (deg[u] == 0)
dq.pb(u);
}
int maxs = 0;
for (int i = 1; i <= n; ++i)
maxs = max(maxs, dp[i]);
cout << maxs;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXNN = 1e5 + 7;
const int INF = 1e9 + 7;
#define ll long long
#define pb push_back
#define endl '\n'
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F first
#define S second
ll poww(ll a, ll b, ll md) {
return (!b ? 1
: (b & 1 ? a * poww(a * a % md, b / 2, md) % md
: poww(a * a % md, b / 2, md) % md));
}
ll MOD(ll a) { return ((a % INF) + INF) % INF; }
ll inv(ll a) { return poww(a, INF - 2, INF); }
vector<int> adjList[MAXN];
int dp[MAXN], deg[MAXN];
int main() {
fast_io;
// cout << fixed << setprecision(15);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int c, d;
cin >> c >> d;
adjList[c].pb(d);
++deg[d];
}
deque<int> dq;
for (int i = 1; i <= n; ++i)
if (!deg[i])
dq.pb(i);
while (!dq.empty()) {
int now = dq.front();
dq.pop_front();
for (auto u : adjList[now]) {
dp[u] = max(dp[u], dp[now] + 1);
--deg[u];
}
for (auto u : adjList[now])
if (deg[u] == 0)
dq.pb(u);
}
int maxs = 0;
for (int i = 1; i <= n; ++i)
maxs = max(maxs, dp[i]);
cout << maxs;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
typedef long long ll;
#define test \
ll t; \
cin >> t; \
while (t--)
#define f first
#define s second
#define pb push_back
#define pop pop_back
#define int long long int
vector<int> graph[10000];
int dp[1000];
int solve(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = 1;
int bestchild = 0;
for (int child : graph[src]) {
leaf = 0;
bestchild = max(bestchild, solve(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
int32_t main() {
fast;
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof dp);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
graph[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, solve(i));
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
typedef long long ll;
#define test \
ll t; \
cin >> t; \
while (t--)
#define f first
#define s second
#define pb push_back
#define pop pop_back
#define int long long int
vector<int> graph[100005];
int dp[100005];
int solve(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = 1;
int bestchild = 0;
for (int child : graph[src]) {
leaf = 0;
bestchild = max(bestchild, solve(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
int32_t main() {
fast;
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof dp);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
graph[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, solve(i));
}
cout << ans << "\n";
return 0;
}
|
replace
| 18 | 20 | 18 | 20 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define endl "\n"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
const int N = 1e5 + 10, inf = 1e9 + 10;
vector<int> g[N];
int d[N], ans, u[N];
void dfs(int v) {
u[v] = 1;
if (g[v].size() == 0)
d[v] = 0;
for (int i = 0; i < g[v].size(); i++) {
int to = g[v][i];
dfs(to);
d[v] = max(d[v], d[to] + 1);
}
}
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// freopen("prices.in", "r", stdin);
// freopen("prices.out", "w", stdout);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!u[i])
dfs(i);
ans = max(ans, d[i]);
}
cout << ans;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define endl "\n"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag,
tree_order_statistics_node_update>;
const int N = 1e5 + 10, inf = 1e9 + 10;
vector<int> g[N];
int d[N], ans, u[N];
void dfs(int v) {
u[v] = 1;
if (g[v].size() == 0)
d[v] = 0;
for (int i = 0; i < g[v].size(); i++) {
int to = g[v][i];
if (!u[to])
dfs(to);
d[v] = max(d[v], d[to] + 1);
}
}
int main() {
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// freopen("prices.in", "r", stdin);
// freopen("prices.out", "w", stdout);
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!u[i])
dfs(i);
ans = max(ans, d[i]);
}
cout << ans;
}
|
replace
| 22 | 23 | 22 | 24 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = 1e9;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
int dp[100010];
int deg[100010];
vector<vector<int>> G;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M, x, y;
cin >> N >> M;
G.resize(N);
for (int i = 0; i < M; ++i) {
cin >> x >> y;
--x;
--y;
G[x].push_back(y);
++deg[y];
}
queue<int> que;
for (int i = 0; i < N; ++i)
if (deg[i] == 0)
que.push(i);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
chmax(dp[nv], dp[v] + 1);
que.push(nv);
}
}
int ans = 0;
for (int i = 0; i < N; ++i)
chmax(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = 1e9;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
int dp[100010];
int deg[100010];
vector<vector<int>> G;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, M, x, y;
cin >> N >> M;
G.resize(N);
for (int i = 0; i < M; ++i) {
cin >> x >> y;
--x;
--y;
G[x].push_back(y);
++deg[y];
}
queue<int> que;
for (int i = 0; i < N; ++i)
if (deg[i] == 0)
que.push(i);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
chmax(dp[nv], dp[v] + 1);
if (--deg[nv] == 0)
que.push(nv);
}
}
int ans = 0;
for (int i = 0; i < N; ++i)
chmax(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
replace
| 40 | 41 | 40 | 42 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int memo[100010];
vector<int> v[100010];
int sol(int pos) {
if (memo[pos])
return memo[pos];
int ma = 0;
for (int i : v[pos])
ma = max(ma, sol(i) + 1);
return ma;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
}
int ma = 0;
for (int i = 0; i < N; i++)
ma = max(ma, sol(i));
cout << ma;
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int memo[100010];
vector<int> v[100010];
int sol(int pos) {
if (memo[pos])
return memo[pos];
int ma = 0;
for (int i : v[pos])
ma = max(ma, sol(i) + 1);
return memo[pos] = ma;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
}
int ma = 0;
for (int i = 0; i < N; i++)
ma = max(ma, sol(i));
cout << ma;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long ll;
ll n, m;
vector<int> graph[100005];
int memo[100005];
int findpath(int node) {
int maxlen = 0;
for (auto x : graph[node]) {
if (memo[x] != -1)
maxlen = max(maxlen, 1 + memo[x]);
else
maxlen = max(maxlen, 1 + findpath(x));
}
return maxlen;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
graph[a].PB(b);
}
memset(memo, -1, sizeof(memo));
int mmax = -1;
for (int i = 1; i <= n; i++) {
if (memo[i] != -1) {
mmax = max(mmax, memo[i]);
} else {
mmax = max(mmax, findpath(i));
}
}
cout << mmax << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long ll;
ll n, m;
vector<int> graph[100005];
int memo[100005];
int findpath(int node) {
int maxlen = 0;
for (auto x : graph[node]) {
if (memo[x] != -1)
maxlen = max(maxlen, 1 + memo[x]);
else
maxlen = max(maxlen, 1 + findpath(x));
}
return memo[node] = maxlen;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
graph[a].PB(b);
}
memset(memo, -1, sizeof(memo));
int mmax = -1;
for (int i = 1; i <= n; i++) {
if (memo[i] != -1) {
mmax = max(mmax, memo[i]);
} else {
mmax = max(mmax, findpath(i));
}
}
cout << mmax << "\n";
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
// 入力
int N, M;
int dp[100100]; // メモ化再帰
vector<vector<int>> G; // グラフ
int rec(int v) {
if (dp[v] != 0)
return dp[v]; // 既に更新済み
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res; // メモしながらリターン
}
int main() {
// 入力受け取り
cin >> N >> M;
G.resize(M);
// G.assign(N, vector<int>());
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
--x, --y; // 0-indexed にする
G[x].push_back(y);
}
// 全ノードを一通り更新しながら答えを求める
int res = 0;
for (int v = 0; v < N; ++v) {
res = max(res, rec(v));
}
cout << res << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
// 入力
int N, M;
int dp[100100]; // メモ化再帰
vector<vector<int>> G; // グラフ
int rec(int v) {
if (dp[v] != 0)
return dp[v]; // 既に更新済み
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res; // メモしながらリターン
}
int main() {
// 入力受け取り
cin >> N >> M;
G.resize(N);
// G.assign(N, vector<int>());
for (int i = 0; i < M; ++i) {
int x, y;
cin >> x >> y;
--x, --y; // 0-indexed にする
G[x].push_back(y);
}
// 全ノードを一通り更新しながら答えを求める
int res = 0;
for (int v = 0; v < N; ++v) {
res = max(res, rec(v));
}
cout << res << endl;
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
vector<int> deg(n, 0);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
g[x].push_back(y);
deg[y]++;
}
vector<int> dp(n, 0);
queue<int> q;
for (int i = 0; i < n; i++) {
if (deg[i] == 0)
q.push(i);
}
while (!q.empty()) {
int s = q.front();
q.pop();
for (auto t : g[s]) {
dp[t] = max(dp[t], dp[s] + 1);
q.push(t);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
vector<int> deg(n, 0);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
g[x].push_back(y);
deg[y]++;
}
vector<int> dp(n, 0);
queue<int> q;
for (int i = 0; i < n; i++) {
if (deg[i] == 0)
q.push(i);
}
while (!q.empty()) {
int s = q.front();
q.pop();
for (auto t : g[s]) {
dp[t] = max(dp[t], dp[s] + 1);
deg[t]--;
if (deg[t] == 0)
q.push(t);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
replace
| 26 | 27 | 26 | 29 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[100001];
int solve(vector<vector<int>> v, int i) {
if (dp[i] != -1)
return dp[i];
int ans = 0;
for (int j = 0; j < v[i].size(); j++) {
ans = max(ans, solve(v, v[i][j]) + 1);
}
dp[i] = ans;
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int m;
cin >> m;
for (int i = 0; i < n; i++)
dp[i] = -1;
vector<vector<int>> v;
for (int i = 0; i < n; i++) {
vector<int> temp;
v.push_back(temp);
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
int y;
cin >> y;
x--;
y--;
v[x].push_back(y);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (dp[i] == -1) {
dp[i] = solve(v, i);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[100001];
int solve(vector<vector<int>> &v, int i) {
if (dp[i] != -1)
return dp[i];
int ans = 0;
for (int j = 0; j < v[i].size(); j++) {
ans = max(ans, solve(v, v[i][j]) + 1);
}
dp[i] = ans;
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int m;
cin >> m;
for (int i = 0; i < n; i++)
dp[i] = -1;
vector<vector<int>> v;
for (int i = 0; i < n; i++) {
vector<int> temp;
v.push_back(temp);
}
for (int i = 0; i < m; i++) {
int x;
cin >> x;
int y;
cin >> y;
x--;
y--;
v[x].push_back(y);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (dp[i] == -1) {
dp[i] = solve(v, i);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
replace
| 7 | 8 | 7 | 8 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
int bio[100010];
vector<int> v[100010];
int dfs(int x) {
for (int i = 0; i < v[x].size(); i++) {
bio[x] = max(bio[x], dfs(v[x][i]) + 1);
}
return bio[x];
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[a].push_back(b);
}
int maxi = 0;
for (int i = 1; i <= n; i++) {
if (bio[i] == 0) {
dfs(i);
}
maxi = max(maxi, bio[i]);
}
cout << maxi;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b;
int bio[100010];
vector<int> v[100010];
int dfs(int x) {
for (int i = 0; i < v[x].size(); i++) {
if (bio[v[x][i]] == 0)
bio[x] = max(bio[x], dfs(v[x][i]) + 1);
else {
bio[x] = max(bio[x], bio[v[x][i]] + 1);
}
}
return bio[x];
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[a].push_back(b);
}
int maxi = 0;
for (int i = 1; i <= n; i++) {
if (bio[i] == 0) {
dfs(i);
}
maxi = max(maxi, bio[i]);
}
cout << maxi;
return 0;
}
|
replace
| 9 | 10 | 9 | 14 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
/*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #x << ':' << x << '\n';
using namespace std;
class Graph {
int n;
list<int> *graph;
vector<int> dp;
public:
int ans = 0;
Graph(int n) {
this->n = n;
graph = new list<int>[n];
dp.assign(n, 0);
}
void addEdge(int a, int b) {
a--;
b--;
graph[a].push_back(b);
}
void dfs(int s, bool *&visited) {
visited[s] = 1;
for (auto &x : graph[s]) {
// if(visited[x])continue;
dfs(x, visited);
dp[s] = max(dp[s], dp[x] + 1);
ans = max(dp[s], ans);
}
}
void dfs() {
bool *visited = new bool[n];
for (int i = 0; i < n; i++) {
visited[i] = 0;
}
for (int i = 0; i < n; ++i) {
if (visited[i])
continue;
dfs(i, visited);
}
}
};
void solve() {
int i, j;
int n, e;
cin >> n >> e;
Graph g(n);
for (int i = 0; i < e; ++i) {
int a, b;
cin >> a >> b;
g.addEdge(a, b);
}
g.dfs();
printf("%d\n", g.ans);
}
int main() {
int T = 1;
// cin >> T;
while (T--) {
solve();
}
}
|
/*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #x << ':' << x << '\n';
using namespace std;
class Graph {
int n;
list<int> *graph;
vector<int> dp;
public:
int ans = 0;
Graph(int n) {
this->n = n;
graph = new list<int>[n];
dp.assign(n, 0);
}
void addEdge(int a, int b) {
a--;
b--;
graph[a].push_back(b);
}
void dfs(int s, bool *&visited) {
visited[s] = 1;
for (auto &x : graph[s]) {
if (!visited[x])
dfs(x, visited);
// dfs(x,visited);
dp[s] = max(dp[s], dp[x] + 1);
ans = max(dp[s], ans);
}
}
void dfs() {
bool *visited = new bool[n];
for (int i = 0; i < n; i++) {
visited[i] = 0;
}
for (int i = 0; i < n; ++i) {
if (visited[i])
continue;
dfs(i, visited);
}
}
};
void solve() {
int i, j;
int n, e;
cin >> n >> e;
Graph g(n);
for (int i = 0; i < e; ++i) {
int a, b;
cin >> a >> b;
g.addEdge(a, b);
}
g.dfs();
printf("%d\n", g.ans);
}
int main() {
int T = 1;
// cin >> T;
while (T--) {
solve();
}
}
|
replace
| 38 | 40 | 38 | 41 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[10007];
int used[100007], dp[100007], mx;
void dfs(int v) {
if (used[v])
return;
used[v] = 1;
for (auto u : adj[v]) {
dfs(u);
dp[v] = max(dp[v], dp[u] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
dfs(i);
mx = max(mx, dp[i]);
}
cout << mx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100007];
int used[100007], dp[100007], mx;
void dfs(int v) {
if (used[v])
return;
used[v] = 1;
for (auto u : adj[v]) {
dfs(u);
dp[v] = max(dp[v], dp[u] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
dfs(i);
mx = max(mx, dp[i]);
}
cout << mx << endl;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100000];
int visited[100000];
int dp[100000];
void dfs(int node) {
dp[node] = 0;
visited[node] = 1;
for (auto child : g[node]) {
if (!visited[child]) {
dfs(child);
}
dp[node] = max(dp[node], 1 + dp[child]);
}
}
int main() {
int n, m, i, j, k;
cin >> n >> m;
for (i = 0; i < m; i++)
cin >> j >> k, g[j].push_back(k);
memset(visited, 0, sizeof(visited));
for (i = 1; i <= n; i++)
if (!visited[i])
dfs(i);
int ans = 0;
for (i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100001];
int visited[100001];
int dp[100001];
void dfs(int node) {
dp[node] = 0;
visited[node] = 1;
for (auto child : g[node]) {
if (!visited[child]) {
dfs(child);
}
dp[node] = max(dp[node], 1 + dp[child]);
}
}
int main() {
int n, m, i, j, k;
cin >> n >> m;
for (i = 0; i < m; i++)
cin >> j >> k, g[j].push_back(k);
memset(visited, 0, sizeof(visited));
for (i = 1; i <= n; i++)
if (!visited[i])
dfs(i);
int ans = 0;
for (i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
|
replace
| 2 | 5 | 2 | 5 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long int
#define S second
#define F first
using namespace std;
const int N = 120, M = 1e5 + 100;
int dp[N], n, m, cnt[N], k[N];
pair<int, int> p[N];
vector<int> v[N], ans;
queue<int> q;
int32_t main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int aa, bb;
cin >> aa >> bb;
v[aa - 1].push_back(bb - 1);
cnt[bb - 1]++;
}
for (int i = 0; i < n; i++) {
if (cnt[i] == 0) {
q.push(i);
}
}
while (q.size()) {
int u = q.front();
q.pop();
ans.push_back(u);
for (auto x : v[u]) {
cnt[x]--;
if (!cnt[x]) {
q.push(x);
}
}
}
// sort(p , p + n) ;
reverse(ans.begin(), ans.end());
for (int i = 0; i < n; i++) {
k[ans[i]] = i;
}
int mx = 0;
for (int i = 0; i < n; i++) {
// cout << ans[i] << " " ;
for (auto j : v[ans[i]]) {
dp[i] = max(dp[k[j]] + 1, dp[i]);
}
mx = max(mx, dp[i]);
}
cout << mx;
return 0;
}
/*
#include <radman/roderc++.h>
....._____
.~~~~~////////\\ ...
.:::::////////////\\ ....::////////..
(/\\\\...
.:::::////// \\\\///\\ .::::// ..:::::///////////////.
\\\\\$$$$$$
\\\\\////// \\\\///\\ //\\\//////
\\\\\////////////////////. ""\\$$$$$$$
\\\\\//// \\\\//// |||||////////. \\\\\/////
~~~~~////// ... "\$$$$
\\\\\//\ ////|||/ \\\\\/////////
\\\\\//\ ~~~~~////// (/\\\\... .
\\\\\//\ ////|||/ |||||////*\\///.
\\\\\//\ ~~~~~////// \\\\\$$$$$$ .@@@@@.
\\\\\//\ ////|||/ \\\\\///|\\\////
\\\\\//\ ~~~~~////// ""\\$$$$$$$ @@@@////\
\\\\\//\ ____---/|||/ |||||///|\\\\\///.
\\\\\//\ ~~~~~////// "\$$$$ @@@@\///\
\\\\\//\--|||||||_-' \\\\\///|\\\\\////
\\\\\//\ ~~~~~////// ,@@@@|///|
\\\\\//\|||||_"-\\\\\ |||||///| ~~~~~///.
\\\\\//\ ~~~~~////// .@@@@. /@@@@@|/////
\\\\\//\///"""\\\\\\\\ \\\\\///|~~~~[[[////.
\\\\\//\ ~~~~~////// @@@@@@@@ ..@@@@@.//////
\\\\\//\ \"""\\\\\\\ |||||///|~~[[[[["\////.
\\\\\//\ ~~~~~////// '@@@@/////\ .:;@@@@@@@..///////"
\\\\\//\ \"""\\\\\\ \\\\\///|[[[[*\\\\\////.
\\\\\//\ ~~~~~////// *@@@\//////\@@@@@@@@..//////////"
\\\\\//\ \:::\\\\/ |||||///|[[[* \\\\\\///
\\\\\//\~~~~~///////' *@@\/////////////////////"
\\\\\//\ \___\\/ \\\\\///|* \\\\\/"
\\\\\//\~~////////' **"///////////"""
\\\\\//\ |||||///| \\\\\//\///////"
\\\\\//\ \\\\\///| \\\\\//\////"
\\\\\/// |||||////| \\\\\////"
\\\\\/" \\\\\///* \\\\\/"
"""""*
*/
|
#include <bits/stdc++.h>
#define int long long int
#define S second
#define F first
using namespace std;
const int N = 2e6 + 100, M = 1e5 + 100;
int dp[N], n, m, cnt[N], k[N];
pair<int, int> p[N];
vector<int> v[N], ans;
queue<int> q;
int32_t main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int aa, bb;
cin >> aa >> bb;
v[aa - 1].push_back(bb - 1);
cnt[bb - 1]++;
}
for (int i = 0; i < n; i++) {
if (cnt[i] == 0) {
q.push(i);
}
}
while (q.size()) {
int u = q.front();
q.pop();
ans.push_back(u);
for (auto x : v[u]) {
cnt[x]--;
if (!cnt[x]) {
q.push(x);
}
}
}
// sort(p , p + n) ;
reverse(ans.begin(), ans.end());
for (int i = 0; i < n; i++) {
k[ans[i]] = i;
}
int mx = 0;
for (int i = 0; i < n; i++) {
// cout << ans[i] << " " ;
for (auto j : v[ans[i]]) {
dp[i] = max(dp[k[j]] + 1, dp[i]);
}
mx = max(mx, dp[i]);
}
cout << mx;
return 0;
}
/*
#include <radman/roderc++.h>
....._____
.~~~~~////////\\ ...
.:::::////////////\\ ....::////////..
(/\\\\...
.:::::////// \\\\///\\ .::::// ..:::::///////////////.
\\\\\$$$$$$
\\\\\////// \\\\///\\ //\\\//////
\\\\\////////////////////. ""\\$$$$$$$
\\\\\//// \\\\//// |||||////////. \\\\\/////
~~~~~////// ... "\$$$$
\\\\\//\ ////|||/ \\\\\/////////
\\\\\//\ ~~~~~////// (/\\\\... .
\\\\\//\ ////|||/ |||||////*\\///.
\\\\\//\ ~~~~~////// \\\\\$$$$$$ .@@@@@.
\\\\\//\ ////|||/ \\\\\///|\\\////
\\\\\//\ ~~~~~////// ""\\$$$$$$$ @@@@////\
\\\\\//\ ____---/|||/ |||||///|\\\\\///.
\\\\\//\ ~~~~~////// "\$$$$ @@@@\///\
\\\\\//\--|||||||_-' \\\\\///|\\\\\////
\\\\\//\ ~~~~~////// ,@@@@|///|
\\\\\//\|||||_"-\\\\\ |||||///| ~~~~~///.
\\\\\//\ ~~~~~////// .@@@@. /@@@@@|/////
\\\\\//\///"""\\\\\\\\ \\\\\///|~~~~[[[////.
\\\\\//\ ~~~~~////// @@@@@@@@ ..@@@@@.//////
\\\\\//\ \"""\\\\\\\ |||||///|~~[[[[["\////.
\\\\\//\ ~~~~~////// '@@@@/////\ .:;@@@@@@@..///////"
\\\\\//\ \"""\\\\\\ \\\\\///|[[[[*\\\\\////.
\\\\\//\ ~~~~~////// *@@@\//////\@@@@@@@@..//////////"
\\\\\//\ \:::\\\\/ |||||///|[[[* \\\\\\///
\\\\\//\~~~~~///////' *@@\/////////////////////"
\\\\\//\ \___\\/ \\\\\///|* \\\\\/"
\\\\\//\~~////////' **"///////////"""
\\\\\//\ |||||///| \\\\\//\///////"
\\\\\//\ \\\\\///| \\\\\//\////"
\\\\\/// |||||////| \\\\\////"
\\\\\/" \\\\\///* \\\\\/"
"""""*
*/
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100005];
int dp[100005], vis[100005], mx;
void dfs(int node) {
vis[node] = 1;
for (int a : g[node])
dfs(a), dp[node] = max(dp[a] + 1, dp[node]);
mx = max(mx, dp[node]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
cout << mx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100005];
int dp[100005], vis[100005], mx;
void dfs(int node) {
vis[node] = 1;
for (int a : g[node]) {
if (!vis[a])
dfs(a);
dp[node] = max(dp[a] + 1, dp[node]);
}
mx = max(mx, dp[node]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
cout << mx << endl;
}
|
replace
| 7 | 9 | 7 | 12 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M, x, y;
cin >> N >> M;
vector<vector<ll>> G(N);
vector<int> c_in(N);
for (int i = 0; i < M; i++) {
cin >> x >> y;
x--, y--;
G[x].push_back(y);
c_in[y]++;
}
vector<int> h(N, -1);
function<int(int, int)> dfs = [&](int v, int p) {
if (h[v] >= 0)
return h[v];
if (G[v].size() == 0)
return 0;
int x = 0;
for (int u : G[v]) {
if (u == p)
continue;
x = max(x, dfs(u, v) + 1);
}
return x;
};
ll ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= 0)
continue;
ans = max(ans, (ll)dfs(i, -1));
}
return ans;
}
int main() {
auto ans = solve();
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M, x, y;
cin >> N >> M;
vector<vector<ll>> G(N);
vector<int> c_in(N);
for (int i = 0; i < M; i++) {
cin >> x >> y;
x--, y--;
G[x].push_back(y);
c_in[y]++;
}
vector<int> h(N, -1);
function<int(int, int)> dfs = [&](int v, int p) {
if (h[v] >= 0)
return h[v];
if (G[v].size() == 0)
return 0;
int x = 0;
for (int u : G[v]) {
if (u == p)
continue;
x = max(x, dfs(u, v) + 1);
}
h[v] = x;
return x;
};
ll ans = 0;
for (int i = 0; i < N; i++) {
if (h[i] >= 0)
continue;
ans = max(ans, (ll)dfs(i, -1));
}
return ans;
}
int main() {
auto ans = solve();
cout << ans << "\n";
return 0;
}
|
insert
| 28 | 28 | 28 | 29 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int maxValue = 1e5 + 5;
int dfs(int i, vector<int> g[], int *maxNodes, int dist) {
if (g[i].size() == 0) {
maxNodes[i] = 1;
}
for (int j : g[i]) {
maxNodes[i] = max(maxNodes[i], dfs(j, g, maxNodes, dist) + 1);
}
return maxNodes[i];
}
int main() {
int n, m;
cin >> n >> m;
vector<int> g[n + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
int maxNodes[n + 1];
for (int i = 0; i <= n; i++) {
maxNodes[i] = 0;
}
for (int i = 1; i <= n; i++) {
if (maxNodes[i] == 0) {
dfs(i, g, maxNodes, 0);
}
}
int ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, maxNodes[i]);
}
ans -= 1;
cout << ans;
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int maxValue = 1e5 + 5;
int dfs(int i, vector<int> g[], int *maxNodes, int dist) {
if (g[i].size() == 0) {
maxNodes[i] = 1;
}
if (maxNodes[i] != 0)
return maxNodes[i];
for (int j : g[i]) {
maxNodes[i] = max(maxNodes[i], dfs(j, g, maxNodes, dist) + 1);
}
return maxNodes[i];
}
int main() {
int n, m;
cin >> n >> m;
vector<int> g[n + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
int maxNodes[n + 1];
for (int i = 0; i <= n; i++) {
maxNodes[i] = 0;
}
for (int i = 1; i <= n; i++) {
if (maxNodes[i] == 0) {
dfs(i, g, maxNodes, 0);
}
}
int ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, maxNodes[i]);
}
ans -= 1;
cout << ans;
}
|
insert
| 9 | 9 | 9 | 11 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
||||||| | | ||||||| ||| ||| |||||
| | | | | | | | | | |
| | ||| | | | || |||| | |
||||||||||||||||||||||||||||||||||||||||||||||||
*/
using namespace std;
// #include "testlib.h"
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(), v.end()
#define int long long
#define ll long long
#define M 1000000007
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) m *(n / GCD(m, n))
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll int, string>
#define rep(a, b) for (ll i = a; i < b; i++)
#define rep0(n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define FORE(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof(a))
#define FOR repi
#define pii pair<int, int>
#define REVERSE(v) reverse(ALL(v))
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
// #define float long double
ll max(ll a, ll b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
vi dp(100001, 0), vis(100001, 0);
vector<vi> adj(100001);
void dfs(int v) {
dp[v] = 1;
vis[v] = 1;
for (auto i : adj[v]) {
dp[v] = max(dp[v], 1 + dp[i]);
if (vis[i])
continue;
dfs(i);
dp[v] = max(dp[v], 1 + dp[i]);
}
}
int solve() {
inputoutput int n, m;
cin >> n >> m;
rep0(m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(1, n + 1) {
if (vis[i])
continue;
dfs(i);
}
// rep(1,n+1) cout<<dp[i]<<" ";
cout << *max_element(all(dp)) - 1;
r0
}
signed main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
||||||| | | ||||||| ||| ||| |||||
| | | | | | | | | | |
| | ||| | | | || |||| | |
||||||||||||||||||||||||||||||||||||||||||||||||
*/
using namespace std;
// #include "testlib.h"
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(), v.end()
#define int long long
#define ll long long
#define M 1000000007
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) m *(n / GCD(m, n))
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll int, string>
#define rep(a, b) for (ll i = a; i < b; i++)
#define rep0(n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define FORE(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof(a))
#define FOR repi
#define pii pair<int, int>
#define REVERSE(v) reverse(ALL(v))
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
// #define float long double
ll max(ll a, ll b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
vi dp(100001, 0), vis(100001, 0);
vector<vi> adj(100001);
void dfs(int v) {
dp[v] = 1;
vis[v] = 1;
for (auto i : adj[v]) {
dp[v] = max(dp[v], 1 + dp[i]);
if (vis[i])
continue;
dfs(i);
dp[v] = max(dp[v], 1 + dp[i]);
}
}
int solve() { // inputoutput
int n, m;
cin >> n >> m;
rep0(m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(1, n + 1) {
if (vis[i])
continue;
dfs(i);
}
// rep(1,n+1) cout<<dp[i]<<" ";
cout << *max_element(all(dp)) - 1;
r0
}
signed main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
replace
| 91 | 93 | 91 | 93 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mrep(i, j, n) for (int i = j; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define mreps(i, j, n) for (int i = j; i <= n; i++)
#define rreps(i, n) for (int i = n; i >= 1; i--)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define el cout << endl
#define sp(x) cout << setprecision(x);
#define cer(x) cerr << x << endl
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x, val) x.erase(remove(ALL(x), val), x.end())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int, int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector<string>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
vvi to;
vi dp;
int rec(int n) {
if (to[n].empty())
return dp[n] = 0;
int res = 0;
for (int i = 0; i < sz(to[n]); i++) {
int next = to[n][i];
chmax(res, rec(next) + 1);
}
return dp[n] = res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
to = vvi(n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
to[x].push_back(y);
}
dp = vi(n, -1);
int ans = -1;
rep(i, n) {
if (dp[i] < 0)
rec(i);
chmax(ans, dp[i]);
}
co(ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mrep(i, j, n) for (int i = j; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define mreps(i, j, n) for (int i = j; i <= n; i++)
#define rreps(i, n) for (int i = n; i >= 1; i--)
#define co(x) cout << x << endl
#define cs(x) cout << x << " "
#define el cout << endl
#define sp(x) cout << setprecision(x);
#define cer(x) cerr << x << endl
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define ERASE(x, val) x.erase(remove(ALL(x), val), x.end())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pair<int, int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vs vector<string>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
vvi to;
vi dp;
int rec(int n) {
if (to[n].empty())
return dp[n] = 0;
if (dp[n] >= 0)
return dp[n];
int res = 0;
for (int i = 0; i < sz(to[n]); i++) {
int next = to[n][i];
chmax(res, rec(next) + 1);
}
return dp[n] = res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
to = vvi(n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
to[x].push_back(y);
}
dp = vi(n, -1);
int ans = -1;
rep(i, n) {
if (dp[i] < 0)
rec(i);
chmax(ans, dp[i]);
}
co(ans);
return 0;
}
|
insert
| 59 | 59 | 59 | 61 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N_MAX = 100000;
int n, m;
vector<int> graph[N_MAX];
vector<int> lp(N_MAX, -1);
int dfs(int node) {
int max_child_lp = -1;
for (int child : graph[node]) {
if (lp[child] != -1) {
max_child_lp = max(max_child_lp, lp[child]);
} else {
max_child_lp = max(max_child_lp, dfs(child));
}
}
return max_child_lp + 1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; ++i) {
cin >> x >> y;
--x;
--y;
graph[x].push_back(y);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (lp[i] != -1) {
ans = max(ans, lp[i]);
continue;
} else {
ans = max(ans, dfs(i));
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N_MAX = 100000;
int n, m;
vector<int> graph[N_MAX];
vector<int> lp(N_MAX, -1);
int dfs(int node) {
int max_child_lp = -1;
for (int child : graph[node]) {
if (lp[child] != -1) {
max_child_lp = max(max_child_lp, lp[child]);
} else {
max_child_lp = max(max_child_lp, dfs(child));
}
}
return lp[node] = max_child_lp + 1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; ++i) {
cin >> x >> y;
--x;
--y;
graph[x].push_back(y);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (lp[i] != -1) {
ans = max(ans, lp[i]);
continue;
} else {
ans = max(ans, dfs(i));
}
}
cout << ans << endl;
}
|
replace
| 22 | 23 | 22 | 23 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int longestPath(vector<vector<int>> &G, int v) {
if (dp[v] == -1) {
int r = 0;
for (int i = 0; i < G[v].size(); i++) {
r = max(r, 1 + longestPath(G, G[v][i]));
}
dp[v] = r;
}
return dp[v];
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
G[x].push_back(y);
}
int r = 0;
dp = vector<int>(N, -1);
for (int i = 0; i < N; i++)
r = max(r, longestPath(G, i));
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int longestPath(vector<vector<int>> &G, int v) {
if (dp[v] == -1) {
int r = 0;
for (int i = 0; i < G[v].size(); i++) {
r = max(r, 1 + longestPath(G, G[v][i]));
}
dp[v] = r;
}
return dp[v];
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
G[x - 1].push_back(y - 1);
}
int r = 0;
dp = vector<int>(N, -1);
for (int i = 0; i < N; i++)
r = max(r, longestPath(G, i));
cout << r;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int js, a[100010], to[100010];
int n, m, c, b, ans, sum, dp[100010];
vector<int> v[100010];
vector<int> vv[10010];
inline void topsort() {
queue<int> q;
for (int i = 1; i <= n; ++i) {
if (!to[i])
q.push(i);
}
while (!q.empty()) {
int x = q.front();
q.pop();
if (to[x] == 0)
a[++js] = x;
for (int i = 0; i < v[x].size(); ++i) {
to[v[x][i]]--;
if (to[v[x][i]] == 0)
q.push(v[x][i]);
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &c, &b);
v[c].push_back(b);
vv[b].push_back(c);
to[b]++;
}
topsort();
// for(int i=1;i<=n;++i)cout<<a[i]<<" ";
// cout<<endl;
for (int i = 1; i <= n; ++i) {
int k = a[i];
for (int j = 0; j < vv[k].size(); ++j) {
dp[k] = max(dp[k], dp[vv[k][j]] + 1);
ans = max(ans, dp[k]);
}
}
for (int i = 1; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int js, a[100010], to[100010];
int n, m, c, b, ans, sum, dp[100010];
vector<int> v[100010];
vector<int> vv[100010];
inline void topsort() {
queue<int> q;
for (int i = 1; i <= n; ++i) {
if (!to[i])
q.push(i);
}
while (!q.empty()) {
int x = q.front();
q.pop();
if (to[x] == 0)
a[++js] = x;
for (int i = 0; i < v[x].size(); ++i) {
to[v[x][i]]--;
if (to[v[x][i]] == 0)
q.push(v[x][i]);
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &c, &b);
v[c].push_back(b);
vv[b].push_back(c);
to[b]++;
}
topsort();
// for(int i=1;i<=n;++i)cout<<a[i]<<" ";
// cout<<endl;
for (int i = 1; i <= n; ++i) {
int k = a[i];
for (int j = 0; j < vv[k].size(); ++j) {
dp[k] = max(dp[k], dp[vv[k][j]] + 1);
ans = max(ans, dp[k]);
}
}
for (int i = 1; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03166
|
C++
|
Runtime Error
|
#pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
#define randomINIT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll MOD = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 1e+5 + 7;
vll adj[MAXN];
ll visited[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
//<<-----Declare Variable Here------->>//
int t = 1;
ll n, m, x, y;
stack<ll> Stack;
vll v1;
ll lis[100005];
//<<-----Implement Functions Here---->>//
void topologicalSortUtil(ll v) {
visited[v] = 1;
for (auto it : adj[v])
if (!visited[it])
topologicalSortUtil(it);
Stack.push(v);
}
//<<-----Start of Main--------------->>//
void MAIN() {
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
for (ll i = 1; i <= n; i++)
lis[i] = 1;
for (int i = 1; i <= n; i++) {
if (!visited[i])
topologicalSortUtil(i);
}
while (!Stack.empty()) {
v1.pb(Stack.top());
Stack.pop();
}
// for(auto it:v1)cout<<it<<" ";cout<<endl;
for (auto it : v1) {
for (auto it1 : adj[it]) {
lis[it1] = max(lis[it1], lis[it] + 1);
}
}
ll max1 = -1;
for (ll i = 1; i <= n; i++)
max1 = max(lis[i], max1);
cout << max1 - 1;
}
int main() {
fastio;
randomINIT;
// cin>>t;
while (t--) {
MAIN();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
#define randomINIT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll MOD = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 1e+5 + 7;
vll adj[MAXN];
ll visited[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
//<<-----Declare Variable Here------->>//
int t = 1;
ll n, m, x, y;
stack<ll> Stack;
vll v1;
ll lis[100005];
//<<-----Implement Functions Here---->>//
void topologicalSortUtil(ll v) {
visited[v] = 1;
for (auto it : adj[v])
if (!visited[it])
topologicalSortUtil(it);
Stack.push(v);
}
//<<-----Start of Main--------------->>//
void MAIN() {
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
for (ll i = 1; i <= n; i++)
lis[i] = 1;
for (int i = 1; i <= n; i++) {
if (!visited[i])
topologicalSortUtil(i);
}
while (!Stack.empty()) {
v1.pb(Stack.top());
Stack.pop();
}
// for(auto it:v1)cout<<it<<" ";cout<<endl;
for (auto it : v1) {
for (auto it1 : adj[it]) {
lis[it1] = max(lis[it1], lis[it] + 1);
}
}
ll max1 = -1;
for (ll i = 1; i <= n; i++)
max1 = max(lis[i], max1);
cout << max1 - 1;
}
int main() {
fastio;
randomINIT;
// cin>>t;
while (t--) {
MAIN();
}
}
|
replace
| 0 | 4 | 0 | 1 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
vector<int> G[MAX];
int dp[MAX];
int dfs(int v) {
int res = -1;
for (int u : G[v]) {
chmax(res, dfs(u));
}
if (res < 0)
return dp[v] = 0;
return dp[v] = res + 1;
}
int main() {
int N, M;
cin >> N >> M;
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
}
rep(i, N) dp[i] = -1;
rep(i, N) {
if (dp[i] < 0)
dfs(i);
}
int ans = 0;
rep(i, N) chmax(ans, dp[i]);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
vector<int> G[MAX];
int dp[MAX];
int dfs(int v) {
int res = -1;
for (int u : G[v]) {
if (dp[u] < 0)
chmax(res, dfs(u));
else
chmax(res, dp[u]);
}
if (res < 0)
return dp[v] = 0;
return dp[v] = res + 1;
}
int main() {
int N, M;
cin >> N >> M;
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
}
rep(i, N) dp[i] = -1;
rep(i, N) {
if (dp[i] < 0)
dfs(i);
}
int ans = 0;
rep(i, N) chmax(ans, dp[i]);
cout << ans << endl;
}
|
replace
| 34 | 35 | 34 | 38 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<int> v[100005];
vector<int> dp;
ll dfs(int u) {
ll d = 0;
if (dp[u] != -1) {
return dp[u];
}
for (int w : v[u]) {
d = max(d, dfs(w) + 1);
}
return d;
}
int main(int argc, char *argv[]) {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
v[x].push_back(y);
}
dp = vector<int>(100005, -1);
ll ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<int> v[100005];
vector<int> dp;
ll dfs(int u) {
ll d = 0;
if (dp[u] != -1) {
return dp[u];
}
for (int w : v[u]) {
d = max(d, dfs(w) + 1);
}
return dp[u] = d;
}
int main(int argc, char *argv[]) {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
v[x].push_back(y);
}
dp = vector<int>(100005, -1);
ll ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
return 0;
}
|
replace
| 21 | 22 | 21 | 22 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> from;
vector<vector<int>> to;
vector<int> start, finish;
vector<int> d;
int dist(int u) {
if (d[u] != -1)
return d[u];
int md = -1;
for (int i = 0; i < from[u].size(); i++) {
int v = from[u][i];
md = max(md, dist(v) + 1);
}
return md;
}
int main(void) {
cin >> n >> m;
from = vector<vector<int>>(n, vector<int>());
to = vector<vector<int>>(n, vector<int>());
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
from[u - 1].push_back(v - 1);
to[v - 1].push_back(u - 1);
}
for (int i = 0; i < n; i++) {
if (from[i].size() == 0)
finish.push_back(i);
if (to[i].size() == 0)
start.push_back(i);
}
int md = -1;
d = vector<int>(n, -1);
for (int i = 0; i < finish.size(); i++)
d[finish[i]] = 0;
for (int i = 0; i < start.size(); i++) {
int u = start[i];
md = max(md, dist(u));
}
cout << md;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> from;
vector<vector<int>> to;
vector<int> start, finish;
vector<int> d;
int dist(int u) {
if (d[u] != -1)
return d[u];
int md = -1;
for (int i = 0; i < from[u].size(); i++) {
int v = from[u][i];
md = max(md, dist(v) + 1);
}
d[u] = md;
return md;
}
int main(void) {
cin >> n >> m;
from = vector<vector<int>>(n, vector<int>());
to = vector<vector<int>>(n, vector<int>());
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
from[u - 1].push_back(v - 1);
to[v - 1].push_back(u - 1);
}
for (int i = 0; i < n; i++) {
if (from[i].size() == 0)
finish.push_back(i);
if (to[i].size() == 0)
start.push_back(i);
}
int md = -1;
d = vector<int>(n, -1);
for (int i = 0; i < finish.size(); i++)
d[finish[i]] = 0;
for (int i = 0; i < start.size(); i++) {
int u = start[i];
md = max(md, dist(u));
}
cout << md;
return 0;
}
|
insert
| 19 | 19 | 19 | 20 |
TLE
| |
p03166
|
Python
|
Runtime Error
|
def main():
n, m = map(int, input().split())
graph = [[] for _ in range(n)]
for _ in range(m):
x, y = map(lambda x: int(x) - 1, input().split())
graph[x].append(y)
dp = [-1 for _ in range(n)]
# dp[i] := iから距離が最も長い頂点への距離
def solve(v):
if dp[v] != -1:
return dp[v]
res = 0
for next_v in graph[v]:
res = max(res, solve(next_v) + 1)
dp[v] = res
return dp[v]
ans = 0
for i in range(n):
ans = max(ans, solve(i))
print(ans)
if __name__ == "__main__":
main()
|
from sys import setrecursionlimit
setrecursionlimit(10**7)
def main():
n, m = map(int, input().split())
graph = [[] for _ in range(n)]
for _ in range(m):
x, y = map(lambda x: int(x) - 1, input().split())
graph[x].append(y)
dp = [-1 for _ in range(n)]
# dp[i] := iから距離が最も長い頂点への距離
def solve(v):
if dp[v] != -1:
return dp[v]
res = 0
for next_v in graph[v]:
res = max(res, solve(next_v) + 1)
dp[v] = res
return dp[v]
ans = 0
for i in range(n):
ans = max(ans, solve(i))
print(ans)
if __name__ == "__main__":
main()
|
insert
| 0 | 0 | 0 | 5 |
0
| |
p03166
|
Python
|
Runtime Error
|
N, M = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
x, y = map(int, input().split())
x, y = x - 1, y - 1
G[x].append(y)
def topological_sort(g):
topological_list = []
visited = set()
def dfs(n):
for e in g[n]:
if e not in visited:
dfs(e)
topological_list.append(n)
visited.add(n)
for i in range(len(g)):
if i not in visited:
dfs(i)
return topological_list[::-1]
T = topological_sort(G)
dist = [0] * N
for n in T:
for v in G[n]:
dist[v] = max(dist[v], dist[n] + 1)
print(max(dist))
|
import sys
sys.setrecursionlimit(10**9)
N, M = map(int, input().split())
G = [[] for i in range(N)]
for i in range(M):
x, y = map(int, input().split())
x, y = x - 1, y - 1
G[x].append(y)
def topological_sort(g):
topological_list = []
visited = set()
def dfs(n):
for e in g[n]:
if e not in visited:
dfs(e)
topological_list.append(n)
visited.add(n)
for i in range(len(g)):
if i not in visited:
dfs(i)
return topological_list[::-1]
T = topological_sort(G)
dist = [0] * N
for n in T:
for v in G[n]:
dist[v] = max(dist[v], dist[n] + 1)
print(max(dist))
|
insert
| 0 | 0 | 0 | 4 |
0
| |
p03166
|
Python
|
Runtime Error
|
import sys
from functools import lru_cache
sys.setrecursionlimit(100000)
@lru_cache(maxsize=None)
def dfs(v):
lv = links[v]
return max(map(dfs, lv)) + 1 if lv else 0
n, m = map(int, input().split())
sss = set(range(n))
links = [set() for _ in range(n)]
for line in sys.stdin.readlines():
x, y = map(int, line.split())
x -= 1
y -= 1
sss.discard(y)
links[x].add(y)
print(max(map(dfs, sss)))
|
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
@lru_cache(maxsize=None)
def dfs(v):
lv = links[v]
return max(map(dfs, lv)) + 1 if lv else 0
n, m = map(int, input().split())
sss = set(range(n))
links = [set() for _ in range(n)]
for line in sys.stdin.readlines():
x, y = map(int, line.split())
x -= 1
y -= 1
sss.discard(y)
links[x].add(y)
print(max(map(dfs, sss)))
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
Python
|
Runtime Error
|
def get_kyori(i):
if kos[i] == []:
kyori[i] = 0
return 0
if kyori[i] > -1:
return kyori[i]
re = 0
for ko in kos[i]:
new = get_kyori(ko) + 1
if re < new:
re = new
kyori[i] = re
return re
n, m = map(int, input().split())
kos = [[] for _ in range(n + 1)]
kyori = [-1] * (n + 1)
for _ in range(m):
oya, ko = map(int, input().split())
kos[oya] += [ko]
for i in range(1, n + 1):
if kyori[i] == -1:
kyori[i] = get_kyori(i)
print(max(kyori[1:]))
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def get_kyori(i):
if kos[i] == []:
kyori[i] = 0
return 0
if kyori[i] > -1:
return kyori[i]
re = 0
for ko in kos[i]:
new = get_kyori(ko) + 1
if re < new:
re = new
kyori[i] = re
return re
n, m = map(int, input().split())
kos = [[] for _ in range(n + 1)]
kyori = [-1] * (n + 1)
for _ in range(m):
oya, ko = map(int, input().split())
kos[oya] += [ko]
for i in range(1, n + 1):
if kyori[i] == -1:
kyori[i] = get_kyori(i)
print(max(kyori[1:]))
|
insert
| 0 | 0 | 0 | 6 |
0
| |
p03166
|
Python
|
Runtime Error
|
N, M = map(int, input().split())
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = map(int, input().split())
graph[y - 1][x - 1] = 1
dp = [0 for _ in range(N)]
def dfs(u):
if dp[u] != 0:
return dp[u]
max_dis = 0
for f in graph[u].keys():
if max_dis < dfs(f) + 1:
max_dis = dfs(f) + 1
dp[u] = max_dis
return dp[u]
for i in range(N):
dfs(i)
print(max(dp))
|
import sys
sys.setrecursionlimit(10**8)
N, M = map(int, input().split())
graph = [dict() for _ in range(N)]
for i in range(M):
x, y = map(int, input().split())
graph[y - 1][x - 1] = 1
dp = [0 for _ in range(N)]
def dfs(u):
if dp[u] != 0:
return dp[u]
max_dis = 0
for f in graph[u].keys():
if max_dis < dfs(f) + 1:
max_dis = dfs(f) + 1
dp[u] = max_dis
return dp[u]
for i in range(N):
dfs(i)
print(max(dp))
|
insert
| 0 | 0 | 0 | 4 |
0
| |
p03166
|
Python
|
Runtime Error
|
def dfs(v):
if d[v] != -1:
return d[v]
res = -1
for u in e[v]:
res = max(res, dfs(u))
res += 1
d[v] = res
return res
n, m = map(int, input().split())
e = tuple(set() for _ in range(n))
for _ in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
e[x].add(y)
d = [-1] * n
res = -1
for v in range(n):
res = max(res, dfs(v))
print(res)
|
import sys
sys.setrecursionlimit(10**7)
def dfs(v):
if d[v] != -1:
return d[v]
res = -1
for u in e[v]:
res = max(res, dfs(u))
res += 1
d[v] = res
return res
n, m = map(int, input().split())
e = tuple(set() for _ in range(n))
for _ in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
e[x].add(y)
d = [-1] * n
res = -1
for v in range(n):
res = max(res, dfs(v))
print(res)
|
insert
| 0 | 0 | 0 | 5 |
0
| |
p03166
|
Python
|
Runtime Error
|
import sys
def input():
return sys.stdin.readline().strip()
def dfs(v):
if dp[v] >= 0:
return dp[v]
res = 0
for nv in g[v]:
res = max(res, dfs(nv) + 1)
dp[v] = res
return res
n, m = map(int, input().split())
g = {i: set() for i in range(1, n + 1)}
for _ in range(m):
x, y = map(int, input().split())
g[x].add(y)
dp = [-1] * (n + 1)
for v in g:
dp[v] = max(dp[v], dfs(v))
print(max(dp))
|
import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
def dfs(v):
if dp[v] >= 0:
return dp[v]
res = 0
for nv in g[v]:
res = max(res, dfs(nv) + 1)
dp[v] = res
return res
n, m = map(int, input().split())
g = {i: set() for i in range(1, n + 1)}
for _ in range(m):
x, y = map(int, input().split())
g[x].add(y)
dp = [-1] * (n + 1)
for v in g:
dp[v] = max(dp[v], dfs(v))
print(max(dp))
|
insert
| 1 | 1 | 1 | 3 |
0
| |
p03166
|
C++
|
Runtime Error
|
/***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#define sqr(a) ((a) * (a))
using namespace std;
const LL MOD = 1e9 + 7;
int n, m, dp[100010], num[100010];
vector<int> g[100010], dg[100010], topo;
bool vis[5010];
void dfs(int pos) {
if (vis[pos])
return;
vis[pos] = true;
rep(i, g[pos].size()) dfs(g[pos][i]);
topo.pb(pos);
}
int main() {
rep(i, 100005) dp[i] = 1;
cin >> n >> m;
rep(i, m) {
int x, y;
scanf("%d%d", &x, &y);
g[x].pb(y);
dg[y].pb(x);
}
repn(i, n) if (!vis[i]) dfs(i);
reverse(topo.begin(), topo.end());
rep(i, topo.size()) num[topo[i]] = i;
rep(i, topo.size()) {
rep(j, dg[topo[i]].size()) dp[i] = max(dp[i], dp[num[dg[topo[i]][j]]] + 1);
}
int ans = 0;
rep(i, n) ans = max(ans, dp[i]);
cout << ans - 1 << endl;
rt0;
}
|
/***********************
* Author: xuziyuan *
***********************/
#include <bits/stdc++.h>
#define rt0 return 0
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define replet(c) for (char c = 'a'; c <= 'z'; c++)
#define LL long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define mpr make_pair
#define sqr(a) ((a) * (a))
using namespace std;
const LL MOD = 1e9 + 7;
int n, m, dp[100010], num[100010];
vector<int> g[100010], dg[100010], topo;
bool vis[100010];
void dfs(int pos) {
if (vis[pos])
return;
vis[pos] = true;
rep(i, g[pos].size()) dfs(g[pos][i]);
topo.pb(pos);
}
int main() {
rep(i, 100005) dp[i] = 1;
cin >> n >> m;
rep(i, m) {
int x, y;
scanf("%d%d", &x, &y);
g[x].pb(y);
dg[y].pb(x);
}
repn(i, n) if (!vis[i]) dfs(i);
reverse(topo.begin(), topo.end());
rep(i, topo.size()) num[topo[i]] = i;
rep(i, topo.size()) {
rep(j, dg[topo[i]].size()) dp[i] = max(dp[i], dp[num[dg[topo[i]][j]]] + 1);
}
int ans = 0;
rep(i, n) ans = max(ans, dp[i]);
cout << ans - 1 << endl;
rt0;
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
int f(vector<int> &dp, vector<vector<int>> graph, int vertex) {
if (dp[vertex] != -1)
return dp[vertex];
if (graph[vertex].size() == 0) {
dp[vertex] = 0;
return 0;
}
for (int i = 0; i < graph[vertex].size(); i++) {
dp[vertex] = max(dp[vertex], f(dp, graph, graph[vertex][i]) + 1);
}
return dp[vertex];
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> graph(N, vector<int>());
for (int i = 0; i < M; i++) {
int _a, _b;
cin >> _a >> _b;
graph[_a - 1].push_back(_b - 1);
}
int res = 0;
vector<int> dp(N, -1);
for (int i = 0; i < N; i++) {
res = max(res, f(dp, graph, i));
}
cout << res << endl;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
int f(vector<int> &dp, vector<vector<int>> &graph, int vertex) {
if (dp[vertex] != -1)
return dp[vertex];
if (graph[vertex].size() == 0) {
dp[vertex] = 0;
return 0;
}
for (int i = 0; i < graph[vertex].size(); i++) {
dp[vertex] = max(dp[vertex], f(dp, graph, graph[vertex][i]) + 1);
}
return dp[vertex];
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> graph(N, vector<int>());
for (int i = 0; i < M; i++) {
int _a, _b;
cin >> _a >> _b;
graph[_a - 1].push_back(_b - 1);
}
int res = 0;
vector<int> dp(N, -1);
for (int i = 0; i < N; i++) {
res = max(res, f(dp, graph, i));
}
cout << res << endl;
}
|
replace
| 7 | 8 | 7 | 8 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define ALL(a) begin(a), end(a)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
vector<int> G[100010];
vector<int> dp(100010, 0);
int r() {
int x;
cin >> x;
return x;
}
int dfs(int v) {
if (dp[v])
return dp[v];
int mx = 0;
for (auto it : G[v])
mx = max(mx, dfs(it) + 1);
return mx;
}
void solve() {
int n, m, ans = 0;
cin >> n >> m;
REP(i, m) G[r() - 1].pb(r() - 1);
REP(i, n) ans = max(ans, dfs(i));
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define ALL(a) begin(a), end(a)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
vector<int> G[100010];
vector<int> dp(100010, 0);
int r() {
int x;
cin >> x;
return x;
}
int dfs(int v) {
if (dp[v])
return dp[v];
int mx = 0;
for (auto it : G[v])
mx = max(mx, dfs(it) + 1);
dp[v] = mx;
return mx;
}
void solve() {
int n, m, ans = 0;
cin >> n >> m;
REP(i, m) G[r() - 1].pb(r() - 1);
REP(i, n) ans = max(ans, dfs(i));
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
insert
| 35 | 35 | 35 | 36 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = long long;
int n, m;
vector<vector<int>> adj;
vector<int> in_dig, s_path;
queue<int> Q;
void bfs() {
while (!Q.empty()) {
auto node = Q.front();
Q.pop();
for (auto child : adj[node]) {
s_path[child] = max(s_path[child], s_path[node] + 1);
// if(!vis[child]){
Q.push(child);
// vis[child]=1;
// }
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> m;
adj.resize(n + 1);
in_dig.resize(n + 1);
s_path.resize(n + 1);
// vis.resize(n+1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
in_dig[b]++;
}
for (int node = 1; node <= n; node++) {
if (in_dig[node] == 0)
Q.push(node);
}
bfs();
int ans = 0;
for (int node = 1; node <= n; node++)
ans = max(ans, s_path[node]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = long long;
int n, m;
vector<vector<int>> adj;
vector<int> in_dig, s_path;
queue<int> Q;
void bfs() {
while (!Q.empty()) {
auto node = Q.front();
Q.pop();
for (auto child : adj[node]) {
s_path[child] = max(s_path[child], s_path[node] + 1);
in_dig[child]--;
if (!in_dig[child]) {
Q.push(child);
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> m;
adj.resize(n + 1);
in_dig.resize(n + 1);
s_path.resize(n + 1);
// vis.resize(n+1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
in_dig[b]++;
}
for (int node = 1; node <= n; node++) {
if (in_dig[node] == 0)
Q.push(node);
}
bfs();
int ans = 0;
for (int node = 1; node <= n; node++)
ans = max(ans, s_path[node]);
cout << ans << endl;
return 0;
}
|
replace
| 17 | 21 | 17 | 21 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, b, a) for (int i = b; i >= a; --i)
#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
using namespace std;
const int maxn = 1e5 + 10;
int n, m, timer;
int dp[maxn];
vector<int> adj[maxn];
void dfs(int u) {
for (int v : adj[u]) {
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
REP(i, m) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
int answer = 0;
FOR(i, 1, n) {
dfs(i);
answer = max(answer, dp[i]);
}
cout << answer << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, b, a) for (int i = b; i >= a; --i)
#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
using namespace std;
const int maxn = 1e5 + 10;
int n, m, timer;
int dp[maxn];
vector<int> adj[maxn];
void dfs(int u) {
for (int v : adj[u]) {
if (!dp[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
REP(i, m) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
int answer = 0;
FOR(i, 1, n) {
dfs(i);
answer = max(answer, dp[i]);
}
cout << answer << "\n";
return 0;
}
|
replace
| 20 | 21 | 20 | 22 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
int n, m;
int dp[10005];
vector<int> adj[100005];
int solve(int node) {
int &ret = dp[node];
if (~ret)
return ret;
ret = 0;
for (auto &e : adj[node])
ret = max(ret, 1 + solve(e));
return ret;
}
int main() {
IO;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
int ans = 0;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++)
ans = max(ans, solve(i));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
int n, m;
int dp[100005];
vector<int> adj[100005];
int solve(int node) {
int &ret = dp[node];
if (~ret)
return ret;
ret = 0;
for (auto &e : adj[node])
ret = max(ret, 1 + solve(e));
return ret;
}
int main() {
IO;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
int ans = 0;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++)
ans = max(ans, solve(i));
cout << ans;
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const long long INF = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dp[100000];
vector<int> e[100000];
int dfs(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int nv : e[v])
chmax(res, dfs(nv) + 1);
return res;
}
int main(void) {
int N, M;
cin >> N >> M;
REP(i, M) {
int x, y;
cin >> x >> y;
x--;
y--;
e[x].push_back(y);
}
REP(i, N) dp[i] = -1;
int ans = 0;
REP(i, N) chmax(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const long long INF = 1000000007;
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int dp[100000];
vector<int> e[100000];
int dfs(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int nv : e[v])
chmax(res, dfs(nv) + 1);
return dp[v] = res;
}
int main(void) {
int N, M;
cin >> N >> M;
REP(i, M) {
int x, y;
cin >> x >> y;
x--;
y--;
e[x].push_back(y);
}
REP(i, N) dp[i] = -1;
int ans = 0;
REP(i, N) chmax(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
replace
| 72 | 73 | 72 | 73 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using vi = std::vector<int>;
template <class X, class Y> X &remax(X &x, Y y) { return x = (y > x) ? y : x; }
const int NMAX = 100100;
int nV, nE;
vi next[NMAX];
int cnt[NMAX];
int dfs(int x) {
for (int y : next[x]) {
remax(cnt[x], dfs(y) + 1);
}
remax(cnt[x], 0);
return cnt[x];
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
while (std::cin >> nV >> nE) {
std::fill(cnt, cnt + NMAX, -1);
std::fill(next, next + NMAX, vi{});
for (int i = 0; i < nE; i++) {
int x, y;
std::cin >> x >> y;
next[x].push_back(y);
}
int answ = 0;
for (int i = 1; i <= nV; i++) {
if (cnt[i] == -1) {
remax(answ, dfs(i));
}
}
std::cout << answ << std::endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using vi = std::vector<int>;
template <class X, class Y> X &remax(X &x, Y y) { return x = (y > x) ? y : x; }
const int NMAX = 100100;
int nV, nE;
vi next[NMAX];
int cnt[NMAX];
int dfs(int x) {
if (cnt[x] != -1) {
return cnt[x];
}
for (int y : next[x]) {
remax(cnt[x], dfs(y) + 1);
}
remax(cnt[x], 0);
return cnt[x];
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
while (std::cin >> nV >> nE) {
std::fill(cnt, cnt + NMAX, -1);
std::fill(next, next + NMAX, vi{});
for (int i = 0; i < nE; i++) {
int x, y;
std::cin >> x >> y;
next[x].push_back(y);
}
int answ = 0;
for (int i = 1; i <= nV; i++) {
if (cnt[i] == -1) {
remax(answ, dfs(i));
}
}
std::cout << answ << std::endl;
}
return 0;
}
|
insert
| 8 | 8 | 8 | 11 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm> //swap function is here
#include <bits/stdc++.h>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream> // istringstream buffer(myString);
#include <stack>
#include <vector>
using namespace std;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define max(a, b) (a < b ? b : a)
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define getI(a) \
scanf("%d", &a) // next three are handy ways to get ints, it's also force you
// to use '&' sign
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define wez(n) \
int(n); \
scanf( \
"%d", \
&(n)) // handy if the input is right after the definition of a variable
#define wez2(n, m) \
int(n), (m); \
scanf("%d %d", &(n), &(m))
#define wez3(n, m, k) \
int(n), (m), (k); \
scanf("%d %d %d", &(n), &(m), &(k))
#define TESTS wez(testow) while (testow--) // for multilple cases problems
#define whileZ \
int T; \
getI(T); \
while (T--) // the same as above
#define getS(x) scanf("%s", x) // get a char* string
#define clr(a, x) memset(a, x, sizeof(a)) // set elements of array to some value
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FOREACH(i, t) \
for (typeof(t.begin()) i = t.begin(); i != t.end(); \
i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define ll \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for debug
inline void pisz(int n) { printf("%d\n", n); }
#define DBG(vari) cerr << #vari << " = " << (vari) << endl;
#define printA(a, L, R) FE(i, L, R) cout << a[i] << (i == R ? '\n' : ' ')
#define printV(a) printA(a, 0, a.size() - 1)
#define MAXN 10000
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
template <typename T, typename TT>
ostream &operator<<(ostream &s, pair<T, TT> t) {
return s << "(" << t.first << "," << t.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, vector<T> t) {
F(i, 0, SZ(t)) s << t[i] << " ";
return s;
}
ll mod = 1000000007;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll power(ll a, ll b, ll m) {
ll r = 1;
a = a % m;
while (b) {
if (b & 1)
r = r * a % m;
a = a * a % m;
b = b >> 1;
}
return r;
}
// std::vector<ll> v;
std::vector<ll> v[100000 + 1];
ll vis[100000 + 1];
ll dp[100000 + 1];
ll recurs(ll val) {
vis[val] = 1;
ll mx = 0;
for (int i = 0; i < v[val].size(); ++i) {
if (vis[v[val][i]] == 0) {
mx = max(1 + recurs(v[val][i]), mx);
} else {
mx = max(1 + dp[v[val][i]], mx);
}
/* code */
}
dp[val] = max(dp[val], mx);
return (dp[val]);
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
map<int, vector<int>> mp;
for (int i = 0; i < m; ++i) {
ll x, y;
cin >> x >> y;
// mp[x].push_back(y);
v[x].push_back(y);
/* code */
}
for (int i = 1; i < n + 1; ++i) {
if (vis[i] == 0)
recurs(i);
/* code */
}
ll ans = 0;
for (int i = 1; i <= n; ++i) {
ans = max(ans, dp[i]);
/* code */
}
cout << ans << "\n";
}
|
#include <algorithm> //swap function is here
#include <bits/stdc++.h>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream> // istringstream buffer(myString);
#include <stack>
#include <vector>
using namespace std;
#define bit(x, i) (x & (1 << i)) // select the bit of position i of x
#define lowbit(x) ((x) & ((x) ^ ((x)-1))) // get the lowest bit of x
#define hBit(msb, n) \
asm("bsrl %1,%0" \
: "=r"(msb) \
: "r"(n)) // get the highest bit of x, maybe the fastest
#define max(a, b) (a < b ? b : a)
#define IN(i, l, r) (l < i && i < r) // the next for are for checking bound
#define LINR(i, l, r) (l <= i && i <= r)
#define LIN(i, l, r) (l <= i && i < r)
#define INR(i, l, r) (l < i && i <= r)
#define F(i, L, R) for (int i = L; i < R; i++) // next four are for "for loops"
#define FE(i, L, R) for (int i = L; i <= R; i++)
#define FF(i, L, R) for (int i = L; i > R; i--)
#define FFE(i, L, R) for (int i = L; i >= R; i--)
#define getI(a) \
scanf("%d", &a) // next three are handy ways to get ints, it's also force you
// to use '&' sign
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define wez(n) \
int(n); \
scanf( \
"%d", \
&(n)) // handy if the input is right after the definition of a variable
#define wez2(n, m) \
int(n), (m); \
scanf("%d %d", &(n), &(m))
#define wez3(n, m, k) \
int(n), (m), (k); \
scanf("%d %d %d", &(n), &(m), &(k))
#define TESTS wez(testow) while (testow--) // for multilple cases problems
#define whileZ \
int T; \
getI(T); \
while (T--) // the same as above
#define getS(x) scanf("%s", x) // get a char* string
#define clr(a, x) memset(a, x, sizeof(a)) // set elements of array to some value
#define char2Int(c) (c - '0')
#define lastEle(vec) vec[vec.size() - 1]
#define SZ(x) ((int)((x).size()))
#define REMAX(a, b) (a) = max((a), (b)) // set a to the maximum of a and b
#define REMIN(a, b) (a) = min((a), (b));
#define FOREACH(i, t) \
for (typeof(t.begin()) i = t.begin(); i != t.end(); \
i++) // traverse an STL data structure
#define ALL(c) (c).begin(), (c).end() // handy for function like "sort()"
#define PRESENT(c, x) ((c).find(x) != (c).end())
#define CPRESENT(c, x) (find(ALL(c), x) != (c).end())
#define ll \
long long // data types used often, but you don't want to type them time by
// time
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define IOS \
ios_base::sync_with_stdio(0); // to synchronize the input of cin and scanf
#define INF 1001001001
#define PI 3.1415926535897932384626
// for map, pair
#define mp make_pair
#define fi first
#define se second
// for debug
inline void pisz(int n) { printf("%d\n", n); }
#define DBG(vari) cerr << #vari << " = " << (vari) << endl;
#define printA(a, L, R) FE(i, L, R) cout << a[i] << (i == R ? '\n' : ' ')
#define printV(a) printA(a, 0, a.size() - 1)
#define MAXN 10000
// for vectors
#define pb push_back
typedef int elem_t;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
// directions
const int fx[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const int fxx[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
template <typename T, typename TT>
ostream &operator<<(ostream &s, pair<T, TT> t) {
return s << "(" << t.first << "," << t.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, vector<T> t) {
F(i, 0, SZ(t)) s << t[i] << " ";
return s;
}
ll mod = 1000000007;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll power(ll a, ll b, ll m) {
ll r = 1;
a = a % m;
while (b) {
if (b & 1)
r = r * a % m;
a = a * a % m;
b = b >> 1;
}
return r;
}
// std::vector<ll> v;
std::vector<ll> v[100000 + 1];
ll vis[100000 + 1];
ll dp[100000 + 1];
ll recurs(ll val) {
vis[val] = 1;
ll mx = 0;
for (int i = 0; i < v[val].size(); ++i) {
if (vis[v[val][i]] == 0) {
mx = max(1 + recurs(v[val][i]), mx);
} else {
mx = max(1 + dp[v[val][i]], mx);
}
/* code */
}
dp[val] = max(dp[val], mx);
return (dp[val]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
map<int, vector<int>> mp;
for (int i = 0; i < m; ++i) {
ll x, y;
cin >> x >> y;
// mp[x].push_back(y);
v[x].push_back(y);
/* code */
}
for (int i = 1; i < n + 1; ++i) {
if (vis[i] == 0)
recurs(i);
/* code */
}
ll ans = 0;
for (int i = 1; i <= n; ++i) {
ans = max(ans, dp[i]);
/* code */
}
cout << ans << "\n";
}
|
delete
| 148 | 154 | 148 | 148 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
/*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod 1000000007ll
// constexpr int mod = 998244353ll;
constexpr double PI = 3.141592653589793238462643383279;
// constexpr double eps = DBL_EPSILON;
typedef long long ll;
#ifdef int
#define inf (int)(3e18)
#else
#define inf (int)(5e8)
#endif
#define intt long long
#define itn long long
#define innt long long
#define P pair<long long, long long>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define rev_rep(i, n) for (int i = n - 1; i >= 0; i--)
#define REV_REP(i, n) for (int i = n; i >= 1; i--)
#define ALL(v) v.begin(), v.end()
#define smallpriority_queue(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
// Library
// モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y & 1) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
if (!x || x == 1) {
return false;
}
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// number of 2shinsuu keta
int bitketa(int x) {
int ans = 0;
while (x) {
x >>= 1;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x >>= 1;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
// 入出力高速化時にはoff！！！！
// #define vecin(v) for(int i=0;i<v.size();i++)scanf("%lld",&v[i]);
// #define vecout(v) {if(v.size())printf("%lld",v[0]);for(int
// i=1;i<(int)v.size();i++)printf(" %lld",v[i]);printf("\n");}
template <class T> class SegTree {
int n;
vector<T> node;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
public:
SegTree(unsigned int _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
node = vector<T>(n * 2, def);
}
SegTree(vector<int> &initvec, function<T(T, T)> _operation,
function<T(T, T)> _update)
: operation(_operation), update(_update) {
n = 1;
while (n < initvec.size()) {
n *= 2;
}
node = vector<T>(n * 2, def);
for (int i = n; i < n + initvec.size(); i++) {
node[i] = initvec[i - n];
}
for (int i = n - 1; i >= 1; i--) {
node[i] = operation(node[i * 2], node[i * 2 + 1]);
}
}
void change(int i, T x) {
i += n;
node[i] = update(node[i], x);
while (i >= 1) {
i >>= 1;
node[i] = operation(node[i * 2], node[i * 2 + 1]);
}
}
T query(int l, int r) {
l += n;
r += n;
T rx = def, lx = def;
while (l < r) {
if (l & 1) {
lx = operation(lx, node[l]);
l++;
}
if (r & 1) {
r--;
rx = operation(node[r], rx);
}
l >>= 1;
r >>= 1;
}
return operation(lx, rx);
}
T operator[](const int &x) { return node[x + n]; }
void fill(T x) { std::fill(ALL(node), x); }
void print() {
rep(i, n) std::cout << operator[](i) << " ";
std::cout << std::endl;
}
T queryForALL() { return node[1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (ookisa[x] < ookisa[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
class BIT {
vector<int> data;
int size = 0;
public:
BIT(int _size) {
data = vector<int>(_size + 1);
size = _size;
}
void add(int i, int x) {
while (i <= size) {
data[i] += x;
i += i & -i;
}
}
int sum(int i) {
assert(i <= size);
int s = 0;
while (i > 0) {
s += data[i];
i -= i & -i;
}
return s;
}
int lower_bound(int x) {
if (x <= 0) {
return 0;
} else {
int i = 0;
int r = 1;
while (r < size)
r = r << 1;
for (int len = r; len > 0; len = len >> 1) {
if (i + len < size && data[i + len] < x) {
x -= data[i + len];
i += len;
}
}
return i + 1;
}
}
};
// Union-Find-End
int perm[2000005];
void init_perm() {
perm[0] = 1;
REP(i, 2000004) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
if (y > x) {
return 0;
}
if (x < 0) {
return 0;
}
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
struct Dot {
double x;
double y;
Dot(double _x = 0.0, double _y = 0.0) {
x = _x;
y = _y;
}
};
struct Dot_i {
int x;
int y;
Dot_i(int _x = 0, int _y = 0) {
x = _x;
y = _y;
}
};
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
double kyori(Dot f, Dot s) {
double ans = 0;
double t = fabs(f.x - s.x);
double y = fabs(f.y - s.y);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
// vector<int> RollingHash(string &s, string& t){
// vector<int> ans;
// __int128 h=0,hamod=0,ki=0,kim=0,hikaku=0,one=0;
// one=1;
// ki=1000000007ll;
// hamod=(one<<61)-1;
// kim=1;
// rep(i,t.size()){
// hikaku*=ki;
// h*=ki;
// kim*=ki;
// hikaku+=t[i];
// h+=s[i];
// hikaku%=hamod;
// h%=hamod;
// kim%=hamod;
// }
// rep(i,(int)s.size()-(int)t.size()+1){
// if (h==hikaku) {
// ans.emplace_back(i);
// }
// h*=ki;
// h%=hamod;
// h+=s[i+(int)t.size()];
// h%=hamod;
// h+=hamod;
// h-=s[i]*kim%hamod;
// h%=hamod;
// }
// return ans;
// }
struct edge {
int to;
int length;
edge(int _to, int _length) {
to = _to;
length = _length;
}
};
vector<int> djkstra(vector<vector<edge>> &road, int start) {
vector<int> kyo(road.size(), inf);
smallpriority_queue(P) q;
q.push({0, start});
kyo[start] = 0;
while (q.size()) {
int x = q.top().second;
itn now = q.top().first;
q.pop();
if (kyo[x] < now) {
continue;
}
for (auto &i : road[x]) {
if (kyo[i.to] > now + i.length) {
kyo[i.to] = now + i.length;
q.push({kyo[i.to], i.to});
}
}
}
return kyo;
}
template <class T> void change_to_unique(vector<T> &v) {
std::sort(ALL(v));
auto k = unique(ALL(v));
if (k != v.end())
v.erase(k, v.end());
}
double kodo_dosuu(double r) { return 180.0 * r / (double)PI; }
double dosuu_kodo(double r) { return r * (double)PI / 180.0; }
double kakudo(Dot a, Dot b1, Dot b2) {
double size1 = kyori(a, b1), size2 = kyori(a, b2);
double nai = (b1.x - a.x) * (b2.x - a.x) + (b1.y - a.y) * (b2.y - a.y);
nai /= size1 * size2;
return kodo_dosuu(acos(nai));
}
struct fraction {
int shi;
int bo;
fraction(int bunshi, int bunbo) : bo(bunbo), shi(bunshi) {
if (bunbo && bunshi) {
int g = gcd(bo, shi);
bo /= g;
shi /= g;
}
};
explicit inline operator double() const { return (double)shi / (double)bo; }
explicit inline operator long double() const {
return (long double)shi / (long double)bo;
}
};
bool operator<(const fraction &b1, const fraction &b2) {
return b1.shi * b2.bo < b2.shi * b1.bo;
}
bool operator>(const fraction &b1, const fraction &b2) {
return b1.shi * b2.bo > b2.shi * b1.bo;
}
template <class T> void vecout(vector<T> &v) {
if (v.size()) {
cout << v[0];
}
REP(i, (int)v.size() - 1) { cout << ' ' << v[i]; }
cout << endl;
}
#define endl "\n" // interactive の時に注意！！！
#define Endl "\n" // interactive の時に注意！！！
#define cinn cin
#define printd cout << fixed << setprecision(10)
#define rrep(i, f, s) for (int i = f; i < s; i++)
#define RREP(i, f, s) for (int i = f; i <= s; i++)
#define REV_RREP(i, f, s) for (int i = s; i >= f; i--)
#define hen_rep(i, l, step) for (int i = 0; i < l; i += step)
#define HEN_REP(i, l, step) for (int i = 1; i <= l; i += step)
int n, m, x, y, ans;
vector<int> road[100004], topo;
int dp[100004];
int dfs(int x) {
if (dp[x] != -1) {
return dp[x];
}
int ka = 0;
for (auto &i : road[x]) {
chmax(ka, dfs(i) + 1);
}
return ka;
}
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> m;
rep(i, m) {
cin >> x >> y;
road[x].emplace_back(y);
}
REP(i, n) dp[i] = -1;
REP(i, n) chmax(ans, dfs(i));
cout << ans << Endl;
}
|
/*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod 1000000007ll
// constexpr int mod = 998244353ll;
constexpr double PI = 3.141592653589793238462643383279;
// constexpr double eps = DBL_EPSILON;
typedef long long ll;
#ifdef int
#define inf (int)(3e18)
#else
#define inf (int)(5e8)
#endif
#define intt long long
#define itn long long
#define innt long long
#define P pair<long long, long long>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define rev_rep(i, n) for (int i = n - 1; i >= 0; i--)
#define REV_REP(i, n) for (int i = n; i >= 1; i--)
#define ALL(v) v.begin(), v.end()
#define smallpriority_queue(T) priority_queue<T, vector<T>, greater<T>>
using namespace std;
// Library
// モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y & 1) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
if (!x || x == 1) {
return false;
}
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// number of 2shinsuu keta
int bitketa(int x) {
int ans = 0;
while (x) {
x >>= 1;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x >>= 1;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
// 入出力高速化時にはoff！！！！
// #define vecin(v) for(int i=0;i<v.size();i++)scanf("%lld",&v[i]);
// #define vecout(v) {if(v.size())printf("%lld",v[0]);for(int
// i=1;i<(int)v.size();i++)printf(" %lld",v[i]);printf("\n");}
template <class T> class SegTree {
int n;
vector<T> node;
T def;
function<T(T, T)> operation;
function<T(T, T)> update;
public:
SegTree(unsigned int _n, T _def, function<T(T, T)> _operation,
function<T(T, T)> _update)
: def(_def), operation(_operation), update(_update) {
n = 1;
while (n < _n) {
n *= 2;
}
node = vector<T>(n * 2, def);
}
SegTree(vector<int> &initvec, function<T(T, T)> _operation,
function<T(T, T)> _update)
: operation(_operation), update(_update) {
n = 1;
while (n < initvec.size()) {
n *= 2;
}
node = vector<T>(n * 2, def);
for (int i = n; i < n + initvec.size(); i++) {
node[i] = initvec[i - n];
}
for (int i = n - 1; i >= 1; i--) {
node[i] = operation(node[i * 2], node[i * 2 + 1]);
}
}
void change(int i, T x) {
i += n;
node[i] = update(node[i], x);
while (i >= 1) {
i >>= 1;
node[i] = operation(node[i * 2], node[i * 2 + 1]);
}
}
T query(int l, int r) {
l += n;
r += n;
T rx = def, lx = def;
while (l < r) {
if (l & 1) {
lx = operation(lx, node[l]);
l++;
}
if (r & 1) {
r--;
rx = operation(node[r], rx);
}
l >>= 1;
r >>= 1;
}
return operation(lx, rx);
}
T operator[](const int &x) { return node[x + n]; }
void fill(T x) { std::fill(ALL(node), x); }
void print() {
rep(i, n) std::cout << operator[](i) << " ";
std::cout << std::endl;
}
T queryForALL() { return node[1]; }
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (ookisa[x] < ookisa[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
class BIT {
vector<int> data;
int size = 0;
public:
BIT(int _size) {
data = vector<int>(_size + 1);
size = _size;
}
void add(int i, int x) {
while (i <= size) {
data[i] += x;
i += i & -i;
}
}
int sum(int i) {
assert(i <= size);
int s = 0;
while (i > 0) {
s += data[i];
i -= i & -i;
}
return s;
}
int lower_bound(int x) {
if (x <= 0) {
return 0;
} else {
int i = 0;
int r = 1;
while (r < size)
r = r << 1;
for (int len = r; len > 0; len = len >> 1) {
if (i + len < size && data[i + len] < x) {
x -= data[i + len];
i += len;
}
}
return i + 1;
}
}
};
// Union-Find-End
int perm[2000005];
void init_perm() {
perm[0] = 1;
REP(i, 2000004) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
if (y > x) {
return 0;
}
if (x < 0) {
return 0;
}
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
struct Dot {
double x;
double y;
Dot(double _x = 0.0, double _y = 0.0) {
x = _x;
y = _y;
}
};
struct Dot_i {
int x;
int y;
Dot_i(int _x = 0, int _y = 0) {
x = _x;
y = _y;
}
};
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
double kyori(Dot f, Dot s) {
double ans = 0;
double t = fabs(f.x - s.x);
double y = fabs(f.y - s.y);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
// vector<int> RollingHash(string &s, string& t){
// vector<int> ans;
// __int128 h=0,hamod=0,ki=0,kim=0,hikaku=0,one=0;
// one=1;
// ki=1000000007ll;
// hamod=(one<<61)-1;
// kim=1;
// rep(i,t.size()){
// hikaku*=ki;
// h*=ki;
// kim*=ki;
// hikaku+=t[i];
// h+=s[i];
// hikaku%=hamod;
// h%=hamod;
// kim%=hamod;
// }
// rep(i,(int)s.size()-(int)t.size()+1){
// if (h==hikaku) {
// ans.emplace_back(i);
// }
// h*=ki;
// h%=hamod;
// h+=s[i+(int)t.size()];
// h%=hamod;
// h+=hamod;
// h-=s[i]*kim%hamod;
// h%=hamod;
// }
// return ans;
// }
struct edge {
int to;
int length;
edge(int _to, int _length) {
to = _to;
length = _length;
}
};
vector<int> djkstra(vector<vector<edge>> &road, int start) {
vector<int> kyo(road.size(), inf);
smallpriority_queue(P) q;
q.push({0, start});
kyo[start] = 0;
while (q.size()) {
int x = q.top().second;
itn now = q.top().first;
q.pop();
if (kyo[x] < now) {
continue;
}
for (auto &i : road[x]) {
if (kyo[i.to] > now + i.length) {
kyo[i.to] = now + i.length;
q.push({kyo[i.to], i.to});
}
}
}
return kyo;
}
template <class T> void change_to_unique(vector<T> &v) {
std::sort(ALL(v));
auto k = unique(ALL(v));
if (k != v.end())
v.erase(k, v.end());
}
double kodo_dosuu(double r) { return 180.0 * r / (double)PI; }
double dosuu_kodo(double r) { return r * (double)PI / 180.0; }
double kakudo(Dot a, Dot b1, Dot b2) {
double size1 = kyori(a, b1), size2 = kyori(a, b2);
double nai = (b1.x - a.x) * (b2.x - a.x) + (b1.y - a.y) * (b2.y - a.y);
nai /= size1 * size2;
return kodo_dosuu(acos(nai));
}
struct fraction {
int shi;
int bo;
fraction(int bunshi, int bunbo) : bo(bunbo), shi(bunshi) {
if (bunbo && bunshi) {
int g = gcd(bo, shi);
bo /= g;
shi /= g;
}
};
explicit inline operator double() const { return (double)shi / (double)bo; }
explicit inline operator long double() const {
return (long double)shi / (long double)bo;
}
};
bool operator<(const fraction &b1, const fraction &b2) {
return b1.shi * b2.bo < b2.shi * b1.bo;
}
bool operator>(const fraction &b1, const fraction &b2) {
return b1.shi * b2.bo > b2.shi * b1.bo;
}
template <class T> void vecout(vector<T> &v) {
if (v.size()) {
cout << v[0];
}
REP(i, (int)v.size() - 1) { cout << ' ' << v[i]; }
cout << endl;
}
#define endl "\n" // interactive の時に注意！！！
#define Endl "\n" // interactive の時に注意！！！
#define cinn cin
#define printd cout << fixed << setprecision(10)
#define rrep(i, f, s) for (int i = f; i < s; i++)
#define RREP(i, f, s) for (int i = f; i <= s; i++)
#define REV_RREP(i, f, s) for (int i = s; i >= f; i--)
#define hen_rep(i, l, step) for (int i = 0; i < l; i += step)
#define HEN_REP(i, l, step) for (int i = 1; i <= l; i += step)
int n, m, x, y, ans;
vector<int> road[100004], topo;
int dp[100004];
int dfs(int x) {
if (dp[x] != -1) {
return dp[x];
}
int ka = 0;
for (auto &i : road[x]) {
chmax(ka, dfs(i) + 1);
}
return dp[x] = ka;
}
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cin >> n >> m;
rep(i, m) {
cin >> x >> y;
road[x].emplace_back(y);
}
REP(i, n) dp[i] = -1;
REP(i, n) chmax(ans, dfs(i));
cout << ans << Endl;
}
|
replace
| 577 | 578 | 577 | 578 |
TLE
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.