problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03165 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
//#define mp make_pair
int main() {
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
vii dp(n + 1, vi(m + 1, -inf));
rep(i, n + 1) { dp[i][0] = 0; }
rep(j, m + 1) { dp[0][j] = 0; }
rep1(i, n) {
rep1(j, m) {
int add = (int)(s[i - 1] == t[j - 1]);
dp[i][j] = max({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1] + add});
}
}
int i = n, j = m;
int now = dp[i][j];
string ans;
while (i > 0 && j > 0 && now > 0) {
if (dp[i - 1][j - 1] + 1 == now && s[i - 1] == t[i - 1]) {
i--;
j--;
ans += s[i];
now--;
} else {
if (dp[i - 1][j - 1] == now) {
i--;
j--;
} else if (dp[i - 1][j] == now) {
i--;
} else {
j--;
}
}
}
reverse(all(ans));
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio() \
cin.tie(0); \
ios::sync_with_stdio(false);
//#define mp make_pair
int main() {
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
vii dp(n + 1, vi(m + 1, -inf));
rep(i, n + 1) { dp[i][0] = 0; }
rep(j, m + 1) { dp[0][j] = 0; }
rep1(i, n) {
rep1(j, m) {
int add = (int)(s[i - 1] == t[j - 1]);
dp[i][j] = max({dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1] + add});
}
}
int i = n, j = m;
int now = dp[i][j];
string ans;
while (i > 0 && j > 0 && now > 0) {
if (dp[i - 1][j - 1] + 1 == now && s[i - 1] == t[j - 1]) {
i--;
j--;
ans += s[i];
now--;
} else {
if (dp[i - 1][j - 1] == now) {
i--;
j--;
} else if (dp[i - 1][j] == now) {
i--;
} else {
j--;
}
}
}
reverse(all(ans));
cout << ans << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 974,616 | 974,617 | u579152247 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define SP(x) setprecision(x)
#define sz(x) (int)x.size()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PI 3.14159265358979323846
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
const int maxn = 1e5 + 10;
vector<int> v[maxn];
int vis[maxn];
int a[maxn];
int solve(int k) {
if (vis[k] == 1) {
return a[k];
}
vis[k] = 1;
int o = 0;
for (auto x : v[k]) {
o = max(o, solve(x) + 1);
}
a[k] = o;
return o;
}
int main() {
int n, m;
cin >> n >> m;
ffor(i, 0, n) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
int ans = 0;
ffor(i, 1, n + 1) {
// cout<<a[i]<<" ";
ans = max(ans, solve(i));
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
#define ll long long
#define mod 1000000007
#define ffor(i, a, b) for (int i = a; i < b; i++)
#define bfor(i, a, b) for (int i = a - 1; i >= b; i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x, y) memset(x, y, sizeof(x))
#define all(x) x.begin(), x.end()
#define SP(x) setprecision(x)
#define sz(x) (int)x.size()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PI 3.14159265358979323846
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
const int maxn = 1e5 + 10;
vector<int> v[maxn];
int vis[maxn];
int a[maxn];
int solve(int k) {
if (vis[k] == 1) {
return a[k];
}
vis[k] = 1;
int o = 0;
for (auto x : v[k]) {
o = max(o, solve(x) + 1);
}
a[k] = o;
return o;
}
int main() {
int n, m;
cin >> n >> m;
ffor(i, 0, m) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
int ans = 0;
ffor(i, 1, n + 1) {
// cout<<a[i]<<" ";
ans = max(ans, solve(i));
}
cout << ans;
// ffor(i,1,5)
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 974,655 | 974,656 | u476428694 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
list<int> *adjList;
int dfs(int v, vector<int> &dp) {
if (dp[v] != -1)
return dp[v];
int ans = 0;
for (auto i = adjList[v].begin(); i != adjList[v].end(); i++)
ans = max(ans, dfs(*i, dp) + 1);
return dp[v] = ans;
}
int main() {
int V, E;
cin >> V >> E;
adjList = new list<int>[V + 1];
int u, v;
for (int i = 0; i < E; i++) {
cin >> u >> v;
adjList[u].push_back(v);
}
vector<int> dp(V + 1, -1);
int Max = INT_MIN;
for (int i = 1; i <= V; i++) {
Max = max(dfs(i, dp), Max);
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
list<int> *adjList;
int dfs(int v, vector<int> &dp) {
if (dp[v] != -1)
return dp[v];
int ans = 0;
for (auto i = adjList[v].begin(); i != adjList[v].end(); i++)
ans = max(ans, dfs(*i, dp) + 1);
return dp[v] = ans;
}
int main() {
int V, E;
cin >> V >> E;
adjList = new list<int>[V + 1];
int u, v;
for (int i = 0; i < E; i++) {
cin >> u >> v;
adjList[u].push_back(v);
}
vector<int> dp(V + 1, -1);
int Max = INT_MIN;
for (int i = 1; i <= V; i++) {
Max = max(dfs(i, dp), Max);
}
cout << Max;
return 0;
}
| [
"identifier.change",
"io.output.change"
] | 974,657 | 974,658 | u273574716 | cpp |
p03166 | #include <bits/stdc++.h>
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 bestChild = 0;
for (int c : graph[src]) {
leaf = 0;
bestChild = max(bestChild, solve(c));
}
return dp[src] = leaf ? 0 : 1 + bestChild;
}
int main() {
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < m; i++) {
int s, e;
cin >> s >> e;
graph[s].push_back(e);
}
int ans = 0;
for (int i = 1; i <= m; i++) {
ans = max(ans, solve(i));
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
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 bestChild = 0;
for (int c : graph[src]) {
leaf = 0;
bestChild = max(bestChild, solve(c));
}
return dp[src] = leaf ? 0 : 1 + bestChild;
}
int main() {
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < m; i++) {
int s, e;
cin >> s >> e;
graph[s].push_back(e);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, solve(i));
}
cout << ans;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,659 | 974,660 | u510516229 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define iton for (int i = 0; i <= n; i++)
#define itok for (int i = 0; i < k; i++)
#define jton for (int j = 0; j <= n; j++)
void dfs(vector<ll> input[], int dp[], bool visited[], int val) {
visited[val] = true;
for (int i = 0; i < input[val].size(); i++) {
if (!visited[input[val][i]])
dfs(input, dp, visited, input[val][i]);
dp[val] = max(1 + dp[input[val][i]], dp[val]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long n, k, x, y;
cin >> n >> k;
vector<ll> input[n + 1];
iton {
cin >> x >> y;
input[x].push_back(y);
}
int dp[n + 1];
memset(dp, 0, sizeof dp);
bool visited[n + 1];
memset(visited, false, sizeof visited);
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(input, dp, visited, 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
#define iton for (int i = 0; i <= n; i++)
#define itok for (int i = 0; i < k; i++)
#define jton for (int j = 0; j <= n; j++)
void dfs(vector<ll> input[], int dp[], bool visited[], int val) {
visited[val] = true;
for (int i = 0; i < input[val].size(); i++) {
if (!visited[input[val][i]])
dfs(input, dp, visited, input[val][i]);
dp[val] = max(1 + dp[input[val][i]], dp[val]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long n, k, x, y;
cin >> n >> k;
vector<ll> input[n + 1];
itok {
cin >> x >> y;
input[x].push_back(y);
}
int dp[n + 1];
memset(dp, 0, sizeof dp);
bool visited[n + 1];
memset(visited, false, sizeof visited);
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(input, dp, visited, i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
| [] | 974,663 | 974,664 | u707091521 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int cnt = 0;
int longPath(int *dp, int u, vector<vector<int>> &graph) {
// cout<<u<<" ";
cnt++;
if (dp[u] != -1) {
return dp[u];
}
if (graph[u].empty()) {
dp[u] = 0;
return dp[u];
}
int i;
for (i = 0; i < graph[u].size(); i++) {
dp[u] = max(dp[u], 1 + longPath(dp, graph[u][i], graph));
}
return dp[u];
}
int solve(vector<vector<int>> &graph, int *dp, int n) {
int i;
for (i = 1; i <= n; i++) {
if (graph[i].empty())
dp[i] = 0;
if (dp[i] == -1)
dp[i] = longPath(dp, i, graph);
}
int max = 0;
for (i = 1; i <= n; i++) {
if (max < dp[i]) {
max = dp[i];
}
}
return max;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int>> graph(n + 2);
int dp[n + 2];
int i;
memset(dp, -1, sizeof(dp));
for (i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph[x].push_back(y);
}
cout << solve(graph, dp, n) << endl;
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int cnt = 0;
int longPath(int *dp, int u, vector<vector<int>> &graph) {
// cout<<u<<" ";
cnt++;
if (dp[u] != -1) {
return dp[u];
}
if (graph[u].empty()) {
dp[u] = 0;
return dp[u];
}
int i;
for (i = 0; i < graph[u].size(); i++) {
dp[u] = max(dp[u], 1 + longPath(dp, graph[u][i], graph));
}
return dp[u];
}
int solve(vector<vector<int>> &graph, int *dp, int n) {
int i;
for (i = 1; i <= n; i++) {
if (graph[i].empty())
dp[i] = 0;
if (dp[i] == -1)
dp[i] = longPath(dp, i, graph);
}
int max = 0;
for (i = 1; i <= n; i++) {
if (max < dp[i]) {
max = dp[i];
}
}
return max;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int>> graph(n + 2);
int dp[n + 2];
int i;
memset(dp, -1, sizeof(dp));
for (i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph[x].push_back(y);
}
cout << solve(graph, dp, n) << endl;
// cout<<cnt;
return 0;
} | [] | 974,667 | 974,668 | u610655627 | cpp |
p03166 | #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;
}
| [
"call.remove"
] | 974,670 | 974,671 | u071936511 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, vis[N], ans[N];
vector<int> adj[N];
stack<int> s;
void dfs(int u) {
vis[u] = 1;
for (int v : adj[u]) {
if (vis[v] == 0)
dfs(v);
}
s.push(u);
}
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
for (int i = 1; i <= n; ++i) {
if (vis[i] == 1)
continue;
dfs(i);
vector<int> nodes;
while (!s.empty()) {
nodes.push_back(s.top());
s.pop();
}
reverse(nodes.begin(), nodes.end());
for (int u : nodes) {
ans[u] = max(ans[u], 1);
for (int v : adj[u])
ans[v] = max(ans[u], 1 + ans[v]);
}
}
cout << *max_element(ans + 1, ans + 1 + n) - 1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, vis[N], ans[N];
vector<int> adj[N];
stack<int> s;
void dfs(int u) {
vis[u] = 1;
for (int v : adj[u]) {
if (vis[v] == 0)
dfs(v);
}
s.push(u);
}
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
for (int i = 1; i <= n; ++i) {
if (vis[i] == 1)
continue;
dfs(i);
vector<int> nodes;
while (!s.empty()) {
nodes.push_back(s.top());
s.pop();
}
reverse(nodes.begin(), nodes.end());
for (int u : nodes) {
ans[u] = max(ans[u], 1);
for (int v : adj[u])
ans[u] = max(ans[u], 1 + ans[v]);
}
}
cout << *max_element(ans + 1, ans + 1 + n) - 1;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 974,672 | 974,673 | u126063509 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define N 100001
int DP[N] = {0};
vector<int> adj[N];
bool vis[N] = {0};
void dfs(int x) {
// d++;
vis[x] = 1;
int k = INT_MIN;
for (auto i : adj[x]) {
if (!vis[i]) {
dfs(i);
}
DP[x] = max(DP[x], 1 + DP[i]);
}
}
signed main() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
cout << *max_element(DP, DP + n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define N 100001
int DP[N] = {0};
vector<int> adj[N];
bool vis[N] = {0};
void dfs(int x) {
// d++;
vis[x] = 1;
int k = INT_MIN;
for (auto i : adj[x]) {
if (!vis[i]) {
dfs(i);
}
DP[x] = max(DP[x], 1 + DP[i]);
}
}
signed main() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
cout << *max_element(DP + 1, DP + n + 1);
// cout<<DP[5];
return 0;
} | [
"expression.operation.binary.add"
] | 974,682 | 974,683 | u795378930 | cpp |
p03166 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chMax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll N, M;
cin >> N >> M;
map<ll, vector<ll>> g;
ll *d = new ll[N];
REP(x, N) { d[x] = 0; }
REP(m, M) {
ll x, y;
cin >> x >> y;
x--, y--;
g[x].push_back(y);
d[y]++;
}
ll *dp = new ll[N];
ll max = 0;
queue<ll> q;
REP(x, N) {
dp[x] = 0;
if (d[x] == 0) {
q.push(x);
}
}
while (!q.empty()) {
ll x = q.back();
q.pop();
for (auto y : g[x]) {
d[y]--;
if (d[y] == 0) {
chMax(dp[y], dp[x] + 1);
chMax(max, dp[y]);
q.push(y);
}
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chMax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
ll N, M;
cin >> N >> M;
map<ll, vector<ll>> g;
ll *d = new ll[N];
REP(x, N) { d[x] = 0; }
REP(m, M) {
ll x, y;
cin >> x >> y;
x--, y--;
g[x].push_back(y);
d[y]++;
}
ll *dp = new ll[N];
ll max = 0;
queue<ll> q;
REP(x, N) {
dp[x] = 0;
if (d[x] == 0) {
q.push(x);
}
}
while (!q.empty()) {
ll x = q.front();
q.pop();
for (auto y : g[x]) {
d[y]--;
if (d[y] == 0) {
chMax(dp[y], dp[x] + 1);
chMax(max, dp[y]);
q.push(y);
}
}
}
cout << max << endl;
return 0;
} | [
"call.function.change"
] | 974,684 | 974,685 | u379804877 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PII pair<ll, ll>
#define VI vector<ll>
#define VB vector<bool>
#define VVI vector<vector<ll>>
#define VS vector<string>
#define VP vector<PII>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
#define lr(i, a, b) for (ll i = a; i >= b; i--)
#define lfl(i, v) for (ll i = 0; i < v.size(); i++)
#define lrl(i, v) for (ll i = (ll)(v.size()) - 1; i >= 0; i--)
#define chk2(a, b) cout << "check : " << a << " " << b << endl
#define chk3(a, b, c) cout << "check : " << a << " " << b << " " << c << endl
#define chk4(a, b, c, d) \
cout << "check : " << a << " " << b << " " << c << " " << d << endl
#define chk5(a, b, c, d, e) \
cout << "check : " << a << " " << b << " " << c << " " << d << " " << e \
<< endl
#define lb(v, k) lower_bound(v.begin(), v.end(), k) - v.begin()
#define ub(v, k) upper_bound(v.begin(), v.end(), k) - v.begin()
#define mod 1000000007
#define pb push_back
#define pf push_front
#define m_p make_pair
#define fi first
#define se second
#define sz size()
#define sort(v) sort(v.begin(), v.end())
ll n, m;
VVI gp;
ll dp[100005];
ll fun(ll v) {
if (dp[v] != -1)
return dp[v];
ll len = 0;
ll maxi = 0;
lfl(i, gp[v]) { maxi = max(maxi, 1 + fun(gp[v][i])); }
return dp[v] = maxi;
}
int main() {
cin >> n >> m;
gp = VVI(n + 1);
memset(dp, -1, sizeof(dp));
lf(i, 1, n) {
ll u, v;
cin >> u >> v;
gp[u].pb(v);
}
ll maxi = 0;
lf(i, 1, n) { maxi = max(maxi, fun(i)); }
cout << maxi << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PII pair<ll, ll>
#define VI vector<ll>
#define VB vector<bool>
#define VVI vector<vector<ll>>
#define VS vector<string>
#define VP vector<PII>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
#define lr(i, a, b) for (ll i = a; i >= b; i--)
#define lfl(i, v) for (ll i = 0; i < v.size(); i++)
#define lrl(i, v) for (ll i = (ll)(v.size()) - 1; i >= 0; i--)
#define chk2(a, b) cout << "check : " << a << " " << b << endl
#define chk3(a, b, c) cout << "check : " << a << " " << b << " " << c << endl
#define chk4(a, b, c, d) \
cout << "check : " << a << " " << b << " " << c << " " << d << endl
#define chk5(a, b, c, d, e) \
cout << "check : " << a << " " << b << " " << c << " " << d << " " << e \
<< endl
#define lb(v, k) lower_bound(v.begin(), v.end(), k) - v.begin()
#define ub(v, k) upper_bound(v.begin(), v.end(), k) - v.begin()
#define mod 1000000007
#define pb push_back
#define pf push_front
#define m_p make_pair
#define fi first
#define se second
#define sz size()
#define sort(v) sort(v.begin(), v.end())
ll n, m;
VVI gp;
ll dp[100005];
ll fun(ll v) {
if (dp[v] != -1)
return dp[v];
ll maxi = 0;
lfl(i, gp[v]) { maxi = max(maxi, 1 + fun(gp[v][i])); }
return dp[v] = maxi;
}
int main() {
cin >> n >> m;
gp = VVI(n + 1);
memset(dp, -1, sizeof(dp));
lf(i, 1, m) {
ll u, v;
cin >> u >> v;
gp[u].pb(v);
}
ll maxi = 0;
lf(i, 1, n) { maxi = max(maxi, fun(i)); }
cout << maxi << endl;
} | [
"variable_declaration.remove",
"identifier.change",
"call.arguments.change"
] | 974,692 | 974,693 | u752324944 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000007;
vector<int> e[N];
int memo[N];
int solve(int u) {
int &st = memo[u];
if (st == -1) {
st = 1;
for (int v : e[u]) {
st = max(st, 1 + solve(v));
}
}
return st;
}
int main() {
memset(memo, -1, sizeof memo);
ios::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;
e[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, solve(i));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000007;
vector<int> e[N];
int memo[N];
int solve(int u) {
int &st = memo[u];
if (st == -1) {
st = 0;
for (int v : e[u]) {
st = max(st, 1 + solve(v));
}
}
return st;
}
int main() {
memset(memo, -1, sizeof memo);
ios::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;
e[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, solve(i));
cout << ans << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 974,701 | 974,702 | u502224091 | cpp |
p03166 | #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;
}
| [
"assignment.change"
] | 974,703 | 974,704 | u104889348 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
#define f(i, start, end, inc) for (int i = start; i < end; i += inc)
#define fl(i, start, end, inc) for (ll i = start; i < end; i += inc)
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
#define umap unordered_map
#define uset unordered_set
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vpis vector<pair<int, string>>
#define vpls vector<pair<ll, string>>
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define mp make_pair
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pis pair<int, string>
#define pls pair<ll, string>
#define F first
#define S second
#define inp(c) \
int c; \
cin >> c
#define inpl(c) \
ll c; \
cin >> c
using namespace std;
vector<int> g[100001];
int dp[100001];
int solve(int src) {
if (dp[src] != -1) {
return dp[src];
}
bool leaf = 1;
int bchild = 0;
for (int c : g[src]) {
leaf = 0;
bchild = max(bchild, solve(c));
}
return dp[src] = leaf ? 0 : 1 + bchild;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
f(i, 0, m, 1) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
int ans = 0;
f(i, 0, n, 1) { ans = max(ans, solve(i)); }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define f(i, start, end, inc) for (int i = start; i < end; i += inc)
#define fl(i, start, end, inc) for (ll i = start; i < end; i += inc)
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
#define umap unordered_map
#define uset unordered_set
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vpis vector<pair<int, string>>
#define vpls vector<pair<ll, string>>
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define mp make_pair
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pis pair<int, string>
#define pls pair<ll, string>
#define F first
#define S second
#define inp(c) \
int c; \
cin >> c
#define inpl(c) \
ll c; \
cin >> c
using namespace std;
vector<int> g[100001];
int dp[100001];
int solve(int src) {
if (dp[src] != -1) {
return dp[src];
}
bool leaf = 1;
int bchild = 0;
for (int c : g[src]) {
leaf = 0;
bchild = max(bchild, solve(c));
}
return dp[src] = leaf ? 0 : 1 + bchild;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int n, m;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
f(i, 0, m, 1) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
int ans = 0;
f(i, 1, n + 1, 1) { ans = max(ans, solve(i)); }
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 974,705 | 974,706 | u928676630 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define pb push_back
#define fo(i, N) for (int i = 0; i < N; i++)
#define foo(i, x, N) for (int i = x; i < N; i++)
#define fill(a, val) memset(a, val, sizeof(a))
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define endl '\n'
#define ff first
#define ss second
#define MAX 1234567
#define pii pair<int, int>
#define pll pair<ll, ll>
#define inf 1e9 + 1
#define all(a) a.begin(), a.end()
int n, m;
vector<int> adj[100001];
int dp[100001];
int solve(int x) {
if (dp[x] != -1)
return dp[x];
dp[x] = 0;
for (int next : adj[x]) {
dp[x] = max(dp[x], 1 + solve(next));
}
return dp[x];
}
int main() {
cin >> n >> m;
int a, b;
fo(i, m) {
cin >> a >> b;
adj[a].pb(b);
}
fill(dp, -1);
int ans = 0;
fo(i, n) ans = max(ans, solve(i));
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define pb push_back
#define fo(i, N) for (int i = 0; i < N; i++)
#define foo(i, x, N) for (int i = x; i < N; i++)
#define fill(a, val) memset(a, val, sizeof(a))
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define endl '\n'
#define ff first
#define ss second
#define MAX 1234567
#define pii pair<int, int>
#define pll pair<ll, ll>
#define inf 1e9 + 1
#define all(a) a.begin(), a.end()
int n, m;
vector<int> adj[100001];
int dp[100001];
int solve(int x) {
if (dp[x] != -1)
return dp[x];
dp[x] = 0;
for (int next : adj[x]) {
dp[x] = max(dp[x], 1 + solve(next));
}
return dp[x];
}
int main() {
cin >> n >> m;
int a, b;
fo(i, m) {
cin >> a >> b;
adj[a].pb(b);
}
fill(dp, -1);
int ans = 0;
foo(i, 1, n + 1) ans = max(ans, solve(i));
cout << ans << endl;
}
| [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"call.arguments.add",
"assignment.change"
] | 974,722 | 974,723 | u864055502 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
map<int, vector<int>> graph;
int dfs(int node, vector<int> dp) {
if (dp[node] != 0)
return dp[node] + 1;
for (auto i : graph[node]) {
dp[node] = max(dp[node], dfs(i, dp));
}
dp[node]++;
return dp[node];
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
}
vector<int> dp(n + 1);
for (int i = 1; i <= n; i++) {
if (dp[i] == 0) {
dp[i] = dfs(i, dp);
}
}
int maxm = 0;
for (int i = 1; i <= n; i++) {
maxm = max(maxm, dp[i]);
}
cout << maxm - 1;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
map<int, vector<int>> graph;
int dfs(int node, vector<int> &dp) {
if (dp[node] != 0)
return dp[node];
for (auto i : graph[node]) {
dp[node] = max(dp[node], dfs(i, dp));
}
dp[node]++;
return dp[node];
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
}
vector<int> dp(n + 1);
for (int i = 1; i <= n; i++) {
if (dp[i] == 0) {
dp[i] = dfs(i, dp);
}
}
int maxm = 0;
for (int i = 1; i <= n; i++) {
maxm = max(maxm, dp[i]);
}
cout << maxm - 1;
} | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,730 | 974,731 | u432063054 | cpp |
p03166 | #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;
} | [
"variable_declaration.remove"
] | 974,736 | 974,737 | u294050910 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
const int mxn = 1e5 + 1;
using namespace std;
vector<int> adj[mxn + 1], visited(mxn + 1, 0), dist(mxn + 1, -1);
void dfs(int u) {
if (visited[u])
return;
visited[u] = 1;
for (int v : adj[u]) {
if (!visited[v])
dfs(v);
dist[u] = max(dist[u], dist[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
int ans = *max_element(dist.begin() + 1, dist.end());
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
const int mxn = 1e5 + 1;
using namespace std;
vector<int> adj[mxn + 1], visited(mxn + 1, 0), dist(mxn + 1, 0);
void dfs(int u) {
if (visited[u])
return;
visited[u] = 1;
for (int v : adj[u]) {
if (!visited[v])
dfs(v);
dist[u] = max(dist[u], dist[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
int ans = *max_element(dist.begin() + 1, dist.end());
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 974,742 | 974,743 | u124430580 | cpp |
p03166 | #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;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,744 | 974,745 | u098923136 | cpp |
p03166 | /*
*
* 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;
} | [
"call.remove"
] | 974,754 | 974,755 | u109542682 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> l(100002);
int dp[100002];
int dpres(int i) {
if (dp[i] == -1) {
if (l[i].size() == 1) {
dp[i] = 0;
} else {
int ma = 0;
for (int j = 1; j < l[i].size(); j++) {
ma = max(dpres(l[i][j]), ma);
}
dp[i] = ma + 1;
}
}
return dp[i];
}
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < n + 1; i++) {
l[i].push_back(0);
}
for (int i = 0; i < m; i++) {
cin >> a >> b;
l[a].push_back(b);
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
int ma = 0;
for (int i = 1; i < n + 1; i++) {
if (dp[i] == -1) {
dp[i] = dpres(i);
}
ma = max(dp[i], ma);
}
cout << ma;
} | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> l(100002);
int dp[100002];
int dpres(int i) {
if (dp[i] == -1) {
if (l[i].size() == 1) {
dp[i] = 0;
} else {
int ma = 0;
for (int j = 1; j < l[i].size(); j++) {
ma = max(dpres(l[i][j]), ma);
}
dp[i] = ma + 1;
}
}
return dp[i];
}
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < n + 1; i++) {
l[i].push_back(0);
}
for (int i = 0; i < m; i++) {
cin >> a >> b;
l[a].push_back(b);
}
for (int i = 0; i < n + 1; i++) {
dp[i] = -1;
}
int ma = 0;
for (int i = 1; i < n + 1; i++) {
if (dp[i] == -1) {
dp[i] = dpres(i);
}
ma = max(dp[i], ma);
}
cout << ma;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 974,756 | 974,757 | u891945807 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int child[100001];
int marker[100001];
int maximumm = 0;
int dfs(int head, vector<int> v[]) {
child[head] = 1;
int maxi = 0;
for (int i = 0; i < v[head].size(); i++) {
maxi = 0;
if (marker[v[head][i]] == 0) {
marker[v[head][i]] = 1;
int x = dfs(v[head][i], v);
if (x > maxi)
maxi = x;
} else {
int k = child[v[head][i]];
if (k > maxi)
maxi = k;
}
}
child[head] += maxi;
return child[head];
}
int main() {
for (int i = 0; i <= 100001; i++) {
child[i] = 0;
marker[i] = 0;
}
int n, m;
cin >> n;
cin >> m;
vector<int> v[n + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a;
cin >> b;
v[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (marker[i] == 0) {
marker[i] = 1;
int y = dfs(i, v);
if (y > maximumm)
maximumm = y;
}
}
cout << maximumm << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int child[100001];
int marker[100001];
int maximumm = 0;
int dfs(int head, vector<int> v[]) {
child[head] = 1;
int maxi = 0;
for (int i = 0; i < v[head].size(); i++) {
// maxi=0;
if (marker[v[head][i]] == 0) {
marker[v[head][i]] = 1;
int x = dfs(v[head][i], v);
if (x > maxi)
maxi = x;
} else {
int k = child[v[head][i]];
if (k > maxi)
maxi = k;
}
}
child[head] += maxi;
return child[head];
}
int main() {
for (int i = 0; i <= 100001; i++) {
child[i] = 0;
marker[i] = 0;
}
int n, m;
cin >> n;
cin >> m;
vector<int> v[n + 1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a;
cin >> b;
v[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (marker[i] == 0) {
marker[i] = 1;
int y = dfs(i, v);
if (y > maximumm)
maximumm = y;
}
}
cout << maximumm - 1 << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 974,760 | 974,761 | u464230785 | cpp |
p03166 | /*
created by Sanyam Singhal
/*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define triplet pair<int, pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
#define loop2(i, k, n) for (ll i = k; i >= n; i--)
const ll inf = 1e18;
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
ll dfs(vector<vector<ll>> &adj, vector<ll> &dp, int src) {
if (dp[src] != -1)
return dp[src];
ll ans = 1;
for (int neigh : adj[src]) {
ans = max(ans, dfs(adj, dp, neigh) + 1);
}
dp[src] = ans;
return ans;
}
void solve() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<ll> dp(n + 1, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
// for(int i=0; i<n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
ll ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, dfs(adj, dp, i));
}
cout << ans - 1 << endl;
// for(int i=0; i<=n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
return;
}
int main() {
fastIO;
take_fileIO();
solve();
return 0;
} | /*
created by Sanyam Singhal
/*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define triplet pair<int, pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
#define loop2(i, k, n) for (ll i = k; i >= n; i--)
const ll inf = 1e18;
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
ll dfs(vector<vector<ll>> &adj, vector<ll> &dp, int src) {
if (dp[src] != -1)
return dp[src];
ll ans = 1;
for (int neigh : adj[src]) {
ans = max(ans, dfs(adj, dp, neigh) + 1);
}
dp[src] = ans;
return ans;
}
void solve() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<ll> dp(n + 1, -1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
}
// for(int i=0; i<n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
ll ans = 0;
for (int i = 0; i <= n; i++) {
ans = max(ans, dfs(adj, dp, i));
}
cout << ans - 1 << endl;
// for(int i=0; i<=n; i++)
// cout<<dp[i]<<" ";
// cout<<endl;
return;
}
int main() {
fastIO;
// take_fileIO();
solve();
return 0;
} | [
"call.remove"
] | 974,762 | 974,763 | u142133038 | cpp |
p03166 | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define endl '\n'
#define w(x) \
int x; \
cin >> x; \
while (x-- > 0)
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<vector<int>> v(100011);
// bool visited[10001]={false};
int dp[100011];
int n, m;
int ans = 0;
int dfs(int id) {
if (v[id].size() == 0)
return 0;
if (dp[id] != -1)
return dp[id];
int t = -1;
for (int i : v[id])
t = max(t, dfs(i) + 1);
ans = max(ans, t);
return dp[id] = t;
}
void mysol() {
memset(dp, -1, sizeof dp);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].pb(b);
}
for (int i = 1; i <= n; i++) {
dfs(i);
}
cout << ans;
}
int32_t main() {
fast();
// w(t)
{ mysol(); }
return 0;
}
| #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define endl '\n'
#define w(x) \
int x; \
cin >> x; \
while (x-- > 0)
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<vector<int>> v(100011);
// bool visited[10001]={false};
int dp[100011];
int n, m;
int ans = 0;
int dfs(int id) {
if (v[id].size() == 0)
return 0;
if (dp[id] != -1)
return dp[id];
int t = -1;
for (int i : v[id])
t = max(t, dfs(i) + 1);
ans = max(ans, t);
return dp[id] = t;
}
void mysol() {
memset(dp, -1, sizeof dp);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].pb(b);
}
for (int i = 1; i <= n; i++) {
dfs(i);
}
cout << ans;
}
int32_t main() {
// fast();
// w(t)
{ mysol(); }
return 0;
}
| [
"call.remove"
] | 974,766 | 974,767 | u464104383 | cpp |
p03166 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
bitset<100001> d;
int kq[100001];
int ans = 0;
void dfs(int i, vector<int> a[]) {
for (int j = 0; j < a[i].size(); j++) {
cout << i;
if (d[a[i][j]] == 0) {
d[a[i][j]] = 1;
dfs(a[i][j], a);
}
kq[i] = max(kq[i], kq[a[i][j]] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
a[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
kq[i] = 0;
}
for (int i = 1; i <= n; i++) {
if (d[i] == 0) {
d[i] = 1;
dfs(i, a);
}
}
for (int i = 1; i <= n; i++) {
ans = max(ans, kq[i]);
}
cout << ans;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
bitset<100001> d;
int kq[100001];
int ans = 0;
void dfs(int i, vector<int> a[]) {
for (int j = 0; j < a[i].size(); j++) {
if (d[a[i][j]] == 0) {
d[a[i][j]] = 1;
dfs(a[i][j], a);
}
kq[i] = max(kq[i], kq[a[i][j]] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> a[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
a[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
kq[i] = 0;
}
for (int i = 1; i <= n; i++) {
if (d[i] == 0) {
d[i] = 1;
dfs(i, a);
}
}
for (int i = 1; i <= n; i++) {
ans = max(ans, kq[i]);
}
cout << ans;
}
| [] | 974,775 | 974,776 | u940325994 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<bool> vis;
vector<vector<int>> adj;
vector<int> dp;
inline void dfs(int k) {
vis[k] = 1;
for (int v : adj[k]) {
if (!vis[v]) {
dfs(v);
dp[k] = max(dp[k], 1 + dp[v]);
}
}
}
int main() {
int n, m;
int e[2];
cin >> n >> m;
vis.assign(n + 1, 0);
dp.assign(n + 1, 1);
adj = vector<vector<int>>(n + 1);
for (int i = 0; i < m; ++i) {
cin >> e[0] >> e[1];
adj[e[0]].push_back(e[1]);
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
cout << *max_element(dp.begin(), dp.end()) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<bool> vis;
vector<vector<int>> adj;
vector<int> dp;
void dfs(int k) {
vis[k] = 1;
for (int v : adj[k]) {
if (!vis[v])
dfs(v);
dp[k] = max(dp[k], 1 + dp[v]);
}
}
int main() {
int n, m;
int e[2];
cin >> n >> m;
vis.assign(n + 1, 0);
dp.assign(n + 1, 0);
adj = vector<vector<int>>(n + 1);
for (int i = 0; i < m; ++i) {
cin >> e[0] >> e[1];
adj[e[0]].push_back(e[1]);
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
cout << *max_element(dp.begin(), dp.end()) << '\n';
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 974,805 | 974,806 | u158312277 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<bool> vis;
vector<vector<int>> adj;
vector<int> dp;
inline void dfs(int k) {
vis[k] = 1;
for (int v : adj[k]) {
if (!vis[v]) {
dfs(v);
dp[k] = max(dp[k], 1 + dp[v]);
}
}
}
int main() {
int n, m;
int e[2];
cin >> n >> m;
vis.assign(n + 1, 0);
dp.assign(n + 1, 1);
adj = vector<vector<int>>(n + 1);
for (int i = 0; i < m; ++i) {
cin >> e[0] >> e[1];
adj[e[0]].push_back(e[1]);
}
for (int i = 0; i < n; ++i)
if (!vis[i])
dfs(i);
cout << *max_element(dp.begin(), dp.end()) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<bool> vis;
vector<vector<int>> adj;
vector<int> dp;
void dfs(int k) {
vis[k] = 1;
for (int v : adj[k]) {
if (!vis[v])
dfs(v);
dp[k] = max(dp[k], 1 + dp[v]);
}
}
int main() {
int n, m;
int e[2];
cin >> n >> m;
vis.assign(n + 1, 0);
dp.assign(n + 1, 0);
adj = vector<vector<int>>(n + 1);
for (int i = 0; i < m; ++i) {
cin >> e[0] >> e[1];
adj[e[0]].push_back(e[1]);
}
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
cout << *max_element(dp.begin(), dp.end()) << '\n';
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,807 | 974,806 | u158312277 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int maxv = 5 + 5;
vector<int> arr[maxv];
vector<int> indeg(maxv);
vector<int> vis(maxv);
vector<int> dis(maxv);
void dfs(int i) {
vis[i] = 1;
for (auto v : arr[i]) {
--indeg[v];
dis[v] = max(dis[v], 1 + dis[i]);
if (indeg[v] == 0) {
dfs(v);
}
}
}
int main() {
int v, e;
cin >> v >> e;
int x, y;
for (int i = 0; i < e; i++) {
cin >> x >> y;
arr[x].push_back(y);
++indeg[y];
}
for (int i = 1; i <= v; i++) {
if (vis[i] == 0 && indeg[i] == 0) { // start with vertices with indegree 0
dfs(i);
}
}
int ans = 0;
for (auto v : dis) {
// cout<<v<<" ";
ans = max(ans, v);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int maxv = 1e5 + 5;
vector<int> arr[maxv];
vector<int> indeg(maxv);
vector<int> vis(maxv);
vector<int> dis(maxv);
void dfs(int i) {
vis[i] = 1;
for (auto v : arr[i]) {
--indeg[v];
dis[v] = max(dis[v], 1 + dis[i]);
if (indeg[v] == 0) {
dfs(v);
}
}
}
int main() {
int v, e;
cin >> v >> e;
int x, y;
for (int i = 0; i < e; i++) {
cin >> x >> y;
arr[x].push_back(y);
++indeg[y];
}
for (int i = 1; i <= v; i++) {
if (vis[i] == 0 && indeg[i] == 0) { // start with vertices with indegree 0
dfs(i);
}
}
int ans = 0;
for (auto v : dis) {
// cout<<v<<" ";
ans = max(ans, v);
}
cout << ans << "\n";
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 974,824 | 974,825 | u566474691 | cpp |
p03166 | #include <bits/stdc++.h>
#include <queue>
using namespace std;
vector<queue<int>> gra;
vector<int> dp;
vector<int> si;
int path(int x) {
int &ret = dp[x];
if (ret != -1)
return ret;
ret = 1;
for (int i = 0; i < si[x]; i++) {
int y = gra[x].front();
gra[x].pop();
if (ret < path(y) + 1)
ret = path(y) + 1;
gra[x].push(y);
}
return ret;
}
int main() {
int N;
cin >> N;
gra.resize(N + 1);
dp.assign(N + 1, -1);
si.assign(N + 1, 0);
int M;
cin >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
gra[x].push(y);
si[x]++;
}
int ans = 0;
for (int i = 1; i <= N; i++) {
if (ans < path(i))
ans = path(i);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <queue>
using namespace std;
vector<queue<int>> gra;
vector<int> dp;
vector<int> si;
int path(int x) {
int &ret = dp[x];
if (ret != -1)
return ret;
ret = 0;
for (int i = 0; i < si[x]; i++) {
int y = gra[x].front();
gra[x].pop();
if (ret < path(y) + 1)
ret = path(y) + 1;
gra[x].push(y);
}
return ret;
}
int main() {
int N;
cin >> N;
gra.resize(N + 1);
dp.assign(N + 1, -1);
si.assign(N + 1, 0);
int M;
cin >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
gra[x].push(y);
si[x]++;
}
int ans = 0;
for (int i = 1; i <= N; i++) {
if (ans < path(i))
ans = path(i);
}
cout << ans << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 974,832 | 974,833 | u058186113 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
const int maxn = 10e7;
vector<bool> visited(maxn, false);
vector<vector<int>> edges(maxn);
vector<long long int> dp(maxn);
void dfs(int u) {
visited[u] = 1;
for (int v : edges[u]) {
if (!visited[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++)
edges[0].push_back(i);
dfs(0);
cout << dp[0] - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
const int maxn = 1 + 10e5;
vector<bool> visited(maxn, false);
vector<vector<int>> edges(maxn);
vector<long long int> dp(maxn);
void dfs(int u) {
visited[u] = 1;
for (int v : edges[u]) {
if (!visited[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++)
edges[0].push_back(i);
dfs(0);
cout << dp[0] - 1 << endl;
return 0;
} | [
"literal.number.change"
] | 974,836 | 974,837 | u898200089 | cpp |
p03166 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
#define MohamedMotaz \
ios::sync_with_stdio(0); \
cin.tie(0); \
ios_base::sync_with_stdio(0);
#define f(a, b, c) for (int a = b; a < c; a++)
#define fr(a, b, c) for (int a = b; a >= c; a--)
using namespace std;
// ll fact[1000001]; ll inv[1000001];
// ll primes[100007];
// ll arr[1000007];
// ll modPower(ll b, ll p) {
// if (p == 0)
// return 1;
//
// ll halfpow = modPower(b, p / 2);
// ll toReturn = (halfpow * halfpow) % mod;
// if (p % 2)
// toReturn = (toReturn * b) % mod;
//
// return toReturn;
//}
//
// ll fastPower(ll b, ll p) {
// if (p == 0)
// return 1;
// ll ans = fastPower(b, p / 2);
// ans = (ans * ans);
// if (p % 2 != 0)
// ans = (ans * b);
// return ans;
//}
// ll GcdRecursive(ll a, ll b) {
// if (b == 0) return a;
// return GcdRecursive(b, a % b);
//}
// ll modLCM(ll a, ll b) {
// ll val = GcdRecursive(a, b);
// ll tmp = ((a % mod) * (b % mod)) % mod;
// ll finalVal = ((tmp % mod) * (arr[val] % mod)) % mod;
// return finalVal;
//
//}
// ll LCM(ll a, ll b) {
// return (a * b) / GcdRecursive(a, b);
//}
// void move1step(ll& a, ll& b, ll q) { // a and b by reference
// ll c = a - q * b;
// a = b;
// b = c;
//}
// ll GcdIterative(ll a, ll b) {
// while (b) move1step(a, b, a / b);
// return a;
//}
//
// void pre(ll n) {
//
// fact[0] = 1;
// inv[0] = 1;
//
// for (ll i = 1; i <= n; i++) {
// fact[i] = (i * fact[i - 1]) % mod;
// inv[i] = modPower(fact[i], mod - 2);
// arr[i] = modPower(i, mod - 2);
// }
//}
//
// ll npr(ll n, ll r) {
// return ((fact[n] * inv[n - r]) % mod);
//}
//
// ll ncr(ll n, ll r) {
// return ((((fact[n] * inv[n - r]) % mod) * inv[r]) % mod);
//}
//
// void sieve(ll val) {
// memset(primes, 1, sizeof primes);
// primes[0] = primes[1] = false;
// for (int i = 2; i <= val; i++) {
// if (primes[i]) {
// for (int j = i * i; j <= val; j += i) {
// primes[j] = 0;
// }
// }
// }
//
//}
const ll mod = 1e9 + 7;
const ll N = 2e5 + 7;
const ll inf = 1e9 + 5;
ll n, m, a, b, ans = 0, c = 0;
vector<ll> adj[N];
bool visited[N] = {false};
ll dp[N] = {};
void dfs(ll node) {
visited[node] = true;
for (auto elem : adj[node]) {
if (!visited[elem])
dfs(elem);
dp[node] = max(dp[node] + 1, dp[node]);
ans = max(ans, dp[node]);
}
}
int main() {
MohamedMotaz;
cin >> n >> m;
f(i, 0, m) {
cin >> a >> b;
adj[a].push_back(b);
}
for (int i = 1; i <= n; i++)
dfs(i);
cout << ans;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
#define MohamedMotaz \
ios::sync_with_stdio(0); \
cin.tie(0); \
ios_base::sync_with_stdio(0);
#define f(a, b, c) for (int a = b; a < c; a++)
#define fr(a, b, c) for (int a = b; a >= c; a--)
using namespace std;
// ll fact[1000001]; ll inv[1000001];
// ll primes[100007];
// ll arr[1000007];
// ll modPower(ll b, ll p) {
// if (p == 0)
// return 1;
//
// ll halfpow = modPower(b, p / 2);
// ll toReturn = (halfpow * halfpow) % mod;
// if (p % 2)
// toReturn = (toReturn * b) % mod;
//
// return toReturn;
//}
//
// ll fastPower(ll b, ll p) {
// if (p == 0)
// return 1;
// ll ans = fastPower(b, p / 2);
// ans = (ans * ans);
// if (p % 2 != 0)
// ans = (ans * b);
// return ans;
//}
// ll GcdRecursive(ll a, ll b) {
// if (b == 0) return a;
// return GcdRecursive(b, a % b);
//}
// ll modLCM(ll a, ll b) {
// ll val = GcdRecursive(a, b);
// ll tmp = ((a % mod) * (b % mod)) % mod;
// ll finalVal = ((tmp % mod) * (arr[val] % mod)) % mod;
// return finalVal;
//
//}
// ll LCM(ll a, ll b) {
// return (a * b) / GcdRecursive(a, b);
//}
// void move1step(ll& a, ll& b, ll q) { // a and b by reference
// ll c = a - q * b;
// a = b;
// b = c;
//}
// ll GcdIterative(ll a, ll b) {
// while (b) move1step(a, b, a / b);
// return a;
//}
//
// void pre(ll n) {
//
// fact[0] = 1;
// inv[0] = 1;
//
// for (ll i = 1; i <= n; i++) {
// fact[i] = (i * fact[i - 1]) % mod;
// inv[i] = modPower(fact[i], mod - 2);
// arr[i] = modPower(i, mod - 2);
// }
//}
//
// ll npr(ll n, ll r) {
// return ((fact[n] * inv[n - r]) % mod);
//}
//
// ll ncr(ll n, ll r) {
// return ((((fact[n] * inv[n - r]) % mod) * inv[r]) % mod);
//}
//
// void sieve(ll val) {
// memset(primes, 1, sizeof primes);
// primes[0] = primes[1] = false;
// for (int i = 2; i <= val; i++) {
// if (primes[i]) {
// for (int j = i * i; j <= val; j += i) {
// primes[j] = 0;
// }
// }
// }
//
//}
const ll mod = 1e9 + 7;
const ll N = 2e5 + 7;
const ll inf = 1e9 + 5;
ll n, m, a, b, ans = 0, c = 0;
vector<ll> adj[N];
bool visited[N] = {false};
ll dp[N] = {};
void dfs(ll node) {
visited[node] = true;
for (auto elem : adj[node]) {
if (!visited[elem])
dfs(elem);
dp[node] = max(dp[node], dp[elem] + 1);
ans = max(ans, dp[node]);
}
}
int main() {
MohamedMotaz;
cin >> n >> m;
f(i, 0, m) {
cin >> a >> b;
adj[a].push_back(b);
}
for (int i = 1; i <= n; i++)
dfs(i);
cout << ans;
}
| [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 974,844 | 974,845 | u376276683 | cpp |
p03166 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define INT_MAX 2147483647
#define ll long long
ll max(ll a, ll b) { return (a < b) ? b : a; }
vector<bool> visited;
vector<int> lp;
void dfs(unordered_map<int, vector<int>> &edges, int node) {
visited[node] = true;
for (int neighbour : edges[node]) {
if (!visited[neighbour]) {
dfs(edges, neighbour);
}
lp[node] = max(lp[node], 1 + lp[neighbour]);
}
}
// DP !!
int main() {
int n, m;
cin >> n >> m;
unordered_map<int, vector<int>> edges;
lp.resize(n + 1, 0);
visited.resize(n + 1, false);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(edges, 1);
}
int best = -1;
for (int el : lp) {
best = max(el, best);
}
cout << best << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define INT_MAX 2147483647
#define ll long long
ll max(ll a, ll b) { return (a < b) ? b : a; }
vector<bool> visited;
vector<int> lp;
void dfs(unordered_map<int, vector<int>> &edges, int node) {
visited[node] = true;
for (int neighbour : edges[node]) {
if (!visited[neighbour]) {
dfs(edges, neighbour);
}
lp[node] = max(lp[node], 1 + lp[neighbour]);
}
}
// DP !!
int main() {
int n, m;
cin >> n >> m;
unordered_map<int, vector<int>> edges;
lp.resize(n + 1, 0);
visited.resize(n + 1, false);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(edges, i);
}
int best = -1;
for (int el : lp) {
best = max(el, best);
}
cout << best << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 974,848 | 974,849 | u671252724 | cpp |
p03166 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define llv vector<ll>
#define mp make_pair
#define endl "\n"
const int N = (int)1e5 + 10;
const int M = (int)1000000007;
vector<ll> topo;
bool mark[N];
void topology(vector<ll> g[], ll idx) {
mark[idx] = 1;
for (auto e : g[idx]) {
if (mark[e] == 0)
topology(g, e);
// cout << e << endl ;
}
// cout << idx << endl ;
topo.pb(idx);
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m, i, x, y;
cin >> n >> m;
vector<ll> g[n + 1];
for (i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
for (i = 1; i <= n; i++) {
if (mark[i])
continue;
topology(g, 1LL);
}
reverse(all(topo));
ll dp[n + 1] = {0};
for (i = 0; i < n; i++) {
ll p = topo[i];
for (auto e : g[p]) {
dp[e] = max(dp[e], dp[p] + 1);
}
}
ll ans = 0;
for (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;
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define llv vector<ll>
#define mp make_pair
#define endl "\n"
const int N = (int)1e5 + 10;
const int M = (int)1000000007;
vector<ll> topo;
bool mark[N];
void topology(vector<ll> g[], ll idx) {
mark[idx] = 1;
for (auto e : g[idx]) {
if (mark[e] == 0)
topology(g, e);
// cout << e << endl ;
}
// cout << idx << endl ;
topo.pb(idx);
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m, i, x, y;
cin >> n >> m;
vector<ll> g[n + 1];
for (i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
for (i = 1; i <= n; i++) {
if (mark[i])
continue;
topology(g, i);
}
reverse(all(topo));
ll dp[n + 1] = {0};
for (i = 0; i < n; i++) {
ll p = topo[i];
for (auto e : g[p]) {
dp[e] = max(dp[e], dp[p] + 1);
}
}
ll ans = 0;
for (i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 974,857 | 974,858 | u713352016 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, m, i, ans[20005], an, x, y;
vector<int> adj[200005];
int dfs(int nod) {
int cur = 0;
for (auto x : adj[nod]) {
if (!ans[x])
dfs(x);
cur = max(cur, ans[x]);
}
return ans[nod] = cur++;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> m;
for (i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
/*for(i=1;i<=n;i++){
for(auto x:adj[i]){
dp[i]=max(dp[i],dp[x]+1);
}}*/
for (i = 1; i <= n; i++) {
ans[i] = dfs(i);
// cout<<dfs(i)<< " ";
an = max(an, ans[i]);
}
cout << an - 1;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, m, i, ans[200005], an, x, y;
vector<int> adj[200005];
int dfs(int nod) {
int cur = 0;
for (auto x : adj[nod]) {
if (!ans[x])
dfs(x);
cur = max(cur, ans[x]);
}
return ans[nod] = cur + 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cerr.tie(0);
cout.tie(0);
cin >> n >> m;
for (i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
/*for(i=1;i<=n;i++){
for(auto x:adj[i]){
dp[i]=max(dp[i],dp[x]+1);
}}*/
for (i = 1; i <= n; i++) {
ans[i] = dfs(i);
// cout<<dfs(i)<< " ";
an = max(an, ans[i]);
}
cout << an - 1;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"function.return_value.change"
] | 974,861 | 974,860 | u111912627 | cpp |
p03166 | #include <bits/stdc++.h>
#define x first
#define y second
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mem(i) memset((i), (-1), (sizeof(i)))
#define all(i) (i).begin(), (i).end()
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int MN = 1e5 + 5;
int n, m;
vector<int> adj[MN];
bool visited[MN];
int dp[MN];
void dfs(int cur) {
visited[cur] = true;
for (auto &next : adj[cur]) {
if (!visited[cur])
dfs(next);
dp[cur] = max(dp[next] + 1, dp[cur]);
}
}
int main() {
fastio;
cin >> n >> m;
rep(i, 0, m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(i, 1, n + 1) if (!visited[i]) dfs(i);
cout << *max_element(dp + 1, dp + n + 1) + 1 << '\n';
} | #include <bits/stdc++.h>
#define x first
#define y second
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mem(i) memset((i), (-1), (sizeof(i)))
#define all(i) (i).begin(), (i).end()
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int MN = 1e5 + 5;
int n, m;
vector<int> adj[MN];
bool visited[MN];
int dp[MN];
void dfs(int cur) {
visited[cur] = true;
for (auto &next : adj[cur]) {
if (!visited[next])
dfs(next);
dp[cur] = max(dp[next] + 1, dp[cur]);
}
}
int main() {
fastio;
cin >> n >> m;
rep(i, 0, m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(i, 1, n + 1) if (!visited[i]) dfs(i);
cout << *max_element(dp + 1, dp + n + 1) << '\n';
} | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 974,874 | 974,875 | u938143205 | cpp |
p03166 | #include <bits/stdc++.h>
#define int long long int
#define nitro ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define pb push_back
#define PI 3.1415926535897932384626
#define MOD 1000000007
#define DEBUG false
#pragma GCC optimize "trapv"
using namespace std;
void dfs(vector<int> adj[], int node, int dp[], bool vis[]) {
vis[node] = true;
for (int i = 0; i < adj[node].size(); ++i) {
if (!vis[adj[node][i]])
dfs(adj, adj[node][i], dp, vis);
dp[node] = max(dp[node], 1 + dp[adj[node][i]]);
}
}
int longest(vector<int> adj[], int n) {
int dp[n + 1];
memset(dp, 0, sizeof(dp));
bool vis[n + 1] = {false};
for (int i = 1; i <= n; ++i) {
if (!vis[i])
dfs(adj, i, dp, vis);
}
int ans = *max_element(dp, dp + n);
return ans;
}
int32_t main() {
nitro;
int n, m;
cin >> n >> m;
vector<int> adj[n + 1];
int u, v;
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].pb(v);
}
cout << longest(adj, n);
return 0;
} | #include <bits/stdc++.h>
#define int long long int
#define nitro ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define pb push_back
#define PI 3.1415926535897932384626
#define MOD 1000000007
#define DEBUG false
#pragma GCC optimize "trapv"
using namespace std;
void dfs(vector<int> adj[], int node, int dp[], bool vis[]) {
vis[node] = true;
for (int i = 0; i < adj[node].size(); ++i) {
if (!vis[adj[node][i]])
dfs(adj, adj[node][i], dp, vis);
dp[node] = max(dp[node], 1 + dp[adj[node][i]]);
}
}
int longest(vector<int> adj[], int n) {
int dp[n + 1];
memset(dp, 0, sizeof(dp));
bool vis[n + 1] = {false};
for (int i = 1; i <= n; ++i) {
if (!vis[i])
dfs(adj, i, dp, vis);
}
int ans = *max_element(dp, dp + n + 1);
return ans;
}
int32_t main() {
nitro;
int n, m;
cin >> n >> m;
vector<int> adj[n + 1];
int u, v;
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].pb(v);
}
cout << longest(adj, n);
return 0;
} | [
"assignment.change"
] | 974,876 | 974,877 | u531475417 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fore(i, a, b) for (int i = a; i < b; i++)
#define maxe(a, b, c) max(a, max(b, c))
#define eb emplace_back
#define em emplace
#define print(x) cout << x << endl;
#define in(k) \
int k; \
cin >> k
typedef long long int ll;
const ll mod = 1e9 + 7;
int c = 0;
int n, m;
vector<vector<int>> g;
vector<int> e, f;
void dfs(int n) {
for (auto to : g[n]) {
if (f[to] == 0) {
f[to] = 1;
dfs(to);
}
e[n] = max(e[n], e[to] + 1);
c = max(c, e[n]);
}
}
int main() {
fastio;
cin >> n >> m;
g = vector<vector<int>>(n + 1);
e.assign(n + 1, 0);
f.assign(n + 1, 0);
fore(i, 0, m) {
in(x);
in(y);
g[--x].eb(--y);
}
fore(i, 1, n + 1) {
if (f[i] != 1) {
f[i] = 1;
dfs(i);
}
}
cout << c;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define fore(i, a, b) for (int i = a; i < b; i++)
#define maxe(a, b, c) max(a, max(b, c))
#define eb emplace_back
#define em emplace
#define print(x) cout << x << endl;
#define in(k) \
int k; \
cin >> k
typedef long long int ll;
const ll mod = 1e9 + 7;
int c = 0;
int n, m;
vector<vector<int>> g;
vector<int> e, f;
void dfs(int n) {
for (auto to : g[n]) {
if (f[to] == 0) {
f[to] = 1;
dfs(to);
}
e[n] = max(e[n], e[to] + 1);
c = max(c, e[n]);
}
}
int main() {
fastio;
cin >> n >> m;
g = vector<vector<int>>(n + 1);
e.assign(n + 1, 0);
f.assign(n + 1, 0);
fore(i, 0, m) {
in(x);
in(y);
g[x].eb(y);
}
fore(i, 1, n + 1) {
if (f[i] != 1) {
f[i] = 1;
dfs(i);
}
}
cout << c;
return 0;
}
| [
"call.arguments.change"
] | 974,880 | 974,881 | u719855312 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define per1(i, n) for (ll i = n; i > 0; i--)
#define prll(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
}
#define ain(a) \
for (auto &i : a) \
cin >> i
#define mms(a) memset(a, 0, sizeof(a))
// cout << fixed << setprecision(0) << pi <<" "<<npi<<endl;
ll max_ll(ll a, ll b, ll c) { return max(a, max(b, c)); }
ll min_ll(ll a, ll b, ll c) { return min(a, min(b, c)); }
bool sortBySec(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second == b.second)
return a.first < b.first;
return (a.second < b.second);
}
long long binexpmod(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) {
res = res * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return (res);
}
const int nix = 6;
vi edges[nix];
vi in_degree(nix);
vi vis(nix);
vi dist(nix, 0);
void dfs(ll i) {
assert(!vis[i]);
vis[i] = 1;
for (auto e : edges[i]) {
dist[e] = max(dist[e], dist[i] + 1);
in_degree[e]--;
if (in_degree[e] == 0) {
dfs(e);
}
}
return;
}
ll lcm(ll a, ll b) {
ll x = __gcd(a, b);
a /= x;
b /= x;
ll sum = a * b * x;
return sum;
}
void solve() {
ll n, m, res = 0;
cin >> n >> m;
rep(i, m) {
ll x, y;
cin >> x >> y;
edges[x].push_back(y);
in_degree[y]++;
}
rep1(i, n) {
if (!vis[i] && in_degree[i] == 0) {
dfs(i);
}
}
for (ll i : dist) {
res = max(res, i);
}
cout << res << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define per1(i, n) for (ll i = n; i > 0; i--)
#define prll(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
}
#define ain(a) \
for (auto &i : a) \
cin >> i
#define mms(a) memset(a, 0, sizeof(a))
// cout << fixed << setprecision(0) << pi <<" "<<npi<<endl;
ll max_ll(ll a, ll b, ll c) { return max(a, max(b, c)); }
ll min_ll(ll a, ll b, ll c) { return min(a, min(b, c)); }
bool sortBySec(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second == b.second)
return a.first < b.first;
return (a.second < b.second);
}
long long binexpmod(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) {
res = res * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return (res);
}
const int nix = 100005;
vi edges[nix];
vi in_degree(nix);
vi vis(nix);
vi dist(nix, 0);
void dfs(ll i) {
assert(!vis[i]);
vis[i] = 1;
for (auto e : edges[i]) {
dist[e] = max(dist[e], dist[i] + 1);
in_degree[e]--;
if (in_degree[e] == 0) {
dfs(e);
}
}
return;
}
ll lcm(ll a, ll b) {
ll x = __gcd(a, b);
a /= x;
b /= x;
ll sum = a * b * x;
return sum;
}
void solve() {
ll n, m, res = 0;
cin >> n >> m;
rep(i, m) {
ll x, y;
cin >> x >> y;
edges[x].push_back(y);
in_degree[y]++;
}
rep1(i, n) {
if (!vis[i] && in_degree[i] == 0) {
dfs(i);
}
}
for (ll i : dist) {
res = max(res, i);
}
cout << res << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 974,898 | 974,899 | u720542798 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int cache[N];
vector<int> adj[N];
int dfs(int n) {
int &ans = cache[n];
if (ans != -1)
/*if previously find longest path for the node n
than from here it's compute value return*/
return ans;
ans = 0;
for (auto it : adj[n])
ans = max(ans, 1 + dfs(it));
return ans;
}
int32_t main() {
int n, m, u, v;
/// n->no of node
// m-> no of edges
cin >> n >> m;
// initially decalared cache as -1
memset(cache, -1, sizeof(cache));
for (int i = 0; i < n; ++i) {
// u,v-> directed edge from u to v
cin >> u >> v;
// adj[i] contain all the adjacent of thr=e node i
adj[u].push_back(v);
}
int ans = 0;
// find the longest path from every node in the graph
for (int i = 1; i <= n; ++i)
ans = max(ans, dfs(i));
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int cache[N];
vector<int> adj[N];
int dfs(int n) {
int &ans = cache[n];
if (ans != -1)
/*if previously find longest path for the node n
than from here it's compute value return*/
return ans;
ans = 0;
for (auto it : adj[n])
ans = max(ans, 1 + dfs(it));
return ans;
}
int32_t main() {
int n, m, u, v;
/// n->no of node
// m-> no of edges
cin >> n >> m;
// initially decalared cache as -1
memset(cache, -1, sizeof(cache));
for (int i = 0; i < m; ++i) {
// u,v-> directed edge from u to v
cin >> u >> v;
// adj[i] contain all the adjacent of thr=e node i
adj[u].push_back(v);
}
int ans = 0;
// find the longest path from every node in the graph
for (int i = 1; i <= n; ++i)
ans = max(ans, dfs(i));
cout << ans;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,907 | 974,908 | u295361373 | cpp |
p03166 |
// naveen mall
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define vec vector
#define int long long int
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define trav(a, i) for (auto &i : a)
#define fl(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define rfl(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define invect(v, n) \
for (int i = 0; i < n; i++) { \
int arb; \
cin >> arb; \
v.pb(arb); \
}
#define inset(s, n) \
forloop(n) { \
int aset; \
cin >> aset; \
s.insert(aset); \
}
#define display(c) \
trav(c, i) cout << i << " "; \
cout << "\n";
#define F first
#define S second
#define pii pair<int, int>
#define PB pop_back
#define endl "\n"
#define copy(a, b) copy(all(a), back_inserter(b));
#define section(a, b, w) \
set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define union(a, b, w) \
set_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define diff(a, b, w) \
set_difference(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define symdiff(a, b, w) \
set_symmetric_difference(a.begin(), a.end(), b.begin(), b.end(), \
back_inserter(w));
void dfs(int n, vec<int> v[], bool mark[], int dp[]) {
mark[n] = true;
for (int i = 0; i < sz(v[n]); i++) {
if (v[n][i] == false)
dfs(v[n][i], v, mark, dp);
dp[n] = max(dp[n], 1 + dp[v[n][i]]);
}
}
void solve() {
int n, m;
cin >> n >> m;
vec<int> v[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
int dp[n + 1];
memset(dp, 0, sizeof(dp));
bool mark[n + 1];
memset(mark, false, sizeof(mark));
for (int i = 1; i <= n; i++) {
if (mark[i] == false) {
dfs(i, v, mark, dp);
}
}
int ans = *max_element(dp, dp + n + 1);
cout << ans + 1;
}
signed main() {
fast int t;
t = 1;
// cin>>t;
while (t--)
{
solve();
}
}
|
// naveen mall
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define vec vector
#define int long long int
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define trav(a, i) for (auto &i : a)
#define fl(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define rfl(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define invect(v, n) \
for (int i = 0; i < n; i++) { \
int arb; \
cin >> arb; \
v.pb(arb); \
}
#define inset(s, n) \
forloop(n) { \
int aset; \
cin >> aset; \
s.insert(aset); \
}
#define display(c) \
trav(c, i) cout << i << " "; \
cout << "\n";
#define F first
#define S second
#define pii pair<int, int>
#define PB pop_back
#define endl "\n"
#define copy(a, b) copy(all(a), back_inserter(b));
#define section(a, b, w) \
set_intersection(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define union(a, b, w) \
set_union(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define diff(a, b, w) \
set_difference(a.begin(), a.end(), b.begin(), b.end(), back_inserter(w));
#define symdiff(a, b, w) \
set_symmetric_difference(a.begin(), a.end(), b.begin(), b.end(), \
back_inserter(w));
void dfs(int n, vec<int> v[], bool mark[], int dp[]) {
mark[n] = true;
for (int i = 0; i < sz(v[n]); i++) {
if (mark[v[n][i]] == false)
dfs(v[n][i], v, mark, dp);
dp[n] = max(dp[n], 1 + dp[v[n][i]]);
}
}
void solve() {
int n, m;
cin >> n >> m;
vec<int> v[n + 1];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
// cout<<x<<" "<<y<<endl;
v[x].pb(y);
}
// for(int i=1;i<=n;i++)
// {
// for(int j=0;j<sz(v[i]);j++)
// cout<<v[i][j]<<" ";
// cout<<endl;
// }
int dp[n + 1];
memset(dp, 0, sizeof(dp));
bool mark[n + 1];
memset(mark, false, sizeof(mark));
for (int i = 1; i <= n; i++) {
if (mark[i] == false) {
dfs(i, v, mark, dp);
}
}
int ans = *max_element(dp, dp + n + 1);
cout << ans;
}
signed main() {
fast int t;
t = 1;
// cin>>t;
while (t--)
{
solve();
}
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 974,914 | 974,916 | u949654626 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int dfs(vector<vector<int>> &graph, int k, vector<int> &vis, int &res) {
if (!vis[k]) {
int x = 0;
for (int i = 0; i < graph[k].size(); ++i) {
x = max(x, dfs(graph, graph[k][i], vis, res));
}
vis[k] = x + 1;
res = max(res, vis[k]);
return vis[k];
}
return vis[k];
}
int main() {
vector<int> vis(100005, 0);
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> graph(n + 1);
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].push_back(y);
}
int res = -1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(graph, i, vis, res);
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dfs(vector<vector<int>> &graph, int k, vector<int> &vis, int &res) {
if (!vis[k]) {
int x = 0;
for (int i = 0; i < graph[k].size(); ++i) {
x = max(x, dfs(graph, graph[k][i], vis, res));
}
vis[k] = x + 1;
res = max(res, vis[k]);
return vis[k];
}
return vis[k];
}
int main() {
vector<int> vis(100005, 0);
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> graph(n + 1);
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].push_back(y);
}
int res = -1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(graph, i, vis, res);
}
cout << res - 1;
return 0;
} | [
"expression.operation.binary.add"
] | 974,917 | 974,918 | u427759487 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int dfs(vector<vector<int>> &graph, int k, vector<int> &vis, int &res) {
if (!vis[k]) {
int x = 0;
for (int i = 0; i < graph[k].size(); ++i) {
x = max(x, dfs(graph, graph[k][i], vis, res));
}
vis[k] = x + 1;
res = max(res, vis[k]);
return vis[k];
}
return vis[k];
}
int main() {
vector<int> vis(100005, 0);
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> graph(n + 1);
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].push_back(y);
}
int res = 0;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(graph, i, vis, res);
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dfs(vector<vector<int>> &graph, int k, vector<int> &vis, int &res) {
if (!vis[k]) {
int x = 0;
for (int i = 0; i < graph[k].size(); ++i) {
x = max(x, dfs(graph, graph[k][i], vis, res));
}
vis[k] = x + 1;
res = max(res, vis[k]);
return vis[k];
}
return vis[k];
}
int main() {
vector<int> vis(100005, 0);
int n, m, x, y;
cin >> n >> m;
vector<vector<int>> graph(n + 1);
for (int i = 0; i < m; i++) {
cin >> x >> y;
graph[x].push_back(y);
}
int res = -1;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(graph, i, vis, res);
}
cout << res - 1;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 974,919 | 974,918 | u427759487 | cpp |
p03166 | /***
** AUTHOR::ASHUTOSH MOUDGIL
***/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F first
#define S second
#define int long long
//#define ll long long
#define all(x) x.begin(), x.end()
#define rsort(x) \
sort(all(x)); \
reverse(all(x));
#define endl '\n'
#define vi vector<int>
#define vlli vector<long long>
#define pii pair<int, int>
#define mod 1000000007
#define LMAX 1e18
#define deb(x) cout << #x << " : " << x << endl;
#define PI 3.141592654
#define deb1(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl;
#define deb3(x, y, z) \
cout << #x << "=" << x << ", " << #y << "=" << y << ", " << #z << "=" << z \
<< endl;
#define deb4(x, y, z, a) \
cout << #x << "=" << x << ", " << #y << "=" << y << ", " << #z << "=" << z \
<< ", " << #a << "=" << a << endl;
#define debarr(x) \
cout << #x << endl; \
for (int i : x) { \
cout << i << " "; \
} \
cout << endl;
int n, m;
vector<vector<int>> edges;
vector<int> visited, dist, indeg;
void dfs(int x) {
visited[x] = 1;
for (int y : edges[x]) {
dist[y] = max(dist[y], dist[x] + 1);
indeg[y]--;
if (indeg[y] == 0)
dfs(y);
}
}
void mymain() {
cin >> n >> m;
edges.resize(n + 1, vi());
visited.resize(n + 1, 0);
dist.resize(n + 1, 0);
indeg.resize(n + 1, 0);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].pb(y);
indeg[y]++;
}
for (int i = 1; i <= n; i++)
edges[0].pb(i);
for (int i = 0; i <= n; i++) {
if (!visited[i] && indeg[i] == 0) {
dfs(i);
}
}
int ans = -1;
for (int i = 0; i <= n; i++)
ans = max(ans, dist[i]);
cout << ans << endl;
}
signed main() {
IOS;
/// freopen("input.txt", "r", stdin);
/// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
for (int tt = 0; tt < t; tt++) {
/// cout << "Case #" << tt+1 <<": ";
mymain();
}
return 0;
}
/*
*/
| /***
** AUTHOR::ASHUTOSH MOUDGIL
***/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F first
#define S second
#define int long long
//#define ll long long
#define all(x) x.begin(), x.end()
#define rsort(x) \
sort(all(x)); \
reverse(all(x));
#define endl '\n'
#define vi vector<int>
#define vlli vector<long long>
#define pii pair<int, int>
#define mod 1000000007
#define LMAX 1e18
#define deb(x) cout << #x << " : " << x << endl;
#define PI 3.141592654
#define deb1(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl;
#define deb3(x, y, z) \
cout << #x << "=" << x << ", " << #y << "=" << y << ", " << #z << "=" << z \
<< endl;
#define deb4(x, y, z, a) \
cout << #x << "=" << x << ", " << #y << "=" << y << ", " << #z << "=" << z \
<< ", " << #a << "=" << a << endl;
#define debarr(x) \
cout << #x << endl; \
for (int i : x) { \
cout << i << " "; \
} \
cout << endl;
int n, m;
vector<vector<int>> edges;
vector<int> visited, dist, indeg;
void dfs(int x) {
visited[x] = 1;
for (int y : edges[x]) {
dist[y] = max(dist[y], dist[x] + 1);
indeg[y]--;
if (indeg[y] == 0)
dfs(y);
}
}
void mymain() {
cin >> n >> m;
edges.resize(n + 1, vi());
visited.resize(n + 1, 0);
dist.resize(n + 1, 0);
indeg.resize(n + 1, 0);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
edges[x].pb(y);
indeg[y]++;
}
for (int i = 1; i <= n; i++)
edges[0].pb(i);
for (int i = 1; i <= n; i++) {
if (!visited[i] && indeg[i] == 0) {
dfs(i);
}
}
int ans = -1;
for (int i = 1; i <= n; i++)
ans = max(ans, dist[i]);
cout << ans << endl;
}
signed main() {
IOS;
/// freopen("input.txt", "r", stdin);
/// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
for (int tt = 0; tt < t; tt++) {
/// cout << "Case #" << tt+1 <<": ";
mymain();
}
return 0;
}
/*
*/
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 974,920 | 974,921 | u610676400 | cpp |
p03166 | #include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, m;
int ins[100006], length[100006];
int best;
vector<int> nbrs[100005];
queue<int> q;
inline int maks(int a, int b) { return a > b ? a : b; }
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d %d", &a, &b);
nbrs[a].push_back(b);
ins[b]++;
}
for (int i = 1; i < n; i++) {
if (!ins[i])
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
for (int w : nbrs[v]) {
length[w] = maks(length[w], length[v] + 1);
best = maks(best, length[w]);
ins[w]--;
if (!ins[w])
q.push(w);
}
}
printf("%d\n", best);
}
| #include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int n, m;
int ins[100006], length[100006];
int best;
vector<int> nbrs[100005];
queue<int> q;
inline int maks(int a, int b) { return a > b ? a : b; }
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d %d", &a, &b);
nbrs[a].push_back(b);
ins[b]++;
}
for (int i = 1; i <= n; i++) {
if (!ins[i])
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
for (int w : nbrs[v]) {
length[w] = maks(length[w], length[v] + 1);
best = maks(best, length[w]);
ins[w]--;
if (!ins[w])
q.push(w);
}
}
printf("%d\n", best);
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 974,934 | 974,935 | u427697910 | cpp |
p03166 | // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
using Int = int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
int n, m;
vector<int> graph[100010];
int dp[100010];
bool color[100010];
int add[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : graph[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ! llか? 统一类型 memset()!
//ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n >> m;
;
map<int, int> map1;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
graph[x].pb(y);
map1[y]++;
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int v = 0; v < 0; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
//-------------------------------
return 0;
}
//--------------------------------------------------------------------------- | // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
using Int = int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
int n, m;
vector<int> graph[100010];
int dp[100010];
bool color[100010];
int add[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : graph[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ! llか? 统一类型 memset()!
//ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n >> m;
;
map<int, int> map1;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
graph[x].pb(y);
map1[y]++;
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int v = 0; v < n; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
//-------------------------------
return 0;
}
//--------------------------------------------------------------------------- | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,936 | 974,937 | u220212997 | cpp |
p03166 | // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
using Int = int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
int n, m;
vector<int> graph[100010];
int dp[100010];
bool color[100010];
int add[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : graph[v]) {
chmax(res, rec(nv) + 1);
return dp[v] = res;
}
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ! llか? 统一类型 memset()!
//ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n >> m;
;
map<int, int> map1;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
graph[x].pb(y);
map1[y]++;
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int v = 0; v < 0; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
//-------------------------------
return 0;
}
//--------------------------------------------------------------------------- | // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
using Int = int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
int n, m;
vector<int> graph[100010];
int dp[100010];
bool color[100010];
int add[100010];
int rec(int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (auto nv : graph[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ! llか? 统一类型 memset()!
//ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n >> m;
;
map<int, int> map1;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
graph[x].pb(y);
map1[y]++;
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int v = 0; v < n; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
//-------------------------------
return 0;
}
//--------------------------------------------------------------------------- | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 974,938 | 974,937 | u220212997 | cpp |
p03166 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
vector<vector<int>> G;
vector<int> dp(100010, -1);
int memorize(int n) {
if (dp[n] != -1) {
return dp[n];
} else {
int res = 0;
for (auto x : G[n]) {
res = max(res, memorize(x) + 1);
}
return dp[n] = res;
}
}
int main(void) {
int N, M;
int x, y;
int i, j;
int ans = 0;
cin >> N >> M;
G.assign(N, vector<int>());
rep(i, 1, M) {
cin >> x >> y;
G[x].push_back(y);
}
rep(i, 1, N) { ans = max(ans, memorize(i)); }
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i <= g; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
vector<vector<int>> G;
vector<int> dp(100010, -1);
int memorize(int n) {
if (dp[n] != -1) {
return dp[n];
}
int res = 0;
for (auto x : G[n]) {
res = max(res, memorize(x) + 1);
}
return dp[n] = res;
}
int main(void) {
int N, M;
int x, y;
int i, j;
int ans = 0;
cin >> N >> M;
G.assign(N + 1, vector<int>());
rep(i, 1, M) {
cin >> x >> y;
G[x].push_back(y);
}
rep(i, 1, N) { ans = max(ans, memorize(i)); }
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 974,987 | 974,988 | u880221923 | cpp |
p03166 | #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#define ll long long
#define y1 y12313312312
#define endl '\n'
#define gcd __gcd
//#define int ll
using namespace std;
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, std::less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 40, T = 4 * N, inf = 1e9 + 7;
int n, m, f, r, l, e, w, o, z, test, id, mx;
vector<int> g[N];
int d[N];
void freop() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void boos() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void dfs(int v) {
for (int i = 0; i < g[v].ss; i++) {
int to = g[v][i];
if (d[to])
continue;
dfs(to);
d[v] = max(d[v], d[to] + 1);
}
mx = max(mx, d[v]);
}
main() {
int x, y;
// freop();
boos();
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
for (int i = 1; i <= n; i++) {
if (d[i])
continue;
dfs(i);
}
cout << mx;
}
| #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#define ll long long
#define y1 y12313312312
#define endl '\n'
#define gcd __gcd
//#define int ll
using namespace std;
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, std::less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 40, T = 4 * N, inf = 1e9 + 7;
int n, m, f, r, l, e, w, o, z, test, id, mx;
vector<int> g[N];
int d[N];
void freop() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void boos() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void dfs(int v) {
for (int i = 0; i < g[v].ss; i++) {
int to = g[v][i];
if (!d[to])
dfs(to);
d[v] = max(d[v], d[to] + 1);
}
mx = max(mx, d[v]);
}
main() {
int x, y;
// freop();
boos();
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
for (int i = 1; i <= n; i++) {
if (d[i])
continue;
dfs(i);
}
cout << mx;
}
| [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 974,993 | 974,994 | u242818056 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
vector<int> adj[N];
int n, m, vis[N], dis[N];
stack<int> stk;
void dfs(int u) {
vis[u] = 1;
for (auto it : adj[u]) {
if (!vis[it]) {
dfs(it);
}
}
stk.push(u);
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
memset(vis, 0, sizeof(vis));
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dis[i] = 0;
dfs(i);
while (!stk.empty()) {
int node = stk.top();
stk.pop();
for (auto it : adj[node]) {
dis[it] = max(dis[it], dis[node] + 1);
ans = max(ans, dis[it]);
}
}
}
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
vector<int> adj[N];
int n, m, vis[N], dis[N];
stack<int> stk;
void dfs(int u) {
vis[u] = 1;
for (auto it : adj[u]) {
if (!vis[it]) {
dfs(it);
}
}
stk.push(u);
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
memset(vis, 0, sizeof(vis));
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dis[i] = 0;
dfs(i);
}
}
while (!stk.empty()) {
int node = stk.top();
stk.pop();
for (auto it : adj[node]) {
dis[it] = max(dis[it], dis[node] + 1);
ans = max(ans, dis[it]);
}
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} | [] | 975,023 | 975,024 | u518166320 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
vector<int> g[1000005];
int dp[1000005];
int func(int u) {
if (dp[u] != -1) {
return dp[u];
} else {
int ans = 0;
for (auto i : g[u]) {
ans = max(ans, 1 + func(i));
}
dp[u] = ans;
return ans;
}
}
int main(void) {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
ans = max(ans, func(i));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> g[1000005];
int dp[1000005];
int func(int u) {
if (dp[u] != -1) {
return dp[u];
} else {
int ans = 0;
for (auto i : g[u]) {
ans = max(ans, 1 + func(i));
}
dp[u] = ans;
return ans;
}
}
int main(void) {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
int ans = 0;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++) {
ans = max(ans, func(i));
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,029 | 975,030 | u204368100 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
// bool vis[100007] ;
vector<int> adj[100007];
int dp[100007];
int dfs(int src) {
if (adj[src].size() == 0)
return 0;
if (dp[src] != -1)
return dp[src];
for (auto i : adj[src]) {
// if(!vis[i])
dp[i] = max(dp[i], 1 + dfs(i));
}
return dp[src];
}
int main() {
fast;
int n, m, x, y;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].emplace_back(y);
}
int res = INT_MIN;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
res = max(res, dfs(i));
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
vector<int> adj[100007];
int dp[100007];
int dfs(int src) {
if (adj[src].size() == 0)
return 0;
if (dp[src] != -1)
return dp[src];
for (auto i : adj[src])
dp[src] = max(dp[src], 1 + dfs(i));
return dp[src];
}
int main() {
fast;
int n, m, x, y;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].emplace_back(y);
}
int res = INT_MIN;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
res = max(res, dfs(i));
cout << res << endl;
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 975,042 | 975,043 | u144432905 | cpp |
p03166 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int nax = 1e5 + 5;
vector<int> edges[nax];
int in_degree[nax];
int dist[nax];
bool visited[nax];
void dfs(int a) {
visited[a] = true;
for (int b : edges[a]) {
dist[b] = max(dist[b], dist[a] + 1);
--in_degree[b];
if (in_degree[b] == 0) {
dfs(b);
}
}
}
void max_self(int &a, int b) { a = max(a, b); }
int main() {
int n, e;
scanf("%d%d", &n, &e);
for (int i = 0; i < n; ++i) {
int a, b;
scanf("%d%d", &a, &b);
edges[a].push_back(b);
++in_degree[b];
}
for (int i = 1; i <= n; ++i) {
if (!visited[i] && in_degree[i] == 0) {
dfs(i);
}
}
int answer = 0;
for (int i = 1; i <= n; ++i) {
max_self(answer, dist[i]);
}
printf("%d\n", answer);
} | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int nax = 1e5 + 5;
vector<int> edges[nax];
int in_degree[nax];
int dist[nax];
bool visited[nax];
void dfs(int a) {
visited[a] = true;
for (int b : edges[a]) {
dist[b] = max(dist[b], dist[a] + 1);
--in_degree[b];
if (in_degree[b] == 0) {
dfs(b);
}
}
}
void max_self(int &a, int b) { a = max(a, b); }
int main() {
int n, e;
scanf("%d%d", &n, &e);
for (int i = 0; i < e; ++i) {
int a, b;
scanf("%d%d", &a, &b);
edges[a].push_back(b);
++in_degree[b];
}
for (int i = 1; i <= n; ++i) {
if (!visited[i] && in_degree[i] == 0) {
dfs(i);
}
}
int answer = 0;
for (int i = 1; i <= n; ++i) {
max_self(answer, dist[i]);
}
printf("%d\n", answer);
} | [
"identifier.change"
] | 975,050 | 975,051 | u994133665 | cpp |
p03166 | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long long;
const int INF = 0x3f3f3f3f;
using namespace std;
const double PI = acos(-1);
const int N = 1e5 + 1;
int n, m, a, b, in[100001];
ll dis[100001];
vector<int> adj[100001];
void bfs(int src) {
queue<int> q;
q.push(src);
while (!q.empty()) {
int p = q.front();
q.pop();
for (int ch : adj[p]) {
in[ch]--;
if (dis[ch] < dis[p] + 1) {
dis[ch] = dis[p] + 1;
}
if (!in[ch]) {
q.push(ch);
}
}
}
}
int main() {
// freopen("lazy.in", "r", stdin);
IOS cin >> n >> m;
while (m-- > 0) {
cin >> a >> b;
a--;
b--;
adj[a].emplace_back(b);
in[b]++;
}
for (int i = 0; i < n; ++i) {
if (!in[i] || !dis[i]) {
bfs(i);
}
}
ll mx = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, dis[i]);
}
cout << mx << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long long;
const int INF = 0x3f3f3f3f;
using namespace std;
const double PI = acos(-1);
const int N = 1e5 + 1;
int n, m, a, b, in[100001];
ll dis[100001];
vector<int> adj[100001];
void bfs(int src) {
queue<int> q;
q.push(src);
while (!q.empty()) {
int p = q.front();
q.pop();
for (int ch : adj[p]) {
in[ch]--;
if (dis[ch] < dis[p] + 1) {
dis[ch] = dis[p] + 1;
}
if (!in[ch]) {
q.push(ch);
}
}
}
}
int main() {
// freopen("lazy.in", "r", stdin);
IOS cin >> n >> m;
while (m-- > 0) {
cin >> a >> b;
a--;
b--;
adj[a].emplace_back(b);
in[b]++;
}
for (int i = 0; i < n; ++i) {
if (!in[i] && !dis[i]) {
bfs(i);
}
}
ll mx = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, dis[i]);
}
cout << mx << endl;
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 975,054 | 975,055 | u398135166 | cpp |
p03166 | #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long long;
const int INF = 0x3f3f3f3f;
using namespace std;
const double PI = acos(-1);
const int N = 1e5 + 1;
int n, m, a, b, in[100001];
ll dis[100001];
vector<int> adj[100001];
void bfs(int src) {
queue<int> q;
q.push(src);
while (!q.empty()) {
int p = q.front();
q.pop();
for (int ch : adj[p]) {
in[ch]--;
if (dis[ch] < dis[p] + 1) {
dis[ch] = dis[p] + 1;
}
if (!in[ch]) {
q.push(ch);
}
}
}
}
int main() {
// freopen("lazy.in", "r", stdin);
IOS cin >> n >> m;
while (m--) {
cin >> a >> b;
a--;
b--;
adj[a].emplace_back(b);
in[b]++;
}
for (int i = 0; i < n; ++i) {
if (!in[i] || !dis[i]) {
bfs(i);
}
}
ll mx = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, dis[i]);
}
cout << mx << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using ll = long long;
const int INF = 0x3f3f3f3f;
using namespace std;
const double PI = acos(-1);
const int N = 1e5 + 1;
int n, m, a, b, in[100001];
ll dis[100001];
vector<int> adj[100001];
void bfs(int src) {
queue<int> q;
q.push(src);
while (!q.empty()) {
int p = q.front();
q.pop();
for (int ch : adj[p]) {
in[ch]--;
if (dis[ch] < dis[p] + 1) {
dis[ch] = dis[p] + 1;
}
if (!in[ch]) {
q.push(ch);
}
}
}
}
int main() {
// freopen("lazy.in", "r", stdin);
IOS cin >> n >> m;
while (m-- > 0) {
cin >> a >> b;
a--;
b--;
adj[a].emplace_back(b);
in[b]++;
}
for (int i = 0; i < n; ++i) {
if (!in[i] && !dis[i]) {
bfs(i);
}
}
ll mx = 0;
for (int i = 0; i < n; ++i) {
mx = max(mx, dis[i]);
}
cout << mx << endl;
return 0;
}
| [
"control_flow.loop.condition.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 975,056 | 975,055 | u398135166 | cpp |
p03166 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<int> visited, dp;
vector<vector<int>> edge2;
int bfs(int n) {
queue<int> que;
que.push(n);
int res = 0;
while (!que.empty()) {
int no;
no = que.front();
que.pop();
for (int nn : edge2[no]) {
visited[nn]--;
if (visited[nn] == 0) {
que.push(nn);
// cout<<nn<<endl;
dp[nn] = max(dp[nn], dp[no] + 1);
res = max(res, dp[nn]);
} else {
dp[nn] = max(dp[nn], dp[no + 1]);
}
}
}
return res;
}
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
edge2 = vector<vector<int>>(n + 1);
visited = vector<int>(n + 1, 1);
dp = vector<int>(n + 1, -1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
edge2[a].push_back(b);
visited[b]++;
}
edge2[0] = vector<int>(n);
for (int i = 0; i < n; i++) {
edge2[0][i] = i + 1;
}
cout << bfs(0) << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<int> visited, dp;
vector<vector<int>> edge2;
int bfs(int nod) {
queue<int> que;
que.push(nod);
int res = 0;
while (!que.empty()) {
int no;
no = que.front();
que.pop();
for (int nn : edge2[no]) {
visited[nn]--;
if (visited[nn] == 0) {
que.push(nn);
dp[nn] = max(dp[nn], dp[no] + 1);
res = max(res, dp[nn]);
} else {
dp[nn] = max(dp[nn], dp[no] + 1);
}
}
}
return res;
}
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
edge2 = vector<vector<int>>(n + 1);
visited = vector<int>(n + 1, 1);
dp = vector<int>(n + 1, -1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
edge2[a].push_back(b);
visited[b]++;
}
edge2[0] = vector<int>(n);
for (int i = 0; i < n; i++) {
edge2[0][i] = i + 1;
}
cout << bfs(0) << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 975,061 | 975,062 | u834415466 | cpp |
p03166 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define nl '\n'
#define fillar(x) \
for (int i = 0; i < x; i++) \
cin >> ar[i]
#define qquery \
int query; \
cin >> query; \
while (query--)
#define benfero \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
vector<int> adj[100005];
int dp[100005];
int dfs(int node) {
if (adj[node].size() == 0)
return 0;
if (dp[node] != -1)
return dp[node];
int t = 0;
for (int j = 0; j < adj[node].size(); j++) {
t = max(t, dfs(adj[node][j]));
}
return dp[node] = t + 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// benfero
int n, m, i;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
int ans = 0;
for (i = 0; i < n; i++) {
dfs(i);
}
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define ii pair<int, int>
#define nl '\n'
#define fillar(x) \
for (int i = 0; i < x; i++) \
cin >> ar[i]
#define qquery \
int query; \
cin >> query; \
while (query--)
#define benfero \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
vector<int> adj[100005];
int dp[100005];
int dfs(int node) {
if (adj[node].size() == 0)
return 0;
if (dp[node] != -1)
return dp[node];
int t = 0;
for (int j = 0; j < adj[node].size(); j++) {
t = max(t, dfs(adj[node][j]));
}
return dp[node] = t + 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// benfero
int n, m, i;
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
int ans = 0;
for (i = 1; i <= n; i++) {
dfs(i);
}
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 975,063 | 975,064 | u058612320 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
bool vis[100002];
int dp[100003];
map<int, vector<int>> mapy;
void dfs(int i) {
vis[i] = true;
for (auto node : mapy[i]) {
if (!vis[node])
dfs(node);
dp[i] = max(dp[i], dp[node] + 1);
}
}
int main() {
for (int i = 0; i <= 100000; i++)
vis[i] = false;
for (int i = 0; i <= 100000; i++)
dp[i] = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mapy[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false)
dfs(i);
}
int miny = 0;
for (int i = 1; i <= n; i++) {
miny = max(miny, dp[i]);
}
cout << miny + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
bool vis[100002];
int dp[100003];
map<int, vector<int>> mapy;
void dfs(int i) {
vis[i] = true;
for (auto node : mapy[i]) {
if (!vis[node])
dfs(node);
dp[i] = max(dp[i], dp[node] + 1);
}
}
int main() {
for (int i = 0; i <= 100000; i++)
vis[i] = false;
for (int i = 0; i <= 100000; i++)
dp[i] = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mapy[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false)
dfs(i);
}
int miny = 0;
for (int i = 1; i <= n; i++) {
miny = max(miny, dp[i]);
}
cout << miny << endl;
}
| [
"expression.operation.binary.remove"
] | 975,077 | 975,078 | u079477806 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
bool vis[100002];
int dp[100003];
map<int, vector<int>> mapy;
void dfs(int i) {
vis[i] = true;
for (auto node : mapy[i]) {
if (!vis[i])
dfs(node);
dp[i] = max(dp[i], dp[node] + 1);
}
}
int main() {
for (int i = 0; i <= 100000; i++)
vis[i] = false;
for (int i = 0; i <= 100000; i++)
dp[i] = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mapy[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false)
dfs(i);
}
int miny = 0;
for (int i = 1; i <= n; i++) {
miny = max(miny, dp[i]);
}
cout << miny + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
bool vis[100002];
int dp[100003];
map<int, vector<int>> mapy;
void dfs(int i) {
vis[i] = true;
for (auto node : mapy[i]) {
if (!vis[node])
dfs(node);
dp[i] = max(dp[i], dp[node] + 1);
}
}
int main() {
for (int i = 0; i <= 100000; i++)
vis[i] = false;
for (int i = 0; i <= 100000; i++)
dp[i] = 0;
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mapy[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false)
dfs(i);
}
int miny = 0;
for (int i = 1; i <= n; i++) {
miny = max(miny, dp[i]);
}
cout << miny << endl;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 975,079 | 975,078 | u079477806 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> dp(N), n[N];
int lp(int i) {
if (!dp[i])
return dp[i];
for (auto p : n[i])
dp[i] = max(dp[i], lp(p) + 1);
return dp[i];
}
int main() {
int N, M, x, y;
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> x >> y, n[x].push_back(y);
int rez = 0;
for (int i = 1; i <= N; i++)
rez = max(rez, lp(i));
cout << rez;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> dp(N), n[N];
int lp(int i) {
if (dp[i])
return dp[i];
for (auto p : n[i])
dp[i] = max(dp[i], lp(p) + 1);
return dp[i];
}
int main() {
int N, M, x, y;
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> x >> y, n[x].push_back(y);
int rez = 0;
for (int i = 1; i <= N; i++)
rez = max(rez, lp(i));
cout << rez;
return 0;
} | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 975,093 | 975,094 | u013064880 | cpp |
p03166 | // #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
int mx, n, m, x, y;
vector<int> v[100100];
int dp[100100];
int viz[100100];
void dfs(int x) {
viz[x] = 1;
int cur = -1;
for (auto y : v[x]) {
if (!viz[y])
dfs(y);
cur = max(cur, dp[y]);
}
mx = max(mx, cur + 1);
dp[x] = cur + 1;
}
int main() {
// ifstream cin("tst.in");
// ofstream cout("tst.out");
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
v[x].push_back(y);
}
for (int i = 1; i <= n; i++)
if (!viz[i])
dfs(i);
cout << mx;
return 0;
} | // #pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
int mx, n, m, x, y;
vector<int> v[100100];
int dp[100100];
int viz[100100];
void dfs(int x) {
viz[x] = 1;
int cur = -1;
for (auto y : v[x]) {
if (!viz[y])
dfs(y);
cur = max(cur, dp[y]);
}
mx = max(mx, cur + 1);
dp[x] = cur + 1;
}
int main() {
// ifstream cin("tst.in");
// ofstream cout("tst.out");
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
v[x].push_back(y);
}
for (int i = 1; i <= n; i++)
if (!viz[i])
dfs(i);
cout << mx;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,103 | 975,104 | u093252820 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[100010];
vector<int> adj[100010];
int rec(int x) {
if (dp[x] >= 0)
return dp[x];
if (adj[x].empty())
return dp[x] = 0;
dp[x] = dp[adj[x][0]] + 1;
for (int i = 0; i < adj[x].size(); i++) {
dp[x] = max(dp[adj[x][i]] + 1, dp[x]);
}
return dp[x];
}
int a, b;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, rec(i));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[100010];
vector<int> adj[100010];
int rec(int x) {
if (dp[x] >= 0)
return dp[x];
if (adj[x].empty())
return dp[x] = 0;
dp[x] = dp[adj[x][0]] + 1;
for (int i = 0; i < adj[x].size(); i++) {
dp[x] = max(rec(adj[x][i]) + 1, dp[x]);
}
return dp[x];
}
int a, b;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, rec(i));
cout << ans << endl;
return 0;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 975,107 | 975,108 | u313427116 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[100010];
vector<int> adj[100010];
int rec(int x) {
if (dp[x] >= 0)
return dp[x];
if (adj[x].empty())
return dp[x] = 0;
dp[x] = dp[adj[x][0]] + 1;
for (int i = 0; i < adj[x].size(); i++) {
dp[x] = max(adj[x][i] + 1, dp[x]);
}
return dp[x];
}
int a, b;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, rec(i));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[100010];
vector<int> adj[100010];
int rec(int x) {
if (dp[x] >= 0)
return dp[x];
if (adj[x].empty())
return dp[x] = 0;
dp[x] = dp[adj[x][0]] + 1;
for (int i = 0; i < adj[x].size(); i++) {
dp[x] = max(rec(adj[x][i]) + 1, dp[x]);
}
return dp[x];
}
int a, b;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
memset(dp, -1, sizeof(dp));
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, rec(i));
cout << ans << endl;
return 0;
}
| [
"call.arguments.add",
"call.arguments.change"
] | 975,109 | 975,108 | u313427116 | cpp |
p03166 | #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)とキャストしよう
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;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % 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; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int n, m;
vector<int> adj[100005];
vector<int> memo(100005, -1);
int rec(int i, int pre) {
if (memo[i] != -1)
return memo[i];
int res = 1;
for (auto nxt : adj[i]) {
if (nxt == pre)
continue;
chmax(res, rec(nxt, i) + 1);
}
return memo[i] = res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
adj[x].push_back(y);
}
int ans = 0;
rep(i, n) chmax(ans, rec(i, -1));
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)とキャストしよう
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;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % 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; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int n, m;
vector<int> adj[100005];
vector<int> memo(100005, -1);
int rec(int i, int pre) {
if (memo[i] != -1)
return memo[i];
int res = 0;
for (auto nxt : adj[i]) {
if (nxt == pre)
continue;
chmax(res, rec(nxt, i) + 1);
}
return memo[i] = res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
adj[x].push_back(y);
}
int ans = 0;
rep(i, n) chmax(ans, rec(i, -1));
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 975,119 | 975,120 | u052332717 | cpp |
p03166 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vi posx[10010];
vi posy[10010];
int memo[10010];
int dfs(int pos) {
int maxlength = 0;
if (memo[pos] == -1) {
rep(i, sz(posy[pos])) { maxlength = max(maxlength, 1 + dfs(posy[pos][i])); }
memo[pos] = maxlength;
} else {
maxlength = max(maxlength, memo[pos]);
}
return maxlength;
}
int main() {
rep(i, 10010) { memo[i] = -1; }
int N, M;
cin >> N >> M;
rep(i, M) {
int x, y;
cin >> x >> y;
P p = make_pair(x, y);
posx[x].pb(y);
posy[y].pb(x);
}
int ans = 0;
srep(i, 2, N + 1) {
if (sz(posx[i]) == 0) {
rep2(j, sz(posy[i])) { ans = max(ans, 1 + dfs(posy[i][j])); }
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vi posx[100010];
vi posy[100010];
int memo[100010];
int dfs(int pos) {
int maxlength = 0;
if (memo[pos] == -1) {
rep(i, sz(posy[pos])) { maxlength = max(maxlength, 1 + dfs(posy[pos][i])); }
memo[pos] = maxlength;
} else {
maxlength = max(maxlength, memo[pos]);
}
return maxlength;
}
int main() {
rep(i, 100010) { memo[i] = -1; }
int N, M;
cin >> N >> M;
rep(i, M) {
int x, y;
cin >> x >> y;
P p = make_pair(x, y);
posx[x].pb(y);
posy[y].pb(x);
}
int ans = 0;
srep(i, 1, N + 1) {
if (sz(posx[i]) == 0) {
rep2(j, sz(posy[i])) { ans = max(ans, 1 + dfs(posy[i][j])); }
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 975,125 | 975,126 | u340293807 | cpp |
p03166 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vi posx[10010];
vi posy[10010];
int memo[10010];
int dfs(int pos) {
int maxlength = 0;
if (memo[pos] != -1) {
rep(i, sz(posy[pos])) { maxlength = max(maxlength, 1 + dfs(posy[pos][i])); }
memo[pos] = maxlength;
} else {
maxlength = max(maxlength, memo[pos]);
}
return maxlength;
}
int main() {
rep(i, 10010) { memo[i] = -1; }
int N, M;
cin >> N >> M;
rep(i, M) {
int x, y;
cin >> x >> y;
P p = make_pair(x, y);
posx[x].pb(y);
posy[y].pb(x);
}
int ans = 0;
srep(i, 2, N + 1) {
if (sz(posx[i]) == 0) {
rep2(j, sz(posy[i])) { ans = max(ans, 1 + dfs(posy[i][j])); }
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
vi posx[100010];
vi posy[100010];
int memo[100010];
int dfs(int pos) {
int maxlength = 0;
if (memo[pos] == -1) {
rep(i, sz(posy[pos])) { maxlength = max(maxlength, 1 + dfs(posy[pos][i])); }
memo[pos] = maxlength;
} else {
maxlength = max(maxlength, memo[pos]);
}
return maxlength;
}
int main() {
rep(i, 100010) { memo[i] = -1; }
int N, M;
cin >> N >> M;
rep(i, M) {
int x, y;
cin >> x >> y;
P p = make_pair(x, y);
posx[x].pb(y);
posy[y].pb(x);
}
int ans = 0;
srep(i, 1, N + 1) {
if (sz(posx[i]) == 0) {
rep2(j, sz(posy[i])) { ans = max(ans, 1 + dfs(posy[i][j])); }
}
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 975,127 | 975,126 | u340293807 | cpp |
p03166 | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
void dfs(int node, vector<int> &dp, vector<bool> &vis,
unordered_map<int, vector<int>> &m) {
vis[node] = true;
for (auto i : m[node]) {
if (!vis[i])
dfs(i, dp, vis, m);
dp[node] = max(dp[node], 1 + dp[i]);
}
}
void addedge(unordered_map<int, vector<int>> &m, int u, int v) {
m[u].push_back(v);
}
int main() {
int n, m, i, j;
cin >> n >> m;
unordered_map<int, vector<int>> adj;
for (i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
addedge(adj, u, v);
}
vector<bool> vis(n + 1, false);
vector<int> dp(n + 1, 0);
for (i = 0; i < n; i++) {
if (!vis[i])
dfs(i, dp, vis, adj);
}
int mx = 0;
for (i = 1; i <= n; i++)
mx = max(mx, dp[i]);
cout << mx << endl;
return 0;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <vector>
using namespace std;
void dfs(int node, vector<int> &dp, vector<bool> &vis,
unordered_map<int, vector<int>> &m) {
vis[node] = true;
for (auto i : m[node]) {
if (!vis[i])
dfs(i, dp, vis, m);
dp[node] = max(dp[node], 1 + dp[i]);
}
}
void addedge(unordered_map<int, vector<int>> &m, int u, int v) {
m[u].push_back(v);
}
int main() {
int n, m, i, j;
cin >> n >> m;
unordered_map<int, vector<int>> adj;
for (i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
addedge(adj, u, v);
}
vector<bool> vis(n + 1, false);
vector<int> dp(n + 1, 0);
for (i = 1; i <= n; i++) {
if (!vis[i])
dfs(i, dp, vis, adj);
}
int mx = 0;
for (i = 1; i <= n; i++)
mx = max(mx, dp[i]);
cout << mx << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,161 | 975,162 | u953182071 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100005];
vei child[100005];
void bfs(int from) {
if (dp[from] != 0)
return;
int maxi = 0;
rep(i, child[from].size()) {
int to = child[from][i];
bfs(to);
maxi = max(maxi, dp[to]);
}
dp[from] = maxi + 1;
return;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
child[x].push_back(y);
}
int res = 0;
rep(i, n) {
bfs(i);
res = max(res, dp[i]);
}
cout << res - 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#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 rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100005];
vei child[100005];
void bfs(int from) {
if (dp[from] != 0)
return;
int maxi = 0;
rep(i, child[from].size()) {
int to = child[from][i];
bfs(to);
maxi = max(maxi, dp[to]);
}
dp[from] = maxi + 1;
return;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
child[x].pub(y);
}
int res = 0;
rep(i, n + 1) {
bfs(i);
res = max(res, dp[i]);
}
cout << res - 1 << endl;
return 0;
} | [
"call.function.change"
] | 975,163 | 975,164 | u263715385 | cpp |
p03166 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
||||||| | | ||||||| ||| ||| |||||
| | | | | | | | | | |
| | ||| | | | || |||| | |
||||||||||||||||||||||||||||||||||||||||||||||||
*/
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(), v.end()
#define int long long
#define ll long long
#define M 1000000007
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) m *(n / GCD(m, n))
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll int, string>
#define rep(a, b) for (ll i = a; i < b; i++)
#define rep0(n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define FORE(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof(a))
#define FOR repi
#define pii pair<int, int>
#define REVERSE(v) reverse(ALL(v))
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
//#define float long double
ll max(ll a, ll b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
vi dp(100001, 0), vis(100001, 0);
vector<vi> adj(100001);
void dfs(int v) {
dp[v] = 1;
vis[v] = 1;
for (auto i : adj[v]) {
dp[v] = max(dp[v], 1 + dp[i]);
if (vis[i])
continue;
dfs(i);
dp[v] = max(dp[v], 1 + dp[i]);
}
}
int solve() {
inputoutput int n, m;
cin >> n >> m;
rep0(m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(1, n + 1) {
if (vis[i])
continue;
dfs(i);
}
// rep(1,n+1) cout<<dp[i]<<" ";
cout << *max_element(all(dp)) - 1;
r0
}
signed main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
||||||| | | ||||||| ||| ||| |||||
| | | | | | | | | | |
| | ||| | | | || |||| | |
||||||||||||||||||||||||||||||||||||||||||||||||
*/
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(), v.end()
#define int long long
#define ll long long
#define M 1000000007
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) m *(n / GCD(m, n))
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll int, string>
#define rep(a, b) for (ll i = a; i < b; i++)
#define rep0(n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define FORE(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof(a))
#define FOR repi
#define pii pair<int, int>
#define REVERSE(v) reverse(ALL(v))
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
//#define float long double
ll max(ll a, ll b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
vi dp(100001, 0), vis(100001, 0);
vector<vi> adj(100001);
void dfs(int v) {
dp[v] = 1;
vis[v] = 1;
for (auto i : adj[v]) {
dp[v] = max(dp[v], 1 + dp[i]);
if (vis[i])
continue;
dfs(i);
dp[v] = max(dp[v], 1 + dp[i]);
}
}
int solve() { // inputoutput
int n, m;
cin >> n >> m;
rep0(m) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
}
rep(1, n + 1) {
if (vis[i])
continue;
dfs(i);
}
// rep(1,n+1) cout<<dp[i]<<" ";
cout << *max_element(all(dp)) - 1;
r0
}
signed main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} | [] | 975,165 | 975,166 | u980932400 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
void dfs(long long int x, vector<long long int> adj[], long long int dp[],
bool vis[]) {
vis[x] = true;
for (long long int i = 0; i < adj[x].size(); i++) {
if (!vis[adj[x][i]])
dfs(adj[x][i], adj, dp, vis);
dp[x] = max(dp[x], 1 + dp[adj[x][i]]);
}
}
int main() {
long long int n, m;
scanf("%lld %lld", &n, &m);
vector<long long int> adj[n + 1];
for (long long int i = 0; i < n; i++) {
long long int x, y;
scanf("%lld %lld", &x, &y);
adj[x].push_back(y);
}
long long int dp[n + 1];
memset(dp, 0, sizeof dp);
bool vis[n + 1];
memset(vis, false, sizeof vis);
for (long long int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i, adj, dp, vis);
}
long long int sum = 0;
for (long long int i = 1; i <= n; i++) {
sum = max(sum, dp[i]);
}
printf("%lld\n", sum);
}
| #include <bits/stdc++.h>
using namespace std;
void dfs(long long int x, vector<long long int> adj[], long long int dp[],
bool vis[]) {
vis[x] = true;
for (long long int i = 0; i < adj[x].size(); i++) {
if (!vis[adj[x][i]])
dfs(adj[x][i], adj, dp, vis);
dp[x] = max(dp[x], 1 + dp[adj[x][i]]);
}
}
int main() {
long long int n, m;
scanf("%lld %lld", &n, &m);
vector<long long int> adj[n + 1];
for (long long int i = 0; i < m; i++) {
long long int x, y;
scanf("%lld %lld", &x, &y);
adj[x].push_back(y);
}
long long int dp[n + 1];
memset(dp, 0, sizeof dp);
bool vis[n + 1];
memset(vis, false, sizeof vis);
for (long long int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i, adj, dp, vis);
}
long long int sum = 0;
for (long long int i = 1; i <= n; i++) {
sum = max(sum, dp[i]);
}
printf("%lld\n", sum);
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,167 | 975,168 | u016317669 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define mem(x) memset(x, 0, sizeof(x));
#define what_is(x) cerr << #x << " is " << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int N = 1e5 + 5;
vi ad[N];
bool vis[N];
int dp[N];
stack<int> st;
void topo(int x) {
vis[x] = true;
for (auto y : ad[x]) {
if (vis[y] == false)
topo(y);
}
st.push(x);
}
int dfs(int x) {
if (vis[x] == true)
return dp[x];
vis[x] = true;
int val = 0;
for (auto y : ad[x]) {
val = max(val, dfs(y) + 1);
}
dp[x] = val;
return val;
}
void solve() {
int n, m;
cin >> n >> m;
int u, v;
rep(i, 0, n) {
cin >> u >> v;
ad[u].pb(v);
}
rep(i, 1, n + 1) {
if (vis[i] == false)
topo(i);
}
mem(vis);
while (st.empty() == false) {
u = st.top();
st.pop();
if (vis[u])
continue;
dfs(u);
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1, i = 1;
// cin>>t;
while (t--) {
// cout<<"Case #"<<i++<<": ";
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define mem(x) memset(x, 0, sizeof(x));
#define what_is(x) cerr << #x << " is " << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int N = 1e5 + 5;
vi ad[N];
bool vis[N];
int dp[N];
stack<int> st;
void topo(int x) {
vis[x] = true;
for (auto y : ad[x]) {
if (vis[y] == false)
topo(y);
}
st.push(x);
}
int dfs(int x) {
if (vis[x] == true)
return dp[x];
vis[x] = true;
int val = 0;
for (auto y : ad[x]) {
val = max(val, dfs(y) + 1);
}
dp[x] = val;
return val;
}
void solve() {
int n, m;
cin >> n >> m;
int u, v;
rep(i, 0, m) {
cin >> u >> v;
ad[u].pb(v);
}
rep(i, 1, n + 1) {
if (vis[i] == false)
topo(i);
}
mem(vis);
while (st.empty() == false) {
u = st.top();
st.pop();
if (vis[u])
continue;
dfs(u);
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
ans = max(ans, dp[i]);
}
cout << ans;
}
int main() {
// #ifndef ONLINE_JUDGE
// // for getting input from input.txt
// freopen("input.txt", "r", stdin);
// // for writing output to output.txt
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1, i = 1;
// cin>>t;
while (t--) {
// cout<<"Case #"<<i++<<": ";
solve();
}
return 0;
} | [
"identifier.change",
"call.arguments.change"
] | 975,171 | 975,172 | u026594048 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 998244353
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
#define REP(i, s, e) for (ll i = s; i < e; i++)
#define RREP(i, s, e) for (ll i = s; i > e; i--)
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define print(v) \
for (auto i : v) \
cout << i << " ";
vi dp;
ll solve(vvi &ed, ll s) {
if (dp[s] != -1)
return dp[s];
REP(i, 0, ed[s].size())
dp[s] = max(dp[s], solve(ed, ed[s][i]) + 1);
return dp[s];
}
int main() {
fast;
ll n, m, u, v;
cin >> n >> m;
vvi ed(n + 1);
vi src(n + 1, 1);
dp.resize(n + 1, -1);
REP(i, 0, m) {
cin >> u >> v;
ed[u].pb(v);
src[v] = 0;
}
ll s, ss;
ll ans = 0;
REP(i, 1, n + 1) {
if (ed[i].empty())
dp[i] = 0;
}
REP(i, 1, n + 1)
if (src[i])
ans = max(ans, solve(ed, i));
cout << solve(ed, s) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define M 998244353
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
#define REP(i, s, e) for (ll i = s; i < e; i++)
#define RREP(i, s, e) for (ll i = s; i > e; i--)
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define print(v) \
for (auto i : v) \
cout << i << " ";
vi dp;
ll solve(vvi &ed, ll s) {
if (dp[s] != -1)
return dp[s];
REP(i, 0, ed[s].size())
dp[s] = max(dp[s], solve(ed, ed[s][i]) + 1);
return dp[s];
}
int main() {
fast;
ll n, m, u, v;
cin >> n >> m;
vvi ed(n + 1);
vi src(n + 1, 1);
dp.resize(n + 1, -1);
REP(i, 0, m) {
cin >> u >> v;
ed[u].pb(v);
src[v] = 0;
}
ll s, ss;
ll ans = 0;
REP(i, 1, n + 1) {
if (ed[i].empty())
dp[i] = 0;
}
REP(i, 1, n + 1)
if (src[i])
ans = max(ans, solve(ed, i));
cout << ans << endl;
return 0;
}
| [
"io.output.change",
"call.arguments.change"
] | 975,180 | 975,181 | u760200622 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
const int M = 1e9 + 7;
using namespace std;
int N = 1000000 + 1;
void dfs(vector<int> *g, int st, bool *visited, vector<int> *ts) {
visited[st] = true;
for (int i = 0; i < g[st].size(); i++) {
if (visited[g[st][i]] == false) {
dfs(g, g[st][i], visited, ts);
}
}
ts->pb(st);
}
int logestPath(vector<int> *g, vector<int> *ts, int n, int m) {
int *dp = new int[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
int tss = ts->size();
dp[ts->at(tss - 1)] = 0;
// for(int i=0;i<tss;i++)
// {
// cout<<ts->at(i)<<" ";
// }
// cout<<endl;
for (int i = tss - 1; i >= 0; i--) {
int curVertex = ts->at(i);
// cout<<curVertex<<" ";
for (int j = 0; j < g[curVertex].size(); j++) {
dp[curVertex] = max(dp[curVertex], 1 + dp[g[curVertex][j]]);
}
// cout<<curVertex<<" "<<dp[curVertex]<<" ";
}
// cout<<endl;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[ts->at(i)]);
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> *g = new vector<int>[n + 1];
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
bool *visited = new bool[n + 1]();
// memset(visited,0,n+1);
vector<int> *ts = new vector<int>();
int ans = 0;
// cout<<"BREAKING POINT-1"<<endl;
for (int i = 1; i <= n; i++) {
if (visited[i] == false) {
// ts=new vector<int>();
dfs(g, i, visited, ts);
}
}
reverse(ts->begin(), ts->end());
ans = max(ans, logestPath(g, ts, n, m));
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
const int M = 1e9 + 7;
using namespace std;
int N = 1000000 + 1;
void dfs(vector<int> *g, int st, bool *visited, vector<int> *ts) {
visited[st] = true;
for (int i = 0; i < g[st].size(); i++) {
if (visited[g[st][i]] == false) {
dfs(g, g[st][i], visited, ts);
}
}
ts->pb(st);
}
int logestPath(vector<int> *g, vector<int> *ts, int n, int m) {
int *dp = new int[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
int tss = ts->size();
dp[ts->at(tss - 1)] = 0;
// for(int i=0;i<tss;i++)
// {
// cout<<ts->at(i)<<" ";
// }
// cout<<endl;
for (int i = tss - 1; i >= 0; i--) {
int curVertex = ts->at(i);
// cout<<curVertex<<" ";
for (int j = 0; j < g[curVertex].size(); j++) {
dp[curVertex] = max(dp[curVertex], 1 + dp[g[curVertex][j]]);
}
// cout<<curVertex<<" "<<dp[curVertex]<<" ";
}
// cout<<endl;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> *g = new vector<int>[n + 1];
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
bool *visited = new bool[n + 1]();
// memset(visited,0,n+1);
vector<int> *ts = new vector<int>();
int ans = 0;
// cout<<"BREAKING POINT-1"<<endl;
for (int i = 1; i <= n; i++) {
if (visited[i] == false) {
// ts=new vector<int>();
dfs(g, i, visited, ts);
}
}
reverse(ts->begin(), ts->end());
ans = max(ans, logestPath(g, ts, n, m));
cout << ans << endl;
return 0;
}
| [
"call.remove",
"call.arguments.change"
] | 975,182 | 975,183 | u912430437 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector<pair<long long int, long long int>>
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define what_is(x) cerr << #x << " =" << x << " ";
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define LINT_MAX 9223372036854775807
#define LINT_MIN -9223372036854775808
#define EPS 1e-9
#define MOD 1000000007
#define DEBUG 0
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
if (DEBUG == 0)
return;
cerr << *it << " = " << a << " ";
err(++it, args...);
}
int dp[100000];
int B[100000];
vector<int> A[100000];
int fun(int x) {
if (A[x].size() == 0)
return 0;
if (dp[x] != 0)
return dp[x];
int temp = 0;
forn(i, A[x].size()) temp = max(temp, fun(A[x][i]));
dp[x] = temp + 1;
return dp[x];
}
int main() {
// freopen("test.txt", "r", stdin);
int n, m;
cin >> n >> m;
forn(i, m) {
int x, y;
cin >> x >> y;
A[x].push_back(y);
}
int ans = 0;
forn(i, n) { ans = max(ans, fun(i)); }
cout << ans << endl;
/* cout<<"ssa"<<endl;
queue<int> q;
forn(i,n){
if(B[i]==0)q.push(i);
dp[i]=0;
}
while(!q.empty()){
int x=q.front();
q.pop();
cout<<x<<" ";
forn(i,A[x].size()){
dp[A[x][i]]=max(dp[A[x][i]],dp[x]+1);
q.push(A[x][i]);
}
}
int ans=0;
forn(i,n)ans=max(ans,dp[i]);
cout<<ans<<endl;*/
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, sta, end, inc) for (int i = sta; i <= end; i += inc)
#define itr(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(a, b, c) assert(b <= a && a <= c)
#define pb push_back
#define ll long long int
#define fi first
#define se second
#define ii pair<long long int, long long int>
#define vi vector<long long int>
#define vii vector<pair<long long int, long long int>>
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define what_is(x) cerr << #x << " =" << x << " ";
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define LINT_MAX 9223372036854775807
#define LINT_MIN -9223372036854775808
#define EPS 1e-9
#define MOD 1000000007
#define DEBUG 0
template <typename T, typename U> inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> inline void amax(T &x, U y) {
if (x < y)
x = y;
}
void err(istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
if (DEBUG == 0)
return;
cerr << *it << " = " << a << " ";
err(++it, args...);
}
int dp[100000];
int B[100000];
vector<int> A[100000];
int fun(int x) {
// cout<<x<<" ";
if (A[x].size() == 0)
return 0;
if (dp[x] != 0)
return dp[x];
int temp = 0;
forn(i, A[x].size()) temp = max(temp, fun(A[x][i]) + 1);
dp[x] = temp;
return dp[x];
}
int main() {
// freopen("test.txt", "r", stdin);
int n, m;
cin >> n >> m;
forn(i, m) {
int x, y;
cin >> x >> y;
A[x].push_back(y);
}
int ans = 0;
forn1(i, n) { ans = max(ans, fun(i)); }
cout << ans << endl;
/* cout<<"ssa"<<endl;
queue<int> q;
forn(i,n){
if(B[i]==0)q.push(i);
dp[i]=0;
}
while(!q.empty()){
int x=q.front();
q.pop();
cout<<x<<" ";
forn(i,A[x].size()){
dp[A[x][i]]=max(dp[A[x][i]],dp[x]+1);
q.push(A[x][i]);
}
}
int ans=0;
forn(i,n)ans=max(ans,dp[i]);
cout<<ans<<endl;*/
return 0;
}
| [
"assignment.change",
"expression.operation.binary.remove",
"identifier.change"
] | 975,186 | 975,187 | u858856811 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
const int MAX_N = 100000;
vector<vi> pre(MAX_N + 1);
vi dist(MAX_N + 1);
vector<bool> visited(MAX_N + 1);
void dfs(int v) {
visited[v] = true;
for (int vp : pre[v]) {
if (!visited[vp])
dfs(vp);
dist[v] = max(dist[v], dist[vp] + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
pre[v].push_back(u);
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (!visited[i]) {
dfs(v);
ans = max(ans, dist[v]);
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
const int MAX_N = 100000;
vector<vi> pre(MAX_N + 1);
vi dist(MAX_N + 1);
vector<bool> visited(MAX_N + 1);
void dfs(int v) {
visited[v] = true;
for (int vp : pre[v]) {
if (!visited[vp])
dfs(vp);
dist[v] = max(dist[v], dist[vp] + 1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
pre[v].push_back(u);
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
if (!visited[i]) {
dfs(i);
ans = max(ans, dist[i]);
}
}
cout << ans << '\n';
return 0;
} | [
"identifier.change",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 975,202 | 975,203 | u426076937 | cpp |
p03166 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// Self settings
// clang-format off
#define MAX_N 100000
#define MAX_M 100000
#define REP(i, N) for (int i = 0; i < (int)(N); ++i)
// clang-format on
int N, M;
int dp[MAX_N + 1];
vector<int> G[MAX_N + 1];
int f(int x) {
if (dp[x] > 0)
return dp[x];
int fans = 0;
for (int i = 0; i < G[x].size(); i++)
fans = max(fans, f(G[x][i]));
return dp[x] = fans;
}
void solve() {
int ans = 0;
for (int i = 0; i < N + 1; i++)
ans = max(ans, f(i));
cout << ans << endl;
}
int main(void) {
scanf("%d%d", &N, &M);
int x, y;
REP(i, M) {
scanf("%d%d", &x, &y);
x--, y--;
G[x].push_back(y);
// 入次 0 のものがかならず最長パスに含まれている
// (最長パスの途中からのパスは絶対に最長パスではない)
// ループもないから入次が0の点がかならず存在する
}
solve();
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// Self settings
// clang-format off
#define MAX_N 100000
#define MAX_M 100000
#define REP(i, N) for (int i = 0; i < (int)(N); ++i)
// clang-format on
int N, M;
int dp[MAX_N + 1];
vector<int> G[MAX_N + 1];
int f(int x) {
if (dp[x] > 0)
return dp[x];
int fans = 0;
for (int i = 0; i < G[x].size(); i++)
fans = max(fans, f(G[x][i]) + 1);
return dp[x] = fans;
}
void solve() {
int ans = 0;
for (int i = 0; i < N; i++)
ans = max(ans, f(i));
cout << ans << endl;
}
int main(void) {
scanf("%d%d", &N, &M);
int x, y;
REP(i, M) {
scanf("%d%d", &x, &y);
x--, y--;
G[x].push_back(y);
}
solve();
return 0;
}
| [
"assignment.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 975,204 | 975,205 | u621104964 | cpp |
p03166 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007LL
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rep(i, x) for (int i = 0, _##i = (x); i < _##i; i++)
#define repp(i, s, e) for (int i = (s), _##i = (e); i < _##i; i++)
#define repr(i, s, e) for (int i = (s)-1, _##i = (e); i >= _##i; i--)
#define repi(i, x) for (auto &i : (x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
template <typename T, typename V>
ostream &operator<<(ostream &os, const pair<T, V> pai) {
return os << '(' << pai.first << ' ' << pai.second << ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> v) {
cout << '[';
rep(i, sz(v)) cout << v[i] << ",";
cout << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> v) {
cout << "{";
for (auto p : v)
cout << p << ",";
cout << "}";
return os;
}
template <typename T, typename V>
ostream &operator<<(ostream &os, const map<T, V> v) {
cout << "{";
for (auto p : v)
cout << p << ",";
cout << "}";
return os;
}
#ifndef __SOULTCH
#define debug(...) 0
#define endl '\n'
#else
#define debug(...) cout << " [-] ", _dbg(#__VA_ARGS__, __VA_ARGS__)
template <class TH> void _dbg(const char *sdbg, TH h) {
cout << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cout << *sdbg++;
cout << '=' << (h) << ',';
_dbg(sdbg + 1, a...);
}
#endif
template <typename T> void get_max(T &a, T b) { a = max(a, b); }
template <typename T> void get_min(T &a, T b) { a = min(a, b); }
int N, M;
int dist[100001];
bool visited[100001];
vector<int> adj[100001];
vector<int> top;
void topology_sort(int c) {
repi(i, adj[c]) if (not visited[i]) topology_sort(i);
visited[c] = true;
top.pb(c);
}
int main(void) {
iostream::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cin >> N >> M;
repp(i, 1, N + 1) { adj[0].pb(i); }
rep(i, M) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
topology_sort(0);
reverse(all(top));
repi(i, top) repi(j, adj[i]) dist[j] = dist[i] + 1;
cout << *max_element(dist + 1, dist + N + 1) - 1 << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF (1 << 30)
#define INFL (1LL << 60)
#define MOD 1000000007LL
#define EPS ((ld)(1e-9))
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rep(i, x) for (int i = 0, _##i = (x); i < _##i; i++)
#define repp(i, s, e) for (int i = (s), _##i = (e); i < _##i; i++)
#define repr(i, s, e) for (int i = (s)-1, _##i = (e); i >= _##i; i--)
#define repi(i, x) for (auto &i : (x))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
template <typename T, typename V>
ostream &operator<<(ostream &os, const pair<T, V> pai) {
return os << '(' << pai.first << ' ' << pai.second << ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> v) {
cout << '[';
rep(i, sz(v)) cout << v[i] << ",";
cout << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> v) {
cout << "{";
for (auto p : v)
cout << p << ",";
cout << "}";
return os;
}
template <typename T, typename V>
ostream &operator<<(ostream &os, const map<T, V> v) {
cout << "{";
for (auto p : v)
cout << p << ",";
cout << "}";
return os;
}
#ifndef __SOULTCH
#define debug(...) 0
#define endl '\n'
#else
#define debug(...) cout << " [-] ", _dbg(#__VA_ARGS__, __VA_ARGS__)
template <class TH> void _dbg(const char *sdbg, TH h) {
cout << sdbg << '=' << h << endl;
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cout << *sdbg++;
cout << '=' << (h) << ',';
_dbg(sdbg + 1, a...);
}
#endif
template <typename T> void get_max(T &a, T b) { a = max(a, b); }
template <typename T> void get_min(T &a, T b) { a = min(a, b); }
int N, M;
int dist[100001];
bool visited[100001];
vector<int> adj[100001];
vector<int> top;
void topology_sort(int c) {
repi(i, adj[c]) if (not visited[i]) topology_sort(i);
visited[c] = true;
top.pb(c);
}
int main(void) {
iostream::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cin >> N >> M;
repp(i, 1, N + 1) { adj[0].pb(i); }
rep(i, M) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
}
topology_sort(0);
reverse(all(top));
repi(i, top) repi(j, adj[i]) get_max(dist[j], dist[i] + 1);
cout << *max_element(dist + 1, dist + N + 1) - 1 << endl;
} | [
"call.add",
"call.arguments.change"
] | 975,208 | 975,209 | u236019708 | cpp |
p03166 | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
vector<ll> adj[100005];
vector<ll> visited(100005, -1);
ll r;
ll dfs(ll i) {
if (visited[i] != -1)
return visited[i];
if (adj[i].size() == 0)
return (visited[i] = 0);
ll temp = 0;
for (ll j = 0; j < adj[i].size(); j++) {
// if(visited[adj[i][j]]==-1)
temp = max(temp, dfs(adj[i][j]));
}
visited[i] = temp + 1;
}
void solve() {
ll n, m, x, y, z, d, p = 0, b = 0, q, l = INT_MAX, k, mini = 0, prev;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
r = 0;
for (ll i = 1; i <= n; i++) {
dfs(i);
}
cout << *max_element(visited.begin(), visited.end());
}
int main() {
fast ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
vector<ll> adj[100005];
vector<ll> visited(100005, -1);
ll r;
ll dfs(ll i) {
if (visited[i] != -1)
return visited[i];
if (adj[i].size() == 0)
return (visited[i] = 0);
ll temp = 0;
for (ll j = 0; j < adj[i].size(); j++) {
// if(visited[adj[i][j]]==-1)
temp = max(temp, dfs(adj[i][j]));
}
return (visited[i] = temp + 1);
}
void solve() {
ll n, m, x, y, z, d, p = 0, b = 0, q, l = INT_MAX, k, mini = 0, prev;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
cin >> x >> y;
adj[x].pb(y);
}
r = 0;
for (ll i = 1; i <= n; i++) {
dfs(i);
}
cout << *max_element(visited.begin(), visited.end());
}
int main() {
fast ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | [
"control_flow.return.add",
"function.return_value.change"
] | 975,213 | 975,214 | u864500649 | cpp |
p03166 | // _____ _______ _____ _____
// /\ \ /::\ \ /\ \ /\ \
// /::\ \ /::::\ \ /::\____\ /::\ \
// /::::\ \ /::::::\ \ /:::/ / /::::\ \
// /::::::\ \ /::::::::\ \ /:::/ /
// /::::::\ \
// /:::/\:::\ \ /:::/~~\:::\ \ /:::/ /
// /:::/\:::\ \
// /:::/__\:::\ \ /:::/ \:::\ \ /:::/ / /:::/__\:::\ \
// /::::\ \:::\ \ /:::/ / \:::\ \ /:::/ / /::::\ \:::\
// \
// /::::::\ \:::\ \ /:::/____/ \:::\____\ /:::/ / _____
// /::::::\ \:::\ \
// /:::/\:::\ \:::\ \|:::| | |:::| |/:::/____/
// /\ \ /:::/\:::\ \:::\ \
// /:::/ \:::\ \:::\____|:::|____| |:::|____|:::| / /::\____/:::/
// \:::\ \:::\____\
// \::/ \:::\ /:::/ /\:::\ _\___/:::/ /|:::|____\ /:::/ \::/
// \:::\ /:::/ /
// \/____/ \:::\/:::/ / \:::\ |::| /:::/ / \:::\ \ /:::/ /
// \/____/ \:::\/:::/ /
// \::::::/ / \:::\|::|/:::/ / \:::\ \ /:::/ /
// \::::::/ /
// \::::/ / \::::::::::/ / \:::\ /:::/ / \::::/
// /
// /:::/ / \::::::::/ / \:::\__/:::/ / /:::/ /
// /:::/ / \::::::/ / \::::::::/ / /:::/ /
// /:::/ / \::::/____/ \::::::/ / /:::/ /
// /:::/ / |::| | \::::/ / /:::/ /
// \::/ / |::|____| \::/____/ \::/ /
// \/____/ ~~ ~~ \/____/
// I am aqua
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fo \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define l first
#define r second
#define input \
.txt ifstream fin("input.txt"); \
ofstream fout("output.txt");
using namespace std;
//---------------------------------------------------------------------------------------------------------------------
const int maxn = 1e5;
//---------------------------------------------------------------------------------------------------------------------
int n, m, a[maxn], dp[maxn];
vector<int> adj[maxn];
int Dp(int n) {
if (adj[n].size() == 0)
return 0;
if (dp[n] != 0)
return dp[n];
int mx = 0;
for (int i = 0; i < adj[n].size(); i++) {
int u = adj[n][i];
if (dp[u] == 0)
dp[u] = Dp(u);
mx = max(mx, dp[u]);
}
return mx + 1;
}
//---------------------------------------------------------------------------------------------------------------------
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[y].pb(x);
}
int mx = 1;
for (int i = 1; i <= n; i++) {
mx = max(mx, Dp(i));
}
cout << mx;
}
// I know that ;
// I know where I am
// Do not think I don't
| // _____ _______ _____ _____
// /\ \ /::\ \ /\ \ /\ \
// /::\ \ /::::\ \ /::\____\ /::\ \
// /::::\ \ /::::::\ \ /:::/ / /::::\ \
// /::::::\ \ /::::::::\ \ /:::/ /
// /::::::\ \
// /:::/\:::\ \ /:::/~~\:::\ \ /:::/ /
// /:::/\:::\ \
// /:::/__\:::\ \ /:::/ \:::\ \ /:::/ / /:::/__\:::\ \
// /::::\ \:::\ \ /:::/ / \:::\ \ /:::/ / /::::\ \:::\
// \
// /::::::\ \:::\ \ /:::/____/ \:::\____\ /:::/ / _____
// /::::::\ \:::\ \
// /:::/\:::\ \:::\ \|:::| | |:::| |/:::/____/
// /\ \ /:::/\:::\ \:::\ \
// /:::/ \:::\ \:::\____|:::|____| |:::|____|:::| / /::\____/:::/
// \:::\ \:::\____\
// \::/ \:::\ /:::/ /\:::\ _\___/:::/ /|:::|____\ /:::/ \::/
// \:::\ /:::/ /
// \/____/ \:::\/:::/ / \:::\ |::| /:::/ / \:::\ \ /:::/ /
// \/____/ \:::\/:::/ /
// \::::::/ / \:::\|::|/:::/ / \:::\ \ /:::/ /
// \::::::/ /
// \::::/ / \::::::::::/ / \:::\ /:::/ / \::::/
// /
// /:::/ / \::::::::/ / \:::\__/:::/ / /:::/ /
// /:::/ / \::::::/ / \::::::::/ / /:::/ /
// /:::/ / \::::/____/ \::::::/ / /:::/ /
// /:::/ / |::| | \::::/ / /:::/ /
// \::/ / |::|____| \::/____/ \::/ /
// \/____/ ~~ ~~ \/____/
// I am aqua
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fo \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define l first
#define r second
#define input \
.txt ifstream fin("input.txt"); \
ofstream fout("output.txt");
using namespace std;
//---------------------------------------------------------------------------------------------------------------------
const int maxn = 1e5 + 10;
//---------------------------------------------------------------------------------------------------------------------
int n, m, a[maxn], dp[maxn];
vector<int> adj[maxn];
int Dp(int n) {
if (adj[n].size() == 0)
return 0;
if (dp[n] != 0)
return dp[n];
int mx = 0;
for (int i = 0; i < adj[n].size(); i++) {
int u = adj[n][i];
if (dp[u] == 0)
dp[u] = Dp(u);
mx = max(mx, dp[u]);
}
return mx + 1;
}
//---------------------------------------------------------------------------------------------------------------------
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[y].pb(x);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, Dp(i));
}
cout << mx;
}
// I know that ;
// I know where I am
// Do not think I don't
| [
"literal.number.change",
"variable_declaration.value.change"
] | 975,228 | 975,229 | u132913960 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
queue<int> q;
vector<int> g[N];
int d[N], f[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1, x, y; i <= m; i++) {
scanf("%d%d", &x, &y);
g[y].push_back(x);
d[y]++;
}
for (int i = 1; i <= n; i++)
if (d[i] == 0)
q.push(i);
int ans = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
// printf("x: %d\n", x);
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
d[y]--;
f[y] = max(f[y], f[x] + 1);
if (d[y] == 0)
q.push(y);
}
ans = max(f[x], ans);
}
// for (int i=1; i<=n; i++) printf("%d ", f[i]);
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
queue<int> q;
vector<int> g[N];
int d[N], f[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1, x, y; i <= m; i++) {
scanf("%d%d", &x, &y);
g[x].push_back(y);
d[y]++;
}
for (int i = 1; i <= n; i++)
if (d[i] == 0)
q.push(i);
int ans = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
// printf("x: %d\n", x);
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
d[y]--;
f[y] = max(f[y], f[x] + 1);
if (d[y] == 0)
q.push(y);
}
ans = max(f[x], ans);
}
// for (int i=1; i<=n; i++) printf("%d ", f[i]);
printf("%d\n", ans);
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 975,241 | 975,242 | u608842354 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
queue<int> q;
vector<int> g[N];
int d[N], f[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1, x, y; i <= m; i++) {
scanf("%d%d", &x, &y);
g[y].push_back(x);
d[y]++;
}
for (int i = 1; i <= n; i++)
if (d[i] == 0)
q.push(i);
int ans = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
// printf("x: %d\n", x);
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
d[y]--;
f[y] = max(f[y], f[x] + 1);
if (d[y] == 0)
q.push(y);
}
ans = max(f[x], ans);
}
// for (int i=1; i<=n; i++) printf("%d ", f[i]);
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
queue<int> q;
vector<int> g[N];
int d[N], f[N];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1, x, y; i <= m; i++) {
scanf("%d%d", &x, &y);
g[y].push_back(x);
d[x]++;
}
for (int i = 1; i <= n; i++)
if (d[i] == 0)
q.push(i);
int ans = 0;
while (!q.empty()) {
int x = q.front();
q.pop();
// printf("x: %d\n", x);
for (int i = 0; i < g[x].size(); i++) {
int y = g[x][i];
d[y]--;
f[y] = max(f[y], f[x] + 1);
if (d[y] == 0)
q.push(y);
}
ans = max(f[x], ans);
}
// for (int i=1; i<=n; i++) printf("%d ", f[i]);
printf("%d\n", ans);
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change"
] | 975,241 | 975,243 | u608842354 | cpp |
p03166 | #include <cstdio>
#include <queue>
using namespace std;
int n, m, topo[100005], order[100005], in[100005], topo_cnt, dp[100005];
int head[100005], cnt, ans;
queue<int> q;
struct node {
int to;
int next;
} edge[100005];
void add(int x, int y) {
cnt++;
edge[cnt].to = y;
edge[cnt].next = head[x];
head[x] = cnt;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
in[y]++;
}
for (int i = 1; i <= n; i++) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int temp = q.front();
q.pop();
if (topo[temp])
continue;
topo[temp] = ++topo_cnt;
order[topo_cnt] = temp;
// printf("%d\n",temp);
for (int i = head[temp]; i; i = edge[i].next) {
if (in[edge[i].to] > 0) {
in[edge[i].to]--;
if (in[edge[i].to] == 0)
q.push(edge[i].to);
}
}
}
for (int i = cnt; i >= 1; i--) {
int temp = order[i];
for (int j = head[temp]; j; j = edge[j].next) {
dp[temp] = max(dp[temp], dp[edge[j].to]);
}
ans = max(ans, dp[temp]);
dp[temp]++;
}
printf("%d\n", ans);
return 0;
} | #include <cstdio>
#include <queue>
using namespace std;
int n, m, topo[100005], order[100005], in[100005], topo_cnt, dp[100005];
int head[100005], cnt, ans;
queue<int> q;
struct node {
int to;
int next;
} edge[100005];
void add(int x, int y) {
cnt++;
edge[cnt].to = y;
edge[cnt].next = head[x];
head[x] = cnt;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
in[y]++;
}
for (int i = 1; i <= n; i++) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int temp = q.front();
q.pop();
if (topo[temp])
continue;
topo[temp] = ++topo_cnt;
order[topo_cnt] = temp;
// printf("%d\n",temp);
for (int i = head[temp]; i; i = edge[i].next) {
if (in[edge[i].to] > 0) {
in[edge[i].to]--;
if (in[edge[i].to] == 0)
q.push(edge[i].to);
}
}
}
for (int i = n; i >= 1; i--) {
int temp = order[i];
// printf("%d\n",temp);
for (int j = head[temp]; j; j = edge[j].next) {
dp[temp] = max(dp[temp], dp[edge[j].to]);
}
ans = max(ans, dp[temp]);
dp[temp]++;
}
printf("%d\n", ans);
return 0;
} | [
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.initializer.change"
] | 975,252 | 975,253 | u287687156 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const ld eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= (a); i--)
#define TR(X) \
({ \
if (1) \
cerr << "TR: " << (#X) << " = " << (X) << endl; \
})
ll longestPath[100005] = {0};
map<ll, set<ll>> paths = {};
ll longest(ll knoten) {
if (longestPath[knoten] != -1) {
return longestPath[knoten];
}
ll max = 0;
for (auto i : paths[knoten]) {
if (longest(i) + 1 > max)
max = longest(i) + 1;
}
longestPath[knoten] = max;
return max;
}
int main() {
std::fill(std::begin(longestPath),
std::begin(longestPath) +
sizeof(longestPath) / sizeof(longestPath[0]),
-1);
cin.sync_with_stdio(0);
ll n, m;
cin >> n >> m;
FOR(i, 0, m) {
ll x, y;
cin >> x >> y;
paths[x].insert(y);
}
ll max = 0;
FOR(i, 0, n) {
ll tmp = longest(i);
if (tmp > max)
max = tmp;
}
cout << max;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const ld eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= (a); i--)
#define TR(X) \
({ \
if (1) \
cerr << "TR: " << (#X) << " = " << (X) << endl; \
})
ll longestPath[100005] = {0};
map<ll, set<ll>> paths = {};
ll longest(ll knoten) {
if (longestPath[knoten] != -1) {
return longestPath[knoten];
}
ll max = 0;
for (auto i : paths[knoten]) {
if (longest(i) + 1 > max)
max = longest(i) + 1;
}
longestPath[knoten] = max;
return max;
}
int main() {
std::fill(std::begin(longestPath),
std::begin(longestPath) +
sizeof(longestPath) / sizeof(longestPath[0]),
-1);
cin.sync_with_stdio(0);
ll n, m;
cin >> n >> m;
FOR(i, 0, m) {
ll x, y;
cin >> x >> y;
paths[x].insert(y);
}
ll max = 0;
FOR(i, 1, n + 1) {
ll tmp = longest(i);
if (tmp > max)
max = tmp;
}
cout << max;
} | [
"literal.number.change",
"call.arguments.change"
] | 975,254 | 975,255 | u978976567 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
// from https://misora192.hatenablog.com/entry/2019/01/09/074031
int n, m;
const int max_n = 1e5 + 10;
vector<int> g[max_n];
bool used[max_n];
vector<int> v;
void dfs(int u) {
if (used[u])
return;
used[u] = true;
for (int i : g[u])
dfs(i);
v.push_back(u);
}
void tsort() {
for (int i = 0; i < n; i++)
dfs(i);
reverse(v.begin(), v.end());
}
int main() {
int mod = 1000000007;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
x--;
y--;
g[x].push_back(y);
}
tsort();
reverse(v.begin(), v.end());
vector<int> dp(n, 0);
int ans = 0;
for (int i : v) {
for (int u : g[i]) {
dp[i] = max(dp[i], dp[u] + 1);
}
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// from https://misora192.hatenablog.com/entry/2019/01/09/074031
int n, m;
const int max_n = 1e5 + 10;
vector<int> g[max_n];
bool used[max_n];
vector<int> v;
void dfs(int u) {
if (used[u])
return;
used[u] = true;
for (int i : g[u])
dfs(i);
v.push_back(u);
}
void tsort() {
for (int i = 0; i < n; i++)
dfs(i);
reverse(v.begin(), v.end());
}
int main() {
int mod = 1000000007;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d %d", &x, &y);
x--;
y--;
g[x].push_back(y);
}
tsort();
reverse(v.begin(), v.end());
vector<int> dp(n, 0);
int ans = 0;
for (int i : v) {
for (int u : g[i]) {
dp[i] = max(dp[i], dp[u] + 1);
}
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,258 | 975,259 | u123756661 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
vector<int> g[100010];
int memo[100010];
int dfs(int a) {
if (memo[a] != 0) {
return memo[a];
}
FOR(i, g[a].size()) {
if (memo[a] < dfs(g[a][i]) + 1) {
memo[a] = dfs(g[a][i]) + 1;
}
}
return memo[a];
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
FOR(i, m) {
cin >> x >> y;
g[x].push_back(y);
}
int ans = 0;
for (int i = 1; i < n; i++) {
if (ans < dfs(i)) {
ans = dfs(i);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
vector<int> g[100010];
int memo[100010];
int dfs(int a) {
if (memo[a] != 0) {
return memo[a];
}
FOR(i, g[a].size()) {
if (memo[a] < dfs(g[a][i]) + 1) {
memo[a] = dfs(g[a][i]) + 1;
}
}
return memo[a];
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
FOR(i, m) {
cin >> x >> y;
g[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (ans < dfs(i)) {
ans = dfs(i);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 975,311 | 975,312 | u962104148 | cpp |
p03166 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// vector<int> dp; // 頂点 i から始まるパスで最長のものの長さ
int dp[100001]; // メモ化再帰
multimap<int, int> mp; // 入力値(from, to)
// 一番遠い場所を探す
int rec(int from) {
if (dp[from] != 0) {
return dp[from];
}
int res = 0;
// キーを持つ値を列挙する
auto p = mp.equal_range(from);
for (auto it = p.first; it != p.second; ++it) {
res = max(res, rec(it->second) + 1);
}
return dp[from] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, ans = 0;
cin >> n >> m;
// dp.resize(n + 1, 0);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
mp.emplace(x, y);
}
for (int i = 1; i <= n; i++) {
ans = rec(i);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
// vector<int> dp; // 頂点 i から始まるパスで最長のものの長さ
int dp[100001]; // メモ化再帰
multimap<int, int> mp; // 入力値(from, to)
// 一番遠い場所を探す
int rec(int from) {
if (dp[from] != 0) {
return dp[from];
}
int res = 0;
// キーを持つ値を列挙する
auto p = mp.equal_range(from);
for (auto it = p.first; it != p.second; ++it) {
res = max(res, rec(it->second) + 1);
}
return dp[from] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, ans = 0;
cin >> n >> m;
// dp.resize(n + 1, 0);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
mp.emplace(x, y);
}
for (int i = 1; i <= n; i++) {
ans = max(ans, rec(i));
}
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 975,327 | 975,328 | u858107870 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5;
int dp[MAX_N + 1];
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> adj_list(MAX_N + 1);
vector<int> degree(MAX_N + 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj_list[y].push_back(x);
degree[x]++;
}
vector<int> BFS;
for (int i = 1; i <= n; i++) {
if (degree[i] == -0)
BFS.push_back(i);
}
while (!BFS.empty()) {
vector<int> new_BFS;
for (auto u : BFS) {
for (auto v : adj_list[u]) {
dp[v] = max(dp[v], 1 + dp[u]);
degree[v]--;
if (degree[v] == 0) {
new_BFS.push_back(v);
}
}
}
BFS = new_BFS;
}
int max_path = 0;
for (int i = 1; i <= m; i++) {
max_path = max(max_path, dp[i]);
}
cout << max_path << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5;
int dp[MAX_N + 1];
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> adj_list(MAX_N + 1);
vector<int> degree(MAX_N + 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj_list[y].push_back(x);
degree[x]++;
}
vector<int> BFS;
for (int i = 1; i <= n; i++) {
if (degree[i] == -0)
BFS.push_back(i);
}
while (!BFS.empty()) {
vector<int> new_BFS;
for (auto u : BFS) {
for (auto v : adj_list[u]) {
dp[v] = max(dp[v], 1 + dp[u]);
// cout << v << " " << dp[v] << endl;
degree[v]--;
if (degree[v] == 0) {
new_BFS.push_back(v);
}
}
}
BFS = new_BFS;
}
int max_path = 0;
for (int i = 1; i <= n; i++) {
max_path = max(max_path, dp[i]);
}
cout << max_path << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,365 | 975,366 | u263542246 | cpp |
p03166 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
vector<ll> adj[100002];
bool visited[100002];
ll dp[100002];
void initialize() {
for (ll i = 0; i < 100002; ++i) {
visited[i] = false;
}
}
ll dfs(ll i) {
visited[i] = true;
if (adj[i].size() == 0)
return dp[i] = 0;
ll c = INT_MIN;
for (auto j : adj[i]) {
if (visited[j] == false) {
c = max(c, dfs(j));
} else {
c = max(c, dp[j]);
}
}
return dp[i] = 1 + c;
}
int main() {
ll N, M;
cin >> N >> M;
ll x, y;
for (ll i = 0; i < M; i++) {
cin >> x;
cin >> y;
adj[x].push_back(y);
}
initialize();
for (ll i = 1; i < N; i++) {
dfs(i);
}
ll ans = -1;
for (ll i = 1; i <= N; i++) {
if (dp[i] > ans) {
ans = dp[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
vector<ll> adj[100002];
bool visited[100002];
ll dp[100002];
void initialize() {
for (ll i = 0; i < 100002; ++i) {
visited[i] = false;
}
}
ll dfs(ll i) {
visited[i] = true;
if (adj[i].size() == 0)
return dp[i] = 0;
ll c = INT_MIN;
for (auto j : adj[i]) {
if (visited[j] == false) {
c = max(c, dfs(j));
} else {
c = max(c, dp[j]);
}
}
return dp[i] = 1 + c;
}
int main() {
ll N, M;
cin >> N >> M;
ll x, y;
for (ll i = 0; i < M; i++) {
cin >> x;
cin >> y;
adj[x].push_back(y);
}
initialize();
for (ll i = 1; i <= N; i++) {
dfs(i);
}
ll ans = -1;
for (ll i = 1; i <= N; i++) {
if (dp[i] > ans) {
ans = dp[i];
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 975,371 | 975,372 | u771978844 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 1e5 + 5;
vector<int> adj[maxn];
int dp[maxn];
int n, m;
int solve(int u) {
if (dp[u] != -1)
return dp[u];
int best = 0;
for (int v : adj[u]) {
best = min(best, 1 + solve(v));
}
return dp[u] = best;
}
int main() {
memset(dp, -1, sizeof dp);
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d %d", &x, &y);
adj[x].pb(y);
}
int best = 0;
for (int i = 1; i <= n; i++)
best = max(best, solve(i));
printf("%d\n", best);
} | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 1e5 + 5;
vector<int> adj[maxn];
int dp[maxn];
int n, m;
int solve(int u) {
if (dp[u] != -1)
return dp[u];
int best = 0;
for (int v : adj[u]) {
best = max(best, 1 + solve(v));
}
return dp[u] = best;
}
int main() {
memset(dp, -1, sizeof dp);
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
scanf("%d %d", &x, &y);
adj[x].pb(y);
}
int best = 0;
for (int i = 1; i <= n; i++)
best = max(best, solve(i));
printf("%d\n", best);
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 975,408 | 975,409 | u905710781 | cpp |
p03166 | #include <iostream>
#include <vector>
using namespace std;
int longest_path(int u, int DP[], vector<int> node[]) {
if (DP[u] > 0) {
return DP[u];
}
int ret = 0;
for (int i = 0; i < node[u].size(); i++) {
ret = max(ret, longest_path(node[u][i], DP, node) + 1);
}
return DP[u] = ret;
}
int main() {
int N, M, ans = 0;
cin >> N >> M;
vector<int> node[N + 1];
int DP[N + 1] = {};
int u, v;
for (int i = 0; i < M; i++) {
cin >> u >> v;
node[u].push_back(v);
}
for (int i = 0; i < N; i++) {
ans = max(ans, longest_path(i, DP, node));
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int longest_path(int u, int DP[], vector<int> node[]) {
if (DP[u] > 0) {
return DP[u];
}
int ret = 0;
for (int i = 0; i < node[u].size(); i++) {
ret = max(ret, longest_path(node[u][i], DP, node) + 1);
}
return DP[u] = ret;
}
int main() {
int N, M, ans = 0;
cin >> N >> M;
vector<int> node[N + 1];
int DP[N + 1] = {};
int u, v;
for (int i = 1; i <= M; i++) {
cin >> u >> v;
node[u].push_back(v);
}
for (int i = 1; i <= N; i++) {
ans = max(ans, longest_path(i, DP, node));
}
cout << ans << "\n";
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,448 | 975,449 | u981186088 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
int n, m, a, b, dp[100010], to[100010];
vector<int> v[100010];
queue<int> q;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
to[b]++;
}
for (int i = 1; i <= n; ++i)
if (to[i] == 0)
q.push(i);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < v[x].size(); ++i) {
if (dp[x] + 1 > dp[v[x][i]]) {
dp[v[x][i]] = dp[x] + 1;
to[v[x][i]]--;
if (to[v[x][i]] == 0)
q.push(v[x][i]);
}
}
}
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, m, a, b, dp[100010], to[100010];
vector<int> v[100010];
queue<int> q;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &a, &b);
v[a].push_back(b);
to[b]++;
}
for (int i = 1; i <= n; ++i)
if (to[i] == 0)
q.push(i);
while (!q.empty()) {
int x = q.front();
q.pop();
for (int i = 0; i < v[x].size(); ++i) {
if (dp[x] + 1 > dp[v[x][i]]) {
dp[v[x][i]] = dp[x] + 1;
}
to[v[x][i]]--;
if (to[v[x][i]] == 0)
q.push(v[x][i]);
}
}
int ans = 0;
for (int i = 1; i <= n; ++i)
ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
} | [] | 975,464 | 975,465 | u989325410 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define debug(x) cerr << #x << " = " << (x) << endl;
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
for (auto &x : v)
o << x << ' ';
return o;
}
int n, m;
vi adj[100100];
int memo[100100];
int dp(int u) {
int &res = memo[u];
if (res != -1)
return res;
res = 1;
for (int v : adj[u]) {
res = max(res, 1 + dp(v));
}
return res;
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
adj[u].push_back(v);
}
memset(memo, -1, sizeof memo);
int res = 0;
for (int i = 0; i < n; i++) {
res = max(res, dp(i));
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define debug(x) cerr << #x << " = " << (x) << endl;
template <typename T> ostream &operator<<(ostream &o, vector<T> &v) {
for (auto &x : v)
o << x << ' ';
return o;
}
int n, m;
vi adj[100100];
int memo[100100];
int dp(int u) {
int &res = memo[u];
if (res != -1)
return res;
res = 1;
for (int v : adj[u]) {
res = max(res, 1 + dp(v));
}
return res;
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
adj[u].push_back(v);
}
memset(memo, -1, sizeof memo);
int res = 0;
for (int i = 0; i < n; i++) {
res = max(res, dp(i) - 1);
}
cout << res << endl;
}
| [
"assignment.change"
] | 975,481 | 975,482 | u115464345 | cpp |
p03166 | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
vector<int> sorted;
void dfs(int node, const vector<vector<int>> &g, vector<bool> &visited) {
visited[node] = 1;
for (auto it : g[node])
if (!visited[it])
dfs(it, g, visited);
sorted.push_back(node);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n + 1);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
vector<bool> visited(n + 1, 0);
for (int i = 1; i <= n; i++)
if (!visited[i])
dfs(1, g, visited);
reverse(sorted.begin(), sorted.end());
vector<int> dp(n + 1, 0);
int ans = 0;
for (auto node : sorted) {
for (auto it : g[node])
dp[it] = max(dp[it], dp[node] + 1);
ans = max(ans, dp[node]);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
vector<int> sorted;
void dfs(int node, const vector<vector<int>> &g, vector<bool> &visited) {
visited[node] = 1;
for (auto it : g[node])
if (!visited[it])
dfs(it, g, visited);
sorted.push_back(node);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n + 1);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
vector<bool> visited(n + 1, 0);
for (int i = 1; i <= n; i++)
if (!visited[i])
dfs(i, g, visited);
reverse(sorted.begin(), sorted.end());
vector<int> dp(n + 1, 0);
int ans = 0;
for (auto node : sorted) {
for (auto it : g[node])
dp[it] = max(dp[it], dp[node] + 1);
ans = max(ans, dp[node]);
}
cout << ans;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 975,483 | 975,484 | u088237968 | cpp |
p03167 | /* works correctly*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
char grid[10000][10000];
int r, c;
int dp[1000][1000];
// using memoization
int path(int x, int y) {
if (x >= r || y >= c)
return 0;
if (grid[x][y] == '#')
return 0;
if (x == r - 1 && y == c - 1)
return 1;
if (dp[x][y] != -1)
return dp[x][y];
return dp[x][y] = (path(x + 1, y) + path(x, y + 1)) % mod;
}
int pathTabulation(int x, int y) {
memset(dp, -1, sizeof(dp));
// initialize dp with first row and column
for (int j = 0; j < c; j++) {
(grid[0][j] == '.') ? dp[0][j] = 1 : dp[0][j] = 0;
}
for (int i = 0; i < r; i++) {
(grid[i][0] == '.') ? dp[i][0] = 1 : dp[i][0] = 0;
}
// now process our dp table
for (int i = 1; i < r; i++) {
for (int j = 1; j < c; j++) {
if (grid[i][j] == '#')
continue;
else {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
}
}
}
return dp[r - 1][c - 1];
}
signed main() {
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++)
cin >> grid[i][j];
}
memset(dp, -1, sizeof(dp));
cout << pathTabulation(0, 0);
// cout<<path(0,0);
return 0;
}
| /* works correctly*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
char grid[10000][10000];
int r, c;
int dp[1000][1000];
// using memoization
int path(int x, int y) {
if (x >= r || y >= c)
return 0;
if (grid[x][y] == '#')
return 0;
if (x == r - 1 && y == c - 1)
return 1;
if (dp[x][y] != -1)
return dp[x][y];
return dp[x][y] = (path(x + 1, y) + path(x, y + 1)) % mod;
}
int pathTabulation(int x, int y) {
memset(dp, -1, sizeof(dp));
// initialize dp with first row and column
for (int j = 0; j < c; j++) {
(grid[0][j] == '.') ? dp[0][j] = 1 : dp[0][j] = 0;
}
for (int i = 0; i < r; i++) {
(grid[i][0] == '.') ? dp[i][0] = 1 : dp[i][0] = 0;
}
// now process our dp table
for (int i = 1; i < r; i++) {
for (int j = 1; j < c; j++) {
if (grid[i][j] == '#')
continue;
else {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % mod;
}
}
}
return dp[r - 1][c - 1];
}
signed main() {
cin >> r >> c;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++)
cin >> grid[i][j];
}
memset(dp, -1, sizeof(dp));
// cout<<pathTabulation(0,0);
cout << path(0, 0);
return 0;
}
| [
"identifier.change",
"call.function.change",
"io.output.change"
] | 975,495 | 975,496 | u639986648 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define mod 1000000007
using namespace std;
char block[1001][1001];
ll dp[1001][1001];
ll row, col;
ll ans;
ll no_of_paths(ll r, ll c) {
dp[0][0] = 1;
for (int j = 1; j < c; j++) {
if (block[0][j] == '#') {
dp[0][j] = 0;
} else
dp[0][j] = dp[0][j - 1];
}
for (int i = 1; i < r; i++) {
if (block[i][0] == '#') {
dp[i][0] = 0;
} else
dp[i][0] = dp[i - 1][0];
}
for (int i = 1; i < r; i++) {
for (int j = 1; j < col; j++) {
dp[i][j] = (block[i][j] != '#') ? dp[i - 1][j] + dp[i][j - 1] : 0;
}
}
return dp[r - 1][c - 1];
}
int main() {
cin >> row >> col;
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
dp[i][j] = -1;
}
}
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
cin >> block[i][j];
}
}
cout << no_of_paths(row, col);
} | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define mod 1000000007
using namespace std;
char block[1001][1001];
ll dp[1001][1001];
ll row, col;
ll ans;
ll no_of_paths(ll r, ll c) {
dp[0][0] = 1;
for (int j = 1; j < c; j++) {
if (block[0][j] == '#') {
dp[0][j] = 0;
} else
dp[0][j] = dp[0][j - 1];
}
for (int i = 1; i < r; i++) {
if (block[i][0] == '#') {
dp[i][0] = 0;
} else
dp[i][0] = dp[i - 1][0];
}
for (int i = 1; i < r; i++) {
for (int j = 1; j < c; j++) {
dp[i][j] = (block[i][j] != '#') ? (dp[i - 1][j] + dp[i][j - 1]) % mod : 0;
}
}
return dp[r - 1][c - 1];
}
int main() {
cin >> row >> col;
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
dp[i][j] = -1;
}
}
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
cin >> block[i][j];
}
}
cout << no_of_paths(row, col);
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 975,516 | 975,517 | u438469926 | cpp |
p03167 | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const long long maxMod = 1000000007;
int H, W;
int world[1001 * 1001];
long long table[1001 * 1001];
void setWorld(int x, int y, char a) {
if (a == '.')
world[y * 1000 + x] = 1;
else
world[y * 1000 + x] = 0;
};
int getNum(int x, int y) {
if (x < 0 || y < 0 || x >= 1000 || y >= 1000 || world[y * 1000 + x] == 0)
return 0;
return table[y * 1000 + x];
};
void setNum(int x, int y) {
table[y * 1000 + x] = (getNum(x, y - 1) + getNum(x - 1, y)) % maxMod;
};
int main() {
for (int i = 0; i < 1001 * 1001; i++) {
world[i] = 0;
table[i] = 0;
}
cin >> H >> W;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
char a;
cin >> a;
setWorld(x, y, a);
}
}
table[0] = 1;
for (int a = 0; a < H; a++) {
for (int b = 0; b < W; b++) {
if (a + b == 0)
continue;
setNum(a, b);
}
}
cout << getNum(W - 1, H - 1) << endl;
};
| #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const long long maxMod = 1000000007;
int H, W;
int world[1001 * 1001];
long long table[1001 * 1001];
void setWorld(int x, int y, char a) {
if (a == '.')
world[y * 1000 + x] = 1;
else
world[y * 1000 + x] = 0;
};
int getNum(int x, int y) {
if (x < 0 || y < 0 || x >= 1000 || y >= 1000 || world[y * 1000 + x] == 0)
return 0;
return table[y * 1000 + x];
};
void setNum(int x, int y) {
table[y * 1000 + x] = (getNum(x, y - 1) + getNum(x - 1, y)) % maxMod;
};
int main() {
for (int i = 0; i < 1001 * 1001; i++) {
world[i] = 0;
table[i] = 0;
}
cin >> H >> W;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
char a;
cin >> a;
setWorld(x, y, a);
}
}
table[0] = 1;
for (int a = 0; a < H; a++) {
for (int b = 0; b < W; b++) {
if (a + b == 0)
continue;
setNum(b, a);
}
}
cout << getNum(W - 1, H - 1) << endl;
};
| [
"call.arguments.change",
"call.arguments.add"
] | 975,602 | 975,603 | u539639881 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
long long n, m, dp[1005][1005];
char c;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
dp[0][1] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> c;
if (c == '.')
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000009LL;
}
}
cout << dp[n][m];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, m, dp[1005][1005];
char c;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
dp[0][1] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> c;
if (c == '.')
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000007LL;
}
}
cout << dp[n][m];
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 975,622 | 975,623 | u587171482 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000001;
const ll MOD = 1000000007;
int dp[1001][1001];
int ways(int h, int w) {
// int dp[1001][1001]={0};
if (dp[0][0] == -1) {
return 0;
}
for (int j = 0; j < w; j++) {
if (dp[0][j] == -1) {
break;
}
dp[0][j] = 1;
}
for (int i = 0; i < h; i++) {
if (dp[i][0] == -1) {
break;
}
dp[i][0] = 1;
}
for (int i = 1; i < h; i++) {
for (int j = 1; j < w; j++) {
if (dp[i][j] == -1)
continue;
dp[i][j] = 0;
if (dp[i][j - 1] != -1)
dp[i][j] = dp[i][j - 1] % 1000000007;
if (dp[i - 1][j] != -1) {
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % 1000000007;
}
}
}
if (dp[h - 1][w - 1] == -1) {
return 0;
}
// for(int i=0;i<h;i++){
// for(int j=0;j<w;j++){
// cout<<dp[i][j]<<" ";
//}
// cout<<endl;
return dp[h - 1][w - 1];
}
int main() {
int h, w;
cin >> h >> w;
memset(dp, 0, sizeof dp);
// char grid[N][N];
char x;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
// cin>>grid[i][j];
cin >> x;
if (x == '#') {
dp[i][j] = -1;
}
}
cout << ways(h, w);
}
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000001;
const ll MOD = 1000000007;
int dp[1001][1001];
int ways(int h, int w) {
// int dp[1001][1001]={0};
if (dp[0][0] == -1) {
return 0;
}
for (int j = 0; j < w; j++) {
if (dp[0][j] == -1) {
break;
}
dp[0][j] = 1;
}
for (int i = 0; i < h; i++) {
if (dp[i][0] == -1) {
break;
}
dp[i][0] = 1;
}
for (int i = 1; i < h; i++) {
for (int j = 1; j < w; j++) {
if (dp[i][j] == -1)
continue;
dp[i][j] = 0;
if (dp[i][j - 1] != -1)
dp[i][j] = dp[i][j - 1] % 1000000007;
if (dp[i - 1][j] != -1) {
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % 1000000007;
}
}
}
if (dp[h - 1][w - 1] == -1) {
return 0;
}
// for(int i=0;i<h;i++){
// for(int j=0;j<w;j++){
// cout<<dp[i][j]<<" ";
//}
// cout<<endl;
return dp[h - 1][w - 1];
}
int main() {
int h, w;
cin >> h >> w;
memset(dp, 0, sizeof dp);
// char grid[N][N];
char x;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
// cin>>grid[i][j];
cin >> x;
if (x == '#') {
dp[i][j] = -1;
}
}
}
cout << ways(h, w);
}
| [] | 975,555 | 975,556 | u020281596 | cpp |
p03167 | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define vi vector<int>
#define vvi vector<vector<int>>
#define FASTIO \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL);
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORE(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define MOD 1000000007
using namespace std;
void init() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
// code from below
void solve() {
int n, m;
cin >> n >> m;
char arr[n][m];
FOR(i, n)
FOR(j, m)
cin >> arr[i][j];
int dp[n][m];
memset(dp, 0, sizeof(dp));
// dp[i][j] denotes no. of ways to go from i,j to n,m
// fill the last row with 1 and last col with 1
for (int i = m - 1; i >= 0 and arr[n - 1][i] != '#'; i--)
dp[n - 1][i] = 1;
for (int i = n - 1; i >= 0 and arr[m - 1][i] != '#'; i--)
dp[i][m - 1] = 1;
// fill the remaining dp array
for (int i = n - 2; i >= 0; i--) {
for (int j = m - 2; j >= 0; j--) {
if (arr[i][j] != '#') {
dp[i][j] = ((ll)dp[i + 1][j] + (ll)dp[i][j + 1]) % MOD;
}
}
}
// for(int i=0;i<n;i++,cout<<endl)
// for(int j=0;j<m;j++)
// cout<<dp[i][j]<<" ";
cout << dp[0][0] << endl;
}
int main() {
int t = 1;
// cin>>t;
// cin.ignore(numeric_limits<streamsize>::max(),'\n');
while (t--)
solve();
} | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define vi vector<int>
#define vvi vector<vector<int>>
#define FASTIO \
ios_base::sync_with_stdio(NULL); \
cin.tie(NULL);
#define FOR(i, n) for (int i = 0; i < n; i++)
#define FORE(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define MOD 1000000007
using namespace std;
void init() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
// code from below
void solve() {
int n, m;
cin >> n >> m;
char arr[n][m];
FOR(i, n)
FOR(j, m)
cin >> arr[i][j];
int dp[n][m];
memset(dp, 0, sizeof(dp));
// dp[i][j] denotes no. of ways to go from i,j to n,m
// fill the last row with 1 and last col with 1
for (int i = m - 1; i >= 0 and arr[n - 1][i] != '#'; i--)
dp[n - 1][i] = 1;
for (int i = n - 1; i >= 0 and arr[i][m - 1] != '#'; i--)
dp[i][m - 1] = 1;
// fill the remaining dp array
for (int i = n - 2; i >= 0; i--) {
for (int j = m - 2; j >= 0; j--) {
if (arr[i][j] != '#') {
dp[i][j] = ((ll)dp[i + 1][j] + (ll)dp[i][j + 1]) % MOD;
}
}
}
// for(int i=0;i<n;i++,cout<<endl)
// for(int j=0;j<m;j++)
// cout<<dp[i][j]<<" ";
cout << dp[0][0] << endl;
}
int main() {
int t = 1;
// cin>>t;
// cin.ignore(numeric_limits<streamsize>::max(),'\n');
while (t--)
solve();
}
| [
"control_flow.loop.for.condition.change"
] | 975,671 | 975,672 | u372662491 | cpp |
p03166 | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, it, cur, ans, kq;
int dd[N], x[N], f[N];
vector<int> ad[N];
void dfs(int u) {
dd[u] = 1;
for (auto v : ad[u])
if (!dd[v])
dfs(v);
x[u] = --it;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("lp.inp","r",stdin);
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
ad[u].push_back(v);
}
it = n + 1;
for (int i = 1; i <= n; ++i)
if (!dd[i])
dfs(i);
for (int i = 1; i <= n; ++i) {
int u = x[i];
for (auto v : ad[u])
f[v] = max(f[v], f[u] + 1);
}
cout << *max_element(f + 1, f + n + 1);
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, it, cur, ans, kq;
int dd[N], x[N], f[N];
vector<int> ad[N];
void dfs(int u) {
dd[u] = 1;
for (auto v : ad[u])
if (!dd[v])
dfs(v);
x[--it] = u;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("lp.inp","r",stdin);
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
ad[u].push_back(v);
}
it = n + 1;
for (int i = 1; i <= n; ++i)
if (!dd[i])
dfs(i);
for (int i = 1; i <= n; ++i) {
int u = x[i];
for (auto v : ad[u])
f[v] = max(f[v], f[u] + 1);
}
cout << *max_element(f + 1, f + n + 1);
}
| [
"assignment.change"
] | 975,681 | 975,682 | u815544868 | cpp |
p03167 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define infin ll(pow(10, 9) + 7);
int main() {
int h, w;
cin >> h >> w;
ll ways[h][w]; // ways[i][j]=no.of ways to reach (h-1,w-1) from i,j
char given[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> given[i][j];
}
}
ways[h - 1][w - 1] = 1;
for (int j = w - 2; j >= 0; j--) {
if (given[h - 1][j] == '#')
ways[h = 1][j] = 0;
else {
// cout<<j<<" "<<ways[h-1][j+1]<<endl;
ways[h - 1][j] = (ways[h - 1][j + 1]) % infin;
// cout<<ways[h-1][j]<<endl;
}
}
for (int i = h - 2; i >= 0; i--) {
if (given[i][w - 1] == '#')
ways[i][w - 1] = 0;
else
ways[i][w - 1] = (ways[i + 1][w - 1]) % infin;
}
// for(int i=0;i<h;i++)//just print
// {
// for(int j=0;j<w;j++)
// cout<<ways[i][j]<<" ";
// cout<<endl;
// }
for (int i = h - 2; i >= 0; i--) {
for (int j = w - 2; j >= 0; j--) {
if (given[i][j] == '#')
ways[i][j] = 0;
else
ways[i][j] = (ways[i + 1][j] + ways[i][j + 1]) % infin;
}
}
// cout<<"\n\n"<<endl;
// for(int i=0;i<h;i++)
// {
// for(int j=0;j<w;j++)
// cout<<ways[i][j]<<" ";
// cout<<endl;
// }
cout << ways[0][0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define infin ll(pow(10, 9) + 7);
int main() {
int h, w;
cin >> h >> w;
ll ways[h][w]; // ways[i][j]=no.of ways to reach (h-1,w-1) from i,j
char given[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> given[i][j];
}
}
ways[h - 1][w - 1] = 1;
for (int j = w - 2; j >= 0; j--) {
if (given[h - 1][j] == '#')
ways[h - 1][j] = 0;
else {
// cout<<j<<" "<<ways[h-1][j+1]<<endl;
ways[h - 1][j] = (ways[h - 1][j + 1]) % infin;
// cout<<ways[h-1][j]<<endl;
}
}
for (int i = h - 2; i >= 0; i--) {
if (given[i][w - 1] == '#')
ways[i][w - 1] = 0;
else
ways[i][w - 1] = (ways[i + 1][w - 1]) % infin;
}
// cout<<"all good"<<endl;
// for(int i=0;i<h;i++)//just print
// {
// for(int j=0;j<w;j++)
// cout<<ways[i][j]<<" ";
// cout<<endl;
// }
for (int i = h - 2; i >= 0; i--) {
for (int j = w - 2; j >= 0; j--) {
if (given[i][j] == '#')
ways[i][j] = 0;
else
ways[i][j] = (ways[i + 1][j] + ways[i][j + 1]) % infin;
}
}
// cout<<"\n\n"<<endl;
// for(int i=0;i<h;i++)
// {
// for(int j=0;j<w;j++)
// cout<<ways[i][j]<<" ";
// cout<<endl;
// }
cout << ways[0][0] << endl;
}
| [
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 975,727 | 975,728 | u834471595 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.