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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ff first
#define endl "\n"
#define ss second
#define li list<int>
#define vi vector<int>
#define ll long long int
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define custom pair<int, pair<int, int>>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define mod 1000000007
int dp[100001];
vector<int> graph[100001];
int solve(int node) {
if (dp[node] != -1) {
return dp[node];
}
bool flag = true;
int bestans = 0;
for (auto child : graph[node]) {
flag = false;
bestans = max(bestans, solve(child));
}
return flag ? 0 : 1 + bestans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].pb(y);
}
memset(dp, -1, sizeof dp);
int ans = INT_MIN;
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>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ff first
#define endl "\n"
#define ss second
#define li list<int>
#define vi vector<int>
#define ll long long int
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define custom pair<int, pair<int, int>>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define mod 1000000007
int dp[100001];
vector<int> graph[100001];
int solve(int node) {
if (dp[node] != -1) {
return dp[node];
}
bool flag = true;
int bestans = 0;
for (auto child : graph[node]) {
flag = false;
bestans = max(bestans, solve(child));
}
return dp[node] = flag ? 0 : 1 + bestans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].pb(y);
}
memset(dp, -1, sizeof dp);
int ans = INT_MIN;
for (int i = 1; i <= n; i++) {
ans = max(ans, solve(i));
}
cout << ans;
return 0;
}
|
replace
| 34 | 35 | 34 | 35 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef vector<cd> vcd;
typedef vector<int> vi;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxN = 1e5;
int n, m;
vi adj[maxN];
int deg[maxN];
int dp[maxN];
bool flag[maxN];
void DFS(int u) {
flag[u] = 1;
dp[u] = 0;
for (auto &v : adj[u]) {
if (!flag[v]) {
DFS(v);
}
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
adj[v].eb(u);
++deg[u];
}
for1(u, n) {
if (!flag[u] && deg[u] == 0) {
DFS(u);
}
}
cout << *max_element(dp + 1, dp + n + 1);
return 0;
}
|
#include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef vector<cd> vcd;
typedef vector<int> vi;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 1;
int n, m;
vi adj[maxN];
int deg[maxN];
int dp[maxN];
bool flag[maxN];
void DFS(int u) {
flag[u] = 1;
dp[u] = 0;
for (auto &v : adj[u]) {
if (!flag[v]) {
DFS(v);
}
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
adj[v].eb(u);
++deg[u];
}
for1(u, n) {
if (!flag[u] && deg[u] == 0) {
DFS(u);
}
}
cout << *max_element(dp + 1, dp + n + 1);
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <climits>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef vector<vector<int>> matrix;
int N, M;
int solve_rec(matrix &G, int u, vector<int> &DP) {
if (DP[u] != -1)
return DP[u];
int massimo = 0;
for (int i = 0; i < G[u].size(); i++) {
massimo = max(solve_rec(G, G[u][i], DP), massimo);
}
return massimo + 1;
}
int solve(matrix &G) {
vector<int> DP(N, -1);
int ret = -1;
for (int i = 0; i < N; i++) {
DP[i] = solve_rec(G, i, DP);
}
for (int i = 0; i < N; i++) {
ret = max(ret, DP[i]);
// cout << DP[i] << " (" << i << ") " ;
}
return ret - 1;
}
int main(int argc, char **argv) {
cin >> N >> M;
matrix G(N, vector<int>());
for (int i = 0; i < M; i++) {
int p, e;
cin >> p >> e;
G[p - 1].push_back(e - 1);
}
cout << solve(G);
return 0;
}
|
#include <climits>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef vector<vector<int>> matrix;
int N, M;
int solve_rec(matrix &G, int u, vector<int> &DP) {
if (DP[u] != -1)
return DP[u];
int massimo = 0;
for (int i = 0; i < G[u].size(); i++) {
massimo = max(solve_rec(G, G[u][i], DP), massimo);
}
DP[u] = massimo + 1;
return massimo + 1;
}
int solve(matrix &G) {
vector<int> DP(N, -1);
int ret = -1;
for (int i = 0; i < N; i++) {
DP[i] = solve_rec(G, i, DP);
}
for (int i = 0; i < N; i++) {
ret = max(ret, DP[i]);
// cout << DP[i] << " (" << i << ") " ;
}
return ret - 1;
}
int main(int argc, char **argv) {
cin >> N >> M;
matrix G(N, vector<int>());
for (int i = 0; i < M; i++) {
int p, e;
cin >> p >> e;
G[p - 1].push_back(e - 1);
}
cout << solve(G);
return 0;
}
|
insert
| 19 | 19 | 19 | 20 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <cmath>
#include <iostream>
#include <unistd.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int n, m;
vector<vector<int>> G;
vector<vector<int>> invG;
vector<int> memo;
int search(int v) {
if (invG[v].size() == 0) {
memo[v] = 0;
} else {
rep(i, invG[v].size()) { memo[v] = max(memo[v], search(invG[v][i]) + 1); }
}
return memo[v];
}
int main() {
cin >> n >> m;
G.resize(n);
invG.resize(n);
memo.resize(n);
rep(i, n) memo[i] = -1;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
G[x].push_back(y);
invG[y].push_back(x);
}
rep(i, n) search(i);
int ans = 0;
rep(i, n) ans = max(ans, memo[i]);
cout << ans << endl;
}
|
#include <cmath>
#include <iostream>
#include <unistd.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int n, m;
vector<vector<int>> G;
vector<vector<int>> invG;
vector<int> memo;
int search(int v) {
if (invG[v].size() == 0) {
memo[v] = 0;
} else {
rep(i, invG[v].size()) {
if (memo[invG[v][i]] != -1) {
memo[v] = max(memo[v], memo[invG[v][i]] + 1);
continue;
}
memo[v] = max(memo[v], search(invG[v][i]) + 1);
}
}
return memo[v];
}
int main() {
cin >> n >> m;
G.resize(n);
invG.resize(n);
memo.resize(n);
rep(i, n) memo[i] = -1;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
G[x].push_back(y);
invG[y].push_back(x);
}
rep(i, n) search(i);
int ans = 0;
rep(i, n) ans = max(ans, memo[i]);
cout << ans << endl;
}
|
replace
| 17 | 18 | 17 | 24 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
template <typename T> void min_self(T &a, T b) { a = min(a, b); }
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
const int Nax = 1e5 + 5;
vector<int> edges[Nax];
bool visited[Nax];
int dist[Nax];
int in[Nax];
void dfs(int a) {
visited[a] = true;
for (int b : edges[a]) {
dist[b] = max(dist[b], 1 + dist[a]);
dfs(b);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
int a, b;
while (M--) {
cin >> a >> b;
edges[a].push_back(b);
++in[b];
}
for (int i = 1; i <= N; ++i) {
if (!visited[i] && in[i] == 0) {
dfs(i);
}
}
cout << *max_element(dist + 1, dist + N + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
template <typename T> void min_self(T &a, T b) { a = min(a, b); }
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
const int Nax = 1e5 + 5;
vector<int> edges[Nax];
bool visited[Nax];
int dist[Nax];
int in[Nax];
void dfs(int a) {
visited[a] = true;
for (int b : edges[a]) {
dist[b] = max(dist[b], 1 + dist[a]);
if (--in[b] == 0) {
dfs(b);
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
int a, b;
while (M--) {
cin >> a >> b;
edges[a].push_back(b);
++in[b];
}
for (int i = 1; i <= N; ++i) {
if (!visited[i] && in[i] == 0) {
dfs(i);
}
}
cout << *max_element(dist + 1, dist + N + 1);
}
|
replace
| 25 | 26 | 25 | 28 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// @ /\/\ BESH //
#include <bits/stdc++.h>
#define inp_out_work \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define testCase \
int T; \
cin >> T; \
while (T--)
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, s, e) for (int i = s; i <= e; i++)
#define endl '\n'
#define debug(P) cout << #P << " = " << P << endl;
#define pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 100001;
const int mod = 1000000007;
vector<int> adj[MAXN];
vector<int> bdj[MAXN];
int mxdis[MAXN];
void dfs(int x, bool vis[]) {
vis[x] = 1;
for (int c : adj[x]) {
dfs(c, vis);
mxdis[x] = max(mxdis[x], mxdis[c] + 1);
}
}
int solve(int n) {
bool vis[n + 1];
fill(vis, vis + n + 1, 0);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i, vis);
}
ans = max(ans, mxdis[i]);
}
return ans;
}
int main() {
inp_out_work int n, m;
cin >> n >> m;
fr(i, m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
bdj[v].pb(u);
}
cout << solve(n);
}
|
// @ /\/\ BESH //
#include <bits/stdc++.h>
#define inp_out_work \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define testCase \
int T; \
cin >> T; \
while (T--)
#define fr(i, n) for (int i = 0; i < n; i++)
#define fro(i, s, e) for (int i = s; i <= e; i++)
#define endl '\n'
#define debug(P) cout << #P << " = " << P << endl;
#define pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 100001;
const int mod = 1000000007;
vector<int> adj[MAXN];
vector<int> bdj[MAXN];
int mxdis[MAXN];
void dfs(int x, bool vis[]) {
vis[x] = 1;
for (int c : adj[x]) {
if (!vis[c])
dfs(c, vis);
mxdis[x] = max(mxdis[x], mxdis[c] + 1);
}
}
int solve(int n) {
bool vis[n + 1];
fill(vis, vis + n + 1, 0);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i, vis);
}
ans = max(ans, mxdis[i]);
}
return ans;
}
int main() {
inp_out_work int n, m;
cin >> n >> m;
fr(i, m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
bdj[v].pb(u);
}
cout << solve(n);
}
|
replace
| 32 | 33 | 32 | 34 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
vector<int> dp(100001);
int n, m, x, y;
int vis[100001] = {0};
vector<int> g[100001];
int solve(int vertex) {
vis[vertex] = 1;
dp[vertex] = 0;
for (int child : g[vertex]) {
if (!vis[child]) {
solve(child);
}
dp[vertex] = max(dp[vertex], 1 + dp[child]);
}
}
int main() {
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (ll i = 1; i <= n; i++) {
if (!vis[i]) {
solve(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
vector<int> dp(100001);
int n, m, x, y;
int vis[100001] = {0};
vector<int> g[100001];
void solve(int vertex) {
vis[vertex] = 1;
dp[vertex] = 0;
for (int child : g[vertex]) {
if (!vis[child]) {
solve(child);
}
dp[vertex] = max(dp[vertex], 1 + dp[child]);
}
}
int main() {
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (ll i = 1; i <= n; i++) {
if (!vis[i]) {
solve(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
|
replace
| 7 | 8 | 7 | 8 |
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 std;
using namespace __gnu_pbds;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define int long long
#define fr first
#define sc second
#define vc vector
#define endl '\n'
#define pii pair<int, int>
#define msi map<string, int>
#define mii map<int, int>
#define psi pair<string, int>
#define pis pair<int, string>
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define LSB(i) ((i) & -(i))
template <typename T>
using oset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 5;
int n, m;
vc<int> g[N];
int dp[N];
int DFS(int v) {
if (dp[v] != -1)
return dp[v];
int ans = 0;
for (auto u : g[v]) {
ans = max(ans, DFS(u) + 1);
}
return ans;
}
void solve() {
cin >> n >> m;
mem1(dp);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[x].pb(y);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, DFS(i));
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define int long long
#define fr first
#define sc second
#define vc vector
#define endl '\n'
#define pii pair<int, int>
#define msi map<string, int>
#define mii map<int, int>
#define psi pair<string, int>
#define pis pair<int, string>
#define mem1(a) memset(a, -1, sizeof(a))
#define mem0(a) memset(a, 0, sizeof(a))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define LSB(i) ((i) & -(i))
template <typename T>
using oset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 5;
int n, m;
vc<int> g[N];
int dp[N];
int DFS(int v) {
if (dp[v] != -1)
return dp[v];
int ans = 0;
for (auto u : g[v]) {
ans = max(ans, DFS(u) + 1);
}
dp[v] = ans;
return ans;
}
void solve() {
cin >> n >> m;
mem1(dp);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[x].pb(y);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, DFS(i));
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
insert
| 42 | 42 | 42 | 43 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<int, int>
const int N = 505, M = N, inf = (int)1e9;
const ll mod = 1e9 + 7;
int fastAbs(int n) { return (n ^ (n >> 31)) - (n >> 31); }
ll multiply(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a % mod) - (b % mod) + mod) % mod; }
int ans = INT_MAX;
map<pair<int, int>, int> mp;
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
vector<int> tree[N];
vector<bool> visited(N, 0);
vector<int> long_path(N, 0);
void dfs(int x) {
visited[x] = true;
for (int child = 0; child < tree[x].size(); child++) {
if (!visited[tree[x][child]])
dfs(tree[x][child]);
long_path[x] = max(long_path[x], long_path[tree[x][child]] + 1);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
tree[x].PB(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
cout << *max_element(st(long_path));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
while (q--)
solve();
}
|
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
#define PB push_back
#define ld long double
#define ff first
#define ss second
#define st(v) (v).begin(), (v).end()
#define pr pair<int, int>
const int N = 1e5 + 4, M = N, inf = (int)1e9;
const ll mod = 1e9 + 7;
int fastAbs(int n) { return (n ^ (n >> 31)) - (n >> 31); }
ll multiply(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a % mod) - (b % mod) + mod) % mod; }
int ans = INT_MAX;
map<pair<int, int>, int> mp;
const int dx[4] = {1, 0, 0, -1};
const int dy[4] = {0, -1, 1, 0};
vector<int> tree[N];
vector<bool> visited(N, 0);
vector<int> long_path(N, 0);
void dfs(int x) {
visited[x] = true;
for (int child = 0; child < tree[x].size(); child++) {
if (!visited[tree[x][child]])
dfs(tree[x][child]);
long_path[x] = max(long_path[x], long_path[tree[x][child]] + 1);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
tree[x].PB(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
cout << *max_element(st(long_path));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
while (q--)
solve();
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
const int MAX = 1e5 + 7;
vector<int> graph[MAX];
bool vis[MAX];
int dp[MAX];
int dfs(int s) {
if (vis[s])
return dp[s];
for (int i = 0; i < graph[s].size(); ++i) {
int t = graph[s][i];
dp[s] = max(dp[s], dfs(t) + 1);
}
return dp[s];
}
int main() {
// freopen("tree.in","r",stdin);
// freopen("tree.out","w",stdout);
// freopen("input.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ios_base::sync_with_stdio(0);
// cin.tie(0);
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int u, v;
cin >> u >> v;
graph[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= N; ++i) {
ans = max(ans, dfs(i));
// cout << ans << endl;
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
const int MAX = 1e5 + 7;
vector<int> graph[MAX];
bool vis[MAX];
int dp[MAX];
int dfs(int s) {
if (vis[s])
return dp[s];
vis[s] = true;
for (int i = 0; i < graph[s].size(); ++i) {
int t = graph[s][i];
dp[s] = max(dp[s], dfs(t) + 1);
}
return dp[s];
}
int main() {
// freopen("tree.in","r",stdin);
// freopen("tree.out","w",stdout);
// freopen("input.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ios_base::sync_with_stdio(0);
// cin.tie(0);
int N, M;
cin >> N >> M;
for (int i = 0; i < M; ++i) {
int u, v;
cin >> u >> v;
graph[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= N; ++i) {
ans = max(ans, dfs(i));
// cout << ans << endl;
}
cout << ans << endl;
}
|
insert
| 16 | 16 | 16 | 17 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <dirent.h>
#include <stdlib.h>
using namespace std;
#define sp << " " <<
typedef vector<int> vi;
typedef vector<long int> vli;
typedef vector<long long int> vlli;
typedef long int li;
typedef long long int lli;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<lli, lli>> vplli;
typedef unordered_map<int, int> ump;
int largest(vector<vector<int>> adjList, vector<int> &memo, int source) {
if (memo[source] != -1) {
return memo[source];
}
int ans = -1;
for (int val : adjList[source]) {
ans = max(ans, largest(adjList, memo, val));
}
memo[source] = ans + 1;
return ans + 1;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> adjList(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adjList[a - 1].push_back(b - 1);
}
vector<int> memo(n, -1);
int maxi = 0;
for (int i = 0; i < n; i++) {
maxi = max(maxi, largest(adjList, memo, i));
}
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <dirent.h>
#include <stdlib.h>
using namespace std;
#define sp << " " <<
typedef vector<int> vi;
typedef vector<long int> vli;
typedef vector<long long int> vlli;
typedef long int li;
typedef long long int lli;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<lli, lli>> vplli;
typedef unordered_map<int, int> ump;
int largest(vector<vector<int>> &adjList, vector<int> &memo, int source) {
if (memo[source] != -1) {
return memo[source];
}
int ans = -1;
for (int val : adjList[source]) {
ans = max(ans, largest(adjList, memo, val));
}
memo[source] = ans + 1;
return ans + 1;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> adjList(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adjList[a - 1].push_back(b - 1);
}
vector<int> memo(n, -1);
int maxi = 0;
for (int i = 0; i < n; i++) {
maxi = max(maxi, largest(adjList, memo, i));
}
cout << maxi << endl;
return 0;
}
|
replace
| 15 | 16 | 15 | 16 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// Author:: MUKUL KUMAR RAI
// Institution:: Jalpaiguri Government Engineering College
// If you are not doing well now just stick to it and learn new things one day
// you will be... Compete with yourself
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
///*template{{{
#define sz(x) (ll) x.size()
#define all(x) (x.begin(), x.end())
#define trav(a, x) for (auto &a : x)
#define fr(i, a, b) for (ll i = a; i <= b; i++)
#define fr1(i, a) for (ll i = 0; i < a; i++)
#define frr(i, a, b) for (ll i = b; i >= a; i--)
#define frr1(i, a) for (ll i = a - 1; i >= 0; i--)
#define sorta(a, n) sort(a, a + n)
#define sortd(a, n) sort(a, a + n, greater<ll>())
#define sortva(a) sort(a.begin(), a.end())
#define sortvd(a) sort(a.begin(), a.end(), greater<ll>())
#define tc(t) while (t--)
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<ld>;
using pii = pair<ll, ll>;
using psi = pair<string, ll>;
using pci = pair<char, ll>;
using vpii = vector<pii>;
//}}}template*/
ll mod = 1e9 + 7;
ll const maxn = 1e5 + 5;
ll const inf = 1e18;
bool ss(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return a.first * b.second + a.second < b.first * a.second + b.second;
}
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll modinverse(ll a, ll m) { return powm(a, m - 2, m); }
bool prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return false;
return true;
}
ll divisor(ll x) {
ll cnt = 0;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (i != x / i)
cnt += 2;
else
cnt += 1;
}
}
return cnt;
}
vector<ll> sieve(ll n) {
bool prim[n + 1];
memset(prim, true, sizeof(prim));
for (ll p = 2; p * p <= n; p++) {
if (prim[p] == true) {
for (int i = p * p; i <= n; i += p)
prim[i] = false;
}
}
vector<ll> v;
for (int i = 2; i <= n; i++)
if (prim[i])
v.push_back(i);
return v;
}
bool check(string s) {
ll l = 0, r = sz(s) - 1;
while (l <= r) {
if (s[l] != s[r])
return false;
l++;
r--;
}
return true;
}
vvi adj(maxn);
vb vis(maxn);
vi indegree(maxn);
vi ans(maxn);
void dfs(ll v) {
vis[v] = true;
for (auto u : adj[v]) {
ans[u] = max(ans[u], ans[v] + 1);
--indegree[u];
if (indegree[u] == 0)
dfs(u);
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fio;
ll n, m;
cin >> n >> m;
fr(i, 1, m) {
ll x, y;
cin >> x >> y;
adj[x].pb(y);
++indegree[y];
}
fr(i, 1, n) {
if (!vis[i] and indegree[i] == 0)
dfs(i);
}
ll x = *max_element(ans.begin(), ans.end());
cout << x;
return 0;
}
|
// Author:: MUKUL KUMAR RAI
// Institution:: Jalpaiguri Government Engineering College
// If you are not doing well now just stick to it and learn new things one day
// you will be... Compete with yourself
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
///*template{{{
#define sz(x) (ll) x.size()
#define all(x) (x.begin(), x.end())
#define trav(a, x) for (auto &a : x)
#define fr(i, a, b) for (ll i = a; i <= b; i++)
#define fr1(i, a) for (ll i = 0; i < a; i++)
#define frr(i, a, b) for (ll i = b; i >= a; i--)
#define frr1(i, a) for (ll i = a - 1; i >= 0; i--)
#define sorta(a, n) sort(a, a + n)
#define sortd(a, n) sort(a, a + n, greater<ll>())
#define sortva(a) sort(a.begin(), a.end())
#define sortvd(a) sort(a.begin(), a.end(), greater<ll>())
#define tc(t) while (t--)
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<ld>;
using pii = pair<ll, ll>;
using psi = pair<string, ll>;
using pci = pair<char, ll>;
using vpii = vector<pii>;
//}}}template*/
ll mod = 1e9 + 7;
ll const maxn = 1e5 + 5;
ll const inf = 1e18;
bool ss(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return a.first * b.second + a.second < b.first * a.second + b.second;
}
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll modinverse(ll a, ll m) { return powm(a, m - 2, m); }
bool prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return false;
return true;
}
ll divisor(ll x) {
ll cnt = 0;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (i != x / i)
cnt += 2;
else
cnt += 1;
}
}
return cnt;
}
vector<ll> sieve(ll n) {
bool prim[n + 1];
memset(prim, true, sizeof(prim));
for (ll p = 2; p * p <= n; p++) {
if (prim[p] == true) {
for (int i = p * p; i <= n; i += p)
prim[i] = false;
}
}
vector<ll> v;
for (int i = 2; i <= n; i++)
if (prim[i])
v.push_back(i);
return v;
}
bool check(string s) {
ll l = 0, r = sz(s) - 1;
while (l <= r) {
if (s[l] != s[r])
return false;
l++;
r--;
}
return true;
}
vvi adj(maxn);
vb vis(maxn);
vi indegree(maxn);
vi ans(maxn);
void dfs(ll v) {
vis[v] = true;
for (auto u : adj[v]) {
ans[u] = max(ans[u], ans[v] + 1);
--indegree[u];
if (indegree[u] == 0)
dfs(u);
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
fio;
ll n, m;
cin >> n >> m;
fr(i, 1, m) {
ll x, y;
cin >> x >> y;
adj[x].pb(y);
++indegree[y];
}
fr(i, 1, n) {
if (!vis[i] and indegree[i] == 0)
dfs(i);
}
ll x = *max_element(ans.begin(), ans.end());
cout << x;
return 0;
}
|
replace
| 117 | 121 | 117 | 121 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define INF 1000000001
vector<vector<int>> g;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int rec(vector<int> &dp, int sv) {
if (dp[sv] != -1)
return dp[sv];
if (g[sv].empty())
return dp[sv] = 0;
int ret = -1;
for (int v : g[sv])
ret = max(ret, rec(dp, g[sv][v]) + 1);
return dp[sv] = ret;
}
int main(void) {
int n, m;
cin >> n >> m;
g.assign(n, vector<int>());
vector<int> dp(n, -1);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ans = -1;
rep(i, n) ans = max(ans, rec(dp, i));
out(ans);
}
|
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define inp(X) cin >> X
#define out(X) cout << X << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define MAX(A) *max_element(A.begin(), A.end())
#define MIN(A) *min_element(A.begin(), A.end())
#define SORT(A) sort(A.begin(), A.end())
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define INF 1000000001
vector<vector<int>> g;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
bool bfs(vector<int> &dist, int sv) {
queue<int> q;
q.push(sv);
dist[sv] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto v : g[now]) {
if (dist[v] != -1)
continue;
dist[v] = dist[now] + 1;
q.push(v);
}
}
}
int rec(vector<int> &dp, int sv) {
if (dp[sv] != -1)
return dp[sv];
if (g[sv].empty())
return dp[sv] = 0;
int ret = -1;
for (int v : g[sv])
ret = max(ret, rec(dp, v) + 1);
return dp[sv] = ret;
}
int main(void) {
int n, m;
cin >> n >> m;
g.assign(n, vector<int>());
vector<int> dp(n, -1);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ans = -1;
rep(i, n) ans = max(ans, rec(dp, i));
out(ans);
}
|
replace
| 52 | 53 | 52 | 53 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> a[100002];
int f[100002];
int vis[100002];
int res = 0;
int cal(int u) {
vis[u] = 1;
for (int i = 0; i < a[u].size(); i++) {
if (vis[a[u][i]])
continue;
f[u] = max(f[u], cal(a[u][i]) + 1);
vis[a[u][i]] = 0;
}
res = max(res, f[u]);
return f[u];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1, x, y; i <= m; i++) {
cin >> x >> y;
a[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (f[i] != 0)
continue;
f[i] = 0;
cal(i);
vis[i] = 0;
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> a[100002];
int f[100002];
int vis[100002];
int res = 0;
int cal(int u) {
if (f[u] != 0)
return f[u];
vis[u] = 1;
for (int i = 0; i < a[u].size(); i++) {
if (vis[a[u][i]])
continue;
f[u] = max(f[u], cal(a[u][i]) + 1);
vis[a[u][i]] = 0;
}
res = max(res, f[u]);
return f[u];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1, x, y; i <= m; i++) {
cin >> x >> y;
a[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (f[i] != 0)
continue;
f[i] = 0;
cal(i);
vis[i] = 0;
}
cout << res;
}
|
insert
| 9 | 9 | 9 | 11 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/*-------------------------------"ANJAN AGARWALA"-----------------------------
_/_/_/_/ _/_/ _/ _/_/_/_/ _/_/_/_/ _/_/ _/
_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/
_/_/_/_/ _/ _/ _/ _/ _/_/_/_/ _/ _/ _/
_/ _/ _/ _/_/ _/ _/ _/ _/ _/ _/_/
_/ _/ _/ _/ _/_/_/_/ _/ _/ _/ _/
-------------------------------------@anjn98---------------------------------*/
// #define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long int LL;
typedef unsigned long long int ull;
ll power(ll x, ll y, ll p) {
ll r = 1;
x = x % p;
while (y) {
if (y & 1)
r = r * x % p;
y = y >> 1;
x = x * x % p;
}
return r;
}
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
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(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define PR(a) cout << "(" << a << ")";
#define ED cout << '\n';
// #define endl '\n'
#define loop(j, a, n) for (int j = a; j <= n; j++)
#define loop1(j, a, n) for (int j = a; j >= n; j--)
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define SC(n) scanf("%d", &n)
#define PB push_back
#define MP make_pair
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 1e5 + 99;
int indeg[N], len[N], n, m;
bool vis[N];
std::vector<int> g[N];
void dfs(int v) {
vis[v] = 1;
if (g[v].size() == 0) {
len[v] = 0;
return;
}
trav(x, g[v]) {
if (!vis[x])
dfs(x);
len[v] = max(len[v], 1 + len[x]);
}
}
int main() {
IO
#ifndef ONLINE_JUDGE
FILEIO
#endif
cin >>
n >> m;
fr(m) {
int x, y;
cin >> x >> y;
g[x].PB(y);
indeg[y]++;
}
for (int i = 1; i <= n; i++)
if (!indeg[i]) {
dfs(i);
}
ll ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, (ll)len[i]);
cout << ans << endl;
}
|
/*-------------------------------"ANJAN AGARWALA"-----------------------------
_/_/_/_/ _/_/ _/ _/_/_/_/ _/_/_/_/ _/_/ _/
_/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _/
_/_/_/_/ _/ _/ _/ _/ _/_/_/_/ _/ _/ _/
_/ _/ _/ _/_/ _/ _/ _/ _/ _/ _/_/
_/ _/ _/ _/ _/_/_/_/ _/ _/ _/ _/
-------------------------------------@anjn98---------------------------------*/
// #define opti
#ifdef opti
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long int LL;
typedef unsigned long long int ull;
ll power(ll x, ll y, ll p) {
ll r = 1;
x = x % p;
while (y) {
if (y & 1)
r = r * x % p;
y = y >> 1;
x = x * x % p;
}
return r;
}
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
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(false); \
cin.tie(0); \
cout.tie(0);
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define all(v) v.begin(), v.end()
#define PR(a) cout << "(" << a << ")";
#define ED cout << '\n';
// #define endl '\n'
#define loop(j, a, n) for (int j = a; j <= n; j++)
#define loop1(j, a, n) for (int j = a; j >= n; j--)
#define fr1(j, n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = 0; i < n; i++)
#define trav(x, s) for (auto x : s)
#define SC(n) scanf("%d", &n)
#define PB push_back
#define MP make_pair
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define F first
#define S second
#define binf 2000000000000000001
#define mod 1000000007
const int N = 1e5 + 99;
int indeg[N], len[N], n, m;
bool vis[N];
std::vector<int> g[N];
void dfs(int v) {
vis[v] = 1;
if (g[v].size() == 0) {
len[v] = 0;
return;
}
trav(x, g[v]) {
if (!vis[x])
dfs(x);
len[v] = max(len[v], 1 + len[x]);
}
}
int main() {
IO
/* #ifndef ONLINE_JUDGE
FILEIO
#endif*/
cin >>
n >> m;
fr(m) {
int x, y;
cin >> x >> y;
g[x].PB(y);
indeg[y]++;
}
for (int i = 1; i <= n; i++)
if (!indeg[i]) {
dfs(i);
}
ll ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, (ll)len[i]);
cout << ans << endl;
}
|
replace
| 89 | 93 | 89 | 93 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
int level[100001];
bool visited[100001];
void dfs(int u) {
visited[u] = true;
for (int i = 0; i < v[u].size(); i++) {
level[v[u][i]] = max(level[v[u][i]], level[u] + 1);
dfs(v[u][i]);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i <= n; i++) {
level[i] = 0;
visited[i] = false;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].push_back(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, level[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
int level[100001];
bool visited[100001];
void dfs(int u) {
visited[u] = true;
for (int i = 0; i < v[u].size(); i++) {
if (!visited[v[u][i]])
dfs(v[u][i]);
level[u] = max(level[v[u][i]] + 1, level[u]);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i <= n; i++) {
level[i] = 0;
visited[i] = false;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].push_back(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, level[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 8 | 10 | 8 | 11 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long long int ll;
using namespace std;
const int N = 3e3 + 5;
#define fi first
#define se second
#define pb push_back
#define endl "\n"
ll n, m;
vector<ll> adj[N];
ll cnt[N];
ll ans;
ll dfs(ll u) {
ll &g = cnt[u];
if (g != -1)
return g;
g = 0;
for (auto f : adj[u]) {
g = max(g, dfs(f) + 1);
}
return g;
}
int main() {
cin >> n >> m;
for (ll i = 1; i <= n; ++i)
cnt[i] = -1;
for (ll i = 0; i < m; ++i) {
ll u, v;
cin >> u >> v;
adj[u].pb(v);
// adj[v].pb(u);
}
for (ll i = 1; i <= n; ++i) {
if (cnt[i] == -1) {
ans = max(ans, dfs(i));
}
}
// cout<<endl;
// for(ll i=1;i<=n;++i)
// cout<<cnt[i]<<" ";
cout << ans;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long long int ll;
using namespace std;
const int N = 1e5 + 5;
#define fi first
#define se second
#define pb push_back
#define endl "\n"
ll n, m;
vector<ll> adj[N];
ll cnt[N];
ll ans;
ll dfs(ll u) {
ll &g = cnt[u];
if (g != -1)
return g;
g = 0;
for (auto f : adj[u]) {
g = max(g, dfs(f) + 1);
}
return g;
}
int main() {
cin >> n >> m;
for (ll i = 1; i <= n; ++i)
cnt[i] = -1;
for (ll i = 0; i < m; ++i) {
ll u, v;
cin >> u >> v;
adj[u].pb(v);
// adj[v].pb(u);
}
for (ll i = 1; i <= n; ++i) {
if (cnt[i] == -1) {
ans = max(ans, dfs(i));
}
}
// cout<<endl;
// for(ll i=1;i<=n;++i)
// cout<<cnt[i]<<" ";
cout << ans;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#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 all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
#define fast_cin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define precise \
fixed(cout); \
cout << setprecision(16);
#define vb vector<bool>
using namespace std;
ostream &operator<<(ostream &out, vector<int> &v) {
for (auto a : v)
out << a << " ";
out << endl;
}
const int maxn = 100005;
vi G[maxn];
bool visited[maxn];
ll dp[maxn];
int dfs(int src) {
if (G[src].empty())
return dp[src] = 0;
int len = 0;
for (auto v : G[src]) {
len = max(len, 1 + dfs(v));
}
return dp[src] = len;
}
int main() {
fast_cin int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
G[u].pb(v);
}
int lmax = 0;
for (int i = 1; i <= n; i++) {
lmax = max(lmax, dfs(i));
}
cout << lmax << endl;
}
|
#include <bits/stdc++.h>
#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 all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
#define fast_cin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define precise \
fixed(cout); \
cout << setprecision(16);
#define vb vector<bool>
using namespace std;
ostream &operator<<(ostream &out, vector<int> &v) {
for (auto a : v)
out << a << " ";
out << endl;
}
const int maxn = 100005;
vi G[maxn];
bool visited[maxn];
ll dp[maxn];
int dfs(int src) {
if (dp[src])
return dp[src];
if (G[src].empty())
return dp[src] = 0;
int len = 0;
for (auto v : G[src]) {
len = max(len, 1 + dfs(v));
}
return dp[src] = len;
}
int main() {
fast_cin int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
G[u].pb(v);
}
int lmax = 0;
for (int i = 1; i <= n; i++) {
lmax = max(lmax, dfs(i));
}
cout << lmax << endl;
}
|
insert
| 37 | 37 | 37 | 39 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
int N, M;
int dp[100010];
vector<int> G[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int u : G[v]) {
res = max(res, rec(u) + 1);
}
return dp[v] = res;
}
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].push_back(y);
}
fill(dp, dp + N, -1);
int ans = 0;
for (int i = 0; i < N; i++)
ans = max(ans, rec(i));
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int N, M;
int dp[100010];
vector<int> G[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int u : G[v]) {
res = max(res, rec(u) + 1);
}
return dp[v] = res;
}
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].push_back(y);
}
fill(dp, dp + N, -1);
int ans = 0;
for (int i = 0; i < N; i++)
ans = max(ans, rec(i));
cout << ans << endl;
}
|
replace
| 19 | 20 | 19 | 20 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll d[10005];
using Graph = vector<vector<ll>>;
vector<ll> topological_sort(const Graph &G, vector<ll> &indeg, ll V) {
vector<ll> sorted;
queue<ll> que;
for (int i = 0; i < V; i++)
if (indeg[i] == 0)
que.push(i);
while (!que.empty()) {
ll v = que.front();
que.pop();
sorted.push_back(v);
for (auto u : G[v]) {
indeg[u]--;
if (indeg[u] == 0)
que.push(u);
}
}
return sorted;
}
ll N, M;
int main() {
cin >> N >> M;
Graph G(N);
vector<ll> indeg(N);
for (int i = 0; i < M; i++) {
ll s, t;
cin >> s >> t;
s--;
t--;
G[s].push_back(t);
indeg[t]++;
}
vector<ll> A = topological_sort(G, indeg, N);
for (int i = 0; i < N; i++) {
ll v = A[i];
for (auto u : G[v]) {
d[u] = max(d[v] + 1, d[u]);
}
}
ll ans = 0;
for (int i = 0; i < N; i++)
if (ans < d[i])
ans = d[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll d[100005];
using Graph = vector<vector<ll>>;
vector<ll> topological_sort(const Graph &G, vector<ll> &indeg, ll V) {
vector<ll> sorted;
queue<ll> que;
for (int i = 0; i < V; i++)
if (indeg[i] == 0)
que.push(i);
while (!que.empty()) {
ll v = que.front();
que.pop();
sorted.push_back(v);
for (auto u : G[v]) {
indeg[u]--;
if (indeg[u] == 0)
que.push(u);
}
}
return sorted;
}
ll N, M;
int main() {
cin >> N >> M;
Graph G(N);
vector<ll> indeg(N);
for (int i = 0; i < M; i++) {
ll s, t;
cin >> s >> t;
s--;
t--;
G[s].push_back(t);
indeg[t]++;
}
vector<ll> A = topological_sort(G, indeg, N);
for (int i = 0; i < N; i++) {
ll v = A[i];
for (auto u : G[v]) {
d[u] = max(d[v] + 1, d[u]);
}
}
ll ans = 0;
for (int i = 0; i < N; i++)
if (ans < d[i])
ans = d[i];
cout << ans << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long int lint;
typedef long long int llint;
#define INF 1073741824
#define LINF 4611686018000000000
// Graph
int dp[110000];
int visited[110000];
class Graph {
protected:
vector<vector<int>> G;
void dfs(int from, int visited[], void (*func)(int));
public:
int count;
Graph(int);
void add(int, int);
void dfs(void (*func)(int));
void print();
int ans(int);
};
Graph::Graph(int n) {
count = n;
vector<int> g;
for (int i = 0; i < n; i++) {
G.push_back(g);
}
}
void Graph::add(int from, int to) {
G[from].push_back(to);
G[to].push_back(from);
}
int Graph::ans(int v) {
visited[v] = 1;
if (G[v].empty()) {
dp[v] = 0;
return dp[v];
} else if (dp[v] >= 0) {
return dp[v];
}
int m = 0;
for (int i = 0; i < G[v].size(); i++) {
m = max(m, ans(G[v][i]) + 1);
}
dp[v] = m;
return m;
}
void Graph::dfs(int from, int visited[], void (*func)(int)) {
if (visited[from]) {
return;
}
stack<int> s;
visited[from] = 1;
s.push(from);
while (!s.empty()) {
int v = s.top();
s.pop();
(*func)(v);
for (int i = 0; i < G[v].size(); i++) {
if (!visited[G[v][i]]) {
visited[G[v][i]] = 1;
s.push(G[v][i]);
}
}
}
}
void Graph::dfs(void (*func)(int)) {
int visited[count];
for (int i = 0; i < count; i++) {
visited[i] = 0;
}
for (int i = 0; i < count; i++) {
dfs(i, visited, func);
}
}
void Graph::print() {
for (int i = 0; i < G.size(); i++) {
cout << i << ": ";
for (int j = 0; j < G[i].size(); j++) {
cout << G[i][j] << " ";
}
cout << endl;
}
}
class DGraph : public Graph {
public:
DGraph(int n) : Graph(n){};
void add(int, int);
};
void DGraph::add(int from, int to) { G[from].push_back(to); }
int n, m;
int x, y;
int main() {
cin >> n >> m;
for (int i = 0; i < 110000; i++) {
dp[i] = -1;
}
DGraph g(n);
for (int i = 0; i < m; i++) {
cin >> x >> y;
g.add(x, y);
}
for (int i = 1; i <= n; i++) {
g.ans(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long int lint;
typedef long long int llint;
#define INF 1073741824
#define LINF 4611686018000000000
// Graph
int dp[110000];
int visited[110000];
class Graph {
protected:
vector<vector<int>> G;
void dfs(int from, int visited[], void (*func)(int));
public:
int count;
Graph(int);
void add(int, int);
void dfs(void (*func)(int));
void print();
int ans(int);
};
Graph::Graph(int n) {
count = n;
vector<int> g;
for (int i = 0; i < n; i++) {
G.push_back(g);
}
}
void Graph::add(int from, int to) {
G[from].push_back(to);
G[to].push_back(from);
}
int Graph::ans(int v) {
visited[v] = 1;
if (G[v].empty()) {
dp[v] = 0;
return dp[v];
} else if (dp[v] >= 0) {
return dp[v];
}
int m = 0;
for (int i = 0; i < G[v].size(); i++) {
m = max(m, ans(G[v][i]) + 1);
}
dp[v] = m;
return m;
}
void Graph::dfs(int from, int visited[], void (*func)(int)) {
if (visited[from]) {
return;
}
stack<int> s;
visited[from] = 1;
s.push(from);
while (!s.empty()) {
int v = s.top();
s.pop();
(*func)(v);
for (int i = 0; i < G[v].size(); i++) {
if (!visited[G[v][i]]) {
visited[G[v][i]] = 1;
s.push(G[v][i]);
}
}
}
}
void Graph::dfs(void (*func)(int)) {
int visited[count];
for (int i = 0; i < count; i++) {
visited[i] = 0;
}
for (int i = 0; i < count; i++) {
dfs(i, visited, func);
}
}
void Graph::print() {
for (int i = 0; i < G.size(); i++) {
cout << i << ": ";
for (int j = 0; j < G[i].size(); j++) {
cout << G[i][j] << " ";
}
cout << endl;
}
}
class DGraph : public Graph {
public:
DGraph(int n) : Graph(n){};
void add(int, int);
};
void DGraph::add(int from, int to) { G[from].push_back(to); }
int n, m;
int x, y;
int main() {
cin >> n >> m;
for (int i = 0; i < 110000; i++) {
dp[i] = -1;
}
DGraph g(n + 1);
for (int i = 0; i < m; i++) {
cin >> x >> y;
g.add(x, y);
}
for (int i = 1; i <= n; i++) {
g.ans(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 124 | 125 | 124 | 125 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ini(arr, val) memset(arr, (val), sizeof(arr))
#define loop(i, n) for (ll i = 0; i < n; i++)
#define loop1(i, n) for (ll i = 1; i <= n; i++)
#define all(a) (a).begin(), (a).end()
#define exist(s, e) (s.find(e) != s.end())
#define dbg(x) cout << #x << " = " << x << endl
#define pt(x) cout << x << "\n"
#define pts(x) cout << x << " "
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define inf (int)1e9
#define infll 1e18
#define eps 1e-9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define test \
int t; \
cin >> t; \
while (t--)
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef set<int> si;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pll> vpll;
typedef vector<vl> vvl;
typedef map<ll, ll> mll;
typedef set<ll> sl;
int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};
//===========================DEBUG======================//
#define XOX 1
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
#ifdef XOX
#define debug(...) \
debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
//================================================================//
//////////////////////////////////////////////////////////////////////////////////////////
// main starts
//////////////////////////////////////////////////////////////////////////////////////////
int const lmt = 2e5 + 5;
vi adj[lmt];
int dp[lmt];
int dfs(int p) {
int ans = 0;
for (int c : adj[p]) {
if (!dp[c])
dfs(c);
ans = max(ans, dp[c]);
}
dp[p] = 1 + ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
fast
ll n,
m;
cin >> n >> m;
int u, v;
loop(i, m) {
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
loop1(i, n) {
if (!dp[i])
dfs(i);
ans = max(ans, dp[i]);
}
pt(ans - 1);
}
/*
*/
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ini(arr, val) memset(arr, (val), sizeof(arr))
#define loop(i, n) for (ll i = 0; i < n; i++)
#define loop1(i, n) for (ll i = 1; i <= n; i++)
#define all(a) (a).begin(), (a).end()
#define exist(s, e) (s.find(e) != s.end())
#define dbg(x) cout << #x << " = " << x << endl
#define pt(x) cout << x << "\n"
#define pts(x) cout << x << " "
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define inf (int)1e9
#define infll 1e18
#define eps 1e-9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define test \
int t; \
cin >> t; \
while (t--)
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef set<int> si;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<pll> vpll;
typedef vector<vl> vvl;
typedef map<ll, ll> mll;
typedef set<ll> sl;
int dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};
//===========================DEBUG======================//
#define XOX 1
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
#ifdef XOX
#define debug(...) \
debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
//================================================================//
//////////////////////////////////////////////////////////////////////////////////////////
// main starts
//////////////////////////////////////////////////////////////////////////////////////////
int const lmt = 2e5 + 5;
vi adj[lmt];
int dp[lmt];
void dfs(int p) {
int ans = 0;
for (int c : adj[p]) {
if (!dp[c])
dfs(c);
ans = max(ans, dp[c]);
}
dp[p] = 1 + ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("../input.txt", "r", stdin);
freopen("../output.txt", "w", stdout);
#endif
fast
ll n,
m;
cin >> n >> m;
int u, v;
loop(i, m) {
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
loop1(i, n) {
if (!dp[i])
dfs(i);
ans = max(ans, dp[i]);
}
pt(ans - 1);
}
/*
*/
|
replace
| 97 | 98 | 97 | 98 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03166
|
C++
|
Runtime Error
|
/*
*
* I am o0o0oo00.
*
*/
#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 ll long long
#define p7 1000000007
#define p9 998244353
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mll map<ll, ll>
#define test \
ll T; \
cin >> T; \
while (T--)
#define ad(a, n) \
vll a; \
a.resize(n); \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define as(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
} \
cout << endl;
#define all(x) x.begin(), x.end()
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ll powm(ll x, ll y, ll m = p7) {
x = x % m;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
ll modi(ll a, ll m = p7) { return powm(a, m - 2, m); }
void yesno(bool f) { f ? cout << "YES" << endl : cout << "NO" << endl; }
void ss99() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
vll adj[100005];
ll dp[100005] = {0};
bool vis[100005] = {false};
ll dfs(ll node) {
if (vis[node] == true)
return dp[node];
ll cur = 0;
for (auto x : adj[node]) {
cur = max(cur, dfs(x) + 1ll);
}
dp[node] = cur;
vis[node] = true;
return cur;
}
void dfs1(ll n) {
ll cur = dfs(1);
// as(vis,n+1);
for (ll i = 1; i <= n; i++) {
// cout<<i<<endl;
if (!vis[i])
ll base = dfs(i);
// as(vis,n+1);
}
// as(vis,n+1);
}
int32_t main() {
ss99();
// test
{
ll n, m;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
adj[u].pb(v);
}
ll ans = 0;
dfs1(n);
// as(dp,n+1);
// as(vis,n+1);
for (ll i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
return 0;
}
|
/*
*
* I am o0o0oo00.
*
*/
#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 ll long long
#define p7 1000000007
#define p9 998244353
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mll map<ll, ll>
#define test \
ll T; \
cin >> T; \
while (T--)
#define ad(a, n) \
vll a; \
a.resize(n); \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define as(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
} \
cout << endl;
#define all(x) x.begin(), x.end()
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ll powm(ll x, ll y, ll m = p7) {
x = x % m;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
ll modi(ll a, ll m = p7) { return powm(a, m - 2, m); }
void yesno(bool f) { f ? cout << "YES" << endl : cout << "NO" << endl; }
void ss99() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
vll adj[100005];
ll dp[100005] = {0};
bool vis[100005] = {false};
ll dfs(ll node) {
if (vis[node] == true)
return dp[node];
ll cur = 0;
for (auto x : adj[node]) {
cur = max(cur, dfs(x) + 1ll);
}
dp[node] = cur;
vis[node] = true;
return cur;
}
void dfs1(ll n) {
ll cur = dfs(1);
// as(vis,n+1);
for (ll i = 1; i <= n; i++) {
// cout<<i<<endl;
if (!vis[i])
ll base = dfs(i);
// as(vis,n+1);
}
// as(vis,n+1);
}
int32_t main() {
// ss99();
// test
{
ll n, m;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
adj[u].pb(v);
}
ll ans = 0;
dfs1(n);
// as(dp,n+1);
// as(vis,n+1);
for (ll i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
return 0;
}
|
replace
| 95 | 96 | 95 | 96 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define F(i, a, n) for (int i = a; i < n; i++)
#define INF 1000000007
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;
}
vector<vector<int>> G;
int dp[100010];
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>());
vector<int> x(m), y(m);
rep(i, m) {
cin >> x[i] >> y[i];
G[x[i]].push_back(y[i]);
}
rep(i, n) dp[i] = -1;
int res = 0;
rep(i, n) chmax(res, rec(i));
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define F(i, a, n) for (int i = a; i < n; i++)
#define INF 1000000007
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;
}
vector<vector<int>> G;
int dp[100010];
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>());
vector<int> x(m), y(m);
rep(i, m) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
G[x[i]].push_back(y[i]);
}
rep(i, n) dp[i] = -1;
int res = 0;
rep(i, n) chmax(res, rec(i));
cout << res << endl;
return 0;
}
|
insert
| 41 | 41 | 41 | 43 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> void Max(T &m, const T q) {
if (m < q)
m = q;
}
template <typename T> void Min(T &m, const T q) {
if (m > q)
m = q;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
constexpr int Nmax = 100000;
int N, M;
vector<int> to[Nmax], dp;
int dfs(int now) {
int depth = 0;
for (auto nxt : to[now])
Max(depth, dfs(nxt) + 1);
return dp[now] = depth;
}
int main() {
cin >> N >> M;
REP(_, M) {
int x, y;
cin >> x >> y;
to[x - 1].push_back(y - 1);
}
dp.assign(N, -1);
REP(i, N) if (dp[i] == -1) dfs(i);
cout << *max_element(dp.begin(), dp.end()) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> void Max(T &m, const T q) {
if (m < q)
m = q;
}
template <typename T> void Min(T &m, const T q) {
if (m > q)
m = q;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
constexpr int Nmax = 100000;
int N, M;
vector<int> to[Nmax], dp;
int dfs(int now) {
if (dp[now] >= 0)
return dp[now];
int depth = 0;
for (auto nxt : to[now])
Max(depth, dfs(nxt) + 1);
return dp[now] = depth;
}
int main() {
cin >> N >> M;
REP(_, M) {
int x, y;
cin >> x >> y;
to[x - 1].push_back(y - 1);
}
dp.assign(N, -1);
REP(i, N) if (dp[i] == -1) dfs(i);
cout << *max_element(dp.begin(), dp.end()) << endl;
}
|
insert
| 119 | 119 | 119 | 121 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
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...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
vector<int> a[N];
bool visit[N];
vector<int> topo;
int dp[N];
void DFS(int u) {
visit[u] = true;
for (auto &v : a[u]) {
DFS(v);
}
topo.push_back(u);
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
while (m--) {
int x, y;
scanf("%d%d", &x, &y);
--x;
--y;
a[x].push_back(y);
}
for (int i = 0; i < n; ++i) {
if (!visit[i])
DFS(i);
}
for (auto &u : topo) {
dp[u] = 0;
for (auto &v : a[u]) {
dp[u] = max(dp[u], dp[v] + 1);
}
}
int ret = 0;
for (int i = 0; i < n; ++i)
ret = max(ret, dp[i]);
printf("%d\n", ret);
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
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...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
vector<int> a[N];
bool visit[N];
vector<int> topo;
int dp[N];
void DFS(int u) {
visit[u] = true;
for (auto &v : a[u]) {
if (!visit[v])
DFS(v);
}
topo.push_back(u);
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
while (m--) {
int x, y;
scanf("%d%d", &x, &y);
--x;
--y;
a[x].push_back(y);
}
for (int i = 0; i < n; ++i) {
if (!visit[i])
DFS(i);
}
for (auto &u : topo) {
dp[u] = 0;
for (auto &v : a[u]) {
dp[u] = max(dp[u], dp[v] + 1);
}
}
int ret = 0;
for (int i = 0; i < n; ++i)
ret = max(ret, dp[i]);
printf("%d\n", ret);
return 0;
}
|
replace
| 49 | 50 | 49 | 51 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ii int64_t
#define PI 3.14
#define lli long long int
#define li long int
#define deb(x) cout << "\nhi" << x << "\n"
#define mod 1000000007
#define f(x, n) for (int x = 0; x < n; ++x)
#define ff(x, y, z) for (x = y; x <= z; ++x)
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// while(scanf("%d",&n)!=EOF)
using namespace std;
vector<vector<int>> v(100005);
int dp[100005];
int dhundhle(int i) {
// deb(1);
if (v[i].empty())
return 0;
if (dp[i] >= 0)
return dp[i];
int ans = -1;
for (int j = 0; j < v[i].size(); j++) {
ans = max(ans, dhundhle(v[i][j]) + 1);
}
return ans;
}
int main()
{
fio int n, m, i, j, x, y;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> x >> y;
v[x].push_back(y);
}
// deb(2);
memset(dp, -1, sizeof(dp));
int ans = -1;
for (i = 1; i <= n; i++) {
ans = max(ans, dhundhle(i));
}
cout << ans;
}
|
// #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ii int64_t
#define PI 3.14
#define lli long long int
#define li long int
#define deb(x) cout << "\nhi" << x << "\n"
#define mod 1000000007
#define f(x, n) for (int x = 0; x < n; ++x)
#define ff(x, y, z) for (x = y; x <= z; ++x)
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// while(scanf("%d",&n)!=EOF)
using namespace std;
vector<vector<int>> v(100005);
int dp[100005];
int dhundhle(int i) {
// deb(1);
if (v[i].empty())
return 0;
if (dp[i] >= 0)
return dp[i];
int ans = -1;
for (int j = 0; j < v[i].size(); j++) {
ans = max(ans, dhundhle(v[i][j]) + 1);
dp[i] = ans;
}
return ans;
}
int main()
{
fio int n, m, i, j, x, y;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> x >> y;
v[x].push_back(y);
}
// deb(2);
memset(dp, -1, sizeof(dp));
int ans = -1;
for (i = 1; i <= n; i++) {
ans = max(ans, dhundhle(i));
}
cout << ans;
}
|
insert
| 45 | 45 | 45 | 46 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 2;
int n, m, visited[mxN], dp[mxN];
vector<int> adj[mxN], radj[mxN], topo;
void dfs(int node) {
visited[node] = true;
for (auto &v : adj[node]) {
if (!visited[v]) {
dfs(v);
}
}
topo.push_back(node);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
adj[x].push_back(y);
radj[y].push_back(x);
}
dfs(0);
reverse(topo.begin(), topo.end());
// for (auto& num : topo)
// cout << num << " ";
// cout << endl;
int ret = 0;
for (int i = 0; i < n; i++) {
for (auto &v : radj[topo[i]]) {
dp[topo[i]] = max(dp[topo[i]], dp[v] + 1);
}
ret = max(ret, dp[topo[i]]);
}
cout << ret << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 2;
int n, m, visited[mxN], dp[mxN];
vector<int> adj[mxN], radj[mxN], topo;
void dfs(int node) {
visited[node] = true;
for (auto &v : adj[node]) {
if (!visited[v]) {
dfs(v);
}
}
topo.push_back(node);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
adj[x].push_back(y);
radj[y].push_back(x);
}
for (int i = 0; i < n; i++) {
if (!visited[i])
dfs(i);
}
reverse(topo.begin(), topo.end());
// for (auto& num : topo)
// cout << num << " ";
// cout << endl;
int ret = 0;
for (int i = 0; i < n; i++) {
for (auto &v : radj[topo[i]]) {
dp[topo[i]] = max(dp[topo[i]], dp[v] + 1);
}
ret = max(ret, dp[topo[i]]);
}
cout << ret << endl;
}
|
replace
| 27 | 28 | 27 | 31 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
const ll INF = 9999999999;
ll dp[MAX_N];
vector<vector<int>> G(MAX_N);
int rec(int v) {
if (dp[v] >= 0)
return dp[v];
int res = 0;
for (int u : G[v]) {
res = max(res, rec(u) + 1);
}
return res;
}
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
const ll INF = 9999999999;
ll dp[MAX_N];
vector<vector<int>> G(MAX_N);
int rec(int v) {
if (dp[v] >= 0)
return dp[v];
int res = 0;
for (int u : G[v]) {
res = max(res, rec(u) + 1);
}
dp[v] = res;
return res;
}
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
return 0;
}
|
insert
| 39 | 39 | 39 | 40 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100010];
vector<int> ts; /// topological sort
bool vis[100010];
void dfs(int u) {
vis[u] = true;
for (auto v : adj[u]) {
if (vis[v])
continue;
dfs(v);
}
ts.push_back(u);
}
int dp[10010]; /// dp table
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
}
for (int i = 0; i < n; i++)
if (!vis[i])
dfs(i);
reverse(ts.begin(), ts.end());
for (int i = 0; i < n; i++) {
int u = ts[i];
for (int v : adj[u]) {
dp[v] = max(dp[v], dp[u] + 1);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
/*
* G
**/
|
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100010];
vector<int> ts; /// topological sort
bool vis[100010];
void dfs(int u) {
vis[u] = true;
for (auto v : adj[u]) {
if (vis[v])
continue;
dfs(v);
}
ts.push_back(u);
}
int dp[100010]; /// dp table
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
}
for (int i = 0; i < n; i++)
if (!vis[i])
dfs(i);
reverse(ts.begin(), ts.end());
for (int i = 0; i < n; i++) {
int u = ts[i];
for (int v : adj[u]) {
dp[v] = max(dp[v], dp[u] + 1);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
/*
* G
**/
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
/**
* Kaiwen Zhou,
* CUHK
**/
#include <bits/stdc++.h>
using namespace std;
#define INS \
ios::sync_with_stdio(false); \
cin.tie(0)
typedef long long LINT;
#define INF 1000000000000
vector<int> dp(100001, -1);
vector<vector<int>> prev_map(100001);
int N, M;
int msearch(int i) {
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (auto u : prev_map[i]) {
maxi = max(maxi, msearch(u) + 1);
}
return maxi;
}
int main(void) {
INS;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
prev_map[y].push_back(x);
}
int ans = -1;
for (int i = 1; i <= N; i++) {
ans = max(ans, msearch(i));
}
cout << ans << '\n';
return 0;
}
|
/**
* Kaiwen Zhou,
* CUHK
**/
#include <bits/stdc++.h>
using namespace std;
#define INS \
ios::sync_with_stdio(false); \
cin.tie(0)
typedef long long LINT;
#define INF 1000000000000
vector<int> dp(100001, -1);
vector<vector<int>> prev_map(100001);
int N, M;
int msearch(int i) {
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (auto u : prev_map[i]) {
maxi = max(maxi, msearch(u) + 1);
}
dp[i] = maxi;
return maxi;
}
int main(void) {
INS;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
prev_map[y].push_back(x);
}
int ans = -1;
for (int i = 1; i <= N; i++) {
ans = max(ans, msearch(i));
}
cout << ans << '\n';
return 0;
}
|
insert
| 22 | 22 | 22 | 23 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
vector<int> adj[100001];
vector<int> val, vis;
int dfs(int u) {
vis[u] = 1;
int ans = 0;
for (auto it : adj[u]) {
if (vis[it]) {
ans = max(ans, 1 + val[it]);
}
ans = max(1 + dfs(it), ans);
}
val[u] = ans;
return val[u];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
val.resize(n + 1);
vis.resize(n + 1);
for (int i = 1; i <= n; i++)
vis[i] = val[i] = 0;
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++) {
if (!vis[i])
dfs(i);
}
int mx = INT_MIN;
for (int i = 1; i <= n; i++)
mx = max(mx, val[i]);
cout << mx << "\n";
}
|
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
vector<int> adj[100001];
vector<int> val, vis;
int dfs(int u) {
vis[u] = 1;
int ans = 0;
for (auto it : adj[u]) {
if (vis[it]) {
ans = max(ans, 1 + val[it]);
continue;
}
ans = max(1 + dfs(it), ans);
}
val[u] = ans;
return val[u];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
val.resize(n + 1);
vis.resize(n + 1);
for (int i = 1; i <= n; i++)
vis[i] = val[i] = 0;
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++) {
if (!vis[i])
dfs(i);
}
int mx = INT_MIN;
for (int i = 1; i <= n; i++)
mx = max(mx, val[i]);
cout << mx << "\n";
}
|
insert
| 14 | 14 | 14 | 15 |
TLE
| |
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 std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vpll> vvpll;
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
o_set;
#define pb push_back
#define pf push_front
#define FOR(i, x, y, z) for (i = (x); i < (y); i += (z))
#define FOB(i, x, y, z) for (i = (x); i > (y); i -= (z))
#define REF(i, x) FOR(i, 0, x, 1)
#define REB(i, x) FOB(i, x - 1, -1, 1)
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != (c).end(); it++)
#define rtr(c, it) for (auto it = (c).rbegin(); it != (c).rend(); it++)
#define sz(c) (c).size()
#define ff first
#define ss second
#define mp(x, y) make_pair(x, y)
#define MOD 1000000007
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 100000000
pll add_pair(pll a, pll b) { return mp(a.ff + b.ff, a.ss + b.ss); }
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
vvl G((ll)1e5 + 5, vl());
vl indeg((ll)1e5 + 5, 0), outdeg((ll)1e5 + 5, 0), dp((ll)1e5 + 5);
ll ans = 0;
void dfs(ll root) {
tr(G[root], it) {
dfs(*it);
dp[root] = max(dp[root], dp[*it] + 1);
}
ans = max(ans, dp[root]);
}
int main() {
boost;
ll n, m, i, u, v;
cin >> n >> m;
REF(i, m) {
cin >> u >> v;
G[u].pb(v);
indeg[v]++;
outdeg[u]++;
}
REF(i, n) dp[i + 1] = 0;
REF(i, n) {
if (indeg[i + 1] == 0) {
dfs(i + 1);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vpll> vvpll;
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
o_set;
#define pb push_back
#define pf push_front
#define FOR(i, x, y, z) for (i = (x); i < (y); i += (z))
#define FOB(i, x, y, z) for (i = (x); i > (y); i -= (z))
#define REF(i, x) FOR(i, 0, x, 1)
#define REB(i, x) FOB(i, x - 1, -1, 1)
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != (c).end(); it++)
#define rtr(c, it) for (auto it = (c).rbegin(); it != (c).rend(); it++)
#define sz(c) (c).size()
#define ff first
#define ss second
#define mp(x, y) make_pair(x, y)
#define MOD 1000000007
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 100000000
pll add_pair(pll a, pll b) { return mp(a.ff + b.ff, a.ss + b.ss); }
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}
ll fermat_inv(ll y) { return power(y, MOD - 2); }
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
vvl G((ll)1e5 + 5, vl());
vl indeg((ll)1e5 + 5, 0), outdeg((ll)1e5 + 5, 0), dp((ll)1e5 + 5);
ll ans = 0;
void dfs(ll root) {
if (dp[root] != 0)
return;
tr(G[root], it) {
dfs(*it);
dp[root] = max(dp[root], dp[*it] + 1);
}
ans = max(ans, dp[root]);
}
int main() {
boost;
ll n, m, i, u, v;
cin >> n >> m;
REF(i, m) {
cin >> u >> v;
G[u].pb(v);
indeg[v]++;
outdeg[u]++;
}
REF(i, n) dp[i + 1] = 0;
REF(i, n) {
if (indeg[i + 1] == 0) {
dfs(i + 1);
}
}
cout << ans << '\n';
return 0;
}
|
insert
| 60 | 60 | 60 | 62 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
using Graph = vector<vector<int>>;
Graph G;
ll dp[100010];
// vを始点とした最長長さ
int rec(int v) {
// if(dp[v]!=-1) return dp[v];
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res;
}
signed main() {
int n, m;
cin >> n >> m;
G.assign(n, vector<int>());
// to.assign(n,vector<int>());
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].push_back(y);
// to[y].push_back(x);
}
fill(dp, dp + 100010, -1);
int res = 0;
for (int i = 0; i < n; i++) {
chmax(res, rec(i));
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
using Graph = vector<vector<int>>;
Graph G;
ll dp[100010];
// vを始点とした最長長さ
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : G[v]) {
res = max(res, rec(nv) + 1);
}
return dp[v] = res;
}
signed main() {
int n, m;
cin >> n >> m;
G.assign(n, vector<int>());
// to.assign(n,vector<int>());
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].push_back(y);
// to[y].push_back(x);
}
fill(dp, dp + 100010, -1);
int res = 0;
for (int i = 0; i < n; i++) {
chmax(res, rec(i));
}
cout << res << endl;
return 0;
}
|
replace
| 63 | 64 | 63 | 65 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iomanip> // cout<<setprecision(n)
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iota, accumulate, inner_product
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, stoi, to_string
#include <unordered_map> // hashed by keys
#include <unordered_set> // hashed by keys
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define ENDL "\n"
#define print(i) std::cout << (i) << "\n"
#define int long long // at least int64 > 9*10^18
#define all(v) v.begin(), v.end()
void dfs(int i, std::vector<std::vector<int>> &to, std::vector<int> &dp) {
for (auto v : to[i]) {
dp[v] = std::max(dp[v], dp[i] + 1);
dfs(v, to, dp);
}
return;
}
signed main() {
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> to(n, std::vector<int>());
std::vector<int> dp(n, 0);
rep(i, m) {
int a, b;
std::cin >> a >> b;
a--;
b--;
to[a].emplace_back(b);
}
rep(i, n) if (dp[i] == 0) dfs(i, to, dp);
int max = 0;
rep(i, n) max = std::max(dp[i], max);
print(max);
return 0;
}
|
#include <algorithm> // minmax, sort, swap
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <cstdio> // printf, scanf
#include <iomanip> // cout<<setprecision(n)
#include <iostream> // cin, cout, cerr, clog
#include <map> // key-value pairs sorted by keys
#include <numeric> // iota, accumulate, inner_product
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, stoi, to_string
#include <unordered_map> // hashed by keys
#include <unordered_set> // hashed by keys
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define ENDL "\n"
#define print(i) std::cout << (i) << "\n"
#define int long long // at least int64 > 9*10^18
#define all(v) v.begin(), v.end()
void dfs(int i, std::vector<std::vector<int>> &to, std::vector<int> &dp) {
for (auto v : to[i]) {
if (dp[v] == 0)
dfs(v, to, dp);
dp[i] = std::max(dp[i], dp[v] + 1);
}
return;
}
signed main() {
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> to(n, std::vector<int>());
std::vector<int> dp(n, 0);
rep(i, m) {
int a, b;
std::cin >> a >> b;
a--;
b--;
to[a].emplace_back(b);
}
rep(i, n) if (dp[i] == 0) dfs(i, to, dp);
int max = 0;
rep(i, n) max = std::max(dp[i], max);
print(max);
return 0;
}
|
replace
| 25 | 27 | 25 | 28 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#define endl "\n"
#define ll long long int
#define vll vector<ll>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define tll tuple<ll, ll, ll>
#define mt make_tuple
#define INF LONG_LONG_MAX
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define cases \
ll t; \
cin >> t; \
while (t--)
#define array(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i];
#define vector(a, n) \
vll a(n); \
rep(i, 0, n) cin >> a[i];
#define sortall(a) sort(a.begin(), a.end())
#define printall(a, n) \
rep(i, 0, n) cout << a[i] << " "; \
cout << endl;
// --------------- My Template End --------------- //
class Graph {
map<int, vector<int>> adjList;
int nodes;
map<int, int> dp;
public:
Graph(int node) { nodes = node; }
void addEdge(int u, int v) { adjList[u].pb(v); }
void print() {
for (auto j : adjList) {
cout << j.ff << " ->";
for (auto i : j.ss) {
cout << i << "-";
}
cout << endl;
}
}
int dfshelper(int u) {
if (dp.count(u))
return dp[u];
int max1 = 0;
for (auto j : adjList[u]) {
// cout<<j<<" "<<curr<<endl;
max1 = max(max1, dfshelper(j) + 1);
}
// cout<<"Returend From"<<u<<" value->"<<curr<<endl;
return dp[u] = max1;
}
int dfs() {
int max1 = INT_MIN;
rep(i, 1, nodes + 1) {
max1 = max(max1, dfshelper(i));
// cout<<max1<<endl;
}
return max1;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
input();
int n, m;
cin >> n >> m;
Graph g(n);
rep(i, 0, m) {
int u, v;
cin >> u >> v;
g.addEdge(u, v);
}
cout << g.dfs() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
#define endl "\n"
#define ll long long int
#define vll vector<ll>
#define pb push_back
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define tll tuple<ll, ll, ll>
#define mt make_tuple
#define INF LONG_LONG_MAX
#define mod 1000000007
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define cases \
ll t; \
cin >> t; \
while (t--)
#define array(a, n) \
ll a[n]; \
rep(i, 0, n) cin >> a[i];
#define vector(a, n) \
vll a(n); \
rep(i, 0, n) cin >> a[i];
#define sortall(a) sort(a.begin(), a.end())
#define printall(a, n) \
rep(i, 0, n) cout << a[i] << " "; \
cout << endl;
// --------------- My Template End --------------- //
class Graph {
map<int, vector<int>> adjList;
int nodes;
map<int, int> dp;
public:
Graph(int node) { nodes = node; }
void addEdge(int u, int v) { adjList[u].pb(v); }
void print() {
for (auto j : adjList) {
cout << j.ff << " ->";
for (auto i : j.ss) {
cout << i << "-";
}
cout << endl;
}
}
int dfshelper(int u) {
if (dp.count(u))
return dp[u];
int max1 = 0;
for (auto j : adjList[u]) {
// cout<<j<<" "<<curr<<endl;
max1 = max(max1, dfshelper(j) + 1);
}
// cout<<"Returend From"<<u<<" value->"<<curr<<endl;
return dp[u] = max1;
}
int dfs() {
int max1 = INT_MIN;
rep(i, 1, nodes + 1) {
max1 = max(max1, dfshelper(i));
// cout<<max1<<endl;
}
return max1;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// input();
int n, m;
cin >> n >> m;
Graph g(n);
rep(i, 0, m) {
int u, v;
cin >> u >> v;
g.addEdge(u, v);
}
cout << g.dfs() << endl;
}
|
replace
| 81 | 82 | 81 | 82 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define ar array
const int mxn = 1e5;
int n, m;
vector<int> adj[mxn];
ll d[mxn], indegree[mxn];
bool vis[mxn];
void bfs(int node) {
queue<int> q;
q.push(node);
vis[node] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto i : adj[u]) {
// if(!vis[i])
{
d[i] = max(d[i], d[u] + 1);
indegree[i]--;
vis[i] = true;
if (indegree[i] <= 0)
q.push(i);
}
}
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
// int t;
// cin>>t;
// while(t--)
{
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
adj[x].push_back(y);
indegree[y]++;
}
for (int i = 0; i < n; i++) {
if (!vis[i]) {
bfs(i);
}
}
// for(int i=0;i<n;i++)
//{
// cout<<indegree[i]<<' ';
//}
// cout<<'\n';
ll ans = 0;
for (int i = 0; i < mxn; i++) {
ans = max(ans, d[i]);
}
cout << ans << '\n';
}
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define ar array
const int mxn = 1e5;
int n, m;
vector<int> adj[mxn];
ll d[mxn], indegree[mxn];
bool vis[mxn];
void bfs(int node) {
queue<int> q;
q.push(node);
vis[node] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto i : adj[u]) {
// if(!vis[i])
{
d[i] = max(d[i], d[u] + 1);
indegree[i]--;
vis[i] = true;
if (indegree[i] <= 0)
q.push(i);
}
}
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
// int t;
// cin>>t;
// while(t--)
{
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
adj[x].push_back(y);
indegree[y]++;
}
for (int i = 0; i < n; i++) {
if (!vis[i] && indegree[i] == 0) {
bfs(i);
}
}
// for(int i=0;i<n;i++)
//{
// cout<<indegree[i]<<' ';
//}
// cout<<'\n';
ll ans = 0;
for (int i = 0; i < mxn; i++) {
ans = max(ans, d[i]);
}
cout << ans << '\n';
}
}
|
replace
| 50 | 51 | 50 | 51 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <chrono>
#include <cstring>
#include <iostream>
#include <random>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
const int N = 1e5 + 5, inf = 1e9 + 5;
ll add(ll x, ll y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
ll mult(ll x, ll y) { return (x * y) % MOD; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> adj[N];
int dp[N];
int f(int id) {
if (dp[id] != -1)
return dp[id];
int best = 0;
for (int u : adj[id])
best = max(best, f(u) + 1);
return best;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
rep(i, 0, m) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; ++i)
f(i);
for (int i = 1; i <= n; ++i)
ans = max(ans, f(i));
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <chrono>
#include <cstring>
#include <iostream>
#include <random>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
const int N = 1e5 + 5, inf = 1e9 + 5;
ll add(ll x, ll y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
ll mult(ll x, ll y) { return (x * y) % MOD; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> adj[N];
int dp[N];
int f(int id) {
if (dp[id] != -1)
return dp[id];
int best = 0;
for (int u : adj[id])
best = max(best, f(u) + 1);
return dp[id] = best;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
rep(i, 0, m) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; ++i)
f(i);
for (int i = 1; i <= n; ++i)
ans = max(ans, f(i));
cout << ans << endl;
return 0;
}
|
replace
| 37 | 38 | 37 | 38 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int solve(int cur, vector<int> *gr, vector<int> &dp) {
bool isLeaf = true;
int best = 0;
for (auto nbr : gr[cur]) {
isLeaf = false;
best = max(best, solve(nbr, gr, dp));
}
dp[cur] = (isLeaf) ? 0 : 1 + best;
return dp[cur];
}
int main() {
int n, m;
cin >> n >> m;
vector<int> gr[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
gr[x].push_back(y);
}
vector<int> dp(n + 1, -1);
for (int i = 1; i <= n; i++) {
if (dp[i] == -1) {
dp[i] = solve(i, gr, dp);
}
}
cout << *max_element(dp.begin(), dp.end());
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int solve(int cur, vector<int> *gr, vector<int> &dp) {
if (dp[cur] != -1) {
return dp[cur];
}
bool isLeaf = true;
int best = 0;
for (auto nbr : gr[cur]) {
isLeaf = false;
best = max(best, solve(nbr, gr, dp));
}
dp[cur] = (isLeaf) ? 0 : 1 + best;
return dp[cur];
}
int main() {
int n, m;
cin >> n >> m;
vector<int> gr[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
gr[x].push_back(y);
}
vector<int> dp(n + 1, -1);
for (int i = 1; i <= n; i++) {
if (dp[i] == -1) {
dp[i] = solve(i, gr, dp);
}
}
cout << *max_element(dp.begin(), dp.end());
return 0;
}
|
insert
| 6 | 6 | 6 | 9 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
const ll MOD = 1000000007;
const ll INF = (1LL << 62);
ll dp[100005];
map<ll, vector<ll>> m;
ll rec(ll v) {
if (dp[v] >= 0) {
return dp[v];
}
auto ite = m[v].begin();
ll r = 0;
for (; ite != end(m[v]); ite++) {
// cout << (*ite) << endl;
r = max(r, rec(*ite) + 1);
}
return r;
}
int main() {
ll N, M;
scanf("%lld %lld", &N, &M);
for (ll i = 0; i < M; i++) {
ll x, y;
scanf("%lld %lld", &x, &y);
x--;
y--;
m[x].emplace_back(y);
}
fill_n(dp, 100005, -1);
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
const ll MOD = 1000000007;
const ll INF = (1LL << 62);
ll dp[100005];
map<ll, vector<ll>> m;
ll rec(ll v) {
if (dp[v] >= 0) {
return dp[v];
}
auto ite = m[v].begin();
ll r = 0;
for (; ite != end(m[v]); ite++) {
// cout << (*ite) << endl;
r = max(r, rec(*ite) + 1);
}
dp[v] = r;
return r;
}
int main() {
ll N, M;
scanf("%lld %lld", &N, &M);
for (ll i = 0; i < M; i++) {
ll x, y;
scanf("%lld %lld", &x, &y);
x--;
y--;
m[x].emplace_back(y);
}
fill_n(dp, 100005, -1);
ll ans = 0;
for (ll i = 0; i < N; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
}
|
insert
| 30 | 30 | 30 | 32 |
TLE
| |
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 fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PSET(x, y) fixed << setprecision(y) << x
#define pb push_back
#define pf push_front
#define mp make_pair
#define pii pair<int, int>
#define pid pair<int, double>
#define vi vector<int>
#define ff first
#define ss second
#define int long long int
#define ull unsigned long long
#define PI 3.14159265
#define SIZE 200010
#define MOD 1000000007
#define BIG 998244353
#define s(t) scanf("%d", &t)
#define p(t) printf("%d\n", t)
#define mii map<int, int>
#define tc \
int tcs; \
cin >> tcs; \
while (tcs--)
#define set_bit __builtin_popcount
#define MSET(table, i) memset(table, i, sizeof(table))
int toint(const string &s) {
stringstream ss;
ss << s;
int x;
ss >> x;
return x;
}
string tostring(int number) {
stringstream ss;
ss << number;
return ss.str();
}
int power(int x, int y) {
int r = 1, z = x;
while (y) {
if (y & 1)
r *= z;
z *= z;
y = y >> 1;
}
return r;
}
int powerm(int x, int y, int p) {
int r = 1;
while (y) {
if (y & 1)
r = (r * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return r % p;
}
int modinv(int x, int m) { return powerm(x, m - 2, m); }
int logarithm(int a, int b) {
int x = 0;
while (a > 1) {
x++;
a /= b;
}
return x;
}
int max3(int a, int b, int c) { return max(a, max(b, c)); }
int min3(int a, int b, int c) { return min(a, min(b, c)); }
int fact[500010];
int nCr(int n, int r) {
int ans = fact[n];
ans *= modinv(fact[r], BIG);
ans %= BIG;
ans *= modinv(fact[n - r], BIG);
ans %= BIG;
return ans;
}
int segmin[1000000], segmax[1000000];
void buildmin(int node, int start, int end, int A[]) {
if (start == end) {
segmin[node] = A[start];
} else {
int mid = (start + end) / 2;
buildmin(2 * node, start, mid, A);
buildmin(2 * node + 1, mid + 1, end, A);
segmin[node] = min(segmin[2 * node], segmin[2 * node + 1]);
}
}
void buildmax(int start, int end, int id, int pre[]) {
if (start == end) {
segmax[id] = pre[start];
return;
}
int mid = (start + end) / 2;
buildmax(start, mid, id * 2, pre);
buildmax(mid + 1, end, id * 2 + 1, pre);
segmax[id] = max(segmax[id * 2], segmax[id * 2 + 1]);
}
int querymin(int id, int start, int end, int l, int r) {
if (start > r || end < l)
return INT_MAX;
if (start >= l && end <= r)
return segmin[id];
int mid = (start + end) / 2;
return min(querymin(id * 2, start, mid, l, r),
querymin(id * 2 + 1, mid + 1, end, l, r));
}
int querymax(int id, int start, int end, int l, int r) {
if (start > r || end < l)
return INT_MIN;
if (start >= l && end <= r)
return segmax[id];
int mid = (start + end) / 2;
return max(querymax(id * 2, start, mid, l, r),
querymax(id * 2 + 1, mid + 1, end, l, r));
}
int count(int x) {
int count = 0;
while (x % 2 == 0) {
count++;
x = x / 2;
}
return count;
}
map<int, vector<int>> adj;
int n, m;
int dp[100010];
int visited[100010] = {0};
void dfs(int v, int p) {
visited[v] = 1;
for (auto el : adj[v]) {
if (el != p) {
dfs(el, v);
dp[v] = max(dp[v], 1 + dp[el]);
}
}
}
int32_t main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (visited[i] == 0)
dfs(i, -1);
}
int ans = INT_MIN;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
return 0;
}
|
#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 fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define PSET(x, y) fixed << setprecision(y) << x
#define pb push_back
#define pf push_front
#define mp make_pair
#define pii pair<int, int>
#define pid pair<int, double>
#define vi vector<int>
#define ff first
#define ss second
#define int long long int
#define ull unsigned long long
#define PI 3.14159265
#define SIZE 200010
#define MOD 1000000007
#define BIG 998244353
#define s(t) scanf("%d", &t)
#define p(t) printf("%d\n", t)
#define mii map<int, int>
#define tc \
int tcs; \
cin >> tcs; \
while (tcs--)
#define set_bit __builtin_popcount
#define MSET(table, i) memset(table, i, sizeof(table))
int toint(const string &s) {
stringstream ss;
ss << s;
int x;
ss >> x;
return x;
}
string tostring(int number) {
stringstream ss;
ss << number;
return ss.str();
}
int power(int x, int y) {
int r = 1, z = x;
while (y) {
if (y & 1)
r *= z;
z *= z;
y = y >> 1;
}
return r;
}
int powerm(int x, int y, int p) {
int r = 1;
while (y) {
if (y & 1)
r = (r * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return r % p;
}
int modinv(int x, int m) { return powerm(x, m - 2, m); }
int logarithm(int a, int b) {
int x = 0;
while (a > 1) {
x++;
a /= b;
}
return x;
}
int max3(int a, int b, int c) { return max(a, max(b, c)); }
int min3(int a, int b, int c) { return min(a, min(b, c)); }
int fact[500010];
int nCr(int n, int r) {
int ans = fact[n];
ans *= modinv(fact[r], BIG);
ans %= BIG;
ans *= modinv(fact[n - r], BIG);
ans %= BIG;
return ans;
}
int segmin[1000000], segmax[1000000];
void buildmin(int node, int start, int end, int A[]) {
if (start == end) {
segmin[node] = A[start];
} else {
int mid = (start + end) / 2;
buildmin(2 * node, start, mid, A);
buildmin(2 * node + 1, mid + 1, end, A);
segmin[node] = min(segmin[2 * node], segmin[2 * node + 1]);
}
}
void buildmax(int start, int end, int id, int pre[]) {
if (start == end) {
segmax[id] = pre[start];
return;
}
int mid = (start + end) / 2;
buildmax(start, mid, id * 2, pre);
buildmax(mid + 1, end, id * 2 + 1, pre);
segmax[id] = max(segmax[id * 2], segmax[id * 2 + 1]);
}
int querymin(int id, int start, int end, int l, int r) {
if (start > r || end < l)
return INT_MAX;
if (start >= l && end <= r)
return segmin[id];
int mid = (start + end) / 2;
return min(querymin(id * 2, start, mid, l, r),
querymin(id * 2 + 1, mid + 1, end, l, r));
}
int querymax(int id, int start, int end, int l, int r) {
if (start > r || end < l)
return INT_MIN;
if (start >= l && end <= r)
return segmax[id];
int mid = (start + end) / 2;
return max(querymax(id * 2, start, mid, l, r),
querymax(id * 2 + 1, mid + 1, end, l, r));
}
int count(int x) {
int count = 0;
while (x % 2 == 0) {
count++;
x = x / 2;
}
return count;
}
map<int, vector<int>> adj;
int n, m;
int dp[100010];
int visited[100010] = {0};
void dfs(int v, int p) {
visited[v] = 1;
for (auto el : adj[v]) {
if (el != p) {
if (!visited[el])
dfs(el, v);
dp[v] = max(dp[v], 1 + dp[el]);
}
}
}
int32_t main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (visited[i] == 0)
dfs(i, -1);
}
int ans = INT_MIN;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
return 0;
}
|
replace
| 144 | 145 | 144 | 146 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// fahadmd16(IIEST Shibpur)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
#define forn(i, n) for (ll i = 0; i < n; i++)
#define forn1(i, n) for (ll i = 1; i < n; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define ford1(i, n) for (ll i = n - 1; i >= 1; i--)
#define forab(i, a, b) for (ll i = a; i < b; i++)
#define forabd(i, a, b) for (ll i = a; i >= b; i--)
#define eps 1e-10
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define tracen(x, n) \
{ \
cout << (#x) << ":"; \
for (int i = 0; i < n; i++) \
cout << (#x) << "[" << i << "]:" << x[i] << " "; \
cout << endl; \
}
#define tracenm(x, n, m) \
{ \
cout << (#x) << endl; \
for (int i = 0; i < n; i++) { \
cout << "Row #" << i << ":"; \
for (int j = 0; j < m; j++) \
cout << x[i][j] << " "; \
cout << endl; \
} \
}
#define trace(v) \
{ \
cout << #v << ": "; \
for (auto it = v.begin(); it != v.end(); it++) \
cout << *it << " "; \
cout << endl; \
}
using namespace std;
const ll sz = 1e5 + 2;
const ll mod = 1e9 + 7;
const db PI = acos(-1);
typedef vector<ll> VL;
typedef vector<pll> VLL;
typedef vector<vector<ll>> VVL;
ll power(ll n, ll k, ll m) {
ll ans = 1;
while (k) {
if (k & 1)
ans = (ans * n) % m;
k /= 2;
n = (n * n) % m;
}
return ans;
}
stack<ll> order;
void dfs(ll v, VL adj[], vector<bool> &vis) {
vis[v] = 1;
for (auto w : adj[v]) {
if (!vis[w]) {
dfs(w, adj, vis);
}
}
order.push(v);
}
void solver() {
ll n, m;
cin >> n >> m;
VL adj[n + 1];
forn(i, m) {
ll v, w;
cin >> v >> w;
adj[v].pb(w);
}
forn1(i, n + 1) {
if (adj[i].size())
adj[0].pb(i);
}
vector<bool> vis(n + 1, 0);
dfs(0, adj, vis);
VL disTo(n + 1, INT_MIN);
disTo[0] = 0;
while (!order.empty()) {
ll v = order.top();
order.pop();
if (disTo[v] != INT_MIN) {
for (auto w : adj[v]) {
if (disTo[w] < disTo[v] + 1) {
disTo[w] = disTo[v] + 1;
}
}
}
}
ll ans = 0;
forn1(i, n + 1) ans = max(ans, disTo[i]);
cout << ans - 1 << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
ll T = 1; // cin >> T;
forn1(i, T + 1) {
clock_t z = clock();
solver();
debug("Total Time: %.3f\n", (double)(clock() - z) / CLOCKS_PER_SEC);
}
return 0;
}
|
// fahadmd16(IIEST Shibpur)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
#define forn(i, n) for (ll i = 0; i < n; i++)
#define forn1(i, n) for (ll i = 1; i < n; i++)
#define ford(i, n) for (ll i = n - 1; i >= 0; i--)
#define ford1(i, n) for (ll i = n - 1; i >= 1; i--)
#define forab(i, a, b) for (ll i = a; i < b; i++)
#define forabd(i, a, b) for (ll i = a; i >= b; i--)
#define eps 1e-10
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define tracen(x, n) \
{ \
cout << (#x) << ":"; \
for (int i = 0; i < n; i++) \
cout << (#x) << "[" << i << "]:" << x[i] << " "; \
cout << endl; \
}
#define tracenm(x, n, m) \
{ \
cout << (#x) << endl; \
for (int i = 0; i < n; i++) { \
cout << "Row #" << i << ":"; \
for (int j = 0; j < m; j++) \
cout << x[i][j] << " "; \
cout << endl; \
} \
}
#define trace(v) \
{ \
cout << #v << ": "; \
for (auto it = v.begin(); it != v.end(); it++) \
cout << *it << " "; \
cout << endl; \
}
using namespace std;
const ll sz = 1e5 + 2;
const ll mod = 1e9 + 7;
const db PI = acos(-1);
typedef vector<ll> VL;
typedef vector<pll> VLL;
typedef vector<vector<ll>> VVL;
ll power(ll n, ll k, ll m) {
ll ans = 1;
while (k) {
if (k & 1)
ans = (ans * n) % m;
k /= 2;
n = (n * n) % m;
}
return ans;
}
stack<ll> order;
void dfs(ll v, VL adj[], vector<bool> &vis) {
vis[v] = 1;
for (auto w : adj[v]) {
if (!vis[w]) {
dfs(w, adj, vis);
}
}
order.push(v);
}
void solver() {
ll n, m;
cin >> n >> m;
VL adj[n + 1];
forn(i, m) {
ll v, w;
cin >> v >> w;
adj[v].pb(w);
}
forn1(i, n + 1) {
if (adj[i].size())
adj[0].pb(i);
}
vector<bool> vis(n + 1, 0);
dfs(0, adj, vis);
VL disTo(n + 1, INT_MIN);
disTo[0] = 0;
while (!order.empty()) {
ll v = order.top();
order.pop();
if (disTo[v] != INT_MIN) {
for (auto w : adj[v]) {
if (disTo[w] < disTo[v] + 1) {
disTo[w] = disTo[v] + 1;
}
}
}
}
ll ans = 0;
forn1(i, n + 1) ans = max(ans, disTo[i]);
cout << ans - 1 << endl;
}
int main() {
IOS;
ll T = 1; // cin >> T;
forn1(i, T + 1) {
clock_t z = clock();
solver();
debug("Total Time: %.3f\n", (double)(clock() - z) / CLOCKS_PER_SEC);
}
return 0;
}
|
replace
| 137 | 141 | 137 | 138 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//****************************************************
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(X) X.begin(), X.end()
#define endl "\n" // comment it for interactive questions
#define trace1(a) cerr << #a << ": " << a << endl;
#define trace2(a, b) cerr << #a << ": " << a << " " << #b << ": " << b << endl;
#define trace3(a, b, c) \
cerr << #a << ": " << a << " " << #b << ": " << b << " " << #c << ": " << c \
<< endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " " << #b << ": " << b << " " << #c << ": " << c \
<< #d << ": " << d << endl;
#define OC \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define MOD (ll)1e9 + 7; // change it for other mods
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
//*******************************************************
// Some Functions
ll powmod(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b = b >> 1;
}
return res % MOD;
}
vector<vll> G;
vll dp;
ll dfs(ll source) {
ll res = 0;
if (dp[source] != -1) {
return dp[source];
}
for (ll ne : G[source]) {
res = max(res, dfs(ne) + 1);
}
return res;
}
void solve() {
ll n, m;
cin >> n >> m;
G.resize(n + 1);
dp.assign(n + 1, -1);
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
G[x].pb(y);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
ans = max(ans, dfs(i));
}
cout << ans << "\n";
}
int main() {
FAST_IO;
#ifndef ONLINE_JUDGE
// OC;
#endif
ll t = 1;
// cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
//****************************************************
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(X) X.begin(), X.end()
#define endl "\n" // comment it for interactive questions
#define trace1(a) cerr << #a << ": " << a << endl;
#define trace2(a, b) cerr << #a << ": " << a << " " << #b << ": " << b << endl;
#define trace3(a, b, c) \
cerr << #a << ": " << a << " " << #b << ": " << b << " " << #c << ": " << c \
<< endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " " << #b << ": " << b << " " << #c << ": " << c \
<< #d << ": " << d << endl;
#define OC \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define MOD (ll)1e9 + 7; // change it for other mods
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
//*******************************************************
// Some Functions
ll powmod(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b = b >> 1;
}
return res % MOD;
}
vector<vll> G;
vll dp;
ll dfs(ll source) {
ll res = 0;
if (dp[source] != -1) {
return dp[source];
}
for (ll ne : G[source]) {
res = max(res, dfs(ne) + 1);
}
dp[source] = res;
return res;
}
void solve() {
ll n, m;
cin >> n >> m;
G.resize(n + 1);
dp.assign(n + 1, -1);
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
G[x].pb(y);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
ans = max(ans, dfs(i));
}
cout << ans << "\n";
}
int main() {
FAST_IO;
#ifndef ONLINE_JUDGE
// OC;
#endif
ll t = 1;
// cin >> t;
while (t--) {
solve();
}
}
|
insert
| 59 | 59 | 59 | 60 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
using uint = unsigned int;
using ull = unsigned long long;
uint lps(const vector<vector<uint>> &E, vector<int> &LP, const uint v) {
if (LP[v] >= 0)
return LP[v];
uint d = 0;
for (auto nv : E[v]) {
d = max(d, lps(E, LP, nv) + 1);
}
return d;
}
int main() {
uint N, M;
cin >> N >> M;
vector<vector<uint>> E(N, vector<uint>());
for (uint i = 0; i < M; i++) {
uint x, y;
cin >> x >> y;
E[x - 1].push_back(y - 1);
}
vector<int> V(N, -1);
uint ans = 0;
for (uint i = 0; i < N; i++) { // start node
ans = max(ans, lps(E, V, i));
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
using uint = unsigned int;
using ull = unsigned long long;
uint lps(const vector<vector<uint>> &E, vector<int> &LP, const uint v) {
if (LP[v] >= 0)
return LP[v];
uint d = 0;
for (auto nv : E[v]) {
d = max(d, lps(E, LP, nv) + 1);
}
LP[v] = d;
return d;
}
int main() {
uint N, M;
cin >> N >> M;
vector<vector<uint>> E(N, vector<uint>());
for (uint i = 0; i < M; i++) {
uint x, y;
cin >> x >> y;
E[x - 1].push_back(y - 1);
}
vector<int> V(N, -1);
uint ans = 0;
for (uint i = 0; i < N; i++) { // start node
ans = max(ans, lps(E, V, i));
}
cout << ans << endl;
return 0;
}
|
insert
| 17 | 17 | 17 | 18 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
vector<vector<int>> graph;
vector<int> dp;
int dfs(int fr) {
int mx = 0;
if (dp[fr] != -1)
return dp[fr];
for (auto itr = graph[fr].begin(); itr != graph[fr].end(); itr++) {
int t = dfs(*itr) + 1;
mx = MAX(mx, t);
}
return mx;
}
int main() {
int n, m;
int ans;
cin >> n >> m;
graph = vector<vector<int>>(n);
dp = vector<int>(n);
fill(dp.begin(), dp.end(), -1);
for (int i = 0; i < m; i++) {
int fr, to;
cin >> fr >> to;
graph[fr - 1].push_back(to - 1);
}
ans = 0;
for (int i = 0; i < n; i++) {
ans = MAX(ans, dfs(i));
// cout << i << ": " << dfs(i) << endl;
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
vector<vector<int>> graph;
vector<int> dp;
int dfs(int fr) {
int mx = 0;
if (dp[fr] != -1)
return dp[fr];
for (auto itr = graph[fr].begin(); itr != graph[fr].end(); itr++) {
int t = dfs(*itr) + 1;
mx = MAX(mx, t);
}
return dp[fr] = mx;
}
int main() {
int n, m;
int ans;
cin >> n >> m;
graph = vector<vector<int>>(n);
dp = vector<int>(n);
fill(dp.begin(), dp.end(), -1);
for (int i = 0; i < m; i++) {
int fr, to;
cin >> fr >> to;
graph[fr - 1].push_back(to - 1);
}
ans = 0;
for (int i = 0; i < n; i++) {
ans = MAX(ans, dfs(i));
// cout << i << ": " << dfs(i) << endl;
}
cout << ans << endl;
return 0;
}
|
replace
| 19 | 20 | 19 | 20 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 10005
int n, m, dp[MAX_N];
vector<int> adh[MAX_N];
int f_imp(int);
int f(int p) {
if (dp[p] == 0)
dp[p] = f_imp(p) + 1;
return dp[p] - 1;
}
int f_imp(int p) {
int rs = 0;
for (auto &i : adh[p])
rs = max(rs, f(i) + 1);
return rs;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int t1, t2;
scanf("%d %d", &t1, &t2);
t1--;
t2--;
adh[t1].push_back(t2);
}
int rs = 0;
for (int i = 0; i < n; i++) {
rs = max(rs, f(i));
}
printf("%d\n", rs);
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 100005
int n, m, dp[MAX_N];
vector<int> adh[MAX_N];
int f_imp(int);
int f(int p) {
if (dp[p] == 0)
dp[p] = f_imp(p) + 1;
return dp[p] - 1;
}
int f_imp(int p) {
int rs = 0;
for (auto &i : adh[p])
rs = max(rs, f(i) + 1);
return rs;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int t1, t2;
scanf("%d %d", &t1, &t2);
t1--;
t2--;
adh[t1].push_back(t2);
}
int rs = 0;
for (int i = 0; i < n; i++) {
rs = max(rs, f(i));
}
printf("%d\n", rs);
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int d[100000];
int f(int x, vector<vector<int>> &v) {
if (d[x] != 0)
return d[x];
if (v[x].size() == 0)
return 0;
int ans = 0;
for (int a : v[x]) {
ans = max(ans, f(a, v) + 1);
}
return ans;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
--a;
--b;
v[a].push_back(b);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
ans = max(ans, f(i, v));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[100000];
int f(int x, vector<vector<int>> &v) {
if (d[x] != 0)
return d[x];
if (v[x].size() == 0)
return 0;
int ans = 0;
for (int a : v[x]) {
ans = max(ans, f(a, v) + 1);
}
return d[x] = ans;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
--a;
--b;
v[a].push_back(b);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
ans = max(ans, f(i, v));
}
cout << ans << endl;
}
|
replace
| 13 | 14 | 13 | 14 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define all(x) x.begin(), x.end()
ll power(ll a, ll b) {
ll res = 1;
a = a % mod;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return res;
}
ll invmod(ll a) { return power(a, mod - 2); }
vector<vector<int>> adj;
vector<int> dp;
int dfs(int v) {
int mx = -1;
for (auto u : adj[v]) {
mx = max(mx, dfs(u));
}
return dp[v] = mx + 1;
}
int main(void) {
FIO int t = 1;
// cin>>t;
while (t--) {
int n, m, u, v;
cin >> n >> m;
adj.assign(n + 1, vector<int>());
dp.assign(n + 1, -1);
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].pb(v);
}
for (int i = 1; i <= n; i++) {
if (dp[i] == -1)
dfs(i);
}
cout << *max_element(all(dp)) << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define all(x) x.begin(), x.end()
ll power(ll a, ll b) {
ll res = 1;
a = a % mod;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b /= 2;
}
return res;
}
ll invmod(ll a) { return power(a, mod - 2); }
vector<vector<int>> adj;
vector<int> dp;
int dfs(int v) {
int mx = -1;
for (auto u : adj[v]) {
if (dp[u] == -1)
dfs(u);
mx = max(mx, dp[u]);
}
return dp[v] = mx + 1;
}
int main(void) {
FIO int t = 1;
// cin>>t;
while (t--) {
int n, m, u, v;
cin >> n >> m;
adj.assign(n + 1, vector<int>());
dp.assign(n + 1, -1);
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].pb(v);
}
for (int i = 1; i <= n; i++) {
if (dp[i] == -1)
dfs(i);
}
cout << *max_element(all(dp)) << "\n";
}
return 0;
}
|
replace
| 32 | 33 | 32 | 35 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define double long double
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define len(x) ((int)(x).length())
#define pii pair<int, int>
#define vi vector<int>
#define vd vector<double>
#define vs vector<string>
#define mp map<int, int>
#define ms(x, y) memset(x, y, sizeof(x))
#define ump unordered_map<int, int>
#define lb lower_bound
#define ub upper_bound
#define nx cout << "\n";
#define inf 9223372036854775807
#define PI 3.14159265
const int MOD = 1e9 + 7;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int add(int a, int b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline int multi(int a, int b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline int sub(int a, int b) {
a %= MOD;
b %= MOD;
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline int power(int a, int b) {
a %= MOD;
int res = 1;
while (b > 0) {
if (b & 1) {
res = multi(res, a);
}
a = multi(a, a);
b >>= 1;
}
return res;
}
bool isPrime(int x) {
if (x <= 4 || x % 2 == 0 || x % 3 == 0) {
return x == 2 || x == 3;
}
for (int i = 5; i * i <= x; i += 6) {
if (x % i == 0 || x % (i + 2) == 0) {
return 0;
}
}
return 1;
}
int dfs(int i, int dp[], vi adj[]) {
if (dp[i] != -1)
return dp[i];
int res = 0;
for (int j : adj[i]) {
res = max(res, 1 + dfs(j, dp, adj));
}
return dp[i] = res;
}
int32_t main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m;
cin >> n >> m;
int dp[n + 1];
ms(dp, -1);
vi adj[n + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i, dp, adj));
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define double long double
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define len(x) ((int)(x).length())
#define pii pair<int, int>
#define vi vector<int>
#define vd vector<double>
#define vs vector<string>
#define mp map<int, int>
#define ms(x, y) memset(x, y, sizeof(x))
#define ump unordered_map<int, int>
#define lb lower_bound
#define ub upper_bound
#define nx cout << "\n";
#define inf 9223372036854775807
#define PI 3.14159265
const int MOD = 1e9 + 7;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int add(int a, int b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline int multi(int a, int b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline int sub(int a, int b) {
a %= MOD;
b %= MOD;
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline int power(int a, int b) {
a %= MOD;
int res = 1;
while (b > 0) {
if (b & 1) {
res = multi(res, a);
}
a = multi(a, a);
b >>= 1;
}
return res;
}
bool isPrime(int x) {
if (x <= 4 || x % 2 == 0 || x % 3 == 0) {
return x == 2 || x == 3;
}
for (int i = 5; i * i <= x; i += 6) {
if (x % i == 0 || x % (i + 2) == 0) {
return 0;
}
}
return 1;
}
int dfs(int i, int dp[], vi adj[]) {
if (dp[i] != -1)
return dp[i];
int res = 0;
for (int j : adj[i]) {
res = max(res, 1 + dfs(j, dp, adj));
}
return dp[i] = res;
}
int32_t main() {
fast;
int n, m;
cin >> n >> m;
int dp[n + 1];
ms(dp, -1);
vi adj[n + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i, dp, adj));
}
cout << ans;
}
|
delete
| 83 | 87 | 83 | 83 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vis, dp;
void initialise(int n) {
vis.assign(n, 0);
dp.assign(n, 0);
}
int dfs(int i, vector<int> v[]) {
int max = 0;
vis[i] = 1;
for (int j = 0; j < (int)v[i].size(); j++) {
if (max < dfs(v[i][j], v)) {
max = dfs(v[i][j], v);
}
}
dp[i] = max + 1;
return dp[i];
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
vector<int> v[n];
initialise(n);
for (int i = 0; i < m; i++) {
cin >> x >> y;
x--, y--;
v[x].push_back(y);
}
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, v);
}
}
int i = *max_element(dp.begin(), dp.end());
cout << i - 1;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> vis, dp;
void initialise(int n) {
vis.assign(n, 0);
dp.assign(n, 0);
}
int dfs(int i, vector<int> v[]) {
int max = 0;
vis[i] = 1;
for (int j = 0; j < (int)v[i].size(); j++) {
if (!vis[v[i][j]]) {
if (max < dfs(v[i][j], v)) {
max = dp[v[i][j]];
}
} else if (max < dp[v[i][j]]) {
max = dp[v[i][j]];
}
}
dp[i] = max + 1;
return dp[i];
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
vector<int> v[n];
initialise(n);
for (int i = 0; i < m; i++) {
cin >> x >> y;
x--, y--;
v[x].push_back(y);
}
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, v);
}
}
int i = *max_element(dp.begin(), dp.end());
cout << i - 1;
}
|
replace
| 13 | 15 | 13 | 19 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
Graph G;
int dp[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return res;
}
int main() {
int n, m;
cin >> n >> m;
G.resize(n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
rep(i, n) { dp[i] = -1; }
int ans = 0;
rep(i, n) { chmax(ans, rec(i)); }
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
Graph G;
int dp[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
int main() {
int n, m;
cin >> n >> m;
G.resize(n);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
rep(i, n) { dp[i] = -1; }
int ans = 0;
rep(i, n) { chmax(ans, rec(i)); }
cout << ans << endl;
return 0;
}
|
replace
| 31 | 32 | 31 | 32 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> tree[100001];
vector<int> emp[100001];
int dp[100001];
int gmx = 0;
int dfs(int ind) {
int mx = 0;
for (auto e : tree[ind]) {
mx = max(mx, dfs(e));
}
dp[ind] = mx + 1;
return mx + 1;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
tree[a].push_back(b);
emp[b].push_back(a);
}
queue<int> q;
for (int i = 1; i <= n; i++) {
if (emp[i].empty())
q.push(i);
}
while (!q.empty()) {
gmx = max(gmx, dfs(q.front()));
q.pop();
}
cout << gmx - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> tree[100001];
vector<int> emp[100001];
int dp[100001];
int gmx = 0;
int dfs(int ind) {
int mx = 0;
if (dp[ind] != 0)
return dp[ind];
for (auto e : tree[ind]) {
mx = max(mx, dfs(e));
}
dp[ind] = mx + 1;
return mx + 1;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
tree[a].push_back(b);
emp[b].push_back(a);
}
queue<int> q;
for (int i = 1; i <= n; i++) {
if (emp[i].empty())
q.push(i);
}
while (!q.empty()) {
gmx = max(gmx, dfs(q.front()));
q.pop();
}
cout << gmx - 1 << endl;
}
|
insert
| 12 | 12 | 12 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ull unsigned long long
#define repi(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define repdi(i, a) for (auto i = a.rbegin(); i != a.rend(); ++i)
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define MOD 1000000007
#define ff first
#define ss second
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl "\n"
#define INF 1e18
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define mod 998244353
#define limit 1000
#define fl(a, x) memset(a, x, sizeof(a));
#define pt(a, x) cout << get<x>(a) << " ";
#define int long
typedef vector<int> vii;
typedef pair<ll, ll> pii;
typedef vector<pii> vpi;
typedef vector<vector<ll>> vv;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int n, m, dp[100001];
vector<int> g[100001];
int ans(int node) {
int mx = 0;
if (dp[node] != -1)
return dp[node];
for (auto i : g[node]) {
mx = max(mx, 1 + ans(i));
}
return mx;
}
void solve() {
cin >> n >> m;
fl(dp, -1);
rep(i, 0, m) {
int x, y;
cin >> x >> y;
g[x].eb(y);
}
int mx = 0;
rep(i, 1, n + 1) { mx = max(mx, ans(i)); }
cout << mx << nl;
}
int32_t main() {
fast;
int t = 1;
// cin>>t;
rep(i, 0, t) { solve(); }
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
|
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ull unsigned long long
#define repi(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define repdi(i, a) for (auto i = a.rbegin(); i != a.rend(); ++i)
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define MOD 1000000007
#define ff first
#define ss second
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl "\n"
#define INF 1e18
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define mod 998244353
#define limit 1000
#define fl(a, x) memset(a, x, sizeof(a));
#define pt(a, x) cout << get<x>(a) << " ";
#define int long
typedef vector<int> vii;
typedef pair<ll, ll> pii;
typedef vector<pii> vpi;
typedef vector<vector<ll>> vv;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int n, m, dp[100001];
vector<int> g[100001];
int ans(int node) {
int mx = 0;
if (dp[node] != -1)
return dp[node];
for (auto i : g[node]) {
mx = max(mx, 1 + ans(i));
}
return dp[node] = mx;
}
void solve() {
cin >> n >> m;
fl(dp, -1);
rep(i, 0, m) {
int x, y;
cin >> x >> y;
g[x].eb(y);
}
int mx = 0;
rep(i, 1, n + 1) { mx = max(mx, ans(i)); }
cout << mx << nl;
}
int32_t main() {
fast;
int t = 1;
// cin>>t;
rep(i, 0, t) { solve(); }
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
}
|
replace
| 66 | 67 | 66 | 67 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> adj[100100];
vector<int> inc[100100];
bool vis[100100];
vector<int> ord;
void topo(int x) {
vis[x] = true;
for (auto i : adj[x]) {
topo(i);
}
ord.push_back(x);
}
int dp[100100];
int o = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int ai, bi;
for (int i = 0; i < m; i++) {
cin >> ai >> bi;
ai--;
bi--;
adj[ai].push_back(bi);
inc[bi].push_back(ai);
}
for (int i = 0; i < n; i++) {
if (!vis[i])
topo(i);
}
reverse(ord.begin(), ord.end());
for (auto &i : ord) {
for (auto &j : inc[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
o = max(o, dp[i]);
}
cout << o << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector<int> adj[100100];
vector<int> inc[100100];
bool vis[100100];
vector<int> ord;
void topo(int x) {
vis[x] = true;
for (auto i : adj[x]) {
if (vis[i])
continue;
topo(i);
}
ord.push_back(x);
}
int dp[100100];
int o = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
int ai, bi;
for (int i = 0; i < m; i++) {
cin >> ai >> bi;
ai--;
bi--;
adj[ai].push_back(bi);
inc[bi].push_back(ai);
}
for (int i = 0; i < n; i++) {
if (!vis[i])
topo(i);
}
reverse(ord.begin(), ord.end());
for (auto &i : ord) {
for (auto &j : inc[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
o = max(o, dp[i]);
}
cout << o << endl;
}
|
insert
| 12 | 12 | 12 | 14 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
void dfs(int i, vector<int> adj[], vector<bool> vis, vector<int> &dp) {
vis[i] = 1;
for (int j = 0; j < adj[i].size(); j++) {
if (!vis[adj[i][j]])
dfs(adj[i][j], adj, vis, dp);
dp[i] = max(dp[i], 1 + dp[adj[i][j]]);
}
}
int main() {
int n, m, x, y;
cin >> n >> m;
vector<int> dp(n + 1, 0);
vector<int> adj[n + 1];
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].push_back(y);
}
vector<bool> vis(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i, adj, vis, dp);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(int i, vector<int> adj[], vector<bool> &vis, vector<int> &dp) {
vis[i] = 1;
for (int j = 0; j < adj[i].size(); j++) {
if (!vis[adj[i][j]])
dfs(adj[i][j], adj, vis, dp);
dp[i] = max(dp[i], 1 + dp[adj[i][j]]);
}
}
int main() {
int n, m, x, y;
cin >> n >> m;
vector<int> dp(n + 1, 0);
vector<int> adj[n + 1];
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].push_back(y);
}
vector<bool> vis(n + 1, 0);
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i, adj, vis, dp);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
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;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
詰まった時に、別の分野の問題として考え直す（これdpでは？、グラフとしてみればいいのでは？）
多くの問題はパターンマッチだが、パターンに落とし込むまでが難しく、そのための訓練としてわからない問題をあれこれ色々な角度から考察してみるのではないか
cin.tie(0);
ios::sync_with_stdio(false);<- これら、printfとかと併用しない方が良さそう
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
/* <--------------------------------------------> */
int n;
vector<int> G[100005];
vector<int> dp(100005, -1);
int rec(int now) {
if (dp[now] != -1)
return dp[now];
int res = 0;
for (auto to : G[now]) {
chmax(res, rec(to) + 1);
}
return res;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int m;
cin >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
}
int ans = 0;
rep(i, n) chmax(ans, rec(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
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;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
ごちゃごちゃ場合分けを考える前に全探索は考えましたか？
詰まった時に、別の分野の問題として考え直す（これdpでは？、グラフとしてみればいいのでは？）
多くの問題はパターンマッチだが、パターンに落とし込むまでが難しく、そのための訓練としてわからない問題をあれこれ色々な角度から考察してみるのではないか
cin.tie(0);
ios::sync_with_stdio(false);<- これら、printfとかと併用しない方が良さそう
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
/* <--------------------------------------------> */
int n;
vector<int> G[100005];
vector<int> dp(100005, -1);
int rec(int now) {
if (dp[now] != -1)
return dp[now];
int res = 0;
for (auto to : G[now]) {
chmax(res, rec(to) + 1);
}
return dp[now] = res;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
int m;
cin >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
}
int ans = 0;
rep(i, n) chmax(ans, rec(i));
cout << ans << endl;
return 0;
}
|
replace
| 63 | 64 | 63 | 64 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<int> graph[100001];
int dp[100001];
int solve(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = true;
int best = 0;
for (int child : graph[src]) {
leaf = false;
best = max(best, solve(child));
}
return leaf ? 0 : 1 + best;
}
int main() {
memset(dp, -1, sizeof dp);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int res = solve(i);
ans = max(ans, res);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
vector<int> graph[100001];
int dp[100001];
int solve(int src) {
if (dp[src] != -1)
return dp[src];
bool leaf = true;
int best = 0;
for (int child : graph[src]) {
leaf = false;
best = max(best, solve(child));
}
return dp[src] = leaf ? 0 : 1 + best;
}
int main() {
memset(dp, -1, sizeof dp);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int res = solve(i);
ans = max(ans, res);
}
cout << ans << endl;
}
|
replace
| 19 | 20 | 19 | 20 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
/****************************************************************************
Is this the real life? Is this just fantasy?
Caught in a landslide, no escape from reality
Open your eyes, look up to the skies and see
I'm just a poor boy, I need no sympathy
Because I'm easy come, easy go, little high, little low
Any way the wind blows doesn't really matter to me, to me!!!
--------------------------------------------------
CP is quite cool.It becomes cooler when you enjoy learning new things
******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define endl "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define pool(i, a, b) for (int i = a; i >= b; i--)
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector<ll>
#define vb vector<bool>
#define all(x) x.begin(), x.end()
#define sz(a) a.size()
#define ff first
#define ss second
#define debug(x) cout << #x << " = " << x << endl;
const int mod = 1e9 + 7;
vector<vi> g;
vi mx;
vb vis;
void dfs(int u) {
for (auto v : g[u]) {
if (!vis[v])
dfs(v);
mx[u] = max(mx[u], 1 + mx[v]);
}
if (g[u].size() == 0)
mx[u] = 0;
}
void solve() {
int n, m;
cin >> n >> m;
g = vector<vi>(n + 1);
vis = vb(n + 1, false);
mx = vi(n + 1, 0);
rep(i, m) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
loop(i, 1, n) {
if (!vis[i])
dfs(i);
}
cout << *max_element(all(mx));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
/****************************************************************************
Is this the real life? Is this just fantasy?
Caught in a landslide, no escape from reality
Open your eyes, look up to the skies and see
I'm just a poor boy, I need no sympathy
Because I'm easy come, easy go, little high, little low
Any way the wind blows doesn't really matter to me, to me!!!
--------------------------------------------------
CP is quite cool.It becomes cooler when you enjoy learning new things
******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define endl "\n"
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define pool(i, a, b) for (int i = a; i >= b; i--)
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector<ll>
#define vb vector<bool>
#define all(x) x.begin(), x.end()
#define sz(a) a.size()
#define ff first
#define ss second
#define debug(x) cout << #x << " = " << x << endl;
const int mod = 1e9 + 7;
vector<vi> g;
vi mx;
vb vis;
void dfs(int u) {
vis[u] = true;
for (auto v : g[u]) {
if (!vis[v])
dfs(v);
mx[u] = max(mx[u], 1 + mx[v]);
}
if (g[u].size() == 0)
mx[u] = 0;
}
void solve() {
int n, m;
cin >> n >> m;
g = vector<vi>(n + 1);
vis = vb(n + 1, false);
mx = vi(n + 1, 0);
rep(i, m) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
loop(i, 1, n) {
if (!vis[i])
dfs(i);
}
cout << *max_element(all(mx));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
insert
| 37 | 37 | 37 | 38 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
typedef long int li;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pt;
#define fi first
#define se second
#define dump(x) cout << #x << " = " << x << endl
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
li n, m, x, y, cl[100007], dp[100007], ans;
vector<int> g[100007];
li dfs(int v) {
cl[v] = 1;
dp[v] = 0;
for (int i : g[v]) {
dp[v] = max(dp[v], dfs(i) + 1);
}
return (dp[v]);
}
int main() {
fastIO;
cin >> n >> m;
for (li i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
ans = 0;
for (li i = 1; i <= n; i++) {
if (!cl[i])
ans = max(ans, dfs(i));
}
cout << ans;
}
|
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
typedef long int li;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pt;
#define fi first
#define se second
#define dump(x) cout << #x << " = " << x << endl
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
li n, m, x, y, cl[100007], dp[100007], ans;
vector<int> g[100007];
li dfs(int v) {
if (dp[v])
return (dp[v]);
cl[v] = 1;
dp[v] = 0;
for (int i : g[v]) {
dp[v] = max(dp[v], dfs(i) + 1);
}
return (dp[v]);
}
int main() {
fastIO;
cin >> n >> m;
for (li i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
ans = 0;
for (li i = 1; i <= n; i++) {
if (!cl[i])
ans = max(ans, dfs(i));
}
cout << ans;
}
|
insert
| 22 | 22 | 22 | 24 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> x;
int n, m;
bool visited[100009];
int dp[100009];
int solve(int curr) {
if (dp[curr] != -1)
return dp[curr];
int temp = -1;
for (auto i : x[curr]) {
if (dp[i] != -1) {
temp = 1 + dp[i];
dp[curr] = max(dp[curr], temp);
} else
dp[curr] = max(dp[curr], 1 + solve(i));
}
if (dp[curr] == -1) {
return dp[curr] = 0;
}
return dp[curr];
}
int main() {
scanf("%d%d", &n, &m);
x.resize(m + 5);
int from, to;
for (int i = 0; i < m; ++i) {
scanf("%d%d", &from, &to);
x[from].push_back(to);
}
memset(visited, false, sizeof visited);
memset(dp, -1, sizeof dp);
int ans = -1;
for (int i = 1; i <= n; ++i)
ans = max(ans, solve(i));
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> x;
int n, m;
bool visited[100009];
int dp[100009];
int solve(int curr) {
if (dp[curr] != -1)
return dp[curr];
int temp = -1;
for (auto i : x[curr]) {
if (dp[i] != -1) {
temp = 1 + dp[i];
dp[curr] = max(dp[curr], temp);
} else
dp[curr] = max(dp[curr], 1 + solve(i));
}
if (dp[curr] == -1) {
return dp[curr] = 0;
}
return dp[curr];
}
int main() {
scanf("%d%d", &n, &m);
x.resize(n + 5);
int from, to;
for (int i = 0; i < m; ++i) {
scanf("%d%d", &from, &to);
x[from].push_back(to);
}
memset(visited, false, sizeof visited);
memset(dp, -1, sizeof dp);
int ans = -1;
for (int i = 1; i <= n; ++i)
ans = max(ans, solve(i));
printf("%d", ans);
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int dp[10010];
int longest(vector<int> v[], int i) {
if (v[i].size() == 0)
return 0;
if (dp[i] >= 0)
return dp[i];
else {
for (auto e : v[i]) {
dp[i] = max(dp[i], 1 + longest(v, e));
}
return dp[i];
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m, x, y;
cin >> n >> m;
vector<int> v[n + 1];
for (int i = 0; i <= n; ++i) {
dp[i] = -1;
}
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
v[x].push_back(y);
}
int k = 0;
for (int i = 1; i <= n; ++i) {
k = max(k, longest(v, i));
}
cout << k << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int dp[100100];
int longest(vector<int> v[], int i) {
if (v[i].size() == 0)
return 0;
if (dp[i] >= 0)
return dp[i];
else {
for (auto e : v[i]) {
dp[i] = max(dp[i], 1 + longest(v, e));
}
return dp[i];
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m, x, y;
cin >> n >> m;
vector<int> v[n + 1];
for (int i = 0; i <= n; ++i) {
dp[i] = -1;
}
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
v[x].push_back(y);
}
int k = 0;
for (int i = 1; i <= n; ++i) {
k = max(k, longest(v, i));
}
cout << k << "\n";
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
/// Code By t_bone_289 (Tushar Singh)
/// An Immature Programmer.... I'm still developing !!
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define endl '\n'
#define M 1000000007
#define error(x) cout << #x << " = " << x << endl;
#define pi 3.14159265358979323846
typedef long long ll;
typedef double d;
typedef long double ld;
template <typename T> void ContainerError(T &v) {
cout << "{";
for (auto &x : v) {
cout << x << ',';
}
cout << "}" << endl;
return;
}
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll powmod(ll base, ll exp, ll MOD) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return (res % MOD);
}
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base);
base = (base * base);
exp /= 2;
}
return (res);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// dfs(i,G,dp,vis);
void dfs(ll ver, vector<vector<ll>> &G, vector<ll> &dp, vector<ll> &vis) {
if (vis[ver]) {
return;
}
for (ll j = 0; j < G[ver].size(); j++) {
ll v = G[ver][j];
dfs(v, G, dp, vis);
dp[ver] = max(dp[v] + 1, dp[ver]);
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
vector<vector<ll>> G(n);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
}
vector<ll> dp(n, 0);
vector<ll> vis(n, 0);
for (ll i = 0; i < n; i++) {
dfs(i, G, dp, vis);
}
ll ans = dp[0];
for (auto x : dp) {
ans = max(ans, x);
}
cout << ans;
return 0;
}
|
/// Code By t_bone_289 (Tushar Singh)
/// An Immature Programmer.... I'm still developing !!
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define endl '\n'
#define M 1000000007
#define error(x) cout << #x << " = " << x << endl;
#define pi 3.14159265358979323846
typedef long long ll;
typedef double d;
typedef long double ld;
template <typename T> void ContainerError(T &v) {
cout << "{";
for (auto &x : v) {
cout << x << ',';
}
cout << "}" << endl;
return;
}
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
ll powmod(ll base, ll exp, ll MOD) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return (res % MOD);
}
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base);
base = (base * base);
exp /= 2;
}
return (res);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// dfs(i,G,dp,vis);
void dfs(ll ver, vector<vector<ll>> &G, vector<ll> &dp, vector<ll> &vis) {
if (vis[ver]) {
return;
}
vis[ver] = 1;
for (ll j = 0; j < G[ver].size(); j++) {
ll v = G[ver][j];
dfs(v, G, dp, vis);
dp[ver] = max(dp[v] + 1, dp[ver]);
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m;
cin >> n >> m;
vector<vector<ll>> G(n);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
}
vector<ll> dp(n, 0);
vector<ll> vis(n, 0);
for (ll i = 0; i < n; i++) {
dfs(i, G, dp, vis);
}
ll ans = dp[0];
for (auto x : dp) {
ans = max(ans, x);
}
cout << ans;
return 0;
}
|
insert
| 58 | 58 | 58 | 59 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int dp[100001], n, m, a, b;
int solve(vector<vector<int>> &arr, int i) {
if (dp[i] != -1)
return dp[i];
for (int j = 0; j < arr[i].size(); j++) {
dp[i] = max(1 + solve(arr, arr[i][j]), dp[i]);
}
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof(dp));
cin >> n >> m;
vector<vector<int>> arr(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
arr[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (arr[i].size() == 0) {
dp[i] = 0;
}
}
int maxi = INT_MIN;
for (int i = 1; i <= n; i++) {
memset(dp, -1, sizeof(dp));
for (int j = 1; j <= n; j++) {
if (arr[j].size() == 0) {
dp[j] = 0;
}
}
maxi = max(maxi, solve(arr, i));
}
cout << maxi;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100001], n, m, a, b;
int solve(vector<vector<int>> &arr, int i) {
if (dp[i] != -1)
return dp[i];
for (int j = 0; j < arr[i].size(); j++) {
dp[i] = max(1 + solve(arr, arr[i][j]), dp[i]);
}
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof(dp));
cin >> n >> m;
vector<vector<int>> arr(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
arr[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (arr[i].size() == 0) {
dp[i] = 0;
}
}
int maxi = INT_MIN;
for (int i = 1; i <= n; i++) {
maxi = max(maxi, solve(arr, i));
}
cout << maxi;
}
|
delete
| 33 | 39 | 33 | 33 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int NINF = -1 * INF;
const long long LLINF = 1ll << 60;
const long long LLNINF = -1 * LLINF;
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,
Container const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
return os << "[ " << p.first << ", " << p.second << "]";
}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<vector<int>> vvi;
#define mp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define revAll(x) x.rbegin(), x.rend()
#define gcd(a, b) __gcd(a, b)
#define isize(x) (int)(x.size())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define umap unordered_map
vvi G = vvi(10e5 + 100);
umap<int, int> mem = umap<int, int>();
int gans = 0;
int longest(int node, int prnt) {
if (mem.find(node) != mem.end())
return mem[node];
int ans = 0;
for (const int &nbhr : G[node]) {
if (nbhr == prnt)
continue;
ans = max(ans, 1 + longest(nbhr, node));
}
gans = max(gans, ans);
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, m) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].pb(v);
}
rep(i, n) { longest(i, -1); }
cout << gans;
}
|
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int NINF = -1 * INF;
const long long LLINF = 1ll << 60;
const long long LLNINF = -1 * LLINF;
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,
Container const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
return os << "[ " << p.first << ", " << p.second << "]";
}
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<vector<int>> vvi;
#define mp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define revAll(x) x.rbegin(), x.rend()
#define gcd(a, b) __gcd(a, b)
#define isize(x) (int)(x.size())
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define umap unordered_map
vvi G = vvi(10e5 + 100);
umap<int, int> mem = umap<int, int>();
int gans = 0;
int longest(int node, int prnt) {
if (mem.find(node) != mem.end())
return mem[node];
int ans = 0;
for (const int &nbhr : G[node]) {
if (nbhr == prnt)
continue;
ans = max(ans, 1 + longest(nbhr, node));
}
gans = max(gans, ans);
mem[node] = ans;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, m) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].pb(v);
}
rep(i, n) { longest(i, -1); }
cout << gans;
}
|
insert
| 62 | 62 | 62 | 63 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define BIGINF (int)4e18 + 7
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define INF (int)2e9 + 7
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
typedef long long ll;
typedef long double ld;
typedef string str;
typedef double d;
typedef unsigned u;
typedef unsigned long long ull;
// int N = 10005;
bool visited[100005];
int dp[100005];
int inDegree[100005];
vector<int> graph[100005];
void dfs(int vertex) {
visited[vertex] = true;
int size = graph[vertex].size();
for (int i = 0; i < size; i++) {
int a = graph[vertex][i];
dp[a] = max(dp[a], dp[vertex] + 1);
inDegree[a]--;
if (inDegree[a] == 0)
dfs(a);
}
}
int main() {
// freopen("inputf.txt", "r", stdin);
// freopen("outputf.txt", "w", stdout);
int n, m;
SCD(n);
SCD(m);
int x, y;
memset(dp, 0, sizeof(dp));
memset(visited, false, sizeof(dp));
for (int i = 0; i < m; i++) {
SCD(x);
SCD(y);
graph[x].push_back(y);
inDegree[y]++;
}
for (int i = 1; i <= n; i++) {
if (!visited[i] && inDegree[i] == 0)
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define BIGINF (int)4e18 + 7
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define INF (int)2e9 + 7
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
typedef long long ll;
typedef long double ld;
typedef string str;
typedef double d;
typedef unsigned u;
typedef unsigned long long ull;
// int N = 10005;
bool visited[100005];
int dp[100005];
int inDegree[100005];
vector<int> graph[100005];
void dfs(int vertex) {
visited[vertex] = true;
int size = graph[vertex].size();
for (int i = 0; i < size; i++) {
int a = graph[vertex][i];
dp[a] = max(dp[a], dp[vertex] + 1);
inDegree[a]--;
if (inDegree[a] == 0)
dfs(a);
}
}
int main() {
// freopen("inputf.txt", "r", stdin);
// freopen("outputf.txt", "w", stdout);
int n, m;
SCD(n);
SCD(m);
int x, y;
memset(dp, 0, sizeof(dp));
memset(visited, false, sizeof(visited));
for (int i = 0; i < m; i++) {
SCD(x);
SCD(y);
graph[x].push_back(y);
inDegree[y]++;
}
for (int i = 1; i <= n; i++) {
if (!visited[i] && inDegree[i] == 0)
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
printf("%d", ans);
return 0;
}
|
replace
| 47 | 48 | 47 | 48 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int dfs(const vector<vector<int>> &p, vector<int> &r, int n) {
if (r[n] != -1)
return r[n];
int a = -1;
for (auto m : p[n]) {
a = max(a, dfs(p, r, m));
}
return a + 1;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> p(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
--x;
--y;
p[x].push_back(y);
}
int res = -1;
vector<int> r(N, -1);
for (int i = 0; i < N; i++) {
res = max(res, dfs(p, r, i));
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int dfs(const vector<vector<int>> &p, vector<int> &r, int n) {
if (r[n] != -1)
return r[n];
int a = -1;
for (auto m : p[n]) {
a = max(a, dfs(p, r, m));
}
return r[n] = a + 1;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> p(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
--x;
--y;
p[x].push_back(y);
}
int res = -1;
vector<int> r(N, -1);
for (int i = 0; i < N; i++) {
res = max(res, dfs(p, r, i));
}
cout << res << endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/*
https://atcoder.jp/contests/dp/tasks/dp_g
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 10;
const int oo = 1e9 + 7;
vector<vector<int>> adj;
int n, m;
int f[N], ans = 0;
bool Visited[N];
void Init() {
cin >> n >> m;
for (int i = 0; i <= n; ++i) {
adj.push_back(vector<int>());
}
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
adj[u].push_back(v);
}
}
void DFS(int pos) {
Visited[pos] = true;
for (int i = 0; i < adj[pos].size(); ++i) {
if (!Visited[adj[pos][i]])
DFS(adj[pos][i]);
f[pos] = max(f[pos], f[adj[pos][i]] + 1);
}
}
int main() {
Init();
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (Visited[i])
continue;
DFS(i);
}
for (int i = 1; i <= n; ++i) {
ans = max(ans, f[i]);
}
cout << ans;
return 0;
}
|
/*
https://atcoder.jp/contests/dp/tasks/dp_g
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const int oo = 1e9 + 7;
vector<vector<int>> adj;
int n, m;
int f[N], ans = 0;
bool Visited[N];
void Init() {
cin >> n >> m;
for (int i = 0; i <= n; ++i) {
adj.push_back(vector<int>());
}
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
adj[u].push_back(v);
}
}
void DFS(int pos) {
Visited[pos] = true;
for (int i = 0; i < adj[pos].size(); ++i) {
if (!Visited[adj[pos][i]])
DFS(adj[pos][i]);
f[pos] = max(f[pos], f[adj[pos][i]] + 1);
}
}
int main() {
Init();
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (Visited[i])
continue;
DFS(i);
}
for (int i = 1; i <= n; ++i) {
ans = max(ans, f[i]);
}
cout << ans;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define ll long long int
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
vector<int> g[11111];
int in[11111];
int dp[11111];
ll dfs(ll u) {
if (dp[u])
return dp[u];
ll ans = 0;
for (int v : g[u]) {
ans = max(ans, 1 + dfs(v));
}
return dp[u] = (ans);
}
int main() {
fast;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
in[v]++;
}
ll ans = -1;
for (int i = 1; i <= n; i++) {
if (!dp[i]) {
ans = max(ans, dfs(i));
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define ll long long int
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
vector<int> g[111111];
int in[111111];
int dp[111111];
ll dfs(ll u) {
if (dp[u])
return dp[u];
ll ans = 0;
for (int v : g[u]) {
ans = max(ans, 1 + dfs(v));
}
return dp[u] = (ans);
}
int main() {
fast;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
in[v]++;
}
ll ans = -1;
for (int i = 1; i <= n; i++) {
if (!dp[i]) {
ans = max(ans, dfs(i));
}
}
cout << ans;
return 0;
}
|
replace
| 12 | 15 | 12 | 15 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <vector>
using namespace std;
long long N, W;
vector<vector<int>> G;
long long solve(long long *dp, long long v);
int main() {
cin >> N >> W;
G.assign(N, vector<int>());
// dp[v]: v を始点としたときの、G の有効パスの長さの最大値
long long dp[N];
for (int i = 0; i < N; i++) {
dp[i] = -1;
}
for (int i = 0; i < W; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
// cout << x << " connected to " << y << endl;
}
long long res = 0;
for (int i = 0; i < N; i++) {
long long tmp = solve(dp, i);
// cout << i << " " << tmp << endl;
if (res < tmp) {
res = tmp;
}
}
std::cout << res;
return 0;
}
long long solve(long long *dp, long long v) {
long long res = 0;
for (int edge : G[v]) {
long long tmp = solve(dp, edge) + 1;
if (res < tmp) {
res = tmp;
}
}
dp[v] = res;
return res;
}
|
#include <iostream>
#include <vector>
using namespace std;
long long N, W;
vector<vector<int>> G;
long long solve(long long *dp, long long v);
int main() {
cin >> N >> W;
G.assign(N, vector<int>());
// dp[v]: v を始点としたときの、G の有効パスの長さの最大値
long long dp[N];
for (int i = 0; i < N; i++) {
dp[i] = -1;
}
for (int i = 0; i < W; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
// cout << x << " connected to " << y << endl;
}
long long res = 0;
for (int i = 0; i < N; i++) {
long long tmp = solve(dp, i);
// cout << i << " " << tmp << endl;
if (res < tmp) {
res = tmp;
}
}
std::cout << res;
return 0;
}
long long solve(long long *dp, long long v) {
if (dp[v] != -1) {
return dp[v];
}
long long res = 0;
for (int edge : G[v]) {
long long tmp = solve(dp, edge) + 1;
if (res < tmp) {
res = tmp;
}
}
dp[v] = res;
return res;
}
|
insert
| 43 | 43 | 43 | 47 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int MN = 100010;
int n, m;
int dp[MN];
bool used[MN];
vector<int> g[MN];
int dfs(int v) {
if (used[v])
return dp[v];
for (int i = 0; i < int(g[v].size()); i++) {
int u = g[v][i];
dp[v] = max(dp[v], dfs(u) + 1);
}
return dp[v];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MN = 100010;
int n, m;
int dp[MN];
bool used[MN];
vector<int> g[MN];
int dfs(int v) {
if (used[v])
return dp[v];
for (int i = 0; i < int(g[v].size()); i++) {
int u = g[v][i];
dp[v] = max(dp[v], dfs(u) + 1);
}
used[v] = true;
return dp[v];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
insert
| 17 | 17 | 17 | 18 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> adj;
vector<int> lp;
vector<bool> visited;
void dfs(const int vertex) {
for (const auto child : adj[vertex]) {
if (not visited[child]) {
dfs(child);
}
lp[vertex] = max(lp[vertex], lp[child] + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
adj.resize(N);
lp.resize(N, 0);
visited.resize(N, false);
for (int edge_number = 0; edge_number < M; ++edge_number) {
int u, v;
cin >> u >> v;
--u, --v;
adj[u].emplace_back(v);
}
for (int vertex = 0; vertex < N; ++vertex) {
if (not visited[vertex]) {
visited[vertex] = true;
dfs(vertex);
}
}
int result{};
for (const auto p : lp) {
result = max(result, p);
}
cout << result << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> adj;
vector<int> lp;
vector<bool> visited;
void dfs(const int vertex) {
for (const auto child : adj[vertex]) {
if (not visited[child]) {
visited[child] = true;
dfs(child);
}
lp[vertex] = max(lp[vertex], lp[child] + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
adj.resize(N);
lp.resize(N, 0);
visited.resize(N, false);
for (int edge_number = 0; edge_number < M; ++edge_number) {
int u, v;
cin >> u >> v;
--u, --v;
adj[u].emplace_back(v);
}
for (int vertex = 0; vertex < N; ++vertex) {
if (not visited[vertex]) {
visited[vertex] = true;
dfs(vertex);
}
}
int result{};
for (const auto p : lp) {
result = max(result, p);
}
cout << result << "\n";
return 0;
}
|
insert
| 12 | 12 | 12 | 13 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define _u(i, a, b) for (int i = a; i <= b; ++i)
#define _d(i, a, b) for (int i = a; i >= b; --i)
#define endl "\n"
#define ii pair<int, int>
#define fi first
#define se second
#define ll long long
#define FIO() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define FI(task) freopen(task ".inp", "r", stdin)
#define FO(task) freopen(task ".out", "w", stdout)
using namespace std;
const int N = 1e5 + 7;
const int M = 1e9 + 7;
vector<int> edge[N];
int d[N];
int n, m, res;
void dfs(int u) {
d[u] = 0;
for (int v : edge[u]) {
dfs(v);
d[u] = max(d[u], d[v] + 1);
}
res = max(res, d[u]);
}
#define task "test"
int main() {
FIO();
// FI(task);
/// FO(task);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
edge[u].push_back(v);
}
memset(d, -1, sizeof d);
_u(i, 1, n) if (d[i] == -1) dfs(i);
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
#define _u(i, a, b) for (int i = a; i <= b; ++i)
#define _d(i, a, b) for (int i = a; i >= b; --i)
#define endl "\n"
#define ii pair<int, int>
#define fi first
#define se second
#define ll long long
#define FIO() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define FI(task) freopen(task ".inp", "r", stdin)
#define FO(task) freopen(task ".out", "w", stdout)
using namespace std;
const int N = 1e5 + 7;
const int M = 1e9 + 7;
vector<int> edge[N];
int d[N];
int n, m, res;
void dfs(int u) {
d[u] = 0;
for (int v : edge[u]) {
if (d[v] == -1)
dfs(v);
d[u] = max(d[u], d[v] + 1);
}
res = max(res, d[u]);
}
#define task "test"
int main() {
FIO();
// FI(task);
/// FO(task);
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
edge[u].push_back(v);
}
memset(d, -1, sizeof d);
_u(i, 1, n) if (d[i] == -1) dfs(i);
cout << res;
return 0;
}
|
replace
| 28 | 29 | 28 | 30 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
// var
int n, m, t1, t2, dp[100001], ans = 0;
vector<int> e[100001];
bool v[100001];
void dfs(int g) {
dp[g] = 1;
int am = 0;
for (int u : e[g]) {
if (!v[u])
dfs(u);
am = max(am, dp[u]);
}
dp[g] += am;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> t1 >> t2;
e[t1].pb(t2);
}
for (int i = 1; i <= n; i++) {
if (!v[i])
dfs(i);
ans = max(ans, dp[i]);
}
cout << --ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
// var
int n, m, t1, t2, dp[100001], ans = 0;
vector<int> e[100001];
bool v[100001];
void dfs(int g) {
dp[g] = 1;
int am = 0;
v[g] = 1;
for (int u : e[g]) {
if (!v[u])
dfs(u);
am = max(am, dp[u]);
}
dp[g] += am;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> t1 >> t2;
e[t1].pb(t2);
}
for (int i = 1; i <= n; i++) {
if (!v[i])
dfs(i);
ans = max(ans, dp[i]);
}
cout << --ans << endl;
}
|
insert
| 13 | 13 | 13 | 14 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ctype.h>
#define pb push_back
#define fst first
#define sec second
#define For(i, a, b) for (int i = a; i < b; i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i, n) for (ll i = 0; i < n; i++)
#define endl "\n"
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define fo1(i, n) for (ll i = 1; i <= n; i++)
#define boolsize 1000001
#define pi pair<ll, ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template <typename T> void showvector(vector<T> v) {
for (T x : v)
cout << x << " ";
cout << endl;
}
template <typename T> void showvector1(vector<T> v) {
ll n = v.size();
fo1(i, n - 1) cout << v[i] << endl;
}
template <typename T> void showset(set<T> s) {
for (T x : s)
cout << x << " ";
cout << endl;
}
template <class T> void showvectorpair(vector<T> v) {
for (auto it = v.begin(); it != v.end(); it++)
cout << it->first << " " << it->second << endl;
cout << endl;
}
template <typename T, typename P> void showmap(map<T, P> m) {
for (auto it = m.begin(); it != m.end(); it++)
cout << it->first << " " << it->second << endl;
cout << endl;
}
template <typename T> bool comp(T a, T b) { return (a > b); }
template <class T> bool comppair(T a, T b) {
if (a.first == b.first)
return (a.second > b.second);
return (a.first > b.first);
}
bool sameparity(ll a, ll b) { return (a % 2 == b % 2); }
bool difparity(ll a, ll b) { return !(a % 2 == b % 2); }
bool isprime(ll x) {
if (x <= 1)
return false;
for (ll i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
bool iseven(ll x) { return !(x % 2); }
bool isodd(ll x) { return (x % 2); }
/// check for test case before submitting
void vfun() {
ll n, k;
cin >> n;
vector<ll> v(n);
fo(i, n) cin >> v[i];
}
const int siz = 100;
vector<ll> vis(siz, 0), dist(siz, -1);
vector<ll> g[siz];
ll dfs(ll node) { // cout<<node<<endl;
if (dist[node] != -1)
return dist[node];
vis[node] = 1;
dist[node] = 0;
for (ll child : g[node]) {
// if(!vis[child])
dist[node] = max(dist[node], 1 + dfs(child));
}
return dist[node];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("inputh.txt", "r", stdin);
freopen("outputh.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0); /// cant use scanf, printf
cin.tie(0);
cout.tie(
0); /// no longer auto flush cout before each cin, remove for interactive
// cout << fixed << setprecision(11); /// no scientific output
ll test = 1;
// cin>>test;
while (test--) {
ll n, m, x, y;
cin >> n >> m;
fo(i, m) {
cin >> x >> y;
g[x].pb(y);
}
fo1(i, n) {
if (!vis[i])
dfs(i);
}
// showvector(dist);
cout << *(max_element(dist.begin(), dist.end()));
// if(vfun())
// cout<<"YES\n";
// else
// cout<<"NO\n";
}
}
/// before sub
/// check for value of zero and single input in array
/// loop vars,1LL in mult, equal, one, bounds, int v ll, endl, finish taking
/// inputs
/// check whether test cases are given or not
|
#include <bits/stdc++.h>
#include <ctype.h>
#define pb push_back
#define fst first
#define sec second
#define For(i, a, b) for (int i = a; i < b; i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i, n) for (ll i = 0; i < n; i++)
#define endl "\n"
#define rev(i, n) for (ll i = n - 1; i >= 0; i--)
#define fo1(i, n) for (ll i = 1; i <= n; i++)
#define boolsize 1000001
#define pi pair<ll, ll>
#define vi vector<ll>
#define vii vector<pi>
using namespace std;
template <typename T> void showvector(vector<T> v) {
for (T x : v)
cout << x << " ";
cout << endl;
}
template <typename T> void showvector1(vector<T> v) {
ll n = v.size();
fo1(i, n - 1) cout << v[i] << endl;
}
template <typename T> void showset(set<T> s) {
for (T x : s)
cout << x << " ";
cout << endl;
}
template <class T> void showvectorpair(vector<T> v) {
for (auto it = v.begin(); it != v.end(); it++)
cout << it->first << " " << it->second << endl;
cout << endl;
}
template <typename T, typename P> void showmap(map<T, P> m) {
for (auto it = m.begin(); it != m.end(); it++)
cout << it->first << " " << it->second << endl;
cout << endl;
}
template <typename T> bool comp(T a, T b) { return (a > b); }
template <class T> bool comppair(T a, T b) {
if (a.first == b.first)
return (a.second > b.second);
return (a.first > b.first);
}
bool sameparity(ll a, ll b) { return (a % 2 == b % 2); }
bool difparity(ll a, ll b) { return !(a % 2 == b % 2); }
bool isprime(ll x) {
if (x <= 1)
return false;
for (ll i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
bool iseven(ll x) { return !(x % 2); }
bool isodd(ll x) { return (x % 2); }
/// check for test case before submitting
void vfun() {
ll n, k;
cin >> n;
vector<ll> v(n);
fo(i, n) cin >> v[i];
}
const int siz = 100003;
vector<ll> vis(siz, 0), dist(siz, -1);
vector<ll> g[siz];
ll dfs(ll node) { // cout<<node<<endl;
if (dist[node] != -1)
return dist[node];
vis[node] = 1;
dist[node] = 0;
for (ll child : g[node]) {
// if(!vis[child])
dist[node] = max(dist[node], 1 + dfs(child));
}
return dist[node];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("inputh.txt", "r", stdin);
freopen("outputh.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0); /// cant use scanf, printf
cin.tie(0);
cout.tie(
0); /// no longer auto flush cout before each cin, remove for interactive
// cout << fixed << setprecision(11); /// no scientific output
ll test = 1;
// cin>>test;
while (test--) {
ll n, m, x, y;
cin >> n >> m;
fo(i, m) {
cin >> x >> y;
g[x].pb(y);
}
fo1(i, n) {
if (!vis[i])
dfs(i);
}
// showvector(dist);
cout << *(max_element(dist.begin(), dist.end()));
// if(vfun())
// cout<<"YES\n";
// else
// cout<<"NO\n";
}
}
/// before sub
/// check for value of zero and single input in array
/// loop vars,1LL in mult, equal, one, bounds, int v ll, endl, finish taking
/// inputs
/// check whether test cases are given or not
|
replace
| 68 | 69 | 68 | 69 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define V(i) vector<i>
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define crep(i, N, n) for (__typeof(n) i = N; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define P(i, j) pair<i, j>
#define MP make_pair
#define MOD 1000000007
typedef long long ll;
typedef long l;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
ll n, m;
cin >> n >> m;
V(ll) cn(n + 1, 0), og(n + 1, 0), vis(n + 1, 0), piss;
V(V(ll)) graph(n + 1);
rep(i, m) {
ll a, b;
cin >> a >> b;
graph[b].push_back(a);
cn[a]++;
}
crep(i, 1, n + 1) {
if (cn[i] == 0) {
piss.push_back(i);
}
}
while (piss.size() > 0) {
ll node = piss[0];
if (vis[node] != 0) {
piss.erase(piss.begin());
continue;
}
vis[node] = 1;
for (ll i = 0; i < graph[node].size(); i++) {
og[graph[node][i]] = max(og[graph[node][i]], og[node] + 1);
cn[graph[node][i]]--;
if (cn[graph[node][i]] == 0 && vis[graph[node][i]] == 0) {
piss.push_back(graph[node][i]);
}
}
piss.erase(piss.begin());
}
cout << *max_element(all(og));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define V(i) vector<i>
#define rep(i, n) for (__typeof(n) i = 0; i < n; i++)
#define crep(i, N, n) for (__typeof(n) i = N; i < n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define P(i, j) pair<i, j>
#define MP make_pair
#define MOD 1000000007
typedef long long ll;
typedef long l;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ll n, m;
cin >> n >> m;
V(ll) cn(n + 1, 0), og(n + 1, 0), vis(n + 1, 0), piss;
V(V(ll)) graph(n + 1);
rep(i, m) {
ll a, b;
cin >> a >> b;
graph[b].push_back(a);
cn[a]++;
}
crep(i, 1, n + 1) {
if (cn[i] == 0) {
piss.push_back(i);
}
}
while (piss.size() > 0) {
ll node = piss[0];
if (vis[node] != 0) {
piss.erase(piss.begin());
continue;
}
vis[node] = 1;
for (ll i = 0; i < graph[node].size(); i++) {
og[graph[node][i]] = max(og[graph[node][i]], og[node] + 1);
cn[graph[node][i]]--;
if (cn[graph[node][i]] == 0 && vis[graph[node][i]] == 0) {
piss.push_back(graph[node][i]);
}
}
piss.erase(piss.begin());
}
cout << *max_element(all(og));
return 0;
}
|
replace
| 17 | 19 | 17 | 19 |
-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>
using namespace std;
#define ll long long
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int maxN = 1e5 + 5;
const int mod = 1e9 + 7;
vector<int> g[maxN];
int dp[maxN];
int dfs(int u) {
if (dp[u] != -1)
return dp[u];
int temp = 0;
for (auto x : g[u]) {
temp = max(temp, dfs(x) + 1);
}
return dp[u] = temp;
}
void solve() {
int n, m, u, v;
cin >> n >> m;
memset(dp, -1, 8 * n);
for (int i = 0; i < m; i++) {
cin >> u >> v, u--, v--;
g[u].push_back(v);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
}
int main() {
FASTIO
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int maxN = 1e5 + 5;
const int mod = 1e9 + 7;
vector<int> g[maxN];
int dp[maxN];
int dfs(int u) {
if (dp[u] != -1)
return dp[u];
int temp = 0;
for (auto x : g[u]) {
temp = max(temp, dfs(x) + 1);
}
return dp[u] = temp;
}
void solve() {
int n, m, u, v;
cin >> n >> m;
memset(dp, -1, sizeof dp);
for (int i = 0; i < m; i++) {
cin >> u >> v, u--, v--;
g[u].push_back(v);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
}
int main() {
FASTIO
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 28 | 29 | 28 | 29 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int dp[100009];
#define pb push_back
int vis[100009];
vector<int> adj[100009];
int n;
int call(int u) {
if (adj[u].size() == 0)
return 0;
int mx = 1;
for (int i = 0; i < adj[u].size(); i++) {
int chi = adj[u][i];
int val = call(chi) + 1;
mx = max(val, mx);
}
dp[u] = mx;
return mx;
}
int main() {
int m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int val = call(i);
// cout<<"max from "<<i<<" = "<<val<<endl;
ans = max(val, ans);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100009];
#define pb push_back
int vis[100009];
vector<int> adj[100009];
int n;
int call(int u) {
if (adj[u].size() == 0)
return 0;
int mx = 1;
if (dp[u] != -1)
return dp[u];
for (int i = 0; i < adj[u].size(); i++) {
int chi = adj[u][i];
int val = call(chi) + 1;
mx = max(val, mx);
}
dp[u] = mx;
return mx;
}
int main() {
int m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int val = call(i);
// cout<<"max from "<<i<<" = "<<val<<endl;
ans = max(val, ans);
}
cout << ans << endl;
}
|
insert
| 11 | 11 | 11 | 13 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j, k) for (int(i) = (j); (i) <= (k); (i)++)
#define repdown(i, j, k) for (int(i) = (j); (i) >= (k); (i)--)
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using namespace std;
const int Mod = (1e9) + 7;
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
const int INF = 10241024;
long double INFD = 100100100;
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
//_____________________array calc____________________________________//
/*
vvi mul(vvi &A, vvi &B){
vvi C(A.size(), vi(B.size()))
rep(i,A.size()){
rep(j,B.size()){
rep(k,B[0].size()){
C[i][j] = (C[i][j] A[i][k] + B[k][j]) % Mod;
}
}
}
return C;
}
vvi pow(vvi A, ll n){
vvi B(A.size(), vi(A.size()));
rep(i=0;i<A.size();i++){
B[i][i] = 1;
}
while (n >0){
if (n & 1) B = mul(B, A);
A = mul(A, A);
n = n >> 1;
}
return B;
}
*/
//_____________________Bynary Indexed Tree __________________________//
/*
const max_st = (1 << 15) - 1;
int bit[max_st];
int sum (int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
*/
//_____________________ following sorce code_________________________//
vvi dist;
vi li;
vi lis;
void dfs(int u) {
if (li[u] != 0)
return;
lis[u] = 1;
for (auto c : dist[u])
dfs(c);
li.pb(u);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
IN(n, m);
dist.resize(n);
li.resize(n);
lis.resize(n);
rep(i, 0, m - 1) {
int a, b;
IN(a, b);
a--;
b--;
dist[a].push_back(b);
}
vi dp(n);
int ans = 0;
rep(i, 0, n - 1) dfs(i);
for (auto c : li) {
for (auto d : dist[c]) {
chmax(dp[c], dp[d] + 1);
}
chmax(ans, dp[c]);
}
OUT(ans);
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size();
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j, k) for (int(i) = (j); (i) <= (k); (i)++)
#define repdown(i, j, k) for (int(i) = (j); (i) >= (k); (i)--)
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using namespace std;
const int Mod = (1e9) + 7;
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
const int INF = 10241024;
long double INFD = 100100100;
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
//_____________________array calc____________________________________//
/*
vvi mul(vvi &A, vvi &B){
vvi C(A.size(), vi(B.size()))
rep(i,A.size()){
rep(j,B.size()){
rep(k,B[0].size()){
C[i][j] = (C[i][j] A[i][k] + B[k][j]) % Mod;
}
}
}
return C;
}
vvi pow(vvi A, ll n){
vvi B(A.size(), vi(A.size()));
rep(i=0;i<A.size();i++){
B[i][i] = 1;
}
while (n >0){
if (n & 1) B = mul(B, A);
A = mul(A, A);
n = n >> 1;
}
return B;
}
*/
//_____________________Bynary Indexed Tree __________________________//
/*
const max_st = (1 << 15) - 1;
int bit[max_st];
int sum (int i){
int s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
*/
//_____________________ following sorce code_________________________//
vvi dist;
vi li;
vi lis;
void dfs(int u) {
if (lis[u] != 0)
return;
lis[u] = 1;
for (auto c : dist[u])
dfs(c);
li.pb(u);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
IN(n, m);
dist.resize(n);
li.resize(n);
lis.resize(n);
rep(i, 0, m - 1) {
int a, b;
IN(a, b);
a--;
b--;
dist[a].push_back(b);
}
vi dp(n);
int ans = 0;
rep(i, 0, n - 1) dfs(i);
for (auto c : li) {
for (auto d : dist[c]) {
chmax(dp[c], dp[d] + 1);
}
chmax(ans, dp[c]);
}
OUT(ans);
return 0;
}
|
replace
| 140 | 141 | 140 | 141 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
vector<vector<int>> G;
vector<int> dp;
int rec(int now) {
if (dp[now] != -1)
return dp[now];
int ans = 0;
for (auto next : G[now]) {
ans = max(ans, rec(next) + 1);
}
return ans;
}
signed main() {
scanf("%d %d", &n, &m);
G.resize(n);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
--x;
--y;
G[x].push_back(y);
}
dp.resize(n, -1);
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
vector<vector<int>> G;
vector<int> dp;
int rec(int now) {
if (dp[now] != -1)
return dp[now];
int ans = 0;
for (auto next : G[now]) {
ans = max(ans, rec(next) + 1);
}
return dp[now] = ans;
}
signed main() {
scanf("%d %d", &n, &m);
G.resize(n);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
--x;
--y;
G[x].push_back(y);
}
dp.resize(n, -1);
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repd(i, n) for (int i = n - 1; i > -1; i--)
#define repran(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define v(T) vector<T>
#define vv(T) vector<v(T)>
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int n, m;
vvi g(100005);
int memo[100005];
int dp(int s) {
if (g[s].size() == 0) {
return memo[s] = 0;
}
if (memo[s] > 0)
return memo[s];
int ret = 0;
for (int v : g[s]) {
chmax(ret, dp(v) + 1);
}
return ret;
}
int main() {
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
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 repd(i, n) for (int i = n - 1; i > -1; i--)
#define repran(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end()
#define v(T) vector<T>
#define vv(T) vector<v(T)>
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int n, m;
vvi g(100005);
int memo[100005];
int dp(int s) {
if (g[s].size() == 0) {
return memo[s] = 0;
}
if (memo[s] > 0)
return memo[s];
int ret = 0;
for (int v : g[s]) {
chmax(ret, dp(v) + 1);
}
return memo[s] = ret;
}
int main() {
cin >> n >> m;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
}
int ans = 0;
rep(i, n) chmax(ans, dp(i));
cout << ans << endl;
}
|
replace
| 41 | 42 | 41 | 42 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// È¥°É£¡Æ¤¿¨Çð! °ÑAC´ø»ØÀ´£¡
// ¤Ø¡¡¡¡¡¡¡¡¡¡£¯|
// ¡¡¡¡/£Ü7¡¡¡¡¡¡ ¡Ï£ß/
// ¡¡ /¡¡©¦¡¡¡¡ £¯¡¡£¯ AC AC
// AC AC
// ©¦¡¡Z £ß,£¼¡¡£¯¡¡¡¡ /`©c AC AC AC
// AC ©¦¡¡¡¡¡¡¡¡¡¡©c¡¡¡¡ /¡¡¡¡¡µ AC
// AC AC AC
// ¡¡Y¡¡¡¡¡¡¡¡¡¡`¡¡ /¡¡¡¡/ / AC AC
// AC AC
// ¡¡Øé¡ñ¡¡.¡¡¡ñ¡¡¡¡¡´¡¡/¡¡/ AC AC
// AC AC
// ¡¡()¡¡ ¤Ø¡¡¡¡¡¡¡¡|¡¡£Ü¡´ AC AC
// AC AC
// ¡¡¡¡>- ._¡¡ ¥£¡¡ ©¦ £¯£¯ AC AC
// AC AC
// ¡¡ / ¤Ø¡¡¡¡ /¡¡/£¼| £Ü£Ü AC AC
// AC AC
// ¡¡ ©c_/¡¡¡¡(_£¯¡¡ ©¦£¯£¯ AC AC
// AC AC
// ¡¡¡¡ 7¡¡¡¡¡¡¡¡¡¡¡¡¡¡|£¯ AC AC
// AC AC
// ¡¡¡¡ £¾¨Dr£þ£þ`-¨D£ß/ AC AC
// AC AC
//**************************************Accepted*****************************************//
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)), x.end());
#define CIN_FILE "input.txt"
#define COUT_FILE "output.txt"
#define Pig (OO)
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int Days[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int read() {
#define gc getchar
int ans = 0;
bool f = 1;
char ch = gc();
while (!isdigit(ch))
f ^= ch == '-', ch = gc();
while (isdigit(ch))
ans = ((ans << 2) + ans << 1) + (ch ^ 48), ch = gc();
return f ? ans : -ans;
#undef gc
}
typedef long long ll;
int n, m;
vector<int> v[100010];
int dp[100010];
bool vis[100010];
const int INF = 117901063;
int DFS(int x) {
if (vis[x])
return dp[x];
int ans = 0;
for (int i = 0; i < v[x].size(); i++)
ans = max(ans, DFS(v[x][i]) + 1);
return dp[x] = ans;
}
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, DFS(i));
cout << ans;
// printf("Time used = %.12f",(double)(clock())/CLOCKS_PER_SEC);
return 0;
}
/* GOD BLESS */
|
// È¥°É£¡Æ¤¿¨Çð! °ÑAC´ø»ØÀ´£¡
// ¤Ø¡¡¡¡¡¡¡¡¡¡£¯|
// ¡¡¡¡/£Ü7¡¡¡¡¡¡ ¡Ï£ß/
// ¡¡ /¡¡©¦¡¡¡¡ £¯¡¡£¯ AC AC
// AC AC
// ©¦¡¡Z £ß,£¼¡¡£¯¡¡¡¡ /`©c AC AC AC
// AC ©¦¡¡¡¡¡¡¡¡¡¡©c¡¡¡¡ /¡¡¡¡¡µ AC
// AC AC AC
// ¡¡Y¡¡¡¡¡¡¡¡¡¡`¡¡ /¡¡¡¡/ / AC AC
// AC AC
// ¡¡Øé¡ñ¡¡.¡¡¡ñ¡¡¡¡¡´¡¡/¡¡/ AC AC
// AC AC
// ¡¡()¡¡ ¤Ø¡¡¡¡¡¡¡¡|¡¡£Ü¡´ AC AC
// AC AC
// ¡¡¡¡>- ._¡¡ ¥£¡¡ ©¦ £¯£¯ AC AC
// AC AC
// ¡¡ / ¤Ø¡¡¡¡ /¡¡/£¼| £Ü£Ü AC AC
// AC AC
// ¡¡ ©c_/¡¡¡¡(_£¯¡¡ ©¦£¯£¯ AC AC
// AC AC
// ¡¡¡¡ 7¡¡¡¡¡¡¡¡¡¡¡¡¡¡|£¯ AC AC
// AC AC
// ¡¡¡¡ £¾¨Dr£þ£þ`-¨D£ß/ AC AC
// AC AC
//**************************************Accepted*****************************************//
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)), x.end());
#define CIN_FILE "input.txt"
#define COUT_FILE "output.txt"
#define Pig (OO)
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const int Days[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int read() {
#define gc getchar
int ans = 0;
bool f = 1;
char ch = gc();
while (!isdigit(ch))
f ^= ch == '-', ch = gc();
while (isdigit(ch))
ans = ((ans << 2) + ans << 1) + (ch ^ 48), ch = gc();
return f ? ans : -ans;
#undef gc
}
typedef long long ll;
int n, m;
vector<int> v[100010];
int dp[100010];
bool vis[100010];
const int INF = 117901063;
int DFS(int x) {
if (vis[x])
return dp[x];
vis[x] = 1;
int ans = 0;
for (int i = 0; i < v[x].size(); i++)
ans = max(ans, DFS(v[x][i]) + 1);
return dp[x] = ans;
}
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, DFS(i));
cout << ans;
// printf("Time used = %.12f",(double)(clock())/CLOCKS_PER_SEC);
return 0;
}
/* GOD BLESS */
|
insert
| 75 | 75 | 75 | 77 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long int
#define N 100005
using namespace std;
string s1, s2;
template <typename T> void max_self(T &a, T b) {
if (b >= a) {
a = b;
}
}
int vis[N];
int dis[N];
vector<int> g[N];
void dfs(int r, int p) {
vis[r] = 1;
int m = -1;
for (auto v : g[r]) {
dfs(v, r);
m = max(m, dis[v]);
}
dis[r] = m + 1;
}
int main() {
int n, m, x, y;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
g[n + 1].push_back(i);
}
dis[0] = -1;
dfs(n + 1, 0);
int ans = 0;
for (int i = 0; i <= n + 1; i++) {
// cout<<i<<" "<<dis[i]<<endl;
ans = max(ans, dis[i]);
}
cout << ans - 1;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long int
#define N 100005
using namespace std;
string s1, s2;
template <typename T> void max_self(T &a, T b) {
if (b >= a) {
a = b;
}
}
int vis[N];
int dis[N];
vector<int> g[N];
void dfs(int r, int p) {
vis[r] = 1;
int m = -1;
for (auto v : g[r]) {
if (!vis[v])
dfs(v, r);
m = max(m, dis[v]);
}
dis[r] = m + 1;
}
int main() {
int n, m, x, y;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
g[n + 1].push_back(i);
}
dis[0] = -1;
dfs(n + 1, 0);
int ans = 0;
for (int i = 0; i <= n + 1; i++) {
// cout<<i<<" "<<dis[i]<<endl;
ans = max(ans, dis[i]);
}
cout << ans - 1;
}
|
replace
| 27 | 28 | 27 | 29 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
vector<vector<int>> g;
vector<int> dist;
int dfs(int v) {
int d = 0;
for (int nv : g[v]) {
d = max(d, dfs(nv) + 1);
}
dist[v] = d;
return d;
}
int main() {
int n, m;
cin >> n >> m;
g.resize(n);
dist.assign(n, -1);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
rep(i, n) {
if (dist[i] != -1)
continue;
dfs(i);
}
int ans = 0;
rep(i, n) ans = max(ans, dist[i]);
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
vector<vector<int>> g;
vector<int> dist;
int dfs(int v) {
int d = 0;
for (int nv : g[v]) {
if (dist[nv] != -1)
d = max(d, dist[nv] + 1);
else
d = max(d, dfs(nv) + 1);
}
dist[v] = d;
return d;
}
int main() {
int n, m;
cin >> n >> m;
g.resize(n);
dist.assign(n, -1);
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
rep(i, n) {
if (dist[i] != -1)
continue;
dfs(i);
}
int ans = 0;
rep(i, n) ans = max(ans, dist[i]);
cout << ans << endl;
return 0;
}
|
replace
| 30 | 31 | 30 | 34 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define full(c) c.begin(), c.end()
#define vector2d(name, type, h, w, init) \
vector<vector<type>> name(h, vector<type>(w, init))
const int PRIME = 1000000007;
const int INF = (int)1e9;
const int INT_INF = 2147483647;
const long long int LL_INF = 9223372036854775807;
const double PI = acos(-1);
const double EPS = 0.00001;
typedef unsigned long long int ull;
typedef long long int ll;
using namespace std;
int n, m;
vector<vector<int>> g;
vector<int> path;
int dfs(int current) {
path[current] = 0;
for (int next : g[current]) {
path[current] = max(path[current], dfs(next) + 1);
}
return path[current];
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n >> m;
g.resize(n);
path.resize(n, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int most = 0;
for (int i = 0; i < n; i++) {
if (path[i] == -1) {
path[i] = dfs(i);
}
most = max(most, path[i]);
}
cout << most << endl;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define full(c) c.begin(), c.end()
#define vector2d(name, type, h, w, init) \
vector<vector<type>> name(h, vector<type>(w, init))
const int PRIME = 1000000007;
const int INF = (int)1e9;
const int INT_INF = 2147483647;
const long long int LL_INF = 9223372036854775807;
const double PI = acos(-1);
const double EPS = 0.00001;
typedef unsigned long long int ull;
typedef long long int ll;
using namespace std;
int n, m;
vector<vector<int>> g;
vector<int> path;
int dfs(int current) {
if (path[current] != -1)
return path[current];
path[current] = 0;
for (int next : g[current]) {
path[current] = max(path[current], dfs(next) + 1);
}
return path[current];
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n >> m;
g.resize(n);
path.resize(n, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int most = 0;
for (int i = 0; i < n; i++) {
if (path[i] == -1) {
path[i] = dfs(i);
}
most = max(most, path[i]);
}
cout << most << endl;
return 0;
}
|
insert
| 38 | 38 | 38 | 40 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m;
vector<int> g[n + 1];
int indegree[n + 1];
int dp[n + 1];
for (int i = 0; i <= n; i++) {
indegree[i] = 0;
dp[i] = 0;
}
// cout<<dp[2]<<endl;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
indegree[y]++;
}
queue<int> q;
for (int i = 1; i <= n; i++) {
if (indegree[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i = 0; i < g[t].size(); i++) {
int v = g[t][i];
dp[v] = max(dp[v], dp[t] + 1);
q.push(v);
}
}
int h = dp[1];
for (int i = 2; i <= n; i++) {
h = max(h, dp[i]);
}
cout << h << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m;
vector<int> g[n + 1];
int indegree[n + 1];
int dp[n + 1];
for (int i = 0; i <= n; i++) {
indegree[i] = 0;
dp[i] = 0;
}
// cout<<dp[2]<<endl;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
indegree[y]++;
}
queue<int> q;
for (int i = 1; i <= n; i++) {
if (indegree[i] == 0) {
q.push(i);
}
}
while (!q.empty()) {
int t = q.front();
q.pop();
for (int i = 0; i < g[t].size(); i++) {
int v = g[t][i];
dp[v] = max(dp[v], dp[t] + 1);
indegree[v]--;
if (indegree[v] == 0)
q.push(v);
}
}
int h = dp[1];
for (int i = 2; i <= n; i++) {
h = max(h, dp[i]);
}
cout << h << endl;
return 0;
}
|
replace
| 32 | 33 | 32 | 35 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10, dx[] = {0, 0, 1, -1, 1, -1, 1, -1},
dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
ll MOD = 1e9 + 7;
ld eps = 1e-7, pi = acos(-1);
int n, m, x, y, dist[100100];
vector<int> adj[100100];
int dfs(int node) {
if (dist[node])
return dist[node];
int res = 0;
for (auto nx : adj[node]) {
res = max(res, dfs(nx));
}
return res + 1;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &x, &y);
adj[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dfs(i));
printf("%d", ans - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10, dx[] = {0, 0, 1, -1, 1, -1, 1, -1},
dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
ll MOD = 1e9 + 7;
ld eps = 1e-7, pi = acos(-1);
int n, m, x, y, dist[100100];
vector<int> adj[100100];
int dfs(int node) {
if (dist[node])
return dist[node];
int res = 0;
for (auto nx : adj[node]) {
res = max(res, dfs(nx));
}
return dist[node] = res + 1;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d %d", &x, &y);
adj[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dfs(i));
printf("%d", ans - 1);
return 0;
}
|
replace
| 23 | 24 | 23 | 24 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#define N 100005
int n, m;
int vis[N];
int dp[N];
int head[N], nxt[N], to[N], tot;
void add(int x, int y) {
nxt[++tot] = head[x];
head[x] = tot;
to[tot] = y;
}
int DP(int u) {
if (vis[u])
return dp[u];
dp[u] = 0;
for (int e = head[u]; e; e = nxt[e]) {
int v = to[e];
int cur = DP(v) + 1;
if (cur > dp[u])
dp[u] = cur;
}
return dp[u];
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
--u, --v;
add(u, v);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
int cur = DP(i);
if (cur > ans)
ans = cur;
}
printf("%d\n", ans);
return 0;
}
|
#include <cstdio>
#define N 100005
int n, m;
int vis[N];
int dp[N];
int head[N], nxt[N], to[N], tot;
void add(int x, int y) {
nxt[++tot] = head[x];
head[x] = tot;
to[tot] = y;
}
int DP(int u) {
if (vis[u])
return dp[u];
vis[u] = 1;
dp[u] = 0;
for (int e = head[u]; e; e = nxt[e]) {
int v = to[e];
int cur = DP(v) + 1;
if (cur > dp[u])
dp[u] = cur;
}
return dp[u];
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
--u, --v;
add(u, v);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
int cur = DP(i);
if (cur > ans)
ans = cur;
}
printf("%d\n", ans);
return 0;
}
|
insert
| 14 | 14 | 14 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Om Sree Sai Ram
#include "bits/stdc++.h"
using namespace std;
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
vector<int> dp;
vector<int> vis;
int dfs(int id, vector<vector<int>> adj) {
// cout<<" called "<<id<<endl;
if (vis[id]) {
return dp[id];
}
for (int i = 0; i < adj[id].size(); i++) {
dp[id] = max(dp[id], dfs(adj[id][i], adj) + 1);
}
vis[id] = true;
return dp[id];
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int n, e;
cin >> n >> e;
vector<vector<int>> adj(n);
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
// cout<<a<<" "<<b<<endl;
adj[a - 1].push_back(b - 1);
}
// cout<<" adj done"<<endl;
dp.assign(n, 0);
vis.assign(n, false);
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, adj);
}
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
|
// Om Sree Sai Ram
#include "bits/stdc++.h"
using namespace std;
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
vector<int> dp;
vector<int> vis;
int dfs(int id, vector<vector<int>> &adj) {
// cout<<" called "<<id<<endl;
if (vis[id]) {
return dp[id];
}
for (int i = 0; i < adj[id].size(); i++) {
dp[id] = max(dp[id], dfs(adj[id][i], adj) + 1);
}
vis[id] = true;
return dp[id];
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int n, e;
cin >> n >> e;
vector<vector<int>> adj(n);
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
// cout<<a<<" "<<b<<endl;
adj[a - 1].push_back(b - 1);
}
// cout<<" adj done"<<endl;
dp.assign(n, 0);
vis.assign(n, false);
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, adj);
}
}
cout << *max_element(dp.begin(), dp.end()) << endl;
}
|
replace
| 9 | 10 | 9 | 10 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
Graph g(n);
vector<int> dist(n);
vector<int> delta(n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
delta[y]++;
g[x].push_back(y);
}
queue<int> que;
for (int i = 0; i < n; i++) {
if (delta[i] == 0)
que.push(i);
}
while (!que.empty()) {
int v = que.front();
for (auto &to : g[v]) {
dist[to] = max(dist[to], dist[v] + 1);
if (--delta[to] == 0)
que.push(to);
}
}
cout << *max_element(dist.begin(), dist.end()) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
Graph g(n);
vector<int> dist(n);
vector<int> delta(n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--, y--;
delta[y]++;
g[x].push_back(y);
}
queue<int> que;
for (int i = 0; i < n; i++) {
if (delta[i] == 0)
que.push(i);
}
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto &to : g[v]) {
dist[to] = max(dist[to], dist[v] + 1);
if (--delta[to] == 0)
que.push(to);
}
}
cout << *max_element(dist.begin(), dist.end()) << endl;
return 0;
}
|
insert
| 24 | 24 | 24 | 25 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <cstdio>
#include <iostream>
#include <vector>
#define MAXN 100500
using namespace std;
int n, m;
int dist[MAXN];
vector<int> g[MAXN];
bool was[MAXN];
int ans;
void dfs(int v) {
// cout << v << ' ';
was[v] = true;
for (int w : g[v]) {
dfs(w);
if (dist[v] < dist[w] + 1)
dist[v] = dist[w] + 1;
if (ans < dist[v])
ans = dist[v];
}
}
int x, y;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!was[i]) {
dfs(i);
// cout << endl;
}
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <vector>
#define MAXN 100500
using namespace std;
int n, m;
int dist[MAXN];
vector<int> g[MAXN];
bool was[MAXN];
int ans;
void dfs(int v) {
// cout << v << ' ';
was[v] = true;
for (int w : g[v]) {
if (!was[w])
dfs(w);
if (dist[v] < dist[w] + 1)
dist[v] = dist[w] + 1;
if (ans < dist[v])
ans = dist[v];
}
}
int x, y;
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!was[i]) {
dfs(i);
// cout << endl;
}
}
cout << ans << endl;
return 0;
}
|
replace
| 15 | 16 | 15 | 17 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define N (int)1e5 + 5
#define f1 first
#define s2 second
#define INF 9999999
#define pb push_back
#define ll long long
#define ull unsigned long long;
#define all(a) a.begin(), a.end()
#define fri(a) freopen(a, "r", stdin);
#define fro(a) freopen(a, "w", stdout);
vector<int> v[N];
int n, m, a, b, ans, dp[N];
bool visit[N];
void dfs(int x) {
visit[x] = 1;
for (auto i : v[x]) {
if (!visit[i])
;
dfs(i);
dp[x] = max(dp[x], 1 + dp[i]);
}
}
int main() {
// fri("in.txt");
// fro("out.txt");
cin >> n >> m;
memset(dp, 0, sizeof(dp));
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!visit[i])
dfs(i);
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define N (int)1e5 + 5
#define f1 first
#define s2 second
#define INF 9999999
#define pb push_back
#define ll long long
#define ull unsigned long long;
#define all(a) a.begin(), a.end()
#define fri(a) freopen(a, "r", stdin);
#define fro(a) freopen(a, "w", stdout);
vector<int> v[N];
int n, m, a, b, ans, dp[N];
bool visit[N];
void dfs(int x) {
visit[x] = 1;
for (auto i : v[x]) {
if (!visit[i])
dfs(i);
dp[x] = max(dp[x], 1 + dp[i]);
}
}
int main() {
// fri("in.txt");
// fro("out.txt");
cin >> n >> m;
memset(dp, 0, sizeof(dp));
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!visit[i])
dfs(i);
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 22 | 24 | 22 | 23 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define vi vector<int>
#define vld vector<ld>
#define pii pair<int, int>
#define mii map<int, int>
#define fi first
#define se second
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
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...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
vector<vi> adj;
vi vis, ans;
void dfs(int root) {
vis[root] = 1;
for (auto i : adj[root]) {
if (!vis[i])
dfs(i);
ans[root] = max(ans[root], ans[i] + 1);
}
}
int32_t main() {
fastIO inp_out();
int n, m;
cin >> n >> m;
adj = vector<vi>(n + 1);
vis = ans = vi(n + 1);
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
int fa = 0;
for (int i = 1; i <= n; ++i)
fa = max(fa, ans[i]);
cout << fa;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define vi vector<int>
#define vld vector<ld>
#define pii pair<int, int>
#define mii map<int, int>
#define fi first
#define se second
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
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...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
vector<vi> adj;
vi vis, ans;
void dfs(int root) {
vis[root] = 1;
for (auto i : adj[root]) {
if (!vis[i])
dfs(i);
ans[root] = max(ans[root], ans[i] + 1);
}
}
int32_t main() {
fastIO
// inp_out();
int n,
m;
cin >> n >> m;
adj = vector<vi>(n + 1);
vis = ans = vi(n + 1);
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
int fa = 0;
for (int i = 1; i <= n; ++i)
fa = max(fa, ans[i]);
cout << fa;
return 0;
}
|
replace
| 49 | 51 | 49 | 53 |
-6
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <vector>
int const MAXN = 10000, MAXE = 10000;
int N, E;
std::vector<int> G[MAXN];
int L[MAXN];
int length(int v) {
if (L[v] >= 0)
return L[v];
int ret = 0;
for (auto it = G[v].begin(); it != G[v].end(); ++it) {
ret = std::max(ret, length(*it));
}
return L[v] = ret + 1;
}
int main() {
std::cin >> N >> E;
std::fill(L, L + N, 0);
for (int i = 0; i < E; ++i) {
int x, y;
std::cin >> x >> y;
G[x - 1].push_back(y - 1);
L[x - 1] = -1;
}
int ret = 0;
for (int i = 0; i < N; ++i) {
ret = std::max(ret, length(i));
}
std::cout << ret << std::endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
int const MAXN = 100000, MAXE = 100000;
int N, E;
std::vector<int> G[MAXN];
int L[MAXN];
int length(int v) {
if (L[v] >= 0)
return L[v];
int ret = 0;
for (auto it = G[v].begin(); it != G[v].end(); ++it) {
ret = std::max(ret, length(*it));
}
return L[v] = ret + 1;
}
int main() {
std::cin >> N >> E;
std::fill(L, L + N, 0);
for (int i = 0; i < E; ++i) {
int x, y;
std::cin >> x >> y;
G[x - 1].push_back(y - 1);
L[x - 1] = -1;
}
int ret = 0;
for (int i = 0; i < N; ++i) {
ret = std::max(ret, length(i));
}
std::cout << ret << std::endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
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 ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
vector<ll> v, adj[100005];
ll pr[100005], d[100005];
ll fep(ll x, ll y, ll mod) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
ll dfs(ll node) {
pr[node] = 1;
ll m = 0, i;
for (i = 0; i < adj[node].size(); i++)
m = max(m, dfs(adj[node][i]));
d[node] = 1 + m;
return d[node];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i, m, j, k, x, y, a, b;
string s;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
m = 0;
for (i = 1; i <= n; i++) {
if (!pr[i])
x = dfs(i);
m = max(m, d[i]);
}
cout << m - 1;
return 0;
}
|
#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 ordered_set tree<int, null_type,less<int>,
// rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
vector<ll> v, adj[100005];
ll pr[100005], d[100005];
ll fep(ll x, ll y, ll mod) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
ll dfs(ll node) {
if (pr[node])
return d[node];
pr[node] = 1;
ll m = 0, i;
for (i = 0; i < adj[node].size(); i++)
m = max(m, dfs(adj[node][i]));
d[node] = 1 + m;
return d[node];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i, m, j, k, x, y, a, b;
string s;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
m = 0;
for (i = 1; i <= n; i++) {
if (!pr[i])
x = dfs(i);
m = max(m, d[i]);
}
cout << m - 1;
return 0;
}
|
insert
| 29 | 29 | 29 | 31 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
using namespace std;
vector<int> v[100001];
bool vis[100001] = {false};
ll d[100001] = {0};
void dfs(int s) {
ll mx = 0;
for (int i = 0; i < v[s].size(); i++) {
if (!vis[v[s][i]]) {
dfs(v[s][i]);
}
}
for (int i = 0; i < v[s].size(); i++) {
mx = max(d[v[s][i]], mx);
}
d[s] = mx + 1;
}
int main() {
ll n = 0, m = 0, a = 0, b = 0, dis = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
}
memset(vis, false, sizeof(vis));
memset(d, 0, sizeof(d));
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
for (int i = 1; i <= n; i++) {
dis = max(d[i], dis);
}
cout << dis - 1;
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <stack>
#include <utility>
#include <vector>
#define ll long long int
using namespace std;
vector<int> v[100001];
bool vis[100001] = {false};
ll d[100001] = {0};
void dfs(int s) {
ll mx = 0;
vis[s] = true;
for (int i = 0; i < v[s].size(); i++) {
if (!vis[v[s][i]]) {
dfs(v[s][i]);
}
}
for (int i = 0; i < v[s].size(); i++) {
mx = max(d[v[s][i]], mx);
}
d[s] = mx + 1;
}
int main() {
ll n = 0, m = 0, a = 0, b = 0, dis = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
}
memset(vis, false, sizeof(vis));
memset(d, 0, sizeof(d));
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
for (int i = 1; i <= n; i++) {
dis = max(d[i], dis);
}
cout << dis - 1;
}
|
insert
| 14 | 14 | 14 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int lim = 100010;
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
#define pb push_back
typedef pair<string, string> pi;
std::vector<bool> visited(lim);
std::vector<int> g[100010];
int dist[100010] = {0};
void dfs(int node) {
// int ans=0;
visited[node] = true;
for (auto child : g[node]) {
// cout<<node<<" visiting "<<child<<endl;
dist[child] = std::max(dist[child], dist[node] + 1);
dfs(child);
}
// cout<<"node ans "<<node<<" "<<ans<<endl;
}
int main() {
IOS();
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
g[a].push_back(b);
}
int ans = INT_MIN;
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
dfs(i);
}
}
// cout<<ans<<endl;
for (int i = 1; i <= n; ++i) {
ans = std::max(ans, dist[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int lim = 100010;
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
#define pb push_back
typedef pair<string, string> pi;
std::vector<bool> visited(lim);
std::vector<int> g[100010];
int dist[100010] = {0};
void dfs(int node) {
// int ans=0;
visited[node] = true;
for (auto child : g[node]) {
if (!visited[child])
dfs(child);
dist[node] = std::max(dist[child] + 1, dist[node]);
}
// cout<<"node ans "<<node<<" "<<ans<<endl;
}
int main() {
IOS();
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
g[a].push_back(b);
}
int ans = INT_MIN;
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
dfs(i);
}
}
// cout<<ans<<endl;
for (int i = 1; i <= n; ++i) {
ans = std::max(ans, dist[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 19 | 22 | 19 | 23 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define MAX 100005
using namespace std;
vector<int> maps[MAX];
int memo[MAX];
int indegree[MAX] = {0};
// 从i节点到结束所能达到的最长路径
int dfs(int x) {
if (memo[x] != -1)
return memo[x];
int l = maps[x].size();
int res = 0;
for (int i = 0; i < l; i++) {
res = max(res, dfs(maps[x][i]) + 1);
}
return res;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
fill(memo, memo + MAX, -1);
for (int i = 0; i < m; i++) {
int from, to;
scanf("%d %d", &from, &to);
maps[from].push_back(to);
indegree[to] += 1;
}
int res = 0;
for (int i = 1; i <= n; i++) {
if (indegree[i] == 0) {
res = max(res, dfs(i));
}
}
printf("%d", res);
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define MAX 100005
using namespace std;
vector<int> maps[MAX];
int memo[MAX];
int indegree[MAX] = {0};
// 从i节点到结束所能达到的最长路径
int dfs(int x) {
if (memo[x] != -1)
return memo[x];
int l = maps[x].size();
int res = 0;
for (int i = 0; i < l; i++) {
res = max(res, dfs(maps[x][i]) + 1);
}
memo[x] = res;
return memo[x];
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
fill(memo, memo + MAX, -1);
for (int i = 0; i < m; i++) {
int from, to;
scanf("%d %d", &from, &to);
maps[from].push_back(to);
indegree[to] += 1;
}
int res = 0;
for (int i = 1; i <= n; i++) {
if (indegree[i] == 0) {
res = max(res, dfs(i));
}
}
printf("%d", res);
return 0;
}
|
replace
| 19 | 20 | 19 | 21 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
const int MAX = 3e3 + 10;
const int INF = 1e9 + 7;
int N, M;
vi G[MAX];
void input() {
cin >> N >> M;
rep(_, M) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
}
}
int d[MAX];
int dfs(int v) {
if (d[v] != -1)
return d[v];
int tmp = 0;
rep(i, sz(G[v])) {
int u = G[v][i];
int p = dfs(u);
tmp = max(tmp, p + 1);
}
d[v] = tmp;
return d[v];
}
int ans;
void solve() {
rep(i, N) d[i] = -1;
rep(i, N) {
int tmp = dfs(i);
ans = max(ans, tmp);
}
}
void output() { cout << ans << endl; }
int main() {
input();
solve();
output();
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
const int MAX = 1e5 + 10;
const int INF = 1e9 + 7;
int N, M;
vi G[MAX];
void input() {
cin >> N >> M;
rep(_, M) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
}
}
int d[MAX];
int dfs(int v) {
if (d[v] != -1)
return d[v];
int tmp = 0;
rep(i, sz(G[v])) {
int u = G[v][i];
int p = dfs(u);
tmp = max(tmp, p + 1);
}
d[v] = tmp;
return d[v];
}
int ans;
void solve() {
rep(i, N) d[i] = -1;
rep(i, N) {
int tmp = dfs(i);
ans = max(ans, tmp);
}
}
void output() { cout << ans << endl; }
int main() {
input();
solve();
output();
}
|
replace
| 16 | 17 | 16 | 17 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
ll n, m;
vector<vector<ll>> g;
vector<ll> dp;
ll dfs(ll v, ll p = -1) {
if (dp[v] != -1)
return dp[v];
ll res = 0;
for (auto u : g[v]) {
if (u == p)
continue;
res = max(res, dfs(u, v) + 1);
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
cin >> n >> m;
g.resize(n);
rep(i, m) {
ll x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
dp.resize(n, -1);
ll ans = 0;
rep(i, n) ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
ll n, m;
vector<vector<ll>> g;
vector<ll> dp;
ll dfs(ll v, ll p = -1) {
if (dp[v] != -1)
return dp[v];
ll res = 0;
for (auto u : g[v]) {
if (u == p)
continue;
res = max(res, dfs(u, v) + 1);
}
dp[v] = res;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// ifstream in("input.txt");
// cin.rdbuf(in.rdbuf());
cin >> n >> m;
g.resize(n);
rep(i, m) {
ll x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
dp.resize(n, -1);
ll ans = 0;
rep(i, n) ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
insert
| 24 | 24 | 24 | 25 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// #include <cmath>
// #include <cstdio>
// #include <vector>
// #include <map>
// #include <iostream>
// #include <algorithm>
// #include <set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pli = pair<ll, int>;
#define fi first
#define v vector
#define se second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
int INF = 1e9 + 7;
ll inf = 1e18 + 7;
const int N = 100010;
void add_self(int &a, int b) { a += b; }
void max_self(int &a, int b) {
if (b > a)
a = b;
}
void topsort(int i, v<vi> &graph, vb &visit, stack<int> &res) {
visit[i] = true;
for (int x : graph[i]) {
if (!visit[x])
topsort(x, graph, visit, res);
}
res.push(i);
}
int dp[N];
int find(int i, v<vi> &graph) {
if (dp[i] != -1)
return dp[i];
int res = 0;
for (int v : graph[i]) {
max_self(res, 1 + find(v, graph));
}
return res;
}
void solve() {
for (int i = 0; i < N; ++i) {
dp[i] = -1;
}
int n, m;
scanf("%d%d", &n, &m);
v<vi> graph(n);
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
graph[a - 1].pb(b - 1);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
max_self(ans, find(i, graph));
}
printf("%d\n", ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
// scanf("%d",&t);
while (t--) {
solve();
}
}
|
// #include <cmath>
// #include <cstdio>
// #include <vector>
// #include <map>
// #include <iostream>
// #include <algorithm>
// #include <set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using pli = pair<ll, int>;
#define fi first
#define v vector
#define se second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
int INF = 1e9 + 7;
ll inf = 1e18 + 7;
const int N = 100010;
void add_self(int &a, int b) { a += b; }
void max_self(int &a, int b) {
if (b > a)
a = b;
}
void topsort(int i, v<vi> &graph, vb &visit, stack<int> &res) {
visit[i] = true;
for (int x : graph[i]) {
if (!visit[x])
topsort(x, graph, visit, res);
}
res.push(i);
}
int dp[N];
int find(int i, v<vi> &graph) {
if (dp[i] != -1)
return dp[i];
int res = 0;
for (int v : graph[i]) {
max_self(res, 1 + find(v, graph));
}
dp[i] = res;
return res;
}
void solve() {
for (int i = 0; i < N; ++i) {
dp[i] = -1;
}
int n, m;
scanf("%d%d", &n, &m);
v<vi> graph(n);
for (int i = 0; i < m; ++i) {
int a, b;
scanf("%d%d", &a, &b);
graph[a - 1].pb(b - 1);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
max_self(ans, find(i, graph));
}
printf("%d\n", ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
// scanf("%d",&t);
while (t--) {
solve();
}
}
|
insert
| 53 | 53 | 53 | 54 |
TLE
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.