problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
typedef vector<int> vi;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(v) (int)v.size()
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fill(a, v) memset(a, v, sizeof(a));
#define all(v) v.begin(), v.end()
#define forn(i, a, b) for (int i = a; i < b; i++)
#define trarr(a, n) forn(i, 0, n) cerr << a[i] << " \n"[i == n - 1];
#define trmat(g, n, m) \
forn(i, 0, n) forn(j, 0, m) cerr << g[i][j] << " \n"[i == m - 1];
#define tr(...) \
cerr << __FUNCTION__ << ' ' << __LINE__ << " = "; \
trace(#__VA_ARGS__, __VA_ARGS__)
template <typename S, typename T>
ostream &operator<<(ostream &out, pair<S, T> const &p) {
out << '(' << p.ff << ", " << p.ss << ')';
return out;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> const &v) {
int l = v.size();
for (int i = 0; i < l - 1; i++)
out << v[i] << ' ';
if (l > 0)
out << v[l - 1];
return out;
}
template <typename T> void trace(const char *name, T &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char *names, T &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
const ld PI = acos(-1);
const ld EPS = 1e-9;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int P = 1e9 + 7;
const int N = 2e5 + 10;
vector<int> adj[N];
int dpar[N] = {0};
vector<int> topSort;
bool visited[N] = {0};
void dfs(int u) {
visited[u] = 1;
for (auto v : adj[u])
dfs(v);
topSort.pb(u);
}
int dp(int u) {
if (dpar[u] != 0)
return dpar[u];
int ret = 0;
for (auto v : adj[u]) {
ret = max(ret, dp(v));
}
return dpar[u] = ret + 1;
}
void solve(int _t) {
int n, m;
cin >> n >> m;
int u, v;
forn(i, 0, m) {
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
for (int i = sz(topSort) - 1; i >= 0; i--) {
ans = max(ans, dp(topSort[i]));
}
cout << ans - 1 << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
forn(test, 1, t + 1) { solve(test); }
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
typedef vector<int> vi;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(v) (int)v.size()
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fill(a, v) memset(a, v, sizeof(a));
#define all(v) v.begin(), v.end()
#define forn(i, a, b) for (int i = a; i < b; i++)
#define trarr(a, n) forn(i, 0, n) cerr << a[i] << " \n"[i == n - 1];
#define trmat(g, n, m) \
forn(i, 0, n) forn(j, 0, m) cerr << g[i][j] << " \n"[i == m - 1];
#define tr(...) \
cerr << __FUNCTION__ << ' ' << __LINE__ << " = "; \
trace(#__VA_ARGS__, __VA_ARGS__)
template <typename S, typename T>
ostream &operator<<(ostream &out, pair<S, T> const &p) {
out << '(' << p.ff << ", " << p.ss << ')';
return out;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> const &v) {
int l = v.size();
for (int i = 0; i < l - 1; i++)
out << v[i] << ' ';
if (l > 0)
out << v[l - 1];
return out;
}
template <typename T> void trace(const char *name, T &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char *names, T &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
const ld PI = acos(-1);
const ld EPS = 1e-9;
const int inf = 1e9 + 10;
const ll INF = 1e18 + 10;
const int P = 1e9 + 7;
const int N = 2e5 + 10;
vector<int> adj[N];
int dpar[N] = {0};
vector<int> topSort;
bool visited[N] = {0};
void dfs(int u) {
visited[u] = 1;
for (auto v : adj[u])
if (!visited[v])
dfs(v);
topSort.pb(u);
}
int dp(int u) {
if (dpar[u] != 0)
return dpar[u];
int ret = 0;
for (auto v : adj[u]) {
ret = max(ret, dp(v));
}
return dpar[u] = ret + 1;
}
void solve(int _t) {
int n, m;
cin >> n >> m;
int u, v;
forn(i, 0, m) {
cin >> u >> v;
adj[u].pb(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
for (int i = sz(topSort) - 1; i >= 0; i--) {
ans = max(ans, dp(topSort[i]));
}
cout << ans - 1 << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
forn(test, 1, t + 1) { solve(test); }
return 0;
}
|
replace
| 82 | 83 | 82 | 84 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pb push_back
#define pp pair<int, int>
#define rep(i, l, r) for (int i = l; i < r; i++)
vi g[100005];
vi indeg(100005, 0);
vi lp(100005, 0);
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt.txt", "r", stdin);
freopen("output.txt.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
set<pp> vert;
while (m--) {
int u, v;
cin >> u >> v;
g[u].pb(v);
indeg[v]++;
}
for (int i = 1; i <= n; i++) {
vert.insert({indeg[i], i});
}
int done = 0;
while (done != n) {
pp vv = *vert.begin();
int v = vv.second;
for (auto &x : g[v]) {
lp[x] = max(lp[v] + 1, lp[x]);
vert.erase({indeg[x], x});
indeg[x]--;
vert.insert({indeg[x], x});
}
vert.erase({indeg[v], v});
done++;
}
int ans = 0;
rep(i, 1, n + 1) ans = max(ans, lp[i]);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pb push_back
#define pp pair<int, int>
#define rep(i, l, r) for (int i = l; i < r; i++)
vi g[100005];
vi indeg(100005, 0);
vi lp(100005, 0);
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt.txt","r",stdin);
// freopen("output.txt.txt","w",stdout);
// #endif
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
set<pp> vert;
while (m--) {
int u, v;
cin >> u >> v;
g[u].pb(v);
indeg[v]++;
}
for (int i = 1; i <= n; i++) {
vert.insert({indeg[i], i});
}
int done = 0;
while (done != n) {
pp vv = *vert.begin();
int v = vv.second;
for (auto &x : g[v]) {
lp[x] = max(lp[v] + 1, lp[x]);
vert.erase({indeg[x], x});
indeg[x]--;
vert.insert({indeg[x], x});
}
vert.erase({indeg[v], v});
done++;
}
int ans = 0;
rep(i, 1, n + 1) ans = max(ans, lp[i]);
cout << ans << endl;
}
|
replace
| 13 | 17 | 13 | 17 |
-11
| |
p03166
|
C++
|
Runtime Error
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
vector<int> g[10005];
int d[100005];
int dfs(int x) {
if (d[x] > 0)
return d[x];
d[x] = 0;
for (int y : g[x]) {
d[x] = max(d[x], dfs(y) + 1);
}
return d[x];
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[--x].push_back(--y);
}
fill(d, d + n, -1);
for (int i = 0; i < n; i++) {
if (d[i] < 0) {
d[i] = dfs(i);
}
}
cout << *max_element(d, d + n) << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100005];
int d[100005];
int dfs(int x) {
if (d[x] > 0)
return d[x];
d[x] = 0;
for (int y : g[x]) {
d[x] = max(d[x], dfs(y) + 1);
}
return d[x];
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[--x].push_back(--y);
}
fill(d, d + n, -1);
for (int i = 0; i < n; i++) {
if (d[i] < 0) {
d[i] = dfs(i);
}
}
cout << *max_element(d, d + n) << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int N, M;
vector<vector<int>> G;
vector<int> dp;
int f(int now) {
if (dp[now] != 1e9)
return dp[now];
else if (G[now].size() == 0) {
dp[now] = 0;
return 0;
} else {
int mxcount = 0;
for (auto e : G[now])
mxcount = max(mxcount, f(e) + 1);
dp[now] = max(dp[now], mxcount);
return mxcount;
}
}
int main() {
cin >> N >> M;
G.resize(N);
dp.resize(N, 1e9);
rep(i, M) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
int ans = 0;
rep(i, N) { ans = max(ans, f(i)); }
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int N, M;
vector<vector<int>> G;
vector<int> dp;
int f(int now) {
if (dp[now] != 1e9)
return dp[now];
int mxcount = 0;
for (auto e : G[now])
mxcount = max(mxcount, f(e) + 1);
dp[now] = mxcount;
return mxcount;
}
int main() {
cin >> N >> M;
G.resize(N);
dp.resize(N, 1e9);
rep(i, M) {
int x, y;
cin >> x >> y;
x--;
y--;
G[x].push_back(y);
}
int ans = 0;
rep(i, N) { ans = max(ans, f(i)); }
cout << ans << endl;
}
|
replace
| 13 | 23 | 13 | 18 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
vector<ll> dp;
vector<vector<ll>> s;
bitset<100010> can;
void see(ll here) {
can[here] = 0;
ll f = s[here].size();
for (ll i = 0; i < f; i++) {
if (!can[s[here][i]]) {
see(s[here][i]);
}
dp[here] = max(dp[here], dp[s[here][i]] + 1);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, m, a, b;
cin >> n >> m;
dp.assign(n + 1, 0);
s.assign(n + 1, vector<ll>(0, 0));
for (ll i = 0; i < m; i++) {
cin >> a >> b;
s[a].PB(b);
}
for (ll i = 1; i <= n; i++) {
if (!can[i])
see(i);
}
ll maxi = 0;
for (ll i = 1; i <= n; i++) {
maxi = max(maxi, dp[i]);
}
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i <= b; i++)
vector<ll> dp;
vector<vector<ll>> s;
bitset<100010> can;
void see(ll here) {
can[here] = 1;
ll f = s[here].size();
for (ll i = 0; i < f; i++) {
if (!can[s[here][i]]) {
see(s[here][i]);
}
dp[here] = max(dp[here], dp[s[here][i]] + 1);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, m, a, b;
cin >> n >> m;
dp.assign(n + 1, 0);
s.assign(n + 1, vector<ll>(0, 0));
for (ll i = 0; i < m; i++) {
cin >> a >> b;
s[a].PB(b);
}
for (ll i = 1; i <= n; i++) {
if (!can[i])
see(i);
}
ll maxi = 0;
for (ll i = 1; i <= n; i++) {
maxi = max(maxi, dp[i]);
}
cout << maxi << endl;
return 0;
}
|
replace
| 19 | 20 | 19 | 20 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
#define pb emplace_back
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
lli ans;
lli dfs(lli v, vector<vector<lli>> edges, vector<lli> &dist,
vector<bool> &visited) {
visited[v] = true;
lli val = 0;
for (auto x : edges[v]) {
if (visited[x]) {
val = max(val, dist[x] + 1);
} else {
val = max(dfs(x, edges, dist, visited), val);
}
}
dist[v] = val;
ans = max(ans, dist[v]);
return val + 1;
}
int main() {
fastio;
lli n, m;
cin >> n >> m;
vector<lli> dist(n + 1, -1);
vector<vector<lli>> edges(n + 1);
ans = 0;
for (int i = 0; i < m; i++) {
lli u, v;
cin >> u >> v;
edges[u].pb(v);
}
vector<bool> visited(n + 1, false);
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
// cout << i << " ";
dfs(i, edges, dist, visited);
}
}
// cout << endl;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
#define pb emplace_back
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
lli ans;
lli dfs(lli v, vector<vector<lli>> &edges, vector<lli> &dist,
vector<bool> &visited) {
visited[v] = true;
lli val = 0;
for (auto x : edges[v]) {
if (visited[x]) {
val = max(val, dist[x] + 1);
} else {
val = max(dfs(x, edges, dist, visited), val);
}
}
dist[v] = val;
ans = max(ans, dist[v]);
return val + 1;
}
int main() {
fastio;
lli n, m;
cin >> n >> m;
vector<lli> dist(n + 1, -1);
vector<vector<lli>> edges(n + 1);
ans = 0;
for (int i = 0; i < m; i++) {
lli u, v;
cin >> u >> v;
edges[u].pb(v);
}
vector<bool> visited(n + 1, false);
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
// cout << i << " ";
dfs(i, edges, dist, visited);
}
}
// cout << endl;
cout << ans << endl;
return 0;
}
|
replace
| 12 | 13 | 12 | 13 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
void usain_bolt() {
ios::sync_with_stdio(false);
cin.tie(0);
}
const int N = 1e5 + 5;
vector<int> a[N];
queue<int> q;
int in[N], mx, d[N];
void bfs() {
while (!q.empty()) {
int x = q.front();
q.pop();
mx = max(mx, d[x]);
if (in[x] > 0)
continue;
for (auto v : a[x]) {
if (d[v] <= d[x] + 1)
d[v] = d[x] + 1, q.push(v);
--in[v];
}
}
}
int main() {
usain_bolt();
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
cin >> x >> y;
a[x].push_back(y);
++in[y];
}
for (int i = 1; i <= n; ++i)
if (in[i] == 0)
q.push(i);
bfs();
cout << mx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void usain_bolt() {
ios::sync_with_stdio(false);
cin.tie(0);
}
const int N = 1e5 + 5;
vector<int> a[N];
queue<int> q;
int in[N], mx, d[N];
void bfs() {
while (!q.empty()) {
int x = q.front();
q.pop();
mx = max(mx, d[x]);
if (in[x] > 0)
continue;
for (auto v : a[x]) {
if (d[v] < d[x] + 1)
d[v] = d[x] + 1, q.push(v);
--in[v];
}
}
}
int main() {
usain_bolt();
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
cin >> x >> y;
a[x].push_back(y);
++in[y];
}
for (int i = 1; i <= n; ++i)
if (in[i] == 0)
q.push(i);
bfs();
cout << mx;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long int lint;
typedef unsigned long long int ulint;
list<lint> gelen[100020], giden[100020];
lint dp[100020];
bool hes[100020];
lint hesap(lint a);
lint n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lint i, j, cev = 0, a, b, k, l;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a >> b;
gelen[b].pb(a);
giden[a].pb(b);
}
for (i = 1; i <= n; i++) {
if (gelen[i].size() == 0) {
cev = fmax(cev, hesap(i));
}
}
cout << cev;
return 0;
}
lint hesap(lint a) {
if (hes[a] == true)
return dp[a];
hes[a] == true;
lint cev = 0;
if (giden[a].size() == 0) {
dp[a] = 0;
return 0;
}
list<lint>::iterator it;
for (it = giden[a].begin(); it != giden[a].end(); it++) {
cev = fmax(cev, hesap(*it) + 1);
}
dp[a] = cev;
return cev;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long int lint;
typedef unsigned long long int ulint;
list<lint> gelen[100020], giden[100020];
lint dp[100020];
bool hes[100020];
lint hesap(lint a);
lint n, m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lint i, j, cev = 0, a, b, k, l;
cin >> n >> m;
for (i = 0; i < m; i++) {
cin >> a >> b;
gelen[b].pb(a);
giden[a].pb(b);
}
for (i = 1; i <= n; i++) {
if (gelen[i].size() == 0) {
cev = fmax(cev, hesap(i));
}
}
cout << cev;
return 0;
}
lint hesap(lint a) {
if (hes[a] == true)
return dp[a];
hes[a] = true;
lint cev = 0;
if (giden[a].size() == 0) {
dp[a] = 0;
return 0;
}
list<lint>::iterator it;
for (it = giden[a].begin(); it != giden[a].end(); it++) {
cev = fmax(cev, hesap(*it) + 1);
}
dp[a] = cev;
return cev;
}
|
replace
| 37 | 38 | 37 | 38 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, m, x, y, dp[N], ans;
vector<int> v[N];
bool notroot[N];
int dfs(int x) {
if (dp[x] != -1)
return dp[x];
if (v[x].empty()) {
dp[x] = 0;
return 0;
}
int res = -666666;
for (int i = 0; i < v[x].size(); i++)
res = max(res, dfs(v[x][i]) + 1);
return res;
}
int main() {
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= m; i++) {
cin >> x >> y;
v[x].push_back(y);
notroot[y] = true;
}
for (int i = 1; i <= n; i++)
if (!notroot[i])
ans = max(ans, dfs(i));
cout << ans;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int inf = 2147483647, dx[] = {-1, 0, 1, 0},
dy[] = {0, -1, 0, 1}; // 上 左 下 右
const int N = 100005, M = 1000005, mod = 1000000007;
const long long llinf = 9223372036854775807ll;
int n, m, x, y, dp[N], ans;
vector<int> v[N];
bool notroot[N];
int dfs(int x) {
if (dp[x] != -1)
return dp[x];
if (v[x].empty()) {
dp[x] = 0;
return 0;
}
int res = -666666;
for (int i = 0; i < v[x].size(); i++)
res = max(res, dfs(v[x][i]) + 1);
dp[x] = res;
return res;
}
int main() {
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= m; i++) {
cin >> x >> y;
v[x].push_back(y);
notroot[y] = true;
}
for (int i = 1; i <= n; i++)
if (!notroot[i])
ans = max(ans, dfs(i));
cout << ans;
return 0;
}
|
insert
| 29 | 29 | 29 | 30 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define fill(x, y) memset(x, y, sizeof(x))
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const int MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
vector<ll> memo;
ll dp(ll n, vvll links) {
if (memo[n] != -1)
return memo[n];
ll res = 0;
for (auto d : links[n]) {
res = max(res, dp(d, links) + 1);
}
return memo[n] = res;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> links(N);
int s, t;
for (auto i = 0; i < M; i++) {
cin >> s >> t;
s--;
t--;
links[s].push_back(t);
}
memo.resize(N + 1, -1);
ll ans = 0;
for (auto i = 0; i < N; i++) {
ans = max(ans, dp(i, links));
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define VV(T) vector<vector<T>>
#define rep(i, N) for (int i = 0; i < N; i++)
#define fill(x, y) memset(x, y, sizeof(x))
#define name(x) #x
using namespace std;
const int INF = INT_MAX;
const int MOD = pow(10, 9) + 7;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef long long ll, LL;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pLL;
// vector入力
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
vector<ll> memo;
ll dp(ll n, vvll &links) {
if (memo[n] != -1)
return memo[n];
ll res = 0;
for (auto d : links[n]) {
res = max(res, dp(d, links) + 1);
}
return memo[n] = res;
}
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> links(N);
int s, t;
for (auto i = 0; i < M; i++) {
cin >> s >> t;
s--;
t--;
links[s].push_back(t);
}
memo.resize(N + 1, -1);
ll ans = 0;
for (auto i = 0; i < N; i++) {
ans = max(ans, dp(i, links));
}
cout << ans << endl;
return 0;
}
|
replace
| 55 | 56 | 55 | 56 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const int MAX = 1e5;
vector<int> dp(MAX, -1);
vector<int> g[MAX];
int dfs(int i) {
if (dp[i] != -1)
return dp[i];
int d = 0;
rep(j, g[i].size()) { d = max(d, dfs(g[i][j]) + 1); }
return d;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ans = 0;
rep(i, n) {
if (dp[i] == -1)
ans = max(ans, dfs(i));
else
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
const int MAX = 1e5;
vector<int> dp(MAX, -1);
vector<int> g[MAX];
int dfs(int i) {
if (dp[i] != -1)
return dp[i];
int d = 0;
rep(j, g[i].size()) { d = max(d, dfs(g[i][j]) + 1); }
return dp[i] = d;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int x, y;
cin >> x >> y;
x--;
y--;
g[x].push_back(y);
}
int ans = 0;
rep(i, n) {
if (dp[i] == -1)
ans = max(ans, dfs(i));
else
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int helperfn(int i, vector<vector<int>> &matrix) {
// cout<<"helperfn"<<" "<<i<<endl;
if (matrix[i].size() == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (int j = 0; j <= matrix[i].size(); j++) {
maxi = max(maxi, 1 + helperfn(matrix[i][j], matrix));
}
dp[i] = maxi;
return maxi;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> matrix(n + 2);
for (int i = 0; i <= n; i++)
dp.push_back(-1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
matrix[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int x = helperfn(i, matrix);
}
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> dp;
int helperfn(int i, vector<vector<int>> &matrix) {
// cout<<"helperfn"<<" "<<i<<endl;
if (matrix[i].size() == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int maxi = 0;
for (int j = 0; j < matrix[i].size(); j++) {
maxi = max(maxi, 1 + helperfn(matrix[i][j], matrix));
}
dp[i] = maxi;
return maxi;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> matrix(n + 2);
for (int i = 0; i <= n; i++)
dp.push_back(-1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
matrix[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int x = helperfn(i, matrix);
}
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p03166
|
C++
|
Runtime Error
|
// In the Name of ̲A̲l̲l̲a̲h̲
#include <bits/stdc++.h>
using namespace std;
int n, u, v, m;
vector<int> adj[10000];
bool mark[10000];
int mxPath[10000], mxDepth[10000];
void DFS(int v) {
mark[v] = 1;
if (!adj[v].size())
return;
int mx1 = 0;
int mx3 = 0;
int mx2 = 0;
for (int u : adj[v]) {
if (!mark[u]) {
DFS(u);
}
if (mx1 < mxDepth[u] + 1) {
mx1 = mxDepth[u] + 1;
}
if (mx3 < mxPath[u]) {
mx3 = mxPath[u];
}
}
if (adj[v].size() == 0)
return;
mxPath[v] = max(mx1, mx3);
mxDepth[v] = mx1;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!mark[i]) {
DFS(i);
}
if (mxPath[i] > ans)
ans = mxPath[i];
}
cout << ans;
}
/*𝐻𝒶𝒹𝒾*/
|
// In the Name of ̲A̲l̲l̲a̲h̲
#include <bits/stdc++.h>
using namespace std;
int n, u, v, m;
vector<int> adj[100001];
bool mark[100001];
int mxPath[100001], mxDepth[100001];
void DFS(int v) {
mark[v] = 1;
if (!adj[v].size())
return;
int mx1 = 0;
int mx3 = 0;
int mx2 = 0;
for (int u : adj[v]) {
if (!mark[u]) {
DFS(u);
}
if (mx1 < mxDepth[u] + 1) {
mx1 = mxDepth[u] + 1;
}
if (mx3 < mxPath[u]) {
mx3 = mxPath[u];
}
}
if (adj[v].size() == 0)
return;
mxPath[v] = max(mx1, mx3);
mxDepth[v] = mx1;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].push_back(v);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!mark[i]) {
DFS(i);
}
if (mxPath[i] > ans)
ans = mxPath[i];
}
cout << ans;
}
/*𝐻𝒶𝒹𝒾*/
|
replace
| 7 | 10 | 7 | 10 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 200010
using namespace std;
// ifstream f("date.in");
int n, m;
vector<int> a[NMAX];
int interior[NMAX], exterior[NMAX];
int nr, top_sort[NMAX];
int dp[NMAX];
int vis[NMAX];
void dfs(int x) {
for (int i = 0; i < a[x].size(); ++i) {
if (vis[a[x][i]] == 0) {
dfs(a[x][i]);
}
}
top_sort[nr++] = x;
}
int main() {
f >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
f >> x >> y;
x--;
y--;
a[x].push_back(y);
interior[y]++;
exterior[x]++;
}
for (int i = 0; i < n; ++i) {
if (interior[i] == 0) {
dfs(i);
}
}
int longest_path = 0;
for (int i = 0; i < nr; ++i) {
// cout << top_sort[i] << " ";
int v_max = 0;
int current_element = top_sort[i];
for (int j = 0; j < a[current_element].size(); ++j) {
int current_neig = a[current_element][j];
v_max = max(v_max, dp[current_neig]);
}
dp[current_element] = v_max + 1;
longest_path = max(longest_path, dp[current_element]);
}
cout << longest_path - 1;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <vector>
#define f cin
#define NMAX 200010
using namespace std;
// ifstream f("date.in");
int n, m;
vector<int> a[NMAX];
int interior[NMAX], exterior[NMAX];
int nr, top_sort[NMAX];
int dp[NMAX];
int vis[NMAX];
void dfs(int x) {
vis[x] = 1;
for (int i = 0; i < a[x].size(); ++i) {
if (vis[a[x][i]] == 0) {
dfs(a[x][i]);
}
}
top_sort[nr++] = x;
}
int main() {
f >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
f >> x >> y;
x--;
y--;
a[x].push_back(y);
interior[y]++;
exterior[x]++;
}
for (int i = 0; i < n; ++i) {
if (interior[i] == 0) {
dfs(i);
}
}
int longest_path = 0;
for (int i = 0; i < nr; ++i) {
// cout << top_sort[i] << " ";
int v_max = 0;
int current_element = top_sort[i];
for (int j = 0; j < a[current_element].size(); ++j) {
int current_neig = a[current_element][j];
v_max = max(v_max, dp[current_neig]);
}
dp[current_element] = v_max + 1;
longest_path = max(longest_path, dp[current_element]);
}
cout << longest_path - 1;
return 0;
}
|
insert
| 19 | 19 | 19 | 20 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
constexpr int n = 1e5 + 5;
int N, M;
vector<vector<int>> edges(n);
vector<int> dp(n, 0);
vector<int> vis(n, 0);
int dfs(int x) {
if (!x) {
return 0;
}
int ans = 0;
for (int &nb : edges[x]) {
ans = max(dfs(nb) + 1, ans);
}
vis[x] = 1;
dp[x] = ans;
return dp[x];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y;
cin >> N >> M;
for (int i = 1; i <= N; i++) {
edges[i].push_back(0);
}
for (int i = 0; i < M; i++) {
cin >> x >> y;
edges[y].push_back(x);
}
int ans = 0;
for (int i = 1; i <= N; i++) {
if (!vis[i]) {
ans = max(dfs(i), ans);
} else {
ans = max(dp[i], ans);
}
}
cout << ans - 1;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
constexpr int n = 1e5 + 5;
int N, M;
vector<vector<int>> edges(n);
vector<int> dp(n, 0);
vector<int> vis(n, 0);
int dfs(int x) {
if (!x) {
return 0;
}
int ans = 0;
for (int &nb : edges[x]) {
if (!vis[nb]) {
ans = max(dfs(nb) + 1, ans);
} else {
ans = max(dp[nb] + 1, ans);
}
}
vis[x] = 1;
dp[x] = ans;
return dp[x];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int x, y;
cin >> N >> M;
for (int i = 1; i <= N; i++) {
edges[i].push_back(0);
}
for (int i = 0; i < M; i++) {
cin >> x >> y;
edges[y].push_back(x);
}
int ans = 0;
for (int i = 1; i <= N; i++) {
if (!vis[i]) {
ans = max(dfs(i), ans);
} else {
ans = max(dp[i], ans);
}
}
cout << ans - 1;
return 0;
}
|
replace
| 15 | 17 | 15 | 20 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> g[100000];
long long mx[100000];
int n, m;
void dfs(int u) {
if (mx[u] == 0)
for (auto i = g[u].begin(); i != g[u].end(); ++i) {
if (mx[*i] == 0)
dfs(*i);
mx[u] = max(mx[u], mx[*i] + 1);
}
}
int main() {
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
g[u].push_back(v);
}
long long w = 0;
for (int i = 1; i <= n; ++i)
dfs(i);
for (int i = 1; i <= n; ++i)
w = max(w, mx[i]);
cout << w;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> g[100001];
long long mx[100001];
int n, m;
void dfs(int u) {
if (mx[u] == 0)
for (auto i = g[u].begin(); i != g[u].end(); ++i) {
if (mx[*i] == 0)
dfs(*i);
mx[u] = max(mx[u], mx[*i] + 1);
}
}
int main() {
cin >> n >> m;
int u, v;
for (int i = 0; i < m; ++i) {
cin >> u >> v;
g[u].push_back(v);
}
long long w = 0;
for (int i = 1; i <= n; ++i)
dfs(i);
for (int i = 1; i <= n; ++i)
w = max(w, mx[i]);
cout << w;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int MAX = 1e5;
vector<bool> visited(MAX);
vector<int> dist(MAX);
vector<vector<int>> adj(MAX);
void dfs(int u) {
dist[u] = 0;
for (int it : adj[u]) {
if (!visited[it]) {
dfs(it);
}
dist[u] = max(dist[u], 1 + dist[it]);
}
}
void solve() {
int n, m;
cin >> n >> m;
visited.assign(n, false);
while (m--) {
int x, y;
cin >> x >> y;
x--, y--;
adj[x].push_back(y);
}
int res = 0;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
dfs(i);
}
res = max(res, dist[i]);
}
cout << res << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int MAX = 1e5;
vector<bool> visited(MAX);
vector<int> dist(MAX);
vector<vector<int>> adj(MAX);
void dfs(int u) {
visited[u] = true;
dist[u] = 0;
for (int it : adj[u]) {
if (!visited[it]) {
dfs(it);
}
dist[u] = max(dist[u], 1 + dist[it]);
}
}
void solve() {
int n, m;
cin >> n >> m;
visited.assign(n, false);
while (m--) {
int x, y;
cin >> x >> y;
x--, y--;
adj[x].push_back(y);
}
int res = 0;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
dfs(i);
}
res = max(res, dist[i]);
}
cout << res << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
insert
| 8 | 8 | 8 | 9 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// BWOTSHEWCHB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define X first
#define Y second
const int MAXN = 1e4 + 69, MOD = 1e9 + 7;
int n, m, ans, mark[MAXN], dist[MAXN];
vector<int> top, g[MAXN], rev[MAXN];
void dfs(int v) {
mark[v] = 1;
for (auto u : g[v])
if (!mark[u])
dfs(u);
top.pb(v);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int v, u;
for (int i = 1; i <= m; i++)
cin >> v >> u, g[v].pb(u), rev[u].pb(v);
for (int i = 1; i <= n; i++)
if (!mark[i])
dfs(i);
while (top.size()) {
int v = top.back();
for (auto u : rev[v])
dist[v] = max(dist[v], dist[u] + 1);
top.pop_back();
ans = max(ans, dist[v]);
}
cout << ans << "\n";
}
|
// BWOTSHEWCHB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define X first
#define Y second
const int MAXN = 1e6 + 69, MOD = 1e9 + 7;
int n, m, ans, mark[MAXN], dist[MAXN];
vector<int> top, g[MAXN], rev[MAXN];
void dfs(int v) {
mark[v] = 1;
for (auto u : g[v])
if (!mark[u])
dfs(u);
top.pb(v);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int v, u;
for (int i = 1; i <= m; i++)
cin >> v >> u, g[v].pb(u), rev[u].pb(v);
for (int i = 1; i <= n; i++)
if (!mark[i])
dfs(i);
while (top.size()) {
int v = top.back();
for (auto u : rev[v])
dist[v] = max(dist[v], dist[u] + 1);
top.pop_back();
ans = max(ans, dist[v]);
}
cout << ans << "\n";
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
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;
}
#define ll long long
const ll INF = 1LL << 60;
// 入力
ll N, M;
vector<vector<ll>> vec(10010);
// dp
ll dp[100010];
ll lg(ll v) {
// 頂点vからの最も長い矢印の長さ
if (dp[v] != -1) {
return dp[v];
} else {
if (vec[v].size() == 0) {
chmax(dp[v], 0LL);
} else {
for (ll i : vec[v]) {
chmax(dp[v], lg(i) + 1);
}
}
// cout<<v<<endl;
return dp[v];
}
}
int main() {
cin >> N >> M;
ll x, y;
for (int i = 0; i < M; i++) {
cin >> x >> y;
vec[x - 1].push_back(y - 1);
}
for (int i = 0; i <= N; i++)
dp[i] = -1;
ll res = 0;
for (ll i = 0; i < N; i++) {
chmax(res, lg(i));
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
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;
}
#define ll long long
const ll INF = 1LL << 60;
// 入力
ll N, M;
vector<vector<ll>> vec(100010);
// dp
ll dp[100010];
ll lg(ll v) {
// 頂点vからの最も長い矢印の長さ
if (dp[v] != -1) {
return dp[v];
} else {
if (vec[v].size() == 0) {
chmax(dp[v], 0LL);
} else {
for (ll i : vec[v]) {
chmax(dp[v], lg(i) + 1);
}
}
// cout<<v<<endl;
return dp[v];
}
}
int main() {
cin >> N >> M;
ll x, y;
for (int i = 0; i < M; i++) {
cin >> x >> y;
vec[x - 1].push_back(y - 1);
}
for (int i = 0; i <= N; i++)
dp[i] = -1;
ll res = 0;
for (ll i = 0; i < N; i++) {
chmax(res, lg(i));
}
cout << res << endl;
}
|
replace
| 22 | 23 | 22 | 23 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define endl '\n'
#define exists(s, e) (s.find(e) != s.end())
#define WHILE(n)
#define pb push_back
#define f first
#define s second
#define UNI(vec) vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
typedef long long ll;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::pair<int, pii> piii;
const int INF = 0x3f3f3f3f;
#define MAXN 10001
using namespace std;
int n, m, ans;
int dp[MAXN];
vector<int> a[MAXN];
int dfs(int cur) {
if (dp[cur])
return dp[cur];
int an = 0;
for (int i : a[cur]) {
dfs(i);
an = max(an, dp[i] + 1);
}
return dp[cur] = an;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0, x, y; i < m; i++) {
cin >> x >> y;
a[x].pb(y);
}
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i));
}
cout << ans;
}
|
#include <bits/stdc++.h>
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define endl '\n'
#define exists(s, e) (s.find(e) != s.end())
#define WHILE(n)
#define pb push_back
#define f first
#define s second
#define UNI(vec) vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
typedef long long ll;
typedef long double ld;
typedef std::pair<int, int> pii;
typedef std::pair<int, pii> piii;
const int INF = 0x3f3f3f3f;
#define MAXN 100001
using namespace std;
int n, m, ans;
int dp[MAXN];
vector<int> a[MAXN];
int dfs(int cur) {
if (dp[cur])
return dp[cur];
int an = 0;
for (int i : a[cur]) {
dfs(i);
an = max(an, dp[i] + 1);
}
return dp[cur] = an;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0, x, y; i < m; i++) {
cin >> x >> y;
a[x].pb(y);
}
for (int i = 1; i <= n; i++) {
ans = max(ans, dfs(i));
}
cout << ans;
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define sc second
using namespace std;
const int N = 1e5 + 5;
int d[N], v[N];
vector<int> adj[N];
int dfs(int i) {
v[i] = 1;
for (int j = 0; j < (int)adj[i].size(); j++) {
d[i] = max(d[i], dfs(adj[i][j]));
}
return d[i] + 1;
}
int main() {
int n, m;
cin >> n >> m;
ii s[N];
for (int i = 1; i <= n; i++) {
s[i].second = i;
}
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[v].push_back(u);
s[u].first += 1;
}
sort(s + 1, s + n + 1);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!v[s[i].second]) {
dfs(s[i].second);
ans = max(ans, d[s[i].second]);
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define sc second
using namespace std;
const int N = 1e5 + 5;
int d[N], v[N];
vector<int> adj[N];
int dfs(int i) {
v[i] = 1;
for (int j = 0; j < (int)adj[i].size(); j++) {
int t = adj[i][j];
if (v[t])
t = d[t] + 1;
else
t = dfs(t);
d[i] = max(d[i], t);
}
return d[i] + 1;
}
int main() {
int n, m;
cin >> n >> m;
ii s[N];
for (int i = 1; i <= n; i++) {
s[i].second = i;
}
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[v].push_back(u);
s[u].first += 1;
}
sort(s + 1, s + n + 1);
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!v[s[i].second]) {
dfs(s[i].second);
ans = max(ans, d[s[i].second]);
}
}
cout << ans << '\n';
}
|
replace
| 14 | 15 | 14 | 20 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
lli n, m;
vector<vector<lli>> v(10010);
vector<lli> dp(10010);
vector<bool> seen(10010);
lli f(lli x) {
if (seen[x])
return dp[x];
seen[x] = true;
lli mx = 0;
for (auto to : v[x]) {
mx = max(mx, f(to) + 1);
}
return dp[x] = mx;
}
int main(void) {
cin >> n >> m;
rep(i, m) {
lli a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
}
lli ans = 0;
rep(i, n) { ans = max(ans, f(i)); }
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
lli n, m;
vector<vector<lli>> v(100100);
vector<lli> dp(100100);
vector<bool> seen(100100);
lli f(lli x) {
if (seen[x])
return dp[x];
seen[x] = true;
lli mx = 0;
for (auto to : v[x]) {
mx = max(mx, f(to) + 1);
}
return dp[x] = mx;
}
int main(void) {
cin >> n >> m;
rep(i, m) {
lli a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
}
lli ans = 0;
rep(i, n) { ans = max(ans, f(i)); }
cout << ans << endl;
return 0;
}
|
replace
| 20 | 23 | 20 | 23 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
vector<int> e[100000];
int num[100000];
void dfs(int v) {
int ma = -1;
for (int u : e[v]) {
dfs(u);
ma = max(ma, num[u]);
}
num[v] = ma + 1;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
e[x].push_back(y);
}
for (int i = 0; i < n; i++) {
num[i] = -1;
}
for (int i = 0; i < n; i++) {
if (num[i] == -1) {
dfs(i);
}
}
int ans = -1;
for (int i = 0; i < n; i++) {
ans = max(ans, num[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
vector<int> e[100000];
int num[100000];
void dfs(int v) {
int ma = -1;
for (int u : e[v]) {
if (num[u] == -1)
dfs(u);
ma = max(ma, num[u]);
}
num[v] = ma + 1;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x, --y;
e[x].push_back(y);
}
for (int i = 0; i < n; i++) {
num[i] = -1;
}
for (int i = 0; i < n; i++) {
if (num[i] == -1) {
dfs(i);
}
}
int ans = -1;
for (int i = 0; i < n; i++) {
ans = max(ans, num[i]);
}
cout << ans << endl;
}
|
replace
| 12 | 13 | 12 | 14 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#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;
}
|
replace
| 44 | 45 | 44 | 45 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define fi first
#define se second
const int LEN = 2e5 + 5;
const int LEN5 = 1e5 + 5;
const int MOD = 1e9 + 7;
typedef long long ll;
int n, m;
int dp[LEN5];
vector<int> adj[LEN5];
void sol(int x) {
dp[x] = 0;
for (auto v : adj[x]) {
sol(v);
dp[x] = max(dp[x], 1 + dp[v]);
}
}
int main() {
// freopen ("myfile.txt","r",stdin);
// freopen ("myfile.txt","w",stdout);
// ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
scanf("%d%d", &x, &y);
adj[x].push_back(y);
}
for (int i = 0; i < LEN5; i++)
dp[i] = -1;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (dp[i] == -1) {
sol(i);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define fi first
#define se second
const int LEN = 2e5 + 5;
const int LEN5 = 1e5 + 5;
const int MOD = 1e9 + 7;
typedef long long ll;
int n, m;
int dp[LEN5];
vector<int> adj[LEN5];
void sol(int x) {
if (dp[x] != -1)
return;
dp[x] = 0;
for (auto v : adj[x]) {
sol(v);
dp[x] = max(dp[x], 1 + dp[v]);
}
}
int main() {
// freopen ("myfile.txt","r",stdin);
// freopen ("myfile.txt","w",stdout);
// ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
scanf("%d%d", &x, &y);
adj[x].push_back(y);
}
for (int i = 0; i < LEN5; i++)
dp[i] = -1;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (dp[i] == -1) {
sol(i);
}
ans = max(ans, dp[i]);
}
cout << ans << endl;
}
|
insert
| 13 | 13 | 13 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b; // aをbで更新
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b; // aをbで更新
return true;
}
return false;
}
vi dp(1000000, -1);
vvi G(1000000);
ll rec(int v) {
if (dp[v] >= 0) {
return dp[v];
}
if (G[v].size() == 0) {
return 0;
}
ll ret = -1;
for (auto nv : G[v]) {
ret = max(ret, rec(nv) + 1);
}
return ret;
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
}
ll ans = -1;
rep(i, N) { ans = max(ans, rec(i)); }
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1 << 30;
const ll INFll = 1ll << 60;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b; // aをbで更新
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b; // aをbで更新
return true;
}
return false;
}
vi dp(1000000, -1);
vvi G(1000000);
ll rec(int v) {
if (dp[v] >= 0) {
return dp[v];
}
if (G[v].size() == 0) {
return 0;
}
ll ret = -1;
for (auto nv : G[v]) {
ret = max(ret, rec(nv) + 1);
}
return dp[v] = ret;
}
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
}
ll ans = -1;
rep(i, N) { ans = max(ans, rec(i)); }
cout << ans << endl;
return 0;
}
|
replace
| 40 | 41 | 40 | 41 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define endl "\n"
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define LL long long
#define mod 1000000007LL
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define pp pop_back
// #define p push
#define I insert
#define bg begin()
#define ed end()
#define sz size()
#define all(v) v.begin(), v.end()
typedef vector<LL> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef map<LL, LL> mii;
// typedef priority_queue<int> pq;
typedef queue<int> que;
typedef stack<int> stk;
#define Inf 100000005LL
#define f first
#define s second
vi vect_2pow;
void pow_of_2() {
vect_2pow.assign(32, 0);
for (int i = 0; i <= 32; i++) {
LL y = 1 << i;
vect_2pow[i] = y;
}
}
bool Ispalindrome(string str) {
LL len = str.size();
bool flag;
for (int i = 0; i < len / 2; i++) {
if (str[i] == str[len - i - 1]) {
flag = 0;
continue;
} else {
flag = 1;
break;
}
}
if (flag == 1)
return false;
else
return true;
}
vector<LL> prime_check;
mii get_high_prime;
int high_prime_factor() {
// cout<<"ecd";
LL max_prime = 0;
for (int i = 2; i < 100000; i++) {
LL n = i;
while (n % 2 == 0) {
max_prime = 2;
n >>= 1;
}
for (int j = 3; j <= sqrt(n); j++) {
while (n % j == 0) {
max_prime = j;
n /= j;
}
}
if (n > 2)
max_prime = n;
// prime_check.pb(max_prime);
get_high_prime[i] = max_prime;
}
}
// const LL inf = 10e+9;
void max_self(LL &a, LL b) { a = max(a, b); }
const int maxi = 1e5 + 5;
vector<int> vect[100000];
vector<int> dp(maxi);
vi indegre(maxi);
LL j = 0;
vector<bool> visited(maxi);
void dfs(int k) {
assert(!visited[k]);
visited[k] = true;
for (auto x : vect[k]) {
dp[x] = max(dp[x], dp[k] + 1);
--indegre[x];
if (indegre[x] == 0)
dfs(x);
}
}
int main() {
int n, e;
cin >> n >> e;
// visited.assign(n+1,false);
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
vect[a].pb(b);
++indegre[b];
}
for (int i = 1; i <= n; i++) {
if (!visited[i] && indegre[i] == 0)
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define endl "\n"
#define FILEIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define LL long long
#define mod 1000000007LL
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define pp pop_back
// #define p push
#define I insert
#define bg begin()
#define ed end()
#define sz size()
#define all(v) v.begin(), v.end()
typedef vector<LL> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef map<LL, LL> mii;
// typedef priority_queue<int> pq;
typedef queue<int> que;
typedef stack<int> stk;
#define Inf 100000005LL
#define f first
#define s second
vi vect_2pow;
void pow_of_2() {
vect_2pow.assign(32, 0);
for (int i = 0; i <= 32; i++) {
LL y = 1 << i;
vect_2pow[i] = y;
}
}
bool Ispalindrome(string str) {
LL len = str.size();
bool flag;
for (int i = 0; i < len / 2; i++) {
if (str[i] == str[len - i - 1]) {
flag = 0;
continue;
} else {
flag = 1;
break;
}
}
if (flag == 1)
return false;
else
return true;
}
vector<LL> prime_check;
mii get_high_prime;
int high_prime_factor() {
// cout<<"ecd";
LL max_prime = 0;
for (int i = 2; i < 100000; i++) {
LL n = i;
while (n % 2 == 0) {
max_prime = 2;
n >>= 1;
}
for (int j = 3; j <= sqrt(n); j++) {
while (n % j == 0) {
max_prime = j;
n /= j;
}
}
if (n > 2)
max_prime = n;
// prime_check.pb(max_prime);
get_high_prime[i] = max_prime;
}
}
// const LL inf = 10e+9;
void max_self(LL &a, LL b) { a = max(a, b); }
const int maxi = 1e5 + 5;
vector<int> vect[maxi];
vector<int> dp(maxi);
vi indegre(maxi);
LL j = 0;
vector<bool> visited(maxi);
void dfs(int k) {
assert(!visited[k]);
visited[k] = true;
for (auto x : vect[k]) {
dp[x] = max(dp[x], dp[k] + 1);
--indegre[x];
if (indegre[x] == 0)
dfs(x);
}
}
int main() {
int n, e;
cin >> n >> e;
// visited.assign(n+1,false);
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
vect[a].pb(b);
++indegre[b];
}
for (int i = 1; i <= n; i++) {
if (!visited[i] && indegre[i] == 0)
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << endl;
}
|
replace
| 88 | 89 | 88 | 89 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> adj[1000005];
long long F[1000005], a, b, n, m, dd[1000005], res;
long long dfs(long long u) {
for (long long v : adj[u])
F[u] = max(F[u], dfs(v) + 1);
return F[u];
}
int main() {
// freopen("LONGEST.INP", "r", stdin);
cin >> n >> m;
for (long long i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
for (long long i = 1; i <= n; i++)
if (!dd[i]) {
dd[i] = 1;
dfs(i);
}
for (long long i = 1; i <= n; i++)
res = max(res, F[i]);
cout << res;
return 0;
}
|
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> adj[1000005];
long long F[1000005], a, b, n, m, dd[1000005], res;
long long dfs(long long u) {
for (long long v : adj[u])
if (!dd[v]) {
dd[v] = 1;
F[u] = max(F[u], dfs(v) + 1);
} else
F[u] = max(F[u], F[v] + 1);
return F[u];
}
int main() {
// freopen("LONGEST.INP", "r", stdin);
cin >> n >> m;
for (long long i = 1; i <= m; i++) {
cin >> a >> b;
adj[a].push_back(b);
}
for (long long i = 1; i <= n; i++)
if (!dd[i]) {
dd[i] = 1;
dfs(i);
}
for (long long i = 1; i <= n; i++)
res = max(res, F[i]);
cout << res;
return 0;
}
|
replace
| 8 | 9 | 8 | 13 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> *edges, int n, int i, int *dp) {
int leaf = 1;
int ans = 0;
for (auto x : edges[i]) {
leaf = 0;
int t = solve(edges, n, x, dp);
ans = max(ans, t);
}
if (leaf == 1) {
return dp[i] = 0;
}
return dp[i] = 1 + ans;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> edges[n + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
edges[u].push_back(v);
}
int ans = INT_MIN;
int dp[n + 1];
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
if (dp[i] != -1) {
ans = max(ans, dp[i]);
} else {
ans = max(ans, solve(edges, n, i, dp));
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> *edges, int n, int i, int *dp) {
int leaf = 1;
int ans = 0;
for (auto x : edges[i]) {
leaf = 0;
int t;
if (dp[x] == -1) {
t = solve(edges, n, x, dp);
} else {
t = dp[x];
}
ans = max(ans, t);
}
if (leaf == 1) {
return dp[i] = 0;
}
return dp[i] = 1 + ans;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> edges[n + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
edges[u].push_back(v);
}
int ans = INT_MIN;
int dp[n + 1];
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
if (dp[i] != -1) {
ans = max(ans, dp[i]);
} else {
ans = max(ans, solve(edges, n, i, dp));
}
}
cout << ans << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 13 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define endl '\n'
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ini(a, n, b) \
for (ll int i = 0; i < n; i++) \
a[i] = 0;
#define cset(a) __builtin_popcountll(a)
#define hell (ull)1e9
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << endl; \
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define re resize
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
err(++it, args...);
}
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char ch) { return string("'") + ch + string("'"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class InputIterator>
string to_string(InputIterator first, InputIterator last) {
bool start = true;
string res = "{";
while (first != last) {
if (!start) {
res += ", ";
}
start = false;
res += to_string(*first);
++first;
}
res += "}";
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
template <typename A, typename B>
istream &operator>>(istream &input, pair<A, B> &x) {
input >> x.F >> x.S;
return input;
}
template <typename A> istream &operator>>(istream &input, vector<A> &x) {
for (auto &i : x)
input >> i;
return input;
}
int n, m;
vi adj[(ll)1e5 + 1];
bool vis[(ll)1e5 + 1];
int dp[(ll)1e5 + 1];
void dfs(int s) {
vis[s] = 1;
for (int i : adj[s])
if (!vis[i])
dfs(i);
for (int i : adj[s])
dp[s] = max(dp[s], dp[i]);
dp[s]++;
}
signed main(void) {
ios
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n >> m;
rep(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
rep(i, 1, n + 1) if (!vis[i]) dfs(i);
int ans = 0;
rep(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define endl '\n'
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define F first
#define S second
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ini(a, n, b) \
for (ll int i = 0; i < n; i++) \
a[i] = 0;
#define cset(a) __builtin_popcountll(a)
#define hell (ull)1e9
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << endl; \
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define re resize
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
err(++it, args...);
}
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char ch) { return string("'") + ch + string("'"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class InputIterator>
string to_string(InputIterator first, InputIterator last) {
bool start = true;
string res = "{";
while (first != last) {
if (!start) {
res += ", ";
}
start = false;
res += to_string(*first);
++first;
}
res += "}";
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
template <typename A, typename B>
istream &operator>>(istream &input, pair<A, B> &x) {
input >> x.F >> x.S;
return input;
}
template <typename A> istream &operator>>(istream &input, vector<A> &x) {
for (auto &i : x)
input >> i;
return input;
}
int n, m;
vi adj[(ll)1e5 + 1];
bool vis[(ll)1e5 + 1];
int dp[(ll)1e5 + 1];
void dfs(int s) {
vis[s] = 1;
for (int i : adj[s])
if (!vis[i])
dfs(i);
for (int i : adj[s])
dp[s] = max(dp[s], dp[i]);
dp[s]++;
}
signed main(void) {
ios cin >> n >> m;
rep(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
}
rep(i, 1, n + 1) if (!vis[i]) dfs(i);
int ans = 0;
rep(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans - 1 << endl;
}
|
replace
| 117 | 123 | 117 | 118 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
const ll MAX = 1000000;
const ll MOD = 1000000007;
ll fac[MAX];
// テーブルを作る前処理
/*
void COMinit() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
}
}
*/
ll pow_kai(ll a, ll n) { // aのn乗を計算します。
ll x = 1;
while (n > 0) { // 全てのbitが捨てられるまで。
if (n & 1) { // 1番右のbitが1のとき。
x = x * a % MOD;
}
a = a * a % MOD;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる。
}
return x;
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll tmp = 1;
for (ll i = n; i >= n - k + 1; i--)
tmp = (tmp * i) % MOD;
return (tmp * pow_kai(fac[k], MOD - 2)) % MOD;
}
ll N, M;
ll dp[100001];
vector<vector<ll>> G;
void chmax(ll &a, const ll &b) {
if (a < b)
a = b;
}
void chmin(ll &a, const ll &b) {
if (a > b)
a = b;
}
ll rec(ll v) {
if (dp[v] != -1)
return dp[v];
ll res = 0;
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
int main() {
cin >> N >> M;
G.assign(N + 1, vector<ll>());
ll a, b;
rep(i, M) {
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, N + 1) dp[i] = -1;
ll ans = 0;
for (ll v = 1; v <= N; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
const ll MAX = 1000000;
const ll MOD = 1000000007;
ll fac[MAX];
// テーブルを作る前処理
/*
void COMinit() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
}
}
*/
ll pow_kai(ll a, ll n) { // aのn乗を計算します。
ll x = 1;
while (n > 0) { // 全てのbitが捨てられるまで。
if (n & 1) { // 1番右のbitが1のとき。
x = x * a % MOD;
}
a = a * a % MOD;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる。
}
return x;
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll tmp = 1;
for (ll i = n; i >= n - k + 1; i--)
tmp = (tmp * i) % MOD;
return (tmp * pow_kai(fac[k], MOD - 2)) % MOD;
}
ll N, M;
ll dp[100001];
vector<vector<ll>> G;
void chmax(ll &a, const ll &b) {
if (a < b)
a = b;
}
void chmin(ll &a, const ll &b) {
if (a > b)
a = b;
}
ll rec(ll v) {
if (dp[v] != -1)
return dp[v];
ll res = 0;
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return dp[v] = res;
}
int main() {
cin >> N >> M;
G.assign(N + 1, vector<ll>());
ll a, b;
rep(i, M) {
cin >> a >> b;
G[a].push_back(b);
}
rep(i, N + 1) dp[i] = -1;
ll ans = 0;
for (ll v = 1; v <= N; v++) {
chmax(ans, rec(v));
}
cout << ans << endl;
return 0;
}
|
delete
| 82 | 83 | 82 | 82 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define line cout << __LINE__;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define prvp(a) \
for (auto x : a) \
cout << "{" << x.ff << ',' << x.ss << "}"; \
cout << '\n';
#define decimal_digits cout << fixed << setprecision(15);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A> string to_string(A);
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool f = 1;
string r = "{";
for (const auto &x : v) {
if (!f)
r += ", ";
f = 0;
r += to_string(x);
}
return r + "}";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define pr(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef unordered_map<int, int> umi;
typedef unordered_map<ll, ll> uml;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int bit32 = log2(inf) + 3;
const int bit64 = log2(INF) + 3;
inline int add(int a, int b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
inline int sub(int a, int b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
inline int mul(int a, int b) { return (int)((long long)a * b % mod); }
inline int modexpo(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = mul(res, a);
a = mul(a, a);
b /= 2;
}
return res;
}
inline int divide(int a, int b) { return mul(a, modexpo(b, mod - 2)); }
clock_t time_p = clock();
void ktj() {
time_p = clock() - time_p;
cerr << "Time elapsed : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void pre() { // Reset each global variable (esp. for graphs)
}
const int N = 1e5 + 5;
vector<int> g[N];
int dp[N];
bool vis[N];
void dfs(int v) {
dp[v] = 1;
for (auto u : g[v]) {
if (vis[u] == 0) {
dfs(u);
}
dp[v] = max(dp[v], 1 + dp[u]);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans - 1 << '\n';
}
int main() {
fastio
pre();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
ktj();
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define ld long double
#define forn(low, high, i) for (i = low; i < high; i++)
#define forrev(high, low, i) for (i = high; i >= low; i--)
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define line cout << __LINE__;
#define prv(a) \
for (auto x : a) \
cout << x << ' '; \
cout << '\n';
#define prvp(a) \
for (auto x : a) \
cout << "{" << x.ff << ',' << x.ss << "}"; \
cout << '\n';
#define decimal_digits cout << fixed << setprecision(15);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A> string to_string(A);
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool f = 1;
string r = "{";
for (const auto &x : v) {
if (!f)
r += ", ";
f = 0;
r += to_string(x);
}
return r + "}";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define pr(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef unordered_map<int, int> umi;
typedef unordered_map<ll, ll> uml;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const int bit32 = log2(inf) + 3;
const int bit64 = log2(INF) + 3;
inline int add(int a, int b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
inline int sub(int a, int b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
inline int mul(int a, int b) { return (int)((long long)a * b % mod); }
inline int modexpo(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = mul(res, a);
a = mul(a, a);
b /= 2;
}
return res;
}
inline int divide(int a, int b) { return mul(a, modexpo(b, mod - 2)); }
clock_t time_p = clock();
void ktj() {
time_p = clock() - time_p;
cerr << "Time elapsed : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void pre() { // Reset each global variable (esp. for graphs)
}
const int N = 1e5 + 5;
vector<int> g[N];
int dp[N];
bool vis[N];
void dfs(int v) {
dp[v] = 1;
vis[v] = 1;
for (auto u : g[v]) {
if (vis[u] == 0) {
dfs(u);
}
dp[v] = max(dp[v], 1 + dp[u]);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, dp[i]);
}
cout << ans - 1 << '\n';
}
int main() {
fastio
pre();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
ktj();
}
|
insert
| 119 | 119 | 119 | 120 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (int i = a; i >= (n); --i)
#define fill(a) memset(a, 0, sizeof(a))
#define revsort(a, b) sort(a, b, greater<int>())
#define dout \
if (DEBUGGING) \
cout
#define dbg if (DEBUGGING)
#define endl "\n"
int DEBUGGING = 0;
const int INF = 1000000000;
const int MOD = 1000000007;
const double PI = 3.1415926535897932;
const double EPS = 1e-7;
void dfs(int s, vector<int> &used, vector<int> &dp, vector<int> adj[]) {
if (used[s] == 1)
return;
int max = -1;
for (int i : adj[s]) {
dfs(i, used, dp, adj);
}
for (int i : adj[s]) {
if (max < dp[i])
max = dp[i];
}
dp[s] = 1 + max;
return;
}
void solve(int TEST_CASE) {
int n, m;
cin >> n >> m;
vector<int> adj[n];
int p, q;
fr(i, m) {
cin >> p >> q;
adj[p - 1].push_back(q - 1);
}
vector<int> used(n);
vector<int> dp(n);
fr(i, n) {
if (used[i] == 0) {
dfs(i, used, dp, adj);
}
}
cout << *max_element(dp.begin(), dp.end()) << " ";
}
int main(int argc, char *argv[]) {
if (argc == 2 && argv[1][1] == 'v')
DEBUGGING = 1;
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int nTestCases = 1;
// cin >> nTestCases;
frA(i, 1, nTestCases) solve(i);
return 0;
}
|
// Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (int i = a; i >= (n); --i)
#define fill(a) memset(a, 0, sizeof(a))
#define revsort(a, b) sort(a, b, greater<int>())
#define dout \
if (DEBUGGING) \
cout
#define dbg if (DEBUGGING)
#define endl "\n"
int DEBUGGING = 0;
const int INF = 1000000000;
const int MOD = 1000000007;
const double PI = 3.1415926535897932;
const double EPS = 1e-7;
void dfs(int s, vector<int> &used, vector<int> &dp, vector<int> adj[]) {
if (used[s] == 1)
return;
int max = -1;
for (int i : adj[s]) {
dfs(i, used, dp, adj);
}
for (int i : adj[s]) {
if (max < dp[i])
max = dp[i];
}
dp[s] = 1 + max;
used[s] = 1;
return;
}
void solve(int TEST_CASE) {
int n, m;
cin >> n >> m;
vector<int> adj[n];
int p, q;
fr(i, m) {
cin >> p >> q;
adj[p - 1].push_back(q - 1);
}
vector<int> used(n);
vector<int> dp(n);
fr(i, n) {
if (used[i] == 0) {
dfs(i, used, dp, adj);
}
}
cout << *max_element(dp.begin(), dp.end()) << " ";
}
int main(int argc, char *argv[]) {
if (argc == 2 && argv[1][1] == 'v')
DEBUGGING = 1;
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int nTestCases = 1;
// cin >> nTestCases;
frA(i, 1, nTestCases) solve(i);
return 0;
}
|
insert
| 39 | 39 | 39 | 40 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LL long long
#define ull unsigned ll
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
template <typename T> inline void smin(T &a, T b) { a = a < b ? a : b; }
template <typename T> inline void smax(T &a, T b) { a = a > b ? a : b; }
template <typename T> inline void Int(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n *= f;
}
template <typename T, typename TT> inline void Int(T &n, TT &m) {
Int(n), Int(m);
}
template <typename T, typename TT, typename TTT>
inline void Int(T &n, TT &m, TTT &l) {
Int(n), Int(m, l);
}
#define error(args...) \
{ \
string _s = #args; \
replace(all(_s), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
err(++it, args...);
}
const int mod = (int)1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
int sub(int a, int b) {
a -= b;
if (a <= 0)
a += mod;
return a;
}
int mul(int a, int b) { return (ll)a * b % mod; }
const int inf = (int)1e9 + 5;
const ll Inf = (ll)2e18 + 5;
const int N = (int)3e3 + 5;
vector<int> g[N];
int dp[N], vis[N];
void dfs(int u) {
vis[u] = 1;
for (int v : g[u]) {
if (!vis[v])
dfs(v);
smax(dp[u], dp[v] + 1);
}
}
int solve() {
int n, m;
Int(n, m);
for (int i = 1; i <= m; i++) {
int u, v;
Int(u, v);
g[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
smax(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
int main() {
int test = 1, tc = 0;
// Int(test);
while (test--) {
// printf("Case %d: ", ++tc);
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LL long long
#define ull unsigned ll
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define ff first
#define ss second
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
template <typename T> inline void smin(T &a, T b) { a = a < b ? a : b; }
template <typename T> inline void smax(T &a, T b) { a = a > b ? a : b; }
template <typename T> inline void Int(T &n) {
n = 0;
int f = 1;
register int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
n = (n << 3) + (n << 1) + ch - '0';
n *= f;
}
template <typename T, typename TT> inline void Int(T &n, TT &m) {
Int(n), Int(m);
}
template <typename T, typename TT, typename TTT>
inline void Int(T &n, TT &m, TTT &l) {
Int(n), Int(m, l);
}
#define error(args...) \
{ \
string _s = #args; \
replace(all(_s), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ", ";
err(++it, args...);
}
const int mod = (int)1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
int sub(int a, int b) {
a -= b;
if (a <= 0)
a += mod;
return a;
}
int mul(int a, int b) { return (ll)a * b % mod; }
const int inf = (int)1e9 + 5;
const ll Inf = (ll)2e18 + 5;
const int N = (int)3e5 + 5;
vector<int> g[N];
int dp[N], vis[N];
void dfs(int u) {
vis[u] = 1;
for (int v : g[u]) {
if (!vis[v])
dfs(v);
smax(dp[u], dp[v] + 1);
}
}
int solve() {
int n, m;
Int(n, m);
for (int i = 1; i <= m; i++) {
int u, v;
Int(u, v);
g[u].push_back(v);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
smax(ans, dp[i]);
}
printf("%d\n", ans);
return 0;
}
int main() {
int test = 1, tc = 0;
// Int(test);
while (test--) {
// printf("Case %d: ", ++tc);
solve();
}
return 0;
}
|
replace
| 69 | 70 | 69 | 70 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100];
int dp[100];
int f(int src) {
if (dp[src] != -1)
return dp[src];
int ans = 0;
int flag = 0;
for (auto i : g[src]) {
flag = 1;
ans = max(ans, f(i));
}
return dp[src] = flag == 1 ? ans + 1 : 0;
}
int main() {
memset(dp, -1, sizeof(dp));
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, f(i));
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define maxx 100005
vector<int> g[maxx];
int dp[maxx];
int f(int src) {
if (dp[src] != -1)
return dp[src];
int ans = 0;
int flag = 0;
for (auto i : g[src]) {
flag = 1;
ans = max(ans, f(i));
}
return dp[src] = flag == 1 ? ans + 1 : 0;
}
int main() {
memset(dp, -1, sizeof(dp));
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, f(i));
cout << ans;
}
|
replace
| 2 | 4 | 2 | 5 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> graph[10000];
int dp[1000];
int lenof(int src) {
bool leaf = 1;
if (dp[src] != -1) {
return dp[src];
}
int bestchild = 0;
for (auto child : graph[src]) {
leaf = 0;
bestchild = max(bestchild, lenof(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
int main() {
memset(dp, -1, sizeof(dp));
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, lenof(i));
}
cout << ans;
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> graph[100001];
int dp[100001];
int lenof(int src) {
bool leaf = 1;
if (dp[src] != -1) {
return dp[src];
}
int bestchild = 0;
for (auto child : graph[src]) {
leaf = 0;
bestchild = max(bestchild, lenof(child));
}
return dp[src] = leaf ? 0 : 1 + bestchild;
}
int main() {
memset(dp, -1, sizeof(dp));
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph[x].push_back(y);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, lenof(i));
}
cout << ans;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define ff(i, x, n, k) for (int i = x; i < n; i += k)
#define rf(i, x, n, k) for (int i = n - 1; i >= x; i += k)
#define ef(i, x, n, k) for (int i = x; i <= n; i += k)
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const ll INF = pow(10, 18) + 5;
vector<vector<int>> graph(210000);
int maxPath[210000] = {0};
bool visit[210000] = {false};
int dfs(int n) {
for (auto u : graph[n])
maxPath[n] = max(maxPath[n], dfs(u) + 1);
visit[n] = true;
if (visit[n] == true) {
return maxPath[n];
}
}
int main() {
fast_cin();
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
graph[x].pb(y);
}
int store = 0;
for (int i = 1; i <= n; ++i) {
store = dfs(i);
}
int MAX = 0;
for (int i = 1; i <= n; ++i) {
MAX = max(MAX, maxPath[i]);
}
cout << MAX << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define ff(i, x, n, k) for (int i = x; i < n; i += k)
#define rf(i, x, n, k) for (int i = n - 1; i >= x; i += k)
#define ef(i, x, n, k) for (int i = x; i <= n; i += k)
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const ll INF = pow(10, 18) + 5;
vector<vector<int>> graph(210000);
int maxPath[210000] = {0};
bool visit[210000] = {false};
int dfs(int n) {
if (maxPath[n] != 0)
return maxPath[n];
for (auto u : graph[n])
maxPath[n] = max(maxPath[n], dfs(u) + 1);
visit[n] = true;
if (visit[n] == true) {
return maxPath[n];
}
}
int main() {
fast_cin();
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
graph[x].pb(y);
}
int store = 0;
for (int i = 1; i <= n; ++i) {
store = dfs(i);
}
int MAX = 0;
for (int i = 1; i <= n; ++i) {
MAX = max(MAX, maxPath[i]);
}
cout << MAX << '\n';
return 0;
}
|
insert
| 29 | 29 | 29 | 32 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// hail to jwalaji
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
vector<vector<lli>> adj(100005, vector<lli>());
vector<lli> store(100005, -1);
lli dfs(lli u, lli parent = -1) {
lli maxa = 1;
lli storemax = 0;
for (auto &v : adj[u]) {
if (v == parent)
continue;
else {
storemax = max(storemax, dfs(v, u));
}
}
store[u] = maxa + storemax;
return maxa + storemax;
}
void solve(lli n) {
lli finalmax = 0;
for (lli i = 1; i <= n; i++) {
if (store[i] != -1) {
finalmax = max(finalmax, store[i]);
} else
;
finalmax = max(finalmax, dfs(i, -1));
// cout<<finalmax-1<<" "<<i<<" hello "<<endl;
}
cout << finalmax - 1 << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
lli n, m;
cin >> n >> m;
for (lli i = 0; i < m; i++) {
lli x, y;
cin >> x >> y;
adj[x].push_back(y);
}
solve(n);
return 0;
}
|
// hail to jwalaji
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
vector<vector<lli>> adj(100005, vector<lli>());
vector<lli> store(100005, -1);
lli dfs(lli u, lli parent = -1) {
lli maxa = 1;
lli storemax = 0;
for (auto &v : adj[u]) {
if (v == parent)
continue;
else {
if (store[v] != -1) {
storemax = max(storemax, store[v]);
} else
storemax = max(storemax, dfs(v, u));
}
}
store[u] = maxa + storemax;
return maxa + storemax;
}
void solve(lli n) {
lli finalmax = 0;
for (lli i = 1; i <= n; i++) {
if (store[i] != -1) {
finalmax = max(finalmax, store[i]);
} else
;
finalmax = max(finalmax, dfs(i, -1));
// cout<<finalmax-1<<" "<<i<<" hello "<<endl;
}
cout << finalmax - 1 << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
lli n, m;
cin >> n >> m;
for (lli i = 0; i < m; i++) {
lli x, y;
cin >> x >> y;
adj[x].push_back(y);
}
solve(n);
return 0;
}
|
replace
| 13 | 14 | 13 | 17 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
ll mod = 1000000007;
ll n_pow(ll a, ll n) {
if (n == 0)
return 1;
ll t = n_pow(a, n / 2);
t *= t;
t %= mod;
if (n % 2 == 1)
t *= a;
return t % mod;
}
const int INF = 1001001001;
// const ll INF = 1e18;
vector<vector<int>> path(10050);
int rec(vector<int> &dp, int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int p : path[v]) {
res = max(res, rec(dp, p) + 1);
}
return dp[v] = res;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x;
--y;
path[x].push_back(y);
}
vector<int> dp(n, -1);
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(dp, i));
}
cout << ans << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
ll mod = 1000000007;
ll n_pow(ll a, ll n) {
if (n == 0)
return 1;
ll t = n_pow(a, n / 2);
t *= t;
t %= mod;
if (n % 2 == 1)
t *= a;
return t % mod;
}
const int INF = 1001001001;
// const ll INF = 1e18;
vector<vector<int>> path(100050);
int rec(vector<int> &dp, int v) {
if (dp[v] != -1)
return dp[v];
int res = 0;
for (int p : path[v]) {
res = max(res, rec(dp, p) + 1);
}
return dp[v] = res;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
--x;
--y;
path[x].push_back(y);
}
vector<int> dp(n, -1);
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, rec(dp, i));
}
cout << ans << endl;
return 0;
}
|
replace
| 32 | 33 | 32 | 33 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < (int)n; i++)
#define rf(i, n, a) for (int i = n; i >= a; i--)
#define F first
#define S second
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
#define d1(a) cout << a << "\n"
#define d2(a, b) cout << a << " " << b << "\n"
#define d3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define d4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
typedef vector<pii> vpi;
const int inf = 1e9;
const int inf64 = 1e18;
const int MOD = inf + 7;
const int N = 1e5 + 5;
vi g[N];
int dp[N];
bool vis[N];
int ans = 0;
void dfs(int node) {
for (auto v : g[node]) {
if (!vis[v]) {
dfs(v);
}
dp[node] = max(dp[node], dp[v] + 1);
}
}
int32_t main() {
fast;
int n, m;
cin >> n >> m;
f(i, 0, m) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
f(i, 1, n + 1) if (!vis[i]) { dfs(i); }
int ans = 0;
f(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define f(i, a, n) for (int i = a; i < (int)n; i++)
#define rf(i, n, a) for (int i = n; i >= a; i--)
#define F first
#define S second
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
#define d1(a) cout << a << "\n"
#define d2(a, b) cout << a << " " << b << "\n"
#define d3(a, b, c) cout << a << " " << b << " " << c << "\n"
#define d4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << "\n"
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
typedef vector<pii> vpi;
const int inf = 1e9;
const int inf64 = 1e18;
const int MOD = inf + 7;
const int N = 1e5 + 5;
vi g[N];
int dp[N];
bool vis[N];
int ans = 0;
void dfs(int node) {
vis[node] = true;
for (auto v : g[node]) {
if (!vis[v]) {
dfs(v);
}
dp[node] = max(dp[node], dp[v] + 1);
}
}
int32_t main() {
fast;
int n, m;
cin >> n >> m;
f(i, 0, m) {
int u, v;
cin >> u >> v;
g[u].pb(v);
}
f(i, 1, n + 1) if (!vis[i]) { dfs(i); }
int ans = 0;
f(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans << "\n";
}
|
insert
| 34 | 34 | 34 | 35 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 10;
int memo[N];
bool vis[N];
vector<int> g[N];
int dp(int u) {
if (vis[u])
return memo[u];
int ans = 0;
for (auto v : g[u]) {
ans = max(ans, dp(v) + 1);
}
vis[u] = true;
return memo[u] = ans;
}
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
g[a].push_back(b);
}
int res = 0;
for (int i = 1; i <= n; i++) {
res = max(res, dp(i));
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int memo[N];
bool vis[N];
vector<int> g[N];
int dp(int u) {
if (vis[u])
return memo[u];
int ans = 0;
for (auto v : g[u]) {
ans = max(ans, dp(v) + 1);
}
vis[u] = true;
return memo[u] = ans;
}
int main() {
int n, m;
cin >> n >> m;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
g[a].push_back(b);
}
int res = 0;
for (int i = 1; i <= n; i++) {
res = max(res, dp(i));
}
cout << res << "\n";
return 0;
}
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep3(n) for (int i = 0; i < n; i++)
#define inarr(arr, n) rep(i, a, n) cin >> arr[i]
#define ll long long int
#define pb push_back
#define all(v) v.begin(), v.end()
#define endl "\n"
#define eb emplace_back
#define x first
#define y second
#define gcd(a, b) __gcd(a, b)
#define mem1(a) memset(a, -1, sizeof(a))
#define pres(a, x) a.find(x) != a.end()
#define sz(a) (int)a.size()
#define pii pair<int, int>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ret return 0
#define pi 3.1415926536
#define hell 1000000007
#define narak 998244353
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
const int inf1 = 1e9;
const ll inf2 = 1e18;
const int N = 100000;
using namespace std;
using namespace __gnu_pbds;
#define ordered_set \
tree<pii, null_type, less<pii>, rb_tree_tag, \
tree_order_statistics_node_update>
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
vector<int> g[N + 5];
int lvl[N + 5];
int vis[N];
void dfs(int r) {
vis[r] = 1;
for (auto i : g[r]) {
dfs(i);
lvl[r] = max(lvl[r], 1 + lvl[i]);
}
}
int solve() {
int n, m;
cin >> n >> m;
rep3(m) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
int ma = 0;
for (int i = 1; i <= n; i++) {
if (ma < lvl[i])
ma = lvl[i];
}
cout << ma << endl;
ret;
}
int main() {
IOS;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#ifdef cat
cat();
#endif
int t = 1; // cin>>t;
while (t--) {
solve();
}
ret;
}
|
#pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rep3(n) for (int i = 0; i < n; i++)
#define inarr(arr, n) rep(i, a, n) cin >> arr[i]
#define ll long long int
#define pb push_back
#define all(v) v.begin(), v.end()
#define endl "\n"
#define eb emplace_back
#define x first
#define y second
#define gcd(a, b) __gcd(a, b)
#define mem1(a) memset(a, -1, sizeof(a))
#define pres(a, x) a.find(x) != a.end()
#define sz(a) (int)a.size()
#define pii pair<int, int>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ret return 0
#define pi 3.1415926536
#define hell 1000000007
#define narak 998244353
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
const int inf1 = 1e9;
const ll inf2 = 1e18;
const int N = 100000;
using namespace std;
using namespace __gnu_pbds;
#define ordered_set \
tree<pii, null_type, less<pii>, rb_tree_tag, \
tree_order_statistics_node_update>
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
vector<int> g[N + 5];
int lvl[N + 5];
int vis[N];
void dfs(int r) {
vis[r] = 1;
for (auto i : g[r]) {
if (!vis[i]) {
vis[i] = 1;
dfs(i);
}
lvl[r] = max(lvl[r], 1 + lvl[i]);
}
}
int solve() {
int n, m;
cin >> n >> m;
rep3(m) {
int a, b;
cin >> a >> b;
g[a].pb(b);
}
for (int i = 1; i <= n; i++) {
if (!vis[i])
dfs(i);
}
int ma = 0;
for (int i = 1; i <= n; i++) {
if (ma < lvl[i])
ma = lvl[i];
}
cout << ma << endl;
ret;
}
int main() {
IOS;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#ifdef cat
cat();
#endif
int t = 1; // cin>>t;
while (t--) {
solve();
}
ret;
}
|
replace
| 43 | 44 | 43 | 47 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/* よろしくお願いします
LEARNING DP: Longest Path
+ SIMPLE GRAPH
+ DIRECTED EDGES
+ NO CYCLE
CONSTRAINT:
+2 <= N <= 1e5
+1 <= M <= 1e5
QUESTION:
+ can we START at RANDOM Vertex
+ what should we memorize after done a DFS or BFS
IF WE KNOW:
A PATH that already done by using DFS
we can just add it to the current one.
PRE DP:
ALL PATH equal 0
TIME COMPLEXITY:
O(|S|*|T|)
*/
#include <bits/stdc++.h>
using namespace std;
#define DB(_x) cout << #_x << " is " << (_x) << "\n";
#define FOR(_a, _b) for (_a = 0; _a < _b; ++_a)
#define fs first
#define sc second
#define pb push_back
#define IOFILE
using LL = long long;
using LD = long double;
using VI = vector<int>;
using PI = pair<int, int>;
int DFS(VI &dp, vector<VI> &a, int u) {
if (dp[u])
return dp[u];
int res = 0;
for (auto v : a[u]) {
if (dp[v]) {
res = max(res, dp[v]);
} else {
res = max(res, DFS(dp, a, v));
}
}
return dp[u] = res + 1;
}
void Excalibur() {
int i = 0, j = 0, n, m, ans;
while (cin >> n >> m) {
vector<VI> a(n);
FOR(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
a[x].pb(y);
}
VI dp(n, 0);
ans = 0;
FOR(i, n) {
ans = max(ans, DFS(dp, a, i));
// DB(dp[i]);
}
cout << ans - 1 << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef IOFILE
freopen("INPUT.in", "r", stdin);
freopen("OUTPUT.out", "w", stdout);
#endif
Excalibur();
return 0;
}
|
/* よろしくお願いします
LEARNING DP: Longest Path
+ SIMPLE GRAPH
+ DIRECTED EDGES
+ NO CYCLE
CONSTRAINT:
+2 <= N <= 1e5
+1 <= M <= 1e5
QUESTION:
+ can we START at RANDOM Vertex
+ what should we memorize after done a DFS or BFS
IF WE KNOW:
A PATH that already done by using DFS
we can just add it to the current one.
PRE DP:
ALL PATH equal 0
TIME COMPLEXITY:
O(|S|*|T|)
*/
#include <bits/stdc++.h>
using namespace std;
#define DB(_x) cout << #_x << " is " << (_x) << "\n";
#define FOR(_a, _b) for (_a = 0; _a < _b; ++_a)
#define fs first
#define sc second
#define pb push_back
// #define IOFILE
using LL = long long;
using LD = long double;
using VI = vector<int>;
using PI = pair<int, int>;
int DFS(VI &dp, vector<VI> &a, int u) {
if (dp[u])
return dp[u];
int res = 0;
for (auto v : a[u]) {
if (dp[v]) {
res = max(res, dp[v]);
} else {
res = max(res, DFS(dp, a, v));
}
}
return dp[u] = res + 1;
}
void Excalibur() {
int i = 0, j = 0, n, m, ans;
while (cin >> n >> m) {
vector<VI> a(n);
FOR(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
a[x].pb(y);
}
VI dp(n, 0);
ans = 0;
FOR(i, n) {
ans = max(ans, DFS(dp, a, i));
// DB(dp[i]);
}
cout << ans - 1 << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef IOFILE
freopen("INPUT.in", "r", stdin);
freopen("OUTPUT.out", "w", stdout);
#endif
Excalibur();
return 0;
}
|
replace
| 27 | 28 | 27 | 28 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
vector<int> dp(10010, 0);
vector<vector<int>> g(10010, vector<int>());
int N, M;
int dfs(int u) {
if (dp[u])
return dp[u];
int cu = 0;
for (int i = 0; i < g[u].size(); i++) {
int to = g[u][i];
int nxt = dfs(to);
dp[u] = max(dp[u], dp[to] + 1);
}
return dp[u];
}
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
// for( int i = 1 ; i <= N ; i++ ){
// cout << i << ":";
// for( int j = 0 ; j < g[i].size() ; j++ ){
// cout << g[i][j] << " " ;
// }
// cout << endl;
// }
int ret = 0;
for (int i = 1; i <= N; i++) {
ret = max(ret, dfs(i));
}
cout << ret << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
vector<int> dp(100010, 0);
vector<vector<int>> g(100010, vector<int>());
int N, M;
int dfs(int u) {
if (dp[u])
return dp[u];
int cu = 0;
for (int i = 0; i < g[u].size(); i++) {
int to = g[u][i];
int nxt = dfs(to);
dp[u] = max(dp[u], dp[to] + 1);
}
return dp[u];
}
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
// for( int i = 1 ; i <= N ; i++ ){
// cout << i << ":";
// for( int j = 0 ; j < g[i].size() ; j++ ){
// cout << g[i][j] << " " ;
// }
// cout << endl;
// }
int ret = 0;
for (int i = 1; i <= N; i++) {
ret = max(ret, dfs(i));
}
cout << ret << endl;
return 0;
}
|
replace
| 11 | 13 | 11 | 13 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> viii;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repu(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, b, a) for (int i = b; i >= a; i--)
#define pb push_back
#define db double
#define fi first
#define se second
void dfs(int u, vector<int> adj[], int dist[], bool vis[]) {
vis[u] = true;
rep(i, adj[u].size()) {
if (!vis[adj[u][i]])
dfs(adj[u][i], adj, dist, vis);
dist[u] = max(dist[u], 1 + dist[adj[u][i]]);
}
}
int longestPath(vector<int> adj[], int s, int n) {
bool vis[n];
int dist[n];
memset(vis, false, sizeof vis);
memset(dist, 0, sizeof dist);
dist[s] = 0;
stack<int> stk;
stk.push(s);
rep(i, n) if (!vis[i]) dfs(i, adj, dist, vis);
int ma = 0;
rep(i, n) ma = max(ma, dist[i]);
return ma;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[n];
rep(i, m) {
int x, y;
cin >> x >> y;
x--, y--;
adj[x].pb(y);
}
int ma = 0;
rep(i, n) ma = max(ma, longestPath(adj, i, n));
cout << ma;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> viii;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repu(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, b, a) for (int i = b; i >= a; i--)
#define pb push_back
#define db double
#define fi first
#define se second
void dfs(int u, vector<int> adj[], int dist[], bool vis[]) {
vis[u] = true;
rep(i, adj[u].size()) {
if (!vis[adj[u][i]])
dfs(adj[u][i], adj, dist, vis);
dist[u] = max(dist[u], 1 + dist[adj[u][i]]);
}
}
int longestPath(vector<int> adj[], int s, int n) {
bool vis[n];
int dist[n];
memset(vis, false, sizeof vis);
memset(dist, 0, sizeof dist);
dist[s] = 0;
stack<int> stk;
stk.push(s);
rep(i, n) if (!vis[i]) dfs(i, adj, dist, vis);
int ma = 0;
rep(i, n) ma = max(ma, dist[i]);
return ma;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> adj[n];
rep(i, m) {
int x, y;
cin >> x >> y;
x--, y--;
adj[x].pb(y);
}
cout << longestPath(adj, 0, n);
}
|
replace
| 47 | 50 | 47 | 48 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// People only find me interesting because they can't tell whether I'm serious
// or not #include <boost/multiprecision/cpp_int.hpp>
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
typedef long long int ll;
typedef double db;
typedef __int128 s128;
typedef __uint128_t u128;
typedef unsigned long long u64;
#define int long long int
#define P 1000000007
#define Q 1000000006
#define sz(a) (ll) a.size()
#define lt(a) (ll) a.length()
#define pll pair<ll, ll>
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define bac(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define mll map<ll, ll>
#define umll unordered_map<ll, ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define teevra_gati \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define N 3005
#define PI 3.14159265359
#define inf LLONG_MAX
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
vl adj[N];
ll indeg[N], lev[N], ans = 0;
void topo(ll n) {
queue<ll> q;
f(i, 1, n + 1) if (indeg[i] == 0) q.push(i);
while (!q.empty()) {
ll f = q.front();
q.pop();
for (auto u : adj[f]) {
if (indeg[u]) {
indeg[u]--;
lev[u] = max(lev[u], 1 + lev[f]);
if (!indeg[u])
q.push(u);
}
}
}
}
void solve() {
ll n, m;
cin >> n >> m;
f(i, 0, m) {
ll x, y;
cin >> x >> y;
adj[x].pb(y);
indeg[y]++;
}
topo(n);
f(i, 1, n + 1) { ans = max(ans, lev[i]); }
cout << ans;
}
signed main() {
teevra_gati
solve();
return 0;
}
|
// People only find me interesting because they can't tell whether I'm serious
// or not #include <boost/multiprecision/cpp_int.hpp>
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
typedef long long int ll;
typedef double db;
typedef __int128 s128;
typedef __uint128_t u128;
typedef unsigned long long u64;
#define int long long int
#define P 1000000007
#define Q 1000000006
#define sz(a) (ll) a.size()
#define lt(a) (ll) a.length()
#define pll pair<ll, ll>
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define bac(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define mll map<ll, ll>
#define umll unordered_map<ll, ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define teevra_gati \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define N 100005
#define PI 3.14159265359
#define inf LLONG_MAX
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
vl adj[N];
ll indeg[N], lev[N], ans = 0;
void topo(ll n) {
queue<ll> q;
f(i, 1, n + 1) if (indeg[i] == 0) q.push(i);
while (!q.empty()) {
ll f = q.front();
q.pop();
for (auto u : adj[f]) {
if (indeg[u]) {
indeg[u]--;
lev[u] = max(lev[u], 1 + lev[f]);
if (!indeg[u])
q.push(u);
}
}
}
}
void solve() {
ll n, m;
cin >> n >> m;
f(i, 0, m) {
ll x, y;
cin >> x >> y;
adj[x].pb(y);
indeg[y]++;
}
topo(n);
f(i, 1, n + 1) { ans = max(ans, lev[i]); }
cout << ans;
}
signed main() {
teevra_gati
solve();
return 0;
}
|
replace
| 32 | 33 | 32 | 33 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \
int str; \
std::cin >> str;
#define DEBUGING(str) cout << #str << " " << str << endl
constexpr int INF = (1 << 30);
constexpr ll INFL = (1ll << 60);
constexpr ll MOD = 1000000007; // 10^9+7
int N, M;
vector<vector<int>> edges;
vector<int> dp;
int dfs(int now) {
int res = 0;
for (auto next : edges[now])
res = max(res, dfs(next) + 1);
dp[now] = res;
return res;
}
// メイン関数
int main() {
cin >> N >> M;
edges.resize(N);
dp.resize(N, -1);
REP(i, M) {
int a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
}
REP(i, N) if (dp[i] == -1) dfs(i);
cout << *max_element(dp.begin(), dp.end()) << endl;
cin >> N;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(k, m, n) for (ll(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define WAITING(str) \
int str; \
std::cin >> str;
#define DEBUGING(str) cout << #str << " " << str << endl
constexpr int INF = (1 << 30);
constexpr ll INFL = (1ll << 60);
constexpr ll MOD = 1000000007; // 10^9+7
int N, M;
vector<vector<int>> edges;
vector<int> dp;
int dfs(int now) {
if (dp[now] != -1)
return dp[now];
int res = 0;
for (auto next : edges[now])
res = max(res, dfs(next) + 1);
dp[now] = res;
return res;
}
// メイン関数
int main() {
cin >> N >> M;
edges.resize(N);
dp.resize(N, -1);
REP(i, M) {
int a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
}
REP(i, N) if (dp[i] == -1) dfs(i);
cout << *max_element(dp.begin(), dp.end()) << endl;
cin >> N;
return 0;
}
|
insert
| 24 | 24 | 24 | 26 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define make(type, x) \
type x; \
cin >> x
#define make2(type, x, y) \
type x, y; \
cin >> x >> y
#define fr(x, y) for (long long x = 0; x < y; x++)
#define makevec(x, y, n) \
vector<x> y(n); \
for (ll i = 0; i < n; i++) \
cin >> y[i]
#define M (ll)1000000007
#define MM (ll)1e8
#define INF (ll)1e18
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
template <typename T> T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1)
result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
bool sortbysec(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return a.second < b.second;
}
struct cmp {
bool operator()(const pair<int, int> &a, const pair<int, int> &b) const {
int lena = a.second - a.first + 1;
int lenb = b.second - b.first + 1;
if (lena == lenb)
return a.first < b.first;
return lena > lenb;
}
};
struct c_h {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
ll calcpow(ll x, ll y) {
ll temp;
if (y == 0)
return 1;
temp = calcpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else {
if (y > 0)
return x * temp * temp;
else
return (temp * temp) / x;
}
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll egcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1;
ll y1;
ll g = egcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return g;
}
bool isprime(ll a) {
bool flag = 1;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) {
flag = 0;
break;
}
}
return flag;
}
ll N = 1e5 + 5;
vector<vector<ll>> vec(N);
vector<ll> ans(N, -1);
ll dfs(ll e) {
ll a = 1;
ll maxi = 0;
for (auto x : vec[e]) {
maxi = max(maxi, dfs(x));
}
a += maxi;
ans[e] = a;
return a;
}
int main() {
IOS;
make2(ll, n, m);
fr(i, m) {
make2(ll, x, y);
vec[--x].push_back(--y);
}
fr(i, n) {
if (ans[i] == -1)
dfs(i);
}
ll maxi = 1;
// fr(i,n) cout<<ans[i]<<" ";
fr(i, n) maxi = max(maxi, ans[i]);
cout << maxi - 1 << endl;
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define make(type, x) \
type x; \
cin >> x
#define make2(type, x, y) \
type x, y; \
cin >> x >> y
#define fr(x, y) for (long long x = 0; x < y; x++)
#define makevec(x, y, n) \
vector<x> y(n); \
for (ll i = 0; i < n; i++) \
cin >> y[i]
#define M (ll)1000000007
#define MM (ll)1e8
#define INF (ll)1e18
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
using namespace std;
template <typename T> T modpow(T base, T exp, T modulus) {
base %= modulus;
T result = 1;
while (exp > 0) {
if (exp & 1)
result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
bool sortbysec(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return a.second < b.second;
}
struct cmp {
bool operator()(const pair<int, int> &a, const pair<int, int> &b) const {
int lena = a.second - a.first + 1;
int lenb = b.second - b.first + 1;
if (lena == lenb)
return a.first < b.first;
return lena > lenb;
}
};
struct c_h {
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
x ^= FIXED_RANDOM;
return x ^ (x >> 16);
}
};
ll calcpow(ll x, ll y) {
ll temp;
if (y == 0)
return 1;
temp = calcpow(x, y / 2);
if (y % 2 == 0)
return temp * temp;
else {
if (y > 0)
return x * temp * temp;
else
return (temp * temp) / x;
}
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll egcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1;
ll y1;
ll g = egcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return g;
}
bool isprime(ll a) {
bool flag = 1;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) {
flag = 0;
break;
}
}
return flag;
}
ll N = 1e5 + 5;
vector<vector<ll>> vec(N);
vector<ll> ans(N, -1);
ll dfs(ll e) {
if (ans[e] != -1)
return ans[e];
ll a = 1;
ll maxi = 0;
for (auto x : vec[e]) {
maxi = max(maxi, dfs(x));
}
a += maxi;
ans[e] = a;
return a;
}
int main() {
IOS;
make2(ll, n, m);
fr(i, m) {
make2(ll, x, y);
vec[--x].push_back(--y);
}
fr(i, n) {
if (ans[i] == -1)
dfs(i);
}
ll maxi = 1;
// fr(i,n) cout<<ans[i]<<" ";
fr(i, n) maxi = max(maxi, ans[i]);
cout << maxi - 1 << endl;
return 0;
}
|
insert
| 113 | 113 | 113 | 115 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define ffor(i, j, k, in) for (int i = j; i < k; i += in)
#define rfor(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rep(i, j) ffor(i, 0, j, 1)
#define rrep(i, j) rfor(i, j, 0, 1)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert(B <= A && A <= C)
#define mp make_pair
#define pb push_back
// #define f first
// #define s second
#define inf (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define trace1(x) cout << #x << ": " << x << endl;
#define trace2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
const double pi = acos(-1.0);
typedef pair<long long int, long long int> pii;
typedef long long ll;
typedef vector<long long int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<long long int, long long int> mpii;
typedef set<long long int> sei;
typedef multiset<long long int> msei;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
ll dp[100001] = {0};
ll vis[100001] = {0};
ll maxi = 0;
vector<ll> v[100001];
void dfs(ll cur) {
ll i, j;
for (i = 0; i < v[cur].size(); i++) {
if (vis[v[cur][i]] == 0) {
dfs(v[cur][i]);
}
dp[cur] = max(dp[cur], dp[v[cur][i]] + 1);
}
maxi = max(maxi, dp[cur]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
ll i, j, n, m;
cin >> n >> m;
for (i = 1; i <= m; i++) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
}
for (i = 1; i <= n; i++) {
if (vis[i] == 0) {
dfs(i);
}
}
cout << maxi;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define scd(t) scanf("%d", &t)
#define scld(t) scanf("%ld", &t)
#define sclld(t) scanf("%lld", &t)
#define scc(t) scanf("%c", &t)
#define scs(t) scanf("%s", t)
#define scf(t) scanf("%f", &t)
#define sclf(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define ffor(i, j, k, in) for (int i = j; i < k; i += in)
#define rfor(i, j, k, in) for (int i = j; i >= k; i -= in)
#define rep(i, j) ffor(i, 0, j, 1)
#define rrep(i, j) rfor(i, j, 0, 1)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert(B <= A && A <= C)
#define mp make_pair
#define pb push_back
// #define f first
// #define s second
#define inf (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define trace1(x) cout << #x << ": " << x << endl;
#define trace2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
const double pi = acos(-1.0);
typedef pair<long long int, long long int> pii;
typedef long long ll;
typedef vector<long long int> vi;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<long long int, long long int> mpii;
typedef set<long long int> sei;
typedef multiset<long long int> msei;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
ll dp[100001] = {0};
ll vis[100001] = {0};
ll maxi = 0;
vector<ll> v[100001];
void dfs(ll cur) {
ll i, j;
vis[cur] = 1;
for (i = 0; i < v[cur].size(); i++) {
if (vis[v[cur][i]] == 0) {
dfs(v[cur][i]);
}
dp[cur] = max(dp[cur], dp[v[cur][i]] + 1);
}
maxi = max(maxi, dp[cur]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
ll i, j, n, m;
cin >> n >> m;
for (i = 1; i <= m; i++) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
}
for (i = 1; i <= n; i++) {
if (vis[i] == 0) {
dfs(i);
}
}
cout << maxi;
return 0;
}
|
insert
| 59 | 59 | 59 | 60 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define foi(i, a, n) for (long long int i = a; i < n; i++)
#define el "\n"
const int INF = 2e9 + 5;
const int MAX = 1e5 + 5;
using ll = long long int;
vector<int> vis(MAX, 0), dp(MAX, 0), deg(MAX, 0);
void dfs(vector<vector<int>> &gr, int node, int par) {
vis[node] = 1;
for (auto i : gr[node]) {
if (i != par) {
dp[i] = max(dp[i], dp[node] + 1);
deg[i]--;
if (deg[i] <= 0)
dfs(gr, i, node);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> gr(n + 1);
rep(i, m) {
int x, y;
cin >> x >> y;
x, y;
gr[x].push_back(y);
deg[y]++;
}
foi(i, 1, n + 1) {
if (!vis[i])
dfs(gr, i, 0);
}
cout << *max_element(dp.begin(), dp.end());
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define foi(i, a, n) for (long long int i = a; i < n; i++)
#define el "\n"
const int INF = 2e9 + 5;
const int MAX = 1e5 + 5;
using ll = long long int;
vector<int> vis(MAX, 0), dp(MAX, 0), deg(MAX, 0);
void dfs(vector<vector<int>> &gr, int node, int par) {
vis[node] = 1;
for (auto i : gr[node]) {
if (i != par) {
dp[i] = max(dp[i], dp[node] + 1);
deg[i]--;
if (deg[i] <= 0)
dfs(gr, i, node);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> gr(n + 1);
rep(i, m) {
int x, y;
cin >> x >> y;
x, y;
gr[x].push_back(y);
deg[y]++;
}
foi(i, 1, n + 1) {
if (!vis[i] && deg[i] == 0)
dfs(gr, i, 0);
}
cout << *max_element(dp.begin(), dp.end());
}
int main() {
solve();
return 0;
}
|
replace
| 33 | 34 | 33 | 34 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define reptArIn(i, a, b, ar) \
for (i = a; i < b; ++i) \
cin >> ar[i];
#define fo(i, a, b) for (i = a; i < b; ++i)
#define foe(i, a, b) for (i = a; i <= b; ++i)
#define rep(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define ins insert
#define mk make_pair
#define f first
#define s second
#define mod 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int> // typedef pair<int,int> pii;
#define pll pair<ll, ll>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// mp.reserve(4096);
// mp.max_load_factor(0.25);
void dfs(int p, vector<int> adj[], int dp[], bool vis[]) {
vis[p] = true;
for (auto v : adj[p]) {
dp[v] = max(dp[v], dp[p] + 1);
dfs(v, adj, dp, vis);
}
}
int main() {
int n, m, i, x, y;
cin >> n >> m;
vector<int> adj[n + 1];
int dp[n + 1];
bool vis[n + 1];
memset(vis, false, sizeof(vis));
memset(dp, 0, sizeof(dp));
foe(i, 1, m) {
cin >> x >> y;
adj[x].pb(y);
}
foe(i, 1, n) {
if (!vis[i])
dfs(i, adj, dp, vis);
}
int mx = INT_MIN;
foe(i, 1, n) { mx = max(mx, dp[i]); }
cout << mx << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define reptArIn(i, a, b, ar) \
for (i = a; i < b; ++i) \
cin >> ar[i];
#define fo(i, a, b) for (i = a; i < b; ++i)
#define foe(i, a, b) for (i = a; i <= b; ++i)
#define rep(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define pb push_back
#define ins insert
#define mk make_pair
#define f first
#define s second
#define mod 1000000007
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int> // typedef pair<int,int> pii;
#define pll pair<ll, ll>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// mp.reserve(4096);
// mp.max_load_factor(0.25);
void dfs(int p, vector<int> adj[], int dp[], bool vis[]) {
vis[p] = true;
for (auto v : adj[p]) {
if (!vis[v])
dfs(v, adj, dp, vis);
dp[p] = max(1 + dp[v], dp[p]);
}
}
int main() {
int n, m, i, x, y;
cin >> n >> m;
vector<int> adj[n + 1];
int dp[n + 1];
bool vis[n + 1];
memset(vis, false, sizeof(vis));
memset(dp, 0, sizeof(dp));
foe(i, 1, m) {
cin >> x >> y;
adj[x].pb(y);
}
foe(i, 1, n) {
if (!vis[i])
dfs(i, adj, dp, vis);
}
int mx = INT_MIN;
foe(i, 1, n) { mx = max(mx, dp[i]); }
cout << mx << endl;
return 0;
}
|
replace
| 43 | 45 | 43 | 47 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// mangesh2102000
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long int
#define ld long double
#define pb push_back
#define tr(c, it) for (auto it = (c).begin(); it != (c).end(); ++it)
#define F first
#define S second
#define mod 1000000007
int n, m;
vector<int> g[100005];
int dp[100005];
bool vis[100005];
void dfs(int node) {
for (int i = 0; i < g[node].size(); i++) {
if (!vis[g[node][i]])
dfs(g[node][i]);
dp[node] = max(dp[node], 1 + dp[g[node][i]]);
}
}
void solve(int t) {
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
memset(dp, 0, sizeof(dp));
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
}
}
int ans = -1;
for (int i = 1; i <= n; i++) {
// cout << i << "-" << dp[i] << "\n";
ans = max(ans, dp[i]);
}
cout << ans;
// cout << "Case #" << t << ": ";
}
int32_t main() {
IOS;
int t;
t = 1;
for (int i = 1; i <= t; i++) {
solve(i);
}
return 0;
}
|
// mangesh2102000
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long int
#define ld long double
#define pb push_back
#define tr(c, it) for (auto it = (c).begin(); it != (c).end(); ++it)
#define F first
#define S second
#define mod 1000000007
int n, m;
vector<int> g[100005];
int dp[100005];
bool vis[100005];
void dfs(int node) {
vis[node] = true;
for (int i = 0; i < g[node].size(); i++) {
if (!vis[g[node][i]])
dfs(g[node][i]);
dp[node] = max(dp[node], 1 + dp[g[node][i]]);
}
}
void solve(int t) {
cin >> n >> m;
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
g[x].pb(y);
}
memset(dp, 0, sizeof(dp));
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
}
}
int ans = -1;
for (int i = 1; i <= n; i++) {
// cout << i << "-" << dp[i] << "\n";
ans = max(ans, dp[i]);
}
cout << ans;
// cout << "Case #" << t << ": ";
}
int32_t main() {
IOS;
int t;
t = 1;
for (int i = 1; i <= t; i++) {
solve(i);
}
return 0;
}
|
insert
| 23 | 23 | 23 | 24 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Problem : G - Longest Path
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_g
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int, int>
#define m_p(x, y) make_pair(x, y)
#define vp vector<pair<int, int>>
#define setbits(x) __builtin_popcountll(x)
#define f first
#define se second
#define inc(v, n, x) v.assign(n, x)
#define incd(v, n) v.resize(n)
#define iniz(n) memset(n, 0, sizeof(n))
#define inin(n) memset(n, -1, sizeof(n))
#define inimi(n) memset(n, 0xc0, sizeof(n))
#define inima(n) memset(n, 0x3f, sizeof(n))
#define all(v) (v).begin(), (v).end()
using namespace std;
using namespace __gnu_pbds;
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
for (pair<T1, T2> &t : v)
is >> t.f >> t.se;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v)
is >> t;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v) {
os << t << " ";
}
os << '\n';
return os;
}
double pi = acos(-1.0);
int md = 1e9 + 7;
const int INF = 1e15;
int dx1[] = {0, 0, -1, 1};
int dy1[] = {1, -1, 0, 0};
template <class T> T abst(T a) { return a < 0 ? -a : a; }
template <class T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag,
tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
struct HASH {
size_t operator()(const pii &x) const {
return (size_t)x.first * 37U + (size_t)x.second;
}
};
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int Pow(int n, int x) {
int ans = 1;
while (x > 0) {
if (x & 1)
ans = (ans * n) % md;
n = (n * n) % md;
x = x >> 1;
}
return ans;
}
vi fact, inv;
void inverse(int n) {
inv.resize(n + 1);
inv[0] = 1;
for (int i = 1; i <= n; i++)
inv[i] = Pow(fact[i], md - 2);
}
void factorial(int n) {
fact.resize(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % md;
}
int ncr(int n, int r) { return (((fact[n] * inv[r]) % md) * inv[n - r]) % md; }
template <class T> T max2(T a, T b) { return a > b ? a : b; }
template <class T> T min2(T a, T b) { return a < b ? a : b; }
template <class T> T maxm(initializer_list<T> l) {
T ans = -INF;
for (T i : l)
ans = max2(ans, i);
return ans;
}
int dfs(int x, vi &dp, vi v[]) {
int ans = 0;
for (int i : v[x])
ans = max(ans, 1 + dfs(i, dp, v));
return dp[x] = ans;
}
void solve() {
int n, m;
cin >> n >> m;
vi v[n + 1];
while (m--) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
for (int i = 1; i <= n; i++)
v[0].pb(i);
vi dp(n + 1, INT_MIN);
cout << dfs(0, dp, v) - 1;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
}
|
// Problem : G - Longest Path
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_g
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int, int>
#define m_p(x, y) make_pair(x, y)
#define vp vector<pair<int, int>>
#define setbits(x) __builtin_popcountll(x)
#define f first
#define se second
#define inc(v, n, x) v.assign(n, x)
#define incd(v, n) v.resize(n)
#define iniz(n) memset(n, 0, sizeof(n))
#define inin(n) memset(n, -1, sizeof(n))
#define inimi(n) memset(n, 0xc0, sizeof(n))
#define inima(n) memset(n, 0x3f, sizeof(n))
#define all(v) (v).begin(), (v).end()
using namespace std;
using namespace __gnu_pbds;
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
for (pair<T1, T2> &t : v)
is >> t.f >> t.se;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v)
is >> t;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v) {
os << t << " ";
}
os << '\n';
return os;
}
double pi = acos(-1.0);
int md = 1e9 + 7;
const int INF = 1e15;
int dx1[] = {0, 0, -1, 1};
int dy1[] = {1, -1, 0, 0};
template <class T> T abst(T a) { return a < 0 ? -a : a; }
template <class T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag,
tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
struct HASH {
size_t operator()(const pii &x) const {
return (size_t)x.first * 37U + (size_t)x.second;
}
};
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int Pow(int n, int x) {
int ans = 1;
while (x > 0) {
if (x & 1)
ans = (ans * n) % md;
n = (n * n) % md;
x = x >> 1;
}
return ans;
}
vi fact, inv;
void inverse(int n) {
inv.resize(n + 1);
inv[0] = 1;
for (int i = 1; i <= n; i++)
inv[i] = Pow(fact[i], md - 2);
}
void factorial(int n) {
fact.resize(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % md;
}
int ncr(int n, int r) { return (((fact[n] * inv[r]) % md) * inv[n - r]) % md; }
template <class T> T max2(T a, T b) { return a > b ? a : b; }
template <class T> T min2(T a, T b) { return a < b ? a : b; }
template <class T> T maxm(initializer_list<T> l) {
T ans = -INF;
for (T i : l)
ans = max2(ans, i);
return ans;
}
int dfs(int x, vi &dp, vi v[]) {
if (dp[x] != INT_MIN)
return dp[x];
int ans = 0;
for (int i : v[x])
ans = max(ans, 1 + dfs(i, dp, v));
return dp[x] = ans;
}
void solve() {
int n, m;
cin >> n >> m;
vi v[n + 1];
while (m--) {
int x, y;
cin >> x >> y;
v[x].pb(y);
}
for (int i = 1; i <= n; i++)
v[0].pb(i);
vi dp(n + 1, INT_MIN);
cout << dfs(0, dp, v) - 1;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
}
|
insert
| 119 | 119 | 119 | 121 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int n, m;
vvi G;
vi check;
int dfs(int i) {
if (check[i] != -1) {
return check[i];
}
if (!G[i].size()) {
check[i] = 0;
return 0;
}
int ma = 0;
for (int nexti : G[i]) {
ma = max(ma, dfs(nexti));
}
ma++;
return ma;
}
int main() {
cin >> n >> m;
vi G_(n);
G.resize(n);
rep(i, m) {
int x, y;
cin >> x >> y;
G[x - 1].push_back(y - 1);
G_[y - 1]++;
}
check.assign(n, -1);
int ma = 0;
rep(i, n) {
if (G_[i])
continue;
ma = max(ma, dfs(i));
}
cout << ma << '\n';
}
|
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int n, m;
vvi G;
vi check;
int dfs(int i) {
if (check[i] != -1) {
return check[i];
}
if (!G[i].size()) {
check[i] = 0;
return 0;
}
int ma = 0;
for (int nexti : G[i]) {
ma = max(ma, dfs(nexti));
}
ma++;
check[i] = ma;
return ma;
}
int main() {
cin >> n >> m;
vi G_(n);
G.resize(n);
rep(i, m) {
int x, y;
cin >> x >> y;
G[x - 1].push_back(y - 1);
G_[y - 1]++;
}
check.assign(n, -1);
int ma = 0;
rep(i, n) {
if (G_[i])
continue;
ma = max(ma, dfs(i));
}
cout << ma << '\n';
}
|
insert
| 25 | 25 | 25 | 26 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mp make_pair
#define pi pair<int, int>
#define pl pair<long long int, long long int>
#define pb push_back
#define fi first
#define se second
#define len(a) (int)(a).length()
#define sz(a) (int)(a).size()
using namespace std;
const int N = 1e5;
int n, m, x, y, dp[N] = {0}, ans = -1;
vector<int> adj[N];
bool vis[N];
void dfs(int x) {
vis[x] = true;
for (int i = 0; i < sz(adj[x]); ++i) {
if (!vis[adj[x][i]])
dfs(adj[x][i]);
dp[x] = max(dp[x], 1 + dp[adj[x][i]]);
ans = max(ans, dp[x]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> x >> y;
adj[x].pb(y);
}
for (int i = 1; i <= n; ++i)
vis[i] = false;
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
cout << ans << endl;
return 0;
}
|
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define mp make_pair
#define pi pair<int, int>
#define pl pair<long long int, long long int>
#define pb push_back
#define fi first
#define se second
#define len(a) (int)(a).length()
#define sz(a) (int)(a).size()
using namespace std;
const int N = 1e5 + 5;
int n, m, x, y, dp[N] = {0}, ans = -1;
vector<int> adj[N];
bool vis[N];
void dfs(int x) {
vis[x] = true;
for (int i = 0; i < sz(adj[x]); ++i) {
if (!vis[adj[x][i]])
dfs(adj[x][i]);
dp[x] = max(dp[x], 1 + dp[adj[x][i]]);
ans = max(ans, dp[x]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < m; ++i) {
cin >> x >> y;
adj[x].pb(y);
}
for (int i = 1; i <= n; ++i)
vis[i] = false;
for (int i = 1; i <= n; ++i)
if (!vis[i])
dfs(i);
cout << ans << endl;
return 0;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>,
// rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define ll long long
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define debug(x) cout << #x << ": " << x << endl
#define ld double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
vector<ll> v[100005];
ll dp[100005];
ll mark[100005];
ll ans = 0;
ll dfs(ll n) {
mark[n] = 1;
ll mx = 0;
rep(i, v[n].size()) {
ll x = v[n][i];
if (mark[x]) {
mx = max(mx, dp[x]);
} else {
mx = max(mx, dfs(x));
}
}
ans = max(ans, mx + 1);
return dp[n] = mx + 1;
}
#define INF 1000000000000000000
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
long double pi = 3.14159265358979323846;
ll n, m;
cin >> n >> m;
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
v[a].pb(b);
}
rep(i, n) {
rep(j, v[i].size()) {
if (!mark[v[i][j]]) {
dfs(v[i][j]);
}
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>,
// rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define ll long long
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define debug(x) cout << #x << ": " << x << endl
#define ld double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
vector<ll> v[100005];
ll dp[100005];
ll mark[100005];
ll ans = 0;
ll dfs(ll n) {
mark[n] = 1;
ll mx = 0;
rep(i, v[n].size()) {
ll x = v[n][i];
if (mark[x]) {
mx = max(mx, dp[x]);
} else {
mx = max(mx, dfs(x));
}
}
ans = max(ans, mx + 1);
return dp[n] = mx + 1;
}
#define INF 1000000000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long double pi = 3.14159265358979323846;
ll n, m;
cin >> n >> m;
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
v[a].pb(b);
}
rep(i, n) {
rep(j, v[i].size()) {
if (!mark[v[i][j]]) {
dfs(v[i][j]);
}
}
}
cout << ans;
return 0;
}
|
delete
| 56 | 60 | 56 | 56 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const long long INF = 1LL << 60;
int dp[100010];
Graph G;
int rec(int v) {
// 到達済みならdp[v]を返す
if (dp[v] != -1)
return dp[v];
// 0で初期化(vから出る辺が無ければ0となる)
int res = 0;
// 範囲for文
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
return res;
}
int main() {
int N, M;
cin >> N >> M;
// N×0の配列で初期化(重要)
G.assign(N, vector<int>());
int x, y;
rep(i, M) {
cin >> x >> y;
x--;
y--; // 0から始まる添字にする
G[x].push_back(y);
}
// 未到達(-1)で初期化
rep(i, N) dp[i] = -1;
// すべての頂点iについて,iから始まる最長の部分列を調べてその長さを更新
int ans = 0;
rep(i, N) { chmax(ans, rec(i)); }
cout << ans << endl;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const long long INF = 1LL << 60;
int dp[100010];
Graph G;
int rec(int v) {
// 到達済みならdp[v]を返す
if (dp[v] != -1)
return dp[v];
// 0で初期化(vから出る辺が無ければ0となる)
int res = 0;
// 範囲for文
for (auto nv : G[v]) {
chmax(res, rec(nv) + 1);
}
// dp[v]を更新してそれを返す
dp[v] = res;
return dp[v];
}
int main() {
int N, M;
cin >> N >> M;
// N×0の配列で初期化(重要)
G.assign(N, vector<int>());
int x, y;
rep(i, M) {
cin >> x >> y;
x--;
y--; // 0から始まる添字にする
G[x].push_back(y);
}
// 未到達(-1)で初期化
rep(i, N) dp[i] = -1;
// すべての頂点iについて,iから始まる最長の部分列を調べてその長さを更新
int ans = 0;
rep(i, N) { chmax(ans, rec(i)); }
cout << ans << endl;
}
|
replace
| 36 | 37 | 36 | 39 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void imie() {
cout << "hello"
<< "\n";
}
const ll INF = 1e18 + 5;
const int mXN = 100005;
int vis[mXN][2];
int dfs(int u, const vector<vector<int>> &dp) {
if (vis[u][1] == 1)
return vis[u][0];
int ans = 0;
for (int i = 0; i < dp[u].size(); i++) {
ans = max(ans, dfs(dp[u][i] - 1, dp) + 1);
}
return ans;
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> dp(n, vector<int>());
vector<pair<int, int>> p(n);
for (int i = 0; i < m; i++) {
int A, B;
cin >> A >> B;
dp[A - 1].push_back(B);
p[A - 1].first++;
}
for (int i = 0; i < n; i++) {
p[i].second = i;
}
sort(p.begin(), p.end());
int ans1 = 0;
// call dfs function
for (int i = 0; i < n; i++) {
if (p[i].first == 0) {
vis[p[i].second][0] = 0;
vis[p[i].second][1] = 1;
} else {
int tmp = dfs(p[i].second, dp);
ans1 = max(tmp, ans1);
vis[p[i].second][0] = tmp;
vis[p[i].second][1] = 1;
}
}
cout << ans1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
/*
int t;
cin >> t;
while (t) {
solve();
cout << "\n";
t--;
}
*/
}
|
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void imie() {
cout << "hello"
<< "\n";
}
const ll INF = 1e18 + 5;
const int mXN = 100005;
int vis[mXN][2];
int dfs(int u, const vector<vector<int>> &dp) {
if (vis[u][1] == 1)
return vis[u][0];
int ans = 0;
for (int i = 0; i < dp[u].size(); i++) {
ans = max(ans, dfs(dp[u][i] - 1, dp) + 1);
vis[u][0] = ans;
vis[u][1] = 1;
}
return ans;
}
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> dp(n, vector<int>());
vector<pair<int, int>> p(n);
for (int i = 0; i < m; i++) {
int A, B;
cin >> A >> B;
dp[A - 1].push_back(B);
p[A - 1].first++;
}
for (int i = 0; i < n; i++) {
p[i].second = i;
}
sort(p.begin(), p.end());
int ans1 = 0;
// call dfs function
for (int i = 0; i < n; i++) {
if (p[i].first == 0) {
vis[p[i].second][0] = 0;
vis[p[i].second][1] = 1;
} else {
int tmp = dfs(p[i].second, dp);
ans1 = max(tmp, ans1);
vis[p[i].second][0] = tmp;
vis[p[i].second][1] = 1;
}
}
cout << ans1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
/*
int t;
cin >> t;
while (t) {
solve();
cout << "\n";
t--;
}
*/
}
|
insert
| 47 | 47 | 47 | 49 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); (b) <= i; i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1) * (a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1 << 29)
using namespace std;
#define ld long double
#define ll long long
map<int, int> mpa, mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;
const int N_MAX = 100100;
vector<vector<int>> g;
int dp[N_MAX];
int N, M;
bool used[N_MAX];
int dfs(int s) {
if (used[s])
return dp[s];
used[s] = true;
int ret = 0;
for (auto t : g[s]) {
ret = max(ret, dfs(t) + 1);
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
int x[N_MAX], y[N_MAX];
for (int i = 0; i < N_MAX; i++) {
used[i] = false;
}
/*for(int i=0;i<N_MAX;i++){
for(int j=0;j<N_MAX;j++){
x[i][j]=0;
//if(i==j)x[i][j]==1;
}
}*/
for (int i = 0; i < N_MAX; i++) {
dp[i] = 0;
}
// int x,y;
for (int i = 0; i < M; i++) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
g[x[i]].push_back(y[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); (b) <= i; i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n; n <= i; i--)
#define ABS(a) ((a < 0) ? ((-1) * (a)) : (a))
#define elif else if
#define MOD 1000000007
#define INF (1 << 29)
using namespace std;
#define ld long double
#define ll long long
map<int, int> mpa, mpb;
typedef pair<ll, ll> P;
priority_queue<P, vector<P>, greater<P>> pque;
const int N_MAX = 100100;
vector<int> g[N_MAX];
int dp[N_MAX];
int N, M;
bool used[N_MAX];
int dfs(int s) {
if (used[s])
return dp[s];
used[s] = true;
int ret = 0;
for (auto t : g[s]) {
ret = max(ret, dfs(t) + 1);
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M;
int x[N_MAX], y[N_MAX];
for (int i = 0; i < N_MAX; i++) {
used[i] = false;
}
/*for(int i=0;i<N_MAX;i++){
for(int j=0;j<N_MAX;j++){
x[i][j]=0;
//if(i==j)x[i][j]==1;
}
}*/
for (int i = 0; i < N_MAX; i++) {
dp[i] = 0;
}
// int x,y;
for (int i = 0; i < M; i++) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
g[x[i]].push_back(y[i]);
}
int ans = 0;
for (int i = 0; i < N; i++) {
ans = max(ans, dfs(i));
}
cout << ans << endl;
return 0;
}
|
replace
| 37 | 38 | 37 | 38 |
-11
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define pi pair<ll, ll>
#define md (ll)(1e9 + 7)
#define all(X) X.begin(), X.end()
// for pair comparison function(ascending order) use return (i1.ff < i2.ff);
/* string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
const int M = 1e6 + 6;
ll pwr(ll a, ll n, ll m) {
ll p = 1;
while (n > 0) {
if (n % 2 == 1)
p = (p * a) % m;
a = (a * a) % m;
n = n / 2;
}
return p;
}
ll vis[M], dp[M];
vector<ll> tope, adj[M], rdj[M];
void dfs(ll u) {
vis[u] = 1;
for (auto v : adj[u])
dfs(v);
tope.pb(u);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, i, u, v, mx = 0;
cin >> n >> m;
for (i = 1; i <= m; ++i) {
cin >> u >> v;
adj[u].pb(v);
rdj[v].pb(u);
}
for (i = 1; i <= n; ++i) {
if (vis[i] == 0)
dfs(i);
}
reverse(all(tope));
for (auto u : tope) {
for (auto v : rdj[u]) {
dp[u] = max(dp[u], dp[v] + 1);
mx = max(mx, dp[u]);
}
}
cout << mx << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the kth largest element.(0-based)
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define pi pair<ll, ll>
#define md (ll)(1e9 + 7)
#define all(X) X.begin(), X.end()
// for pair comparison function(ascending order) use return (i1.ff < i2.ff);
/* string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
const int M = 1e6 + 6;
ll pwr(ll a, ll n, ll m) {
ll p = 1;
while (n > 0) {
if (n % 2 == 1)
p = (p * a) % m;
a = (a * a) % m;
n = n / 2;
}
return p;
}
ll vis[M], dp[M];
vector<ll> tope, adj[M], rdj[M];
void dfs(ll u) {
vis[u] = 1;
for (auto v : adj[u]) {
if (vis[v] == 0)
dfs(v);
}
tope.pb(u);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, i, u, v, mx = 0;
cin >> n >> m;
for (i = 1; i <= m; ++i) {
cin >> u >> v;
adj[u].pb(v);
rdj[v].pb(u);
}
for (i = 1; i <= n; ++i) {
if (vis[i] == 0)
dfs(i);
}
reverse(all(tope));
for (auto u : tope) {
for (auto v : rdj[u]) {
dp[u] = max(dp[u], dp[v] + 1);
mx = max(mx, dp[u]);
}
}
cout << mx << endl;
return 0;
}
|
replace
| 47 | 49 | 47 | 51 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> deg(N, 0);
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].emplace_back(y);
deg[y]++;
}
queue<int> que;
for (int i = 0; i < N; i++) {
if (deg[i] == 0)
que.push(i);
}
vector<int> dp(N, 0);
while (!que.empty()) {
int u = que.front();
que.pop();
for (int v : G[u]) {
dp[v] = dp[u] + 1;
que.push(v);
}
}
cout << *max_element(dp.begin(), dp.end()) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> deg(N, 0);
vector<vector<int>> G(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].emplace_back(y);
deg[y]++;
}
queue<int> que;
for (int i = 0; i < N; i++) {
if (deg[i] == 0)
que.push(i);
}
vector<int> dp(N, 0);
while (!que.empty()) {
int u = que.front();
que.pop();
for (int v : G[u]) {
if (--deg[v] != 0)
continue;
dp[v] = dp[u] + 1;
que.push(v);
}
}
cout << *max_element(dp.begin(), dp.end()) << "\n";
return 0;
}
|
insert
| 47 | 47 | 47 | 49 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> G;
vector<int> memo;
int dp(int u) {
if (memo[u] != -1)
return memo[u];
int res = 0;
for (auto v : G[u]) {
res = max(res, dp(v) + 1);
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
G.resize(N), memo.resize(N, -1);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].emplace_back(y);
}
int res = 0;
for (int i = 0; i < N; i++) {
res = max(res, dp(i));
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> G;
vector<int> memo;
int dp(int u) {
if (memo[u] != -1)
return memo[u];
int res = 0;
for (auto v : G[u]) {
res = max(res, dp(v) + 1);
}
return memo[u] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
G.resize(N), memo.resize(N, -1);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--, y--;
G[x].emplace_back(y);
}
int res = 0;
for (int i = 0; i < N; i++) {
res = max(res, dp(i));
}
cout << res << '\n';
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Problem : G - Longest Path
// Contest : Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_g
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/coder3101/cp-editor)
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[(int)1e5 + 5], rev[(int)1e5 + 5], indegree((int)1e5 + 5);
vector<int> dp((int)1e5 + 5), v((int)1e5 + 5);
void dfs(int i) {
v[i] = 1;
for (auto u : rev[i]) {
dfs(u);
dp[i] = max(dp[i], dp[u] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x - 1].push_back(y - 1);
rev[y - 1].push_back(x - 1);
++indegree[y - 1];
}
for (int i = 0; i < n; i++) {
if (!v[i]) {
dfs(i);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
// Problem : G - Longest Path
// Contest : Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_g
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/coder3101/cp-editor)
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[(int)1e5 + 5], rev[(int)1e5 + 5], indegree((int)1e5 + 5);
vector<int> dp((int)1e5 + 5), v((int)1e5 + 5);
void dfs(int i) {
v[i] = 1;
for (auto u : rev[i]) {
if (!v[u])
dfs(u);
dp[i] = max(dp[i], dp[u] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x - 1].push_back(y - 1);
rev[y - 1].push_back(x - 1);
++indegree[y - 1];
}
for (int i = 0; i < n; i++) {
if (!v[i]) {
dfs(i);
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, dp[i]);
}
cout << ans << endl;
return 0;
}
|
replace
| 15 | 16 | 15 | 17 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MAXN = 10101;
vector<int> AdList[MAXN];
int n, m, dp[MAXN];
int maxdfs(int i) {
if (dp[i] != -1)
return dp[i];
int mpath = 0;
for (auto u : AdList[i]) {
mpath = max(mpath, 1 + maxdfs(u));
}
dp[i] = mpath;
return dp[i];
}
int main() {
// #ifdef Javier
// freopen(".in", "r", stdin);
// #endif // Javier
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
AdList[a].push_back(b);
}
int sol = INT_MIN;
fill(dp, dp + n + 1, -1);
for (int i = 1; i <= n; i++) {
if (dp[i] != -1) {
continue;
} else {
dp[i] = maxdfs(i);
sol = max(dp[i], sol);
}
}
cout << sol;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MAXN = 101010;
vector<int> AdList[MAXN];
int n, m, dp[MAXN];
int maxdfs(int i) {
if (dp[i] != -1)
return dp[i];
int mpath = 0;
for (auto u : AdList[i]) {
mpath = max(mpath, 1 + maxdfs(u));
}
dp[i] = mpath;
return dp[i];
}
int main() {
// #ifdef Javier
// freopen(".in", "r", stdin);
// #endif // Javier
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
AdList[a].push_back(b);
}
int sol = INT_MIN;
fill(dp, dp + n + 1, -1);
for (int i = 1; i <= n; i++) {
if (dp[i] != -1) {
continue;
} else {
dp[i] = maxdfs(i);
sol = max(dp[i], sol);
}
}
cout << sol;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include "bits/stdc++.h"
using namespace std;
#define LIM 100003
#define M 1000000007
#define inf 99999999999999999LL // long long inf
typedef long long ll;
#define sc(x) scanf("%d", &x);
#define sc2(x, y) scanf("%d%d", &x, &y);
#define sc3(x, y, z) scanf("%d%d%d", &x, &y, &z);
#define scl(x) scanf("%lld", &x);
#define scl2(x, y) scanf("%lld%lld", &x, &y);
#define scl3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
ll power(ll x, ll y, ll z) {
ll ret = 1;
while (y > 0) {
if (y & 1)
ret = (ret * x) % z;
x = (x * x) % z;
y >>= 1;
}
return ret;
}
#define debug(x) cerr << #x << " :: " << x << "\n";
#define debug2(x, y) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\n";
#define debug4(x, y, z, a) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\t" << #a << " :: " << a << "\n";
int n, m, vis[LIM], dp[LIM], maxi;
vector<int> graph[LIM];
void dfs(int start) {
dp[start] = 1;
for (int ele : graph[start]) {
if (vis[ele])
continue;
dfs(ele);
}
for (int ele : graph[start]) {
dp[start] = max(dp[start], dp[ele] + 1);
}
maxi = max(maxi, dp[start] - 1);
}
int main() {
int i, j, t;
sc2(n, m);
while (m--) {
int st, en;
sc2(st, en);
graph[st].pb(en);
}
for (i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(i);
}
cout << maxi << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define LIM 100003
#define M 1000000007
#define inf 99999999999999999LL // long long inf
typedef long long ll;
#define sc(x) scanf("%d", &x);
#define sc2(x, y) scanf("%d%d", &x, &y);
#define sc3(x, y, z) scanf("%d%d%d", &x, &y, &z);
#define scl(x) scanf("%lld", &x);
#define scl2(x, y) scanf("%lld%lld", &x, &y);
#define scl3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
ll power(ll x, ll y, ll z) {
ll ret = 1;
while (y > 0) {
if (y & 1)
ret = (ret * x) % z;
x = (x * x) % z;
y >>= 1;
}
return ret;
}
#define debug(x) cerr << #x << " :: " << x << "\n";
#define debug2(x, y) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\n";
#define debug4(x, y, z, a) \
cerr << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\t" << #a << " :: " << a << "\n";
int n, m, vis[LIM], dp[LIM], maxi;
vector<int> graph[LIM];
void dfs(int start) {
dp[start] = 1;
vis[start] = 1;
for (int ele : graph[start]) {
if (vis[ele])
continue;
dfs(ele);
}
for (int ele : graph[start]) {
dp[start] = max(dp[start], dp[ele] + 1);
}
maxi = max(maxi, dp[start] - 1);
}
int main() {
int i, j, t;
sc2(n, m);
while (m--) {
int st, en;
sc2(st, en);
graph[st].pb(en);
}
for (i = 1; i <= n; i++) {
if (vis[i] == 0)
dfs(i);
}
cout << maxi << endl;
return 0;
}
|
insert
| 43 | 43 | 43 | 44 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 5;
struct Edge {
int to;
int nxt;
} edges[mx];
int head[mx], depth[mx], tot;
void AddEdge(int u, int v) {
edges[tot].to = v;
edges[tot].nxt = head[u];
head[u] = tot++;
}
int DFS(int cur) {
if (depth[cur])
return depth[cur];
// printf("[DFS] cur : %d\n", cur);
int ret = 0;
for (int i = head[cur]; i != -1; i = edges[i].nxt) {
ret = max(ret, 1 + DFS(edges[i].to));
}
depth[cur] = ret;
return ret;
}
int main() {
memset(head, -1, sizeof(head));
int N, M;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; ++i) {
int xi, yi;
scanf("%d%d", &xi, &yi);
AddEdge(xi, yi);
}
for (int i = 1; i <= N; ++i)
AddEdge(0, i);
DFS(0);
printf("%d\n", depth[0] - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 5;
struct Edge {
int to;
int nxt;
} edges[2 * mx]; // virtual vertex
int head[mx], depth[mx], tot;
void AddEdge(int u, int v) {
edges[tot].to = v;
edges[tot].nxt = head[u];
head[u] = tot++;
}
int DFS(int cur) {
if (depth[cur])
return depth[cur];
// printf("[DFS] cur : %d\n", cur);
int ret = 0;
for (int i = head[cur]; i != -1; i = edges[i].nxt) {
ret = max(ret, 1 + DFS(edges[i].to));
}
depth[cur] = ret;
return ret;
}
int main() {
memset(head, -1, sizeof(head));
int N, M;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; ++i) {
int xi, yi;
scanf("%d%d", &xi, &yi);
AddEdge(xi, yi);
}
for (int i = 1; i <= N; ++i)
AddEdge(0, i);
DFS(0);
printf("%d\n", depth[0] - 1);
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03166
|
C++
|
Memory Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <memory>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dfs(int n, vector<vector<int>> &adjl, vector<int> &dp) {
if (dp[n] != -1)
return dp[n];
int &ret = dp[n];
ret = 0;
for (int i = 0; i < adjl[n].size(); i++)
ret = max(1 + dfs(adjl[n][i], adjl, dp), ret);
return ret;
}
void LongPath() {
int n, e;
cin >> n >> e;
vector<vector<bool>> adj(n + 1, vector<bool>(n + 1));
vector<vector<int>> adjl(n + 1);
vector<int> dp(n + 1, -1);
int _max = 0;
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
adjl[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
_max = max(_max, dfs(i, adjl, dp));
}
cout << _max;
}
int main() {
LongPath();
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <memory>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dfs(int n, vector<vector<int>> &adjl, vector<int> &dp) {
if (dp[n] != -1)
return dp[n];
int &ret = dp[n];
ret = 0;
for (int i = 0; i < adjl[n].size(); i++)
ret = max(1 + dfs(adjl[n][i], adjl, dp), ret);
return ret;
}
void LongPath() {
int n, e;
cin >> n >> e;
vector<vector<int>> adjl(n + 1);
vector<int> dp(n + 1, -1);
int _max = 0;
for (int i = 0; i < e; i++) {
int a, b;
cin >> a >> b;
adjl[a].push_back(b);
}
for (int i = 1; i <= n; i++) {
_max = max(_max, dfs(i, adjl, dp));
}
cout << _max;
}
int main() {
LongPath();
return 0;
}
|
delete
| 22 | 23 | 22 | 22 |
MLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
// Bismillahirrahmanirrahim
// █▀█─█──█──█▀█─█─█
// █▄█─█──█──█▄█─█▄█
// █─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<lo, lo> PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define FOR for (int i = 1; i <= n; i++)
#define mid ((start + end) / 2)
#define ort ((bas + son) / 2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n, m, b[li], a[li], k, flag, t, dp[li];
int cev;
string s;
vector<int> v[li];
inline int dfs(int node) {
int cevv = 0;
if (v[node].size() == 0)
return 0;
if (~dp[node])
return dp[node];
for (int i = 0; i < (int)v[node].size(); i++) {
cevv = max(cevv, dfs(v[node][i]) + 1);
}
return cevv;
}
int main(void) {
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);
v[x].pb(y);
}
FOR { cev = max(cev, dfs(i)); }
printf("%d\n", cev);
return 0;
}
|
// Bismillahirrahmanirrahim
// █▀█─█──█──█▀█─█─█
// █▄█─█──█──█▄█─█▄█
// █─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<lo, lo> PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define FOR for (int i = 1; i <= n; i++)
#define mid ((start + end) / 2)
#define ort ((bas + son) / 2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n, m, b[li], a[li], k, flag, t, dp[li];
int cev;
string s;
vector<int> v[li];
inline int dfs(int node) {
int cevv = 0;
if (v[node].size() == 0)
return 0;
if (~dp[node])
return dp[node];
for (int i = 0; i < (int)v[node].size(); i++) {
cevv = max(cevv, dfs(v[node][i]) + 1);
}
return dp[node] = cevv;
}
int main(void) {
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);
v[x].pb(y);
}
FOR { cev = max(cev, dfs(i)); }
printf("%d\n", cev);
return 0;
}
|
replace
| 50 | 51 | 50 | 51 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[110000];
int dp[11000];
int solve(int i) {
if (dp[i] != -1)
return dp[i];
int ret = 0;
for (int j = 0; j < g[i].size(); j++) {
ret = max(ret, solve(g[i][j]) + 1);
}
dp[i] = ret;
return dp[i];
}
int main() {
int n, m;
int u, v;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret = max(ret, solve(i));
}
cout << ret << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> g[110000];
int dp[110000];
int solve(int i) {
if (dp[i] != -1)
return dp[i];
int ret = 0;
for (int j = 0; j < g[i].size(); j++) {
ret = max(ret, solve(g[i][j]) + 1);
}
dp[i] = ret;
return dp[i];
}
int main() {
int n, m;
int u, v;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret = max(ret, solve(i));
}
cout << ret << "\n";
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)1e5 + 5;
int n, m;
vector<int> g[N];
int dp[N];
void calc(int nod) {
dp[nod] = 1;
for (auto &nou : g[nod]) {
calc(nou);
dp[nod] = max(dp[nod], 1 + dp[nou]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (dp[i] == 0) {
calc(i);
}
ans = max(ans, dp[i]);
/// cout<<i<<" : "<<dp[i]<<"\n";
}
ans--;
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)1e5 + 5;
int n, m;
vector<int> g[N];
int dp[N];
void calc(int nod) {
dp[nod] = 1;
for (auto &nou : g[nod]) {
if (dp[nou] == 0)
calc(nou);
dp[nod] = max(dp[nod], 1 + dp[nou]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (dp[i] == 0) {
calc(i);
}
ans = max(ans, dp[i]);
/// cout<<i<<" : "<<dp[i]<<"\n";
}
ans--;
cout << ans << "\n";
return 0;
}
|
replace
| 16 | 17 | 16 | 18 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll input() {
ll x = 0, f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
#define ll long long
const int N = 1e5 + 7;
vector<int> G[N];
int n, m;
stack<int> s;
int d[N], dis[N];
int Ans = 0;
void bfs() {
queue<int> q;
for (int i = 1; i <= n; i++) {
if (!d[i])
q.push(i);
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v : G[u]) {
if (dis[v] < dis[u] + 1) {
q.push(v);
dis[v] = dis[u] + 1;
}
}
}
}
int main() {
n = input(), m = input();
for (int i = 1; i <= m; i++) {
int u = input(), v = input();
G[u].push_back(v);
d[v]++;
}
bfs();
for (int i = 1; i <= n; i++) {
Ans = max(Ans, dis[i]);
}
printf("%d\n", Ans);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll input() {
ll x = 0, f = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
f |= ch == '-', ch = getchar();
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
#define ll long long
const int N = 1e5 + 7;
vector<int> G[N];
int n, m;
stack<int> s;
int d[N], dis[N];
int Ans = 0;
void bfs() {
queue<int> q;
for (int i = 1; i <= n; i++) {
if (!d[i])
q.push(i);
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v : G[u]) {
d[v]--;
if (d[v] == 0)
dis[v] = dis[u] + 1, q.push(v);
}
}
}
int main() {
n = input(), m = input();
for (int i = 1; i <= m; i++) {
int u = input(), v = input();
G[u].push_back(v);
d[v]++;
}
bfs();
for (int i = 1; i <= n; i++) {
Ans = max(Ans, dis[i]);
}
printf("%d\n", Ans);
}
|
replace
| 34 | 38 | 34 | 37 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int N, M;
vector<int> g[maxn];
int DP[maxn];
bool vis[maxn];
void DFS(int v, int p) {
DP[v] = 1;
for (int u : g[v]) {
if (u != p) {
DFS(u, v);
DP[v] = max(DP[v], DP[u] + 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
for (int i = 1; i <= M; ++i) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= N; ++i) {
if (!DP[i])
DFS(i, -1);
}
int ret = 0;
for (int i = 1; i <= N; ++i) {
ret = max(ret, DP[i]);
}
cout << ret - 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int N, M;
vector<int> g[maxn];
int DP[maxn];
bool vis[maxn];
void DFS(int v, int p) {
DP[v] = 1;
for (int u : g[v]) {
if (u != p) {
if (!DP[u])
DFS(u, v);
DP[v] = max(DP[v], DP[u] + 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M;
for (int i = 1; i <= M; ++i) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
for (int i = 1; i <= N; ++i) {
if (!DP[i])
DFS(i, -1);
}
int ret = 0;
for (int i = 1; i <= N; ++i) {
ret = max(ret, DP[i]);
}
cout << ret - 1 << endl;
}
|
replace
| 13 | 14 | 13 | 15 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define mp make_pair
#define debug1(a) \
cout << "------\n" << #a << " = " << a << endl << "------" << endl
#define debug2(a, b) \
cout << "--------------\n" \
<< #a << " = " << a << " ; " << #b << " = " << b << endl \
<< "--------------" << endl
#define debug3(a, b, c) \
cout << "----------------------\n" \
<< #a << " = " << a << " ; " << #b << " = " << b << " ; " << #c \
<< " = " << c << endl \
<< "----------------------" << endl
#define sz(a) (ll)(a.size())
#define debug4(a) cout << "chu " << a << endl
#define endl "\n"
vector<ll> adj[100005];
bool visited[100005];
ll dp[100005];
void dfs(ll s) {
for (auto it : adj[s]) {
if (!visited[it])
dfs(it);
dp[s] = max(dp[s], dp[it] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, x, y;
cin >> n >> m;
forn(i, 0, m) {
cin >> x >> y;
adj[x].pb(y);
}
for (ll i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
ll ans = 0;
forn(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ll_s long
#define mod 1000000007
#define forn(i, start, lim) for (ll i = start; i < lim; i++)
#define forn_d(i, start, lim) for (ll i = start; i >= lim; i--)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define mp make_pair
#define debug1(a) \
cout << "------\n" << #a << " = " << a << endl << "------" << endl
#define debug2(a, b) \
cout << "--------------\n" \
<< #a << " = " << a << " ; " << #b << " = " << b << endl \
<< "--------------" << endl
#define debug3(a, b, c) \
cout << "----------------------\n" \
<< #a << " = " << a << " ; " << #b << " = " << b << " ; " << #c \
<< " = " << c << endl \
<< "----------------------" << endl
#define sz(a) (ll)(a.size())
#define debug4(a) cout << "chu " << a << endl
#define endl "\n"
vector<ll> adj[100005];
bool visited[100005];
ll dp[100005];
void dfs(ll s) {
visited[s] = true;
for (auto it : adj[s]) {
if (!visited[it])
dfs(it);
dp[s] = max(dp[s], dp[it] + 1);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, m, x, y;
cin >> n >> m;
forn(i, 0, m) {
cin >> x >> y;
adj[x].pb(y);
}
for (ll i = 1; i <= n; i++) {
if (!visited[i])
dfs(i);
}
ll ans = 0;
forn(i, 1, n + 1) ans = max(ans, dp[i]);
cout << ans << endl;
return 0;
}
|
insert
| 32 | 32 | 32 | 33 |
TLE
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
void traverse(vector<int> &distances, vector<vector<int>> &adjList,
vector<bool> visited, int node) {
visited[node] = true;
for (int i = 0; i < adjList[node].size(); i++) {
if (!visited[adjList[node][i]])
traverse(distances, adjList, visited, adjList[node][i]);
distances[node] = max(distances[node], 1 + distances[adjList[node][i]]);
}
}
int main() {
int N, M;
int maxP = INT_MIN;
cin >> N >> M;
vector<vector<int>> adjList(N);
vector<int> distances(N, 0);
vector<bool> visited(N, false);
for (int i = 0; i < M; i++) {
pair<int, int> e;
cin >> e.first >> e.second;
adjList[e.first - 1].push_back(e.second - 1);
}
// for(int i=0;i<N-1;i++){
// for(int j=0;j<M;j++){
// pair<int,int> e = edges[j];
// int src = e.first;
// int dist = e.second;
// distances[dist-1] = max(distances[dist-1],1+distances[src-1]);
// }
// }
for (int i = 0; i < N; i++) {
if (!visited[i])
traverse(distances, adjList, visited, i);
}
for (int i = 0; i < N; i++) {
//
maxP = max(maxP, distances[i]);
}
cout << maxP;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void traverse(vector<int> &distances, vector<vector<int>> &adjList,
vector<bool> &visited, int node) {
visited[node] = true;
for (int i = 0; i < adjList[node].size(); i++) {
if (!visited[adjList[node][i]])
traverse(distances, adjList, visited, adjList[node][i]);
distances[node] = max(distances[node], 1 + distances[adjList[node][i]]);
}
}
int main() {
int N, M;
int maxP = INT_MIN;
cin >> N >> M;
vector<vector<int>> adjList(N);
vector<int> distances(N, 0);
vector<bool> visited(N, false);
for (int i = 0; i < M; i++) {
pair<int, int> e;
cin >> e.first >> e.second;
adjList[e.first - 1].push_back(e.second - 1);
}
// for(int i=0;i<N-1;i++){
// for(int j=0;j<M;j++){
// pair<int,int> e = edges[j];
// int src = e.first;
// int dist = e.second;
// distances[dist-1] = max(distances[dist-1],1+distances[src-1]);
// }
// }
for (int i = 0; i < N; i++) {
if (!visited[i])
traverse(distances, adjList, visited, i);
}
for (int i = 0; i < N; i++) {
//
maxP = max(maxP, distances[i]);
}
cout << maxP;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/*Template by hemnath_d(Enlightened by chamow)*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec vector<ll>
#define pll pair<ll, ll>
#define fastread \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fx first
#define sx second
#define inf 100000000000000
#define minf -100000000000000
#define maxi 105
vec adj[maxi];
/*Function to add an edge*/
// Undirected graph
void add_edge(ll a, ll b) { adj[a].pb(b); }
ll dp[maxi];
ll dfs(ll x) {
if (dp[x] != -1)
return dp[x];
ll ans = 0;
for (ll i = 0; i < adj[x].size(); i++)
ans = max(ans, dfs(adj[x][i]) + 1);
dp[x] = ans;
return ans;
}
int main() {
fastread;
ll n, m;
cin >> n >> m;
for (ll i = 0; i <= n; i++)
dp[i] = -1;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
add_edge(x, y);
}
ll ans = 0;
for (ll i = 1; i <= n; i++)
ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
/*Template by hemnath_d(Enlightened by chamow)*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vec vector<ll>
#define pll pair<ll, ll>
#define fastread \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fx first
#define sx second
#define inf 100000000000000
#define minf -100000000000000
#define maxi 100005
vec adj[maxi];
/*Function to add an edge*/
// Undirected graph
void add_edge(ll a, ll b) { adj[a].pb(b); }
ll dp[maxi];
ll dfs(ll x) {
if (dp[x] != -1)
return dp[x];
ll ans = 0;
for (ll i = 0; i < adj[x].size(); i++)
ans = max(ans, dfs(adj[x][i]) + 1);
dp[x] = ans;
return ans;
}
int main() {
fastread;
ll n, m;
cin >> n >> m;
for (ll i = 0; i <= n; i++)
dp[i] = -1;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
add_edge(x, y);
}
ll ans = 0;
for (ll i = 1; i <= n; i++)
ans = max(ans, dfs(i));
cout << ans << endl;
return 0;
}
|
replace
| 16 | 17 | 16 | 17 |
0
| |
p03166
|
C++
|
Runtime Error
|
#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;
typedef long long ll;
typedef long double ld;
typedef array<ll, 2> pll;
const ll NMAX = 10005;
ll dp[NMAX], deg[NMAX];
vector<ll> edg[NMAX];
int main() {
ll n, m, ans = 0;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
deg[b]++;
edg[a].push_back(b);
}
queue<ll> q;
for (ll i = 1; i <= n; i++) {
if (!deg[i]) {
q.push(i);
}
}
while (!q.empty()) {
for (auto it : edg[q.front()]) {
dp[it] = max(dp[it], dp[q.front()] + 1);
deg[it]--;
if (!deg[it])
q.push(it);
}
ans = max(ans, dp[q.front()]);
q.pop();
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef array<ll, 2> pll;
const ll NMAX = 100005;
ll dp[NMAX], deg[NMAX];
vector<ll> edg[NMAX];
int main() {
ll n, m, ans = 0;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
deg[b]++;
edg[a].push_back(b);
}
queue<ll> q;
for (ll i = 1; i <= n; i++) {
if (!deg[i]) {
q.push(i);
}
}
while (!q.empty()) {
for (auto it : edg[q.front()]) {
dp[it] = max(dp[it], dp[q.front()] + 1);
deg[it]--;
if (!deg[it])
q.push(it);
}
ans = max(ans, dp[q.front()]);
q.pop();
}
cout << ans;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N];
bool vis[N];
int dp[N], ans;
void dfs(int u) {
for (auto v : adj[u]) {
if (!vis[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].emplace_back(y);
}
for (int i = 1; i <= n; i++)
if (!vis[i])
dfs(i);
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> adj[N];
bool vis[N];
int dp[N], ans;
void dfs(int u) {
vis[u] = true;
for (auto v : adj[u]) {
if (!vis[v])
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
int n, m;
cin >> n >> m;
int x, y;
for (int i = 1; i <= m; i++) {
cin >> x >> y;
adj[x].emplace_back(y);
}
for (int i = 1; i <= n; i++)
if (!vis[i])
dfs(i);
for (int i = 1; i <= n; i++)
ans = max(ans, dp[i]);
cout << ans << "\n";
}
|
insert
| 10 | 10 | 10 | 11 |
TLE
| |
p03166
|
C++
|
Runtime Error
|
/* be name Khoda */
// VJUDGE
#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 100;
int dp[N], n, m;
vector<int> adj[N];
bool mark[N];
void dfs(int u) {
mark[u] = true;
for (auto v : adj[u]) {
if (!mark[v]) {
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
}
for (int i = 0; i < n; i++)
if (!mark[i])
dfs(i);
int maxi = 0;
for (int i = 0; i < n; i++)
maxi = max(maxi, dp[i]);
cout << maxi << endl;
}
|
/* be name Khoda */
// VJUDGE
#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1001;
int dp[N], n, m;
vector<int> adj[N];
bool mark[N];
void dfs(int u) {
mark[u] = true;
for (auto v : adj[u]) {
if (!mark[v]) {
dfs(v);
dp[u] = max(dp[u], dp[v] + 1);
}
dp[u] = max(dp[u], dp[v] + 1);
}
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
}
for (int i = 0; i < n; i++)
if (!mark[i])
dfs(i);
int maxi = 0;
for (int i = 0; i < n; i++)
maxi = max(maxi, dp[i]);
cout << maxi << endl;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03166
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, u, v, fix[100005], length[100005], ans;
vector<int> V[100005];
int go(int u) {
if (fix[u])
return length[u];
for (int i = 0; i < V[u].size(); i++) {
length[u] = max(length[u], go(V[u][i]) + 1);
}
return length[u];
}
int main() {
cin >> n >> m;
for (k = 1; k <= m; k++) {
cin >> u >> v;
V[v].push_back(u);
}
for (k = 1; k <= n; k++) {
if (fix[k] == 0) {
go(k);
}
ans = max(ans, length[k]);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, u, v, fix[100005], length[100005], ans;
vector<int> V[100005];
int go(int u) {
if (fix[u])
return length[u];
fix[u] = 1;
for (int i = 0; i < V[u].size(); i++) {
length[u] = max(length[u], go(V[u][i]) + 1);
}
return length[u];
}
int main() {
cin >> n >> m;
for (k = 1; k <= m; k++) {
cin >> u >> v;
V[v].push_back(u);
}
for (k = 1; k <= n; k++) {
if (fix[k] == 0) {
go(k);
}
ans = max(ans, length[k]);
}
cout << ans;
}
|
replace
| 8 | 9 | 8 | 9 |
TLE
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int dx[2] = {-1, 0};
int dy[2] = {0, -1};
long long vec[555][555];
int MOD = 1e9 + 7;
int main() {
int h, w;
cin >> h >> w;
vector<string> board(h, "");
for (int i = 0; i < h; ++i) {
cin >> board[i];
}
if (board[0][0] != '#')
vec[0][0] = 1;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (board[i][j] == '#')
continue;
for (int k = 0; k < 2; ++k) {
int x = dx[k] + i;
int y = dy[k] + j;
if (x >= 0 && y >= 0) {
if (board[x][y] != '#')
vec[i][j] = (vec[i][j] + vec[x][y]) % MOD;
}
}
}
}
cout << vec[h - 1][w - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[2] = {-1, 0};
int dy[2] = {0, -1};
long long vec[1010][1010];
int MOD = 1e9 + 7;
int main() {
int h, w;
cin >> h >> w;
vector<string> board(h, "");
for (int i = 0; i < h; ++i) {
cin >> board[i];
}
if (board[0][0] != '#')
vec[0][0] = 1;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
if (board[i][j] == '#')
continue;
for (int k = 0; k < 2; ++k) {
int x = dx[k] + i;
int y = dy[k] + j;
if (x >= 0 && y >= 0) {
if (board[x][y] != '#')
vec[i][j] = (vec[i][j] + vec[x][y]) % MOD;
}
}
}
}
cout << vec[h - 1][w - 1] << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
static int grid[1000][1000];
static uint path_count[1000][1000];
static const uint mod = 1'000'000'007;
int main() {
int h, w;
cin >> h >> w;
for (auto row = 0; row < h; row++) {
for (auto col = 0; col < w; col++) {
char c;
cin >> c;
grid[row][col] = c == '#' ? 1 : 0;
}
}
path_count[0][0] = 1;
for (auto i = 0; i < h + w - 1; i++) {
for (auto j = 0; j < w; j++) {
int col = j;
int row = i - j;
if (row < 0)
break;
if (grid[row][col] != 0)
continue;
if (col + 1 < w && grid[row][col + 1] == 0) {
path_count[row][col + 1] += path_count[row][col];
path_count[row][col + 1] %= mod;
}
if (row + 1 < h && grid[row + 1][col] == 0) {
path_count[row + 1][col] += path_count[row][col];
path_count[row + 1][col] %= mod;
}
}
}
cout << path_count[h - 1][w - 1] << endl;
}
|
#include <iostream>
using namespace std;
static int grid[1000][1000];
static uint path_count[1000][1000];
static const uint mod = 1'000'000'007;
int main() {
int h, w;
cin >> h >> w;
for (auto row = 0; row < h; row++) {
for (auto col = 0; col < w; col++) {
char c;
cin >> c;
grid[row][col] = c == '#' ? 1 : 0;
}
}
path_count[0][0] = 1;
for (auto i = 0; i < h + w - 1; i++) {
for (auto j = 0; j < w; j++) {
int col = j;
int row = i - j;
if (row >= h)
continue;
if (row < 0)
break;
if (grid[row][col] != 0)
continue;
if (col + 1 < w && grid[row][col + 1] == 0) {
path_count[row][col + 1] += path_count[row][col];
path_count[row][col + 1] %= mod;
}
if (row + 1 < h && grid[row + 1][col] == 0) {
path_count[row + 1][col] += path_count[row][col];
path_count[row + 1][col] %= mod;
}
}
}
cout << path_count[h - 1][w - 1] << endl;
}
|
insert
| 23 | 23 | 23 | 25 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define popb pop_back
#define beg begin()
#define en end()
#define sz(v) (int)((v).size())
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define endl "\n"
#define forn(i, a, n) for (int i = a; i < int(n); ++i)
#define forb(i, a, n) for (int i = int(n) - 1; i >= a; --i)
#define cout(ans) cout << ans << "\n"
#define mod 1000000007
void speed() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve() {
int r, c;
cin >> r >> c;
char cc[r + 1][c + 1];
ll dp[r + 1][c + 1];
forn(i, 0, r) { cin >> cc[i]; }
forn(i, 0, r) {
forn(j, 0, c) {
{ dp[i][j] = -1; }
}
}
int flag = 1;
forn(i, 0, r) {
if (cc[i][0] == '#') {
flag = 0;
}
dp[i][0] = flag;
}
flag = 1;
forn(i, 0, c) {
if (cc[i][0] == '#') {
flag = 0;
}
dp[0][i] = flag;
}
forn(i, 0, r) {
forn(j, 0, c) {
if (cc[i][j] == '#') {
dp[i][j] = 0;
}
}
}
forn(i, 1, r) {
forn(j, 1, c) {
if (dp[i][j] != 0) {
dp[i][j] = (dp[i - 1][j] % mod + dp[i][j - 1] % mod) % mod;
// cout(dp[i][j]);
}
}
}
cout(dp[r - 1][c - 1] % mod);
}
int main() {
speed();
// int tc;cin>>tc;
// while(tc--)
{ solve(); }
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define popb pop_back
#define beg begin()
#define en end()
#define sz(v) (int)((v).size())
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define endl "\n"
#define forn(i, a, n) for (int i = a; i < int(n); ++i)
#define forb(i, a, n) for (int i = int(n) - 1; i >= a; --i)
#define cout(ans) cout << ans << "\n"
#define mod 1000000007
void speed() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve() {
int r, c;
cin >> r >> c;
char cc[r + 1][c + 1];
ll dp[r + 1][c + 1];
forn(i, 0, r) { cin >> cc[i]; }
forn(i, 0, r) {
forn(j, 0, c) {
{ dp[i][j] = -1; }
}
}
int flag = 1;
forn(i, 0, r) {
if (cc[i][0] == '#') {
flag = 0;
}
dp[i][0] = flag;
}
flag = 1;
forn(i, 0, c) {
if (cc[0][i] == '#') {
flag = 0;
}
dp[0][i] = flag;
}
forn(i, 0, r) {
forn(j, 0, c) {
if (cc[i][j] == '#') {
dp[i][j] = 0;
}
}
}
forn(i, 1, r) {
forn(j, 1, c) {
if (dp[i][j] != 0) {
dp[i][j] = (dp[i - 1][j] % mod + dp[i][j - 1] % mod) % mod;
// cout(dp[i][j]);
}
}
}
cout(dp[r - 1][c - 1] % mod);
}
int main() {
speed();
// int tc;cin>>tc;
// while(tc--)
{ solve(); }
}
|
replace
| 45 | 46 | 45 | 46 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
int b[105][105];
long long output[105][105];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char x;
cin >> x;
if (x == '.')
b[i][j] = 0;
else
b[i][j] = 1;
}
}
for (int i = m - 2; i >= 0; i--) {
if (b[n - 1][i] == 1) {
for (int j = i; j >= 0; j--)
output[n - 1][j] = 0;
break;
}
output[n - 1][i] = 1;
}
for (int i = n - 2; i >= 0; i--) {
if (b[i][m - 1] == 1) {
for (int j = i; j >= 0; j--)
output[i][m - 1] = 0;
break;
}
output[i][m - 1] = 1;
}
for (int i = n - 2; i >= 0; i--) {
for (int j = m - 2; j >= 0; j--) {
if (b[i][j] == 1)
continue;
output[i][j] = output[i + 1][j] + output[i][j + 1];
output[i][j] = output[i][j] % MOD;
}
}
cout << output[0][0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
int b[1005][1005];
long long output[1005][1005];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char x;
cin >> x;
if (x == '.')
b[i][j] = 0;
else
b[i][j] = 1;
}
}
for (int i = m - 2; i >= 0; i--) {
if (b[n - 1][i] == 1) {
for (int j = i; j >= 0; j--)
output[n - 1][j] = 0;
break;
}
output[n - 1][i] = 1;
}
for (int i = n - 2; i >= 0; i--) {
if (b[i][m - 1] == 1) {
for (int j = i; j >= 0; j--)
output[i][m - 1] = 0;
break;
}
output[i][m - 1] = 1;
}
for (int i = n - 2; i >= 0; i--) {
for (int j = m - 2; j >= 0; j--) {
if (b[i][j] == 1)
continue;
output[i][j] = output[i + 1][j] + output[i][j + 1];
output[i][j] = output[i][j] % MOD;
}
}
cout << output[0][0] << endl;
return 0;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
input_from_file;
ll n, k, m, u, v;
cin >> n >> m;
vector<vector<char>> vec(n, vector<char>(m, 'a'));
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++)
cin >> vec[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(m, 0));
for (ll i = 0; i < n; i++) {
if (vec[i][0] == '.')
dp[i][0] = 1;
else
break;
}
for (ll i = 0; i < m; i++) {
if (vec[0][i] == '.')
dp[0][i] = 1;
else
break;
}
for (ll i = 1; i < n; i++) {
for (ll j = 1; j < m; j++) {
if (vec[i][j] == '.')
dp[i][j] = (dp[i - 1][j] % mod + dp[i][j - 1] % mod) % mod;
}
}
// for(ll i=0;i<n;i++){
// for(ll j=0;j<m;j++){
// cout<<dp[i][j]<<" ";
// }cout<<endl;
// }
cout << dp[n - 1][m - 1] % mod;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
ll n, k, m, u, v;
cin >> n >> m;
vector<vector<char>> vec(n, vector<char>(m, 'a'));
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++)
cin >> vec[i][j];
}
vector<vector<ll>> dp(n, vector<ll>(m, 0));
for (ll i = 0; i < n; i++) {
if (vec[i][0] == '.')
dp[i][0] = 1;
else
break;
}
for (ll i = 0; i < m; i++) {
if (vec[0][i] == '.')
dp[0][i] = 1;
else
break;
}
for (ll i = 1; i < n; i++) {
for (ll j = 1; j < m; j++) {
if (vec[i][j] == '.')
dp[i][j] = (dp[i - 1][j] % mod + dp[i][j - 1] % mod) % mod;
}
}
// for(ll i=0;i<n;i++){
// for(ll j=0;j<m;j++){
// cout<<dp[i][j]<<" ";
// }cout<<endl;
// }
cout << dp[n - 1][m - 1] % mod;
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
typedef set<char> sc;
typedef pair<int, int> pii;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const int INF = 1 << 29;
#define MOD (ll)(1e9 + 7)
#define eps 1e-6
#define pb push_back
#define mp make_pair
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define F first
#define S second
int main() {
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m;
cin >> n >> m;
string a[n];
REP(i, n) cin >> a[i];
long long dp[n][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j)
dp[i][j] = 0;
}
int curr = 1;
for (int i = 0; i < n; ++i) {
if (a[i][0] == '#') {
curr = 0;
}
dp[i][0] = curr;
}
curr = 1;
for (int i = 0; i < m; ++i) {
if (a[0][i] == '#') {
curr = 0;
}
dp[0][i] = curr;
}
for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (a[i][j] == '#') {
dp[i][j] = 0;
continue;
}
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= MOD;
}
}
// REP(i,n) {
// REP(j,m) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
cout << dp[n - 1][m - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
typedef set<char> sc;
typedef pair<int, int> pii;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const int INF = 1 << 29;
#define MOD (ll)(1e9 + 7)
#define eps 1e-6
#define pb push_back
#define mp make_pair
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define F first
#define S second
int main() {
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
string a[n];
REP(i, n) cin >> a[i];
long long dp[n][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j)
dp[i][j] = 0;
}
int curr = 1;
for (int i = 0; i < n; ++i) {
if (a[i][0] == '#') {
curr = 0;
}
dp[i][0] = curr;
}
curr = 1;
for (int i = 0; i < m; ++i) {
if (a[0][i] == '#') {
curr = 0;
}
dp[0][i] = curr;
}
for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (a[i][j] == '#') {
dp[i][j] = 0;
continue;
}
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= MOD;
}
}
// REP(i,n) {
// REP(j,m) {
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
cout << dp[n - 1][m - 1] << endl;
return 0;
}
|
delete
| 31 | 35 | 31 | 31 |
-11
| |
p03167
|
C++
|
Runtime Error
|
#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;
void solve() {
int n, m;
cin >> n >> m;
ll dp[n + 1][m + 1];
char a[n + 1][m + 1];
rep(i, 0, n + 1) a[i][0] = '#';
rep(i, 0, m + 1) a[0][i] = '#';
rep(i, 1, n + 1) rep(j, 1, m + 1) cin >> a[i][j];
mem(dp);
dp[1][1] = 1;
rep(i, 1, n + 1) {
rep(j, 1, n + 1) {
if (a[i][j] == '#')
continue;
dp[i][j] = (dp[i][j] + dp[i][j - 1]) % hell;
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % hell;
}
}
cout << dp[n][m];
}
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;
void solve() {
int n, m;
cin >> n >> m;
ll dp[n + 1][m + 1];
char a[n + 1][m + 1];
rep(i, 0, n + 1) a[i][0] = '#';
rep(i, 0, m + 1) a[0][i] = '#';
rep(i, 1, n + 1) rep(j, 1, m + 1) cin >> a[i][j];
mem(dp);
dp[1][1] = 1;
rep(i, 1, n + 1) {
rep(j, 1, m + 1) {
if (a[i][j] == '#')
continue;
dp[i][j] = (dp[i][j] + dp[i][j - 1]) % hell;
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % hell;
}
}
cout << dp[n][m];
}
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;
}
|
replace
| 39 | 40 | 39 | 40 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define fr front()
#define ba back()
#define tp top()
#define mem(x, n) memset(x, n, sizeof(x));
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pnl printf("\n")
#define len(x) x.length()
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
const int inf = (1 << 30);
const LL llinf = (1ll << 60);
const double eps = (1e-10);
// const double pi=2*acos(0.0);
// const double GOLD=((1+sqrt(5))/2);
const int xx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
const int yy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
/* \( ·w·)~ Clapie ~(·w· )/ */
int H, W;
char input[1005][1005];
LL arr[1005][1005];
int main() {
scanf("%d%d", &H, &W);
getchar();
for (int i = 0; i < H; i++) {
scanf("%s", input[i]);
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (input[i][j] != '.')
arr[i][j] = 0;
else if (i == 0 && j == 0)
arr[i][j] = 1;
else
arr[i][j] = (arr[i - 1][j] + arr[i][j - 1]) % MOD;
}
}
printf("%lld\n", arr[H - 1][W - 1] % MOD);
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
#define fr front()
#define ba back()
#define tp top()
#define mem(x, n) memset(x, n, sizeof(x));
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pnl printf("\n")
#define len(x) x.length()
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
const int inf = (1 << 30);
const LL llinf = (1ll << 60);
const double eps = (1e-10);
// const double pi=2*acos(0.0);
// const double GOLD=((1+sqrt(5))/2);
const int xx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
const int yy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
/* \( ·w·)~ Clapie ~(·w· )/ */
int H, W;
char input[1005][1005];
LL arr[1005][1005];
int main() {
scanf("%d%d", &H, &W);
getchar();
for (int i = 0; i < H; i++) {
scanf("%s", input[i]);
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (input[i][j] != '.')
arr[i][j] = 0;
else if (i == 0 && j == 0)
arr[i][j] = 1;
else if (i == 0)
arr[i][j] = arr[i][j - 1] % MOD;
else if (j == 0)
arr[i][j] = arr[i - 1][j] % MOD;
else
arr[i][j] = (arr[i - 1][j] + arr[i][j - 1]) % MOD;
}
}
printf("%lld\n", arr[H - 1][W - 1] % MOD);
}
|
insert
| 49 | 49 | 49 | 53 |
0
| |
p03167
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int D[1002][1002];
int MD = 1e9 + 7;
int main() {
int H, W;
cin >> H >> W;
char M[1002][1002];
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++)
cin >> M[i][j];
}
D[0][1] = 1;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++)
D[i][j] = (M[i][j] != '#') ? (D[i - 1][j] + D[i][j - 1]) % MD : 0;
}
cout << D[H][W] << endl;
int a, b;
while (a != -1) {
cin >> a >> b;
cout << D[a][b] << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int D[1002][1002];
int MD = 1e9 + 7;
int main() {
int H, W;
cin >> H >> W;
char M[1002][1002];
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++)
cin >> M[i][j];
}
D[0][1] = 1;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++)
D[i][j] = (M[i][j] != '#') ? (D[i - 1][j] + D[i][j - 1]) % MD : 0;
}
cout << D[H][W] << endl;
}
|
delete
| 26 | 33 | 26 | 26 |
TLE
| |
p03167
|
Python
|
Runtime Error
|
def paths(i, j):
if i == h - 1 and j == w - 1:
return 1
if a[i][0][j] == "#":
return 0
if i < h - 1 and j < w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i + 1, j) + paths(i, j + 1)
return dp[i][j]
else:
return dp[i][j]
elif i == h - 1 and j < w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i, j + 1)
return dp[i][j]
else:
return dp[i][j]
elif i < h - 1 and j == w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i + 1, j)
return dp[i][j]
else:
return dp[i][j]
h, w = map(int, input().split())
a = [[] for _ in range(h)]
m = 1000000007
for i in range(h):
a[i].append(input())
dp = [[-1 for _ in range(1000)] for _ in range(1000)]
print(paths(0, 0) % m)
|
import sys
sys.setrecursionlimit(20000)
def paths(i, j):
if i == h - 1 and j == w - 1:
return 1
if a[i][0][j] == "#":
return 0
if i < h - 1 and j < w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i + 1, j) + paths(i, j + 1)
return dp[i][j]
else:
return dp[i][j]
elif i == h - 1 and j < w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i, j + 1)
return dp[i][j]
else:
return dp[i][j]
elif i < h - 1 and j == w - 1:
if dp[i][j] == -1:
dp[i][j] = paths(i + 1, j)
return dp[i][j]
else:
return dp[i][j]
h, w = map(int, input().split())
a = [[] for _ in range(h)]
m = 1000000007
for i in range(h):
a[i].append(input())
dp = [[-1 for _ in range(1000)] for _ in range(1000)]
print(paths(0, 0) % m)
|
insert
| 0 | 0 | 0 | 5 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
vector<vector<ll>> dp(h, vector<ll>(w));
for (int j = 1; j < w; j++) {
if (a[0][j] == '#')
break;
else
dp[0][j] = 1;
}
for (int i = 1; i < w; i++) {
if (a[i][0] == '#')
break;
else
dp[i][0] = 1;
}
for (int i = 1; i < h; i++) {
for (int j = 1; j < w; j++) {
if (a[i][j] != '#') {
dp[i][j] += dp[i - 1][j];
dp[i][j] += dp[i][j - 1];
dp[i][j] %= mod;
} else
dp[i][j] = 0;
}
}
cout << dp[h - 1][w - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> Type lcm(Type x, Type y) { return x * y / gcd(x, y); }
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
ll h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; i++)
cin >> a[i];
vector<vector<ll>> dp(h, vector<ll>(w));
for (int j = 1; j < w; j++) {
if (a[0][j] == '#')
break;
else
dp[0][j] = 1;
}
for (int i = 1; i < h; i++) {
if (a[i][0] == '#')
break;
else
dp[i][0] = 1;
}
for (int i = 1; i < h; i++) {
for (int j = 1; j < w; j++) {
if (a[i][j] != '#') {
dp[i][j] += dp[i - 1][j];
dp[i][j] += dp[i][j - 1];
dp[i][j] %= mod;
} else
dp[i][j] = 0;
}
}
cout << dp[h - 1][w - 1] << endl;
}
|
replace
| 110 | 111 | 110 | 111 |
-11
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
/*
||||||||||||||||||||||||||||||||||||||||||||||||
| ||| | |||| |||| | |
| | | | | | | | | | |
| | | | | | | | | | |
||||||| | | ||||||| ||| ||| |||||
| | | | | | | | | | |
| | ||| | | | || |||| | |
||||||||||||||||||||||||||||||||||||||||||||||||
*/
using namespace std;
// #include "testlib.h"
#define ff first
#define ss second
#define mp make_pair
#define all(v) v.begin(), v.end()
#define int long long
#define ll long long
#define M 1000000007
#define inputarr(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i]
#define GCD(m, n) __gcd(m, n)
#define LCM(m, n) m *(n / GCD(m, n))
#define mii map<ll, ll>
#define msi map<string, ll>
#define mis map<ll int, string>
#define rep(a, b) for (ll i = a; i < b; i++)
#define rep0(n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define pb push_back
#define vi vector<ll>
#define mp make_pair
#define vs vector<string>
#define ppb pop_back
#define endl '\n'
#define asdf \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define r0 return 0;
#define FORD(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define FORE(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define inputoutput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define input freopen("input.txt", "r", stdin);
#define Set(a, s) 4(a, s, sizeof(a))
#define FOR repi
#define pii pair<int, int>
#define REVERSE(v) reverse(ALL(v))
#define display(x) \
trav(a, x) cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
// #define float long double
ll max(ll a, ll b) { return (a > b) ? a : b; }
int min(int a, int b) { return (a < b) ? a : b; }
int solve() {
int h, w;
cin >> h >> w;
int dp[h + 1][w + 1];
rep0(h + 1) repi(j, 0, w + 1) dp[i][j] = 0;
string s[h + 1];
rep0(h) cin >> s[i];
s[h] = "";
rep0(w + 1) s[h] += "#";
if (s[h - 1][w - 1] == '.')
dp[h - 1][w - 1] = 1;
s[h - 1][w - 1] = '#';
// cout<<"asdf";
int i = h - 1;
for (; i >= 0; i--) {
// cout<<i<<" ";
// cout<<i<<"jklvz ";
for (int j = w - 1; j >= 0; j--) { // cout<<'a';
if (s[i][j] == '.') {
dp[i][j] = (dp[i][j] + dp[i][j + 1]) % M;
dp[i][j] = (dp[i][j] + dp[i + 1][j]) % M;
// cout<<dp[i][j]<<" ";
}
}
}
cout << dp[0][0];
r0
}
signed main() {
asdf
#ifndef ONLINE_JUDGE
inputoutput
#endif
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; }
int solve() {
int h, w;
cin >> h >> w;
int dp[h + 1][w + 1];
rep0(h + 1) repi(j, 0, w + 1) dp[i][j] = 0;
string s[h + 1];
rep0(h) cin >> s[i];
s[h] = "";
rep0(w + 1) s[h] += "#";
if (s[h - 1][w - 1] == '.')
dp[h - 1][w - 1] = 1;
s[h - 1][w - 1] = '#';
// cout<<"asdf";
int i = h - 1;
for (; i >= 0; i--) {
// cout<<i<<" ";
// cout<<i<<"jklvz ";
for (int j = w - 1; j >= 0; j--) { // cout<<'a';
if (s[i][j] == '.') {
dp[i][j] = (dp[i][j] + dp[i][j + 1]) % M;
dp[i][j] = (dp[i][j] + dp[i + 1][j]) % M;
// cout<<dp[i][j]<<" ";
}
}
}
cout << dp[0][0];
r0
}
signed main() {
asdf
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
replace
| 110 | 113 | 110 | 111 |
-11
| |
p03167
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char a[1919][1919];
ll dp[1919][1919];
signed main() {
ll h, w;
cin >> h >> w;
rep(i, h) { rep(j, w) cin >> a[i][j]; }
dp[0][0] = 1;
rep(i, h) {
rep(j, w) {
if (a[i][j] == '#')
dp[i][j] = 0;
else if (i != 0 || j != 0)
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= 1000000007;
}
}
cout << dp[h - 1][w - 1] << endl;
getchar();
getchar();
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char a[1919][1919];
ll dp[1919][1919];
signed main() {
ll h, w;
cin >> h >> w;
rep(i, h) { rep(j, w) cin >> a[i][j]; }
dp[0][0] = 1;
rep(i, h) {
rep(j, w) {
if (a[i][j] == '#')
dp[i][j] = 0;
else if (i == 0 && j != 0)
dp[i][j] = dp[i][j - 1];
else if (j == 0 && i != 0)
dp[i][j] = dp[i - 1][j];
else if (i != 0 || j != 0)
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= 1000000007;
}
}
cout << dp[h - 1][w - 1] << endl;
getchar();
getchar();
return 0;
}
|
insert
| 24 | 24 | 24 | 28 |
0
| |
p03167
|
C++
|
Time Limit Exceeded
|
/////////////////////////////////TEST CASES////////////////////////////////////
/*
*/
/////////////////////////////////////CODE//////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = a; i > b; i--)
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define PI 3.14159265
typedef long long ll;
#define vl vector<ll>
#define IN(inp) \
ll inp; \
cin >> inp;
#define pb push_back
#define all(a) a.begin(), a.end()
#define FR(i, a) for (auto i : a)
#define what(A) cout << #A << " is " << A << endl;
ll MAX = 100000000000;
ll MOD = 1000000007;
ll h, w;
ll dp[1001][1001], vis[1001][1001];
char mat[1001][1001];
ll go(ll x, ll y) {
if (x == h - 1 and y == w - 1)
return 1;
if (x >= h or y >= w or mat[x][y] == '#')
return 0;
if (vis[x][y] != 0)
return dp[x][y];
dp[x][y] = (go(x + 1, y) + go(x, y + 1)) % MOD;
return dp[x][y];
}
void solve() {
cin >> h >> w;
FOR(i, 0, h) {
FOR(j, 0, w) { cin >> mat[i][j]; }
}
cout << go(0, 0);
}
int main() {
fastio
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
ll test = 1;
// cin >> test;
while (test--) {
solve();
}
}
|
/////////////////////////////////TEST CASES////////////////////////////////////
/*
*/
/////////////////////////////////////CODE//////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = a; i > b; i--)
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define PI 3.14159265
typedef long long ll;
#define vl vector<ll>
#define IN(inp) \
ll inp; \
cin >> inp;
#define pb push_back
#define all(a) a.begin(), a.end()
#define FR(i, a) for (auto i : a)
#define what(A) cout << #A << " is " << A << endl;
ll MAX = 100000000000;
ll MOD = 1000000007;
ll h, w;
ll dp[1001][1001], vis[1001][1001];
char mat[1001][1001];
ll go(ll x, ll y) {
if (x == h - 1 and y == w - 1)
return 1;
if (x >= h or y >= w or mat[x][y] == '#')
return 0;
if (vis[x][y] != 0)
return dp[x][y] % MOD;
vis[x][y] = 1;
dp[x][y] = (go(x + 1, y) + go(x, y + 1));
return (dp[x][y] >= MOD ? (dp[x][y] - MOD) : dp[x][y]);
}
void solve() {
cin >> h >> w;
FOR(i, 0, h) {
FOR(j, 0, w) { cin >> mat[i][j]; }
}
cout << go(0, 0);
}
int main() {
fastio
// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
ll test = 1;
// cin >> test;
while (test--) {
solve();
}
}
|
replace
| 30 | 33 | 30 | 34 |
TLE
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
using namespace std;
const ll MOD = 1000000007;
const ll INF = (1LL << 62);
ll dp[105][105];
int main() {
// std::cout << std::fixed << std::setprecision(10);
ll H, W;
scanf("%lld %lld", &H, &W);
vector<string> lines;
for (ll i = 0; i < H; i++) {
string s;
cin >> s;
lines.emplace_back(s);
}
dp[0][0] = 1;
for (ll y = 0; y < H; y++) {
for (ll x = 0; x < W; x++) {
if (y + 1 < H && lines[y + 1][x] == '.') {
dp[y + 1][x] += dp[y][x];
dp[y + 1][x] %= MOD;
// cout << y + 1 << " " << x << " " << dp[y + 1][x] << endl;
}
if (x + 1 < W && lines[y][x + 1] == '.') {
dp[y][x + 1] += dp[y][x];
dp[y][x + 1] %= MOD;
// cout << y << " " << x + 1 << " " << dp[y][x + 1] << endl;
}
}
}
/*
for (;;) {
pair<ll, ll> c = q.front();
q.pop();
cout << c.first << " " << c.second << endl;
bool can_v = false;
if (c.first + 1 < H && lines[c.first + 1][c.second] == '.') {
can_v = true;
}
bool can_h = false;
if (c.second + 1 < W && lines[c.first][c.second + 1] == '.') {
can_h = true;
}
if (can_v && can_h) {
q.push(make_pair(c.first + 1, c.second));
q.push(make_pair(c.first, c.second + 1));
dp[c.first + 1][c.second] = dp[c.first][c.second] + 1;
dp[c.first][c.second + 1] = dp[c.first][c.second] + 1;
} else if (can_v) {
q.push(make_pair(c.first + 1, c.second));
if (dp[c.first + 1][c.second] == 0) {
}
dp[c.first + 1][c.second] = dp[c.first][c.second];
} else if (can_h) {
q.push(make_pair(c.first, c.second + 1));
dp[c.first][c.second + 1] = dp[c.first][c.second];
}
}
*/
cout << dp[H - 1][W - 1] << endl;
}
|
#include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
using namespace std;
const ll MOD = 1000000007;
const ll INF = (1LL << 62);
ll dp[1005][1005];
int main() {
// std::cout << std::fixed << std::setprecision(10);
ll H, W;
scanf("%lld %lld", &H, &W);
vector<string> lines;
for (ll i = 0; i < H; i++) {
string s;
cin >> s;
lines.emplace_back(s);
}
dp[0][0] = 1;
for (ll y = 0; y < H; y++) {
for (ll x = 0; x < W; x++) {
if (y + 1 < H && lines[y + 1][x] == '.') {
dp[y + 1][x] += dp[y][x];
dp[y + 1][x] %= MOD;
// cout << y + 1 << " " << x << " " << dp[y + 1][x] << endl;
}
if (x + 1 < W && lines[y][x + 1] == '.') {
dp[y][x + 1] += dp[y][x];
dp[y][x + 1] %= MOD;
// cout << y << " " << x + 1 << " " << dp[y][x + 1] << endl;
}
}
}
/*
for (;;) {
pair<ll, ll> c = q.front();
q.pop();
cout << c.first << " " << c.second << endl;
bool can_v = false;
if (c.first + 1 < H && lines[c.first + 1][c.second] == '.') {
can_v = true;
}
bool can_h = false;
if (c.second + 1 < W && lines[c.first][c.second + 1] == '.') {
can_h = true;
}
if (can_v && can_h) {
q.push(make_pair(c.first + 1, c.second));
q.push(make_pair(c.first, c.second + 1));
dp[c.first + 1][c.second] = dp[c.first][c.second] + 1;
dp[c.first][c.second + 1] = dp[c.first][c.second] + 1;
} else if (can_v) {
q.push(make_pair(c.first + 1, c.second));
if (dp[c.first + 1][c.second] == 0) {
}
dp[c.first + 1][c.second] = dp[c.first][c.second];
} else if (can_h) {
q.push(make_pair(c.first, c.second + 1));
dp[c.first][c.second + 1] = dp[c.first][c.second];
}
}
*/
cout << dp[H - 1][W - 1] << endl;
}
|
replace
| 14 | 15 | 14 | 15 |
0
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define fastread \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define mp make_pair
#define print(a) \
for (auto x : a) \
cout << x << ' '; \
cout << endl;
#define printM(b) \
for (auto y : b) { \
print(y); \
}
#define printP(p) cout << p.first << ' ' << p.second << endl;
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long ull;
int main() {
fastread;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n, m, i, j;
cin >> n >> m;
string ar[n];
for (i = 0; i < n; ++i)
cin >> ar[i];
ll dp[n + 1][m + 1];
for (j = 0; j <= m; ++j)
dp[0][j] = 0;
for (i = 0; i <= n; ++i)
dp[i][0] = 0;
dp[0][1] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) {
if (ar[i - 1][j - 1] == '.')
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000007;
else
dp[i][j] = 0;
}
cout << dp[n][m];
return 0;
}
|
#include <bits/stdc++.h>
#define fastread \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl '\n'
#define pb push_back
#define mp make_pair
#define print(a) \
for (auto x : a) \
cout << x << ' '; \
cout << endl;
#define printM(b) \
for (auto y : b) { \
print(y); \
}
#define printP(p) cout << p.first << ' ' << p.second << endl;
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long ull;
int main() {
fastread;
ll n, m, i, j;
cin >> n >> m;
string ar[n];
for (i = 0; i < n; ++i)
cin >> ar[i];
ll dp[n + 1][m + 1];
for (j = 0; j <= m; ++j)
dp[0][j] = 0;
for (i = 0; i <= n; ++i)
dp[i][0] = 0;
dp[0][1] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) {
if (ar[i - 1][j - 1] == '.')
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000007;
else
dp[i][j] = 0;
}
cout << dp[n][m];
return 0;
}
|
delete
| 27 | 31 | 27 | 27 |
-11
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fs \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
ll n, m, dp[101][101], mod = 1000000007;
string s[101];
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> s[i];
}
if (s[0][0] == '.')
dp[0][0] = 1;
else
dp[0][0] = 0;
for (ll j = 1; j < m; j++) {
if (s[0][j] == '.')
dp[0][j] = dp[0][j - 1];
else
dp[0][j] = 0;
}
for (ll i = 1; i < n; i++) {
if (s[i][0] == '.')
dp[i][0] = dp[i - 1][0];
else
dp[i][0] = 0;
}
for (ll i = 1; i < n; i++) {
for (ll j = 1; j < m; j++) {
if (s[i][j] == '.') {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= mod;
} else
dp[i][j] = 0;
}
}
cout << dp[n - 1][m - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fs \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
ll n, m, dp[1001][1001], mod = 1000000007;
string s[1001];
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> s[i];
}
if (s[0][0] == '.')
dp[0][0] = 1;
else
dp[0][0] = 0;
for (ll j = 1; j < m; j++) {
if (s[0][j] == '.')
dp[0][j] = dp[0][j - 1];
else
dp[0][j] = 0;
}
for (ll i = 1; i < n; i++) {
if (s[i][0] == '.')
dp[i][0] = dp[i - 1][0];
else
dp[i][0] = 0;
}
for (ll i = 1; i < n; i++) {
for (ll j = 1; j < m; j++) {
if (s[i][j] == '.') {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
dp[i][j] %= mod;
} else
dp[i][j] = 0;
}
}
cout << dp[n - 1][m - 1];
}
|
replace
| 10 | 12 | 10 | 12 |
0
| |
p03167
|
C++
|
Time Limit Exceeded
|
// code.begin();
#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 pb push_back
#define what_is(x) cerr << #x << " is " << x << endl;
#define print(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define my_time \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long
#define endl "\n"
#define MOD 1000000007
const long long int INF = 1e18;
#define mod 1000000007
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// find_by_order(x)
// order_of_key(x)
int power(int x, unsigned int y) {
int res = 1;
while (y > 0) {
// if y is odd multiply with result
if (y & 1)
res = res * x;
y = y >> 1; // y=y/2;
x = x * x;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll max3(ll a, ll b, ll c) { return max(c, max(a, b)); }
int min3(int a, int b, int c) { return min(a, min(b, c)); }
int powermod(int x, int y, int p) {
int res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res % p;
}
int logg(int a) {
int x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
int modinv(int x) { return powermod(x, mod - 2, mod); }
int n, m;
char arr[1001][1001];
ll dp[1003][1003];
int solve(int i, int j) {
if (i == n - 1 && j == m - 1) {
return 1;
}
if (i >= n || j >= m)
return 0;
if (dp[i][j] != 0) {
return dp[i][j];
}
int r = 0;
int d = 0;
if (i < n && arr[i + 1][j] == '.') {
dp[i + 1][j] = solve(i + 1, j) % mod;
}
if (j < m && arr[i][j + 1] == '.') {
dp[i][j + 1] = solve(i, j + 1) % mod;
}
return dp[i][j] = (dp[i + 1][j] + dp[i][j + 1]) % mod;
}
int main() {
my_time;
int t;
t = 1;
// cin>>t;int test=0;
while (t--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> arr[i][j];
}
}
memset(dp, 0, sizeof dp);
cout << (solve(0, 0)) % mod;
}
return 0;
}
// code.end();
|
// code.begin();
#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 pb push_back
#define what_is(x) cerr << #x << " is " << x << endl;
#define print(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define my_time \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long
#define endl "\n"
#define MOD 1000000007
const long long int INF = 1e18;
#define mod 1000000007
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// find_by_order(x)
// order_of_key(x)
int power(int x, unsigned int y) {
int res = 1;
while (y > 0) {
// if y is odd multiply with result
if (y & 1)
res = res * x;
y = y >> 1; // y=y/2;
x = x * x;
}
return res;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll max3(ll a, ll b, ll c) { return max(c, max(a, b)); }
int min3(int a, int b, int c) { return min(a, min(b, c)); }
int powermod(int x, int y, int p) {
int res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res % p;
}
int logg(int a) {
int x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
int modinv(int x) { return powermod(x, mod - 2, mod); }
int n, m;
char arr[1001][1001];
ll dp[1003][1003];
int solve(int i, int j) {
if (i == n - 1 && j == m - 1) {
return 1;
}
if (i >= n || j >= m)
return 0;
if (dp[i][j] != 0) {
return dp[i][j];
}
int r = 0;
int d = 0;
if (i < n && arr[i + 1][j] == '.') {
dp[i + 1][j] = solve(i + 1, j) % mod;
}
if (j < m && arr[i][j + 1] == '.') {
dp[i][j + 1] = solve(i, j + 1) % mod;
}
return dp[i][j] = (dp[i + 1][j] + dp[i][j + 1]) % mod;
}
int main() {
my_time;
int t;
t = 1;
// cin>>t;int test=0;
while (t--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> arr[i][j];
}
}
memset(dp, 0, sizeof dp);
// cout<<(solve(0,0))%mod;
dp[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (arr[i][j] == '#') {
continue;
}
if (i - 1 >= 0) {
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
}
if (j - 1 >= 0) {
dp[i][j] = (dp[i][j] + dp[i][j - 1]) % mod;
}
}
}
cout << dp[n - 1][m - 1] << endl;
}
return 0;
}
// code.end();
|
replace
| 118 | 119 | 118 | 136 |
TLE
| |
p03167
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
int n, m, dp[1005][1005];
char a[1005][1005];
int solve(int i, int j) {
if (i == n && j == m)
return 1;
if (dp[i][j] != -1)
return dp[i][j];
int cur = 0;
if (i + 1 <= n && a[i + 1][j] == '.')
cur += solve(i + 1, j) % mod;
if (j + 1 <= m && a[i][j + 1] == '.')
cur += solve(i, j + 1) % mod;
return cur % mod;
}
int main() {
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
cout << solve(1, 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
int n, m, dp[1005][1005];
char a[1005][1005];
int solve(int i, int j) {
if (i == n && j == m)
return 1;
if (dp[i][j] != -1)
return dp[i][j];
int cur = 0;
if (i + 1 <= n && a[i + 1][j] == '.') {
dp[i + 1][j] = solve(i + 1, j);
if (dp[i + 1][j] >= mod)
dp[i + 1][j] -= mod;
cur += dp[i + 1][j];
}
if (j + 1 <= m && a[i][j + 1] == '.') {
dp[i][j + 1] = solve(i, j + 1);
if (dp[i][j + 1] >= mod)
dp[i][j + 1] -= mod;
cur += dp[i][j + 1];
}
if (cur >= mod)
cur -= mod;
return cur;
}
int main() {
cin >> n >> m;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
cout << solve(1, 1);
return 0;
}
|
replace
| 16 | 21 | 16 | 31 |
TLE
| |
p03167
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define forloop for (int i = 0; i < n; i++)
#define pb push_back
#define ull unsigned long long
#define ll long long
#define mod 1000000007
#define MOD 998244353;
#define unmap unordered_map
#define pi 3.1415926536
#define testcases \
ll t; \
cin >> t; \
while (t--)
#define mp make_pair
#define vcp vector<pair<ll, ll>>
#define preci(x, y) fixed << setprecision(y) << x
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define preinc priority_queue<ll, vector<ll>, greater<ll>>
#define predec priority_queue<ll>
#define vll vector<ll>
#define f(a, b) for (ll i = a; i <= b; i++)
ll path(vector<vector<char>> ch, int i, int j, vector<vector<ll>> &v, int n,
int m) {
if (i == n - 1 && j == m - 1)
return 1;
if (i >= n || j >= m)
return 0;
if (ch[i][j] == '#')
return 0;
if (v[i][j] != -1)
return v[i][j];
int ans = 0, ans1 = 0;
if (i + 1 < n && ch[i + 1][j] != '#')
ans = path(ch, i + 1, j, v, n, m) % mod;
if (j + 1 < m && ch[i][j + 1] != '#')
ans1 = path(ch, i, j + 1, v, n, m) % mod;
v[i][j] = (ans + ans1) % mod;
return v[i][j];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast int n, m;
cin >> n >> m;
vector<vector<char>> ch(n, vector<char>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> ch[i][j];
}
vector<vector<ll>> v(n + 1, vector<ll>(m + 1, -1));
cout << path(ch, 0, 0, v, n, m);
// your code goes here
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define forloop for (int i = 0; i < n; i++)
#define pb push_back
#define ull unsigned long long
#define ll long long
#define mod 1000000007
#define MOD 998244353;
#define unmap unordered_map
#define pi 3.1415926536
#define testcases \
ll t; \
cin >> t; \
while (t--)
#define mp make_pair
#define vcp vector<pair<ll, ll>>
#define preci(x, y) fixed << setprecision(y) << x
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define preinc priority_queue<ll, vector<ll>, greater<ll>>
#define predec priority_queue<ll>
#define vll vector<ll>
#define f(a, b) for (ll i = a; i <= b; i++)
ll path(vector<vector<char>> &ch, int i, int j, vector<vector<ll>> &v, int n,
int m) {
if (i == n - 1 && j == m - 1)
return 1;
if (i >= n || j >= m)
return 0;
if (ch[i][j] == '#')
return 0;
if (v[i][j] != -1)
return v[i][j];
int ans = 0, ans1 = 0;
if (i + 1 < n && ch[i + 1][j] != '#')
ans = path(ch, i + 1, j, v, n, m) % mod;
if (j + 1 < m && ch[i][j + 1] != '#')
ans1 = path(ch, i, j + 1, v, n, m) % mod;
v[i][j] = (ans + ans1) % mod;
return v[i][j];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast int n, m;
cin >> n >> m;
vector<vector<char>> ch(n, vector<char>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
cin >> ch[i][j];
}
vector<vector<ll>> v(n + 1, vector<ll>(m + 1, -1));
cout << path(ch, 0, 0, v, n, m);
// your code goes here
return 0;
}
|
replace
| 28 | 29 | 28 | 29 |
TLE
| |
p03167
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
vector<ll> a, b, c;
map<ll, ll> m1, m2, m3;
ll mod = 1e9 + 7;
char s[150][150];
ll dp[150][150];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m, i, j;
cin >> r >> c;
FOR(i, 0, r - 1) FOR(j, 0, c - 1) { cin >> s[i][j]; }
dp[0][0] = 1;
FOR(i, 0, r - 1) FOR(j, 0, c - 1) {
if (s[i][j] == '#')
continue;
if (i - 1 >= 0)
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
if (j - 1 >= 0)
dp[i][j] = (dp[i][j] + dp[i][j - 1]) % mod;
}
std::cout << dp[r - 1][c - 1] << '\n';
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("atomm.txt", "r", stdin);
// #endif
FAST();
// CASES
//{
Execute();
//}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
vector<ll> a, b, c;
map<ll, ll> m1, m2, m3;
ll mod = 1e9 + 7;
char s[1001][1001];
ll dp[1001][1001];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m, i, j;
cin >> r >> c;
FOR(i, 0, r - 1) FOR(j, 0, c - 1) { cin >> s[i][j]; }
dp[0][0] = 1;
FOR(i, 0, r - 1) FOR(j, 0, c - 1) {
if (s[i][j] == '#')
continue;
if (i - 1 >= 0)
dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
if (j - 1 >= 0)
dp[i][j] = (dp[i][j] + dp[i][j - 1]) % mod;
}
std::cout << dp[r - 1][c - 1] << '\n';
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("atomm.txt", "r", stdin);
// #endif
FAST();
// CASES
//{
Execute();
//}
}
|
replace
| 40 | 42 | 40 | 42 |
0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.