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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const ld EPS = 1e-10;
template <typename T> bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
};
template <typename T> bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
};
const int MAX_V = 1e5;
vector<int> es[MAX_V];
int st, en; // 端点
vector<int> d(MAX_V, 0);
void dfs(int now, int pre) {
if (pre == -1)
d[now] = 0;
else
d[now] = d[pre] + 1;
for (auto &e : es[now]) {
if (e == pre)
continue;
dfs(e, now);
}
}
int tree_diameter() {
dfs(0, -1);
int ret = -1;
rep(i, MAX_V) {
if (chmax(ret, d[i]))
st = i;
}
dfs(st, -1);
ret = -1;
rep(i, MAX_V) {
if (chmax(ret, d[i]))
en = i;
}
return ret;
}
int main() {
int N;
cin >> N;
rep(i, N - 1) {
int u, v;
cin >> u >> v;
u--, v--;
es[u].pb(v), es[v].pb(u);
}
int r = tree_diameter();
if (r % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const ld EPS = 1e-10;
template <typename T> bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
};
template <typename T> bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
};
const int MAX_V = 2e5;
vector<int> es[MAX_V];
int st, en; // 端点
vector<int> d(MAX_V, 0);
void dfs(int now, int pre) {
if (pre == -1)
d[now] = 0;
else
d[now] = d[pre] + 1;
for (auto &e : es[now]) {
if (e == pre)
continue;
dfs(e, now);
}
}
int tree_diameter() {
dfs(0, -1);
int ret = -1;
rep(i, MAX_V) {
if (chmax(ret, d[i]))
st = i;
}
dfs(st, -1);
ret = -1;
rep(i, MAX_V) {
if (chmax(ret, d[i]))
en = i;
}
return ret;
}
int main() {
int N;
cin >> N;
rep(i, N - 1) {
int u, v;
cin >> u >> v;
u--, v--;
es[u].pb(v), es[v].pb(u);
}
int r = tree_diameter();
if (r % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
vector<pair<int, int>> g[100000];
pair<int, int> tddfs(int v, int par = -1) {
pair<int, int> ret = {0, v};
for (auto &x : g[v]) {
int w, cost;
tie(w, cost) = x;
if (w == par)
continue;
auto r = tddfs(w, v);
ret = max(ret, {cost + r.first, r.second});
}
return ret;
}
int treeDiameter() {
auto v = tddfs(0);
auto w = tddfs(v.second);
return w.first;
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// 1 -> o, 2 -> x, 3 -> o, 4 -> o, 5 -> x, 6 -> o, 7 -> o,
int N;
cin >> N;
vector<bool> win(N + 1);
win[1] = true;
win[2] = false;
for (int i = 3; i <= N; i++) {
if (i % 3 == 2)
win[i] = false;
else
win[i] = true;
}
rep(i, N - 1) {
int a, b;
cin >> a >> b;
g[a - 1].push_back({b - 1, 1});
g[b - 1].push_back({a - 1, 1});
}
int ret = treeDiameter();
// cout << ret << endl;
if (win[ret + 1])
cout << "First" << endl;
else
cout << "Second" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
vector<pair<int, int>> g[200000];
pair<int, int> tddfs(int v, int par = -1) {
pair<int, int> ret = {0, v};
for (auto &x : g[v]) {
int w, cost;
tie(w, cost) = x;
if (w == par)
continue;
auto r = tddfs(w, v);
ret = max(ret, {cost + r.first, r.second});
}
return ret;
}
int treeDiameter() {
auto v = tddfs(0);
auto w = tddfs(v.second);
return w.first;
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// 1 -> o, 2 -> x, 3 -> o, 4 -> o, 5 -> x, 6 -> o, 7 -> o,
int N;
cin >> N;
vector<bool> win(N + 1);
win[1] = true;
win[2] = false;
for (int i = 3; i <= N; i++) {
if (i % 3 == 2)
win[i] = false;
else
win[i] = true;
}
rep(i, N - 1) {
int a, b;
cin >> a >> b;
g[a - 1].push_back({b - 1, 1});
g[b - 1].push_back({a - 1, 1});
}
int ret = treeDiameter();
// cout << ret << endl;
if (win[ret + 1])
cout << "First" << endl;
else
cout << "Second" << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sqr(x) ((x) * (x))
#define mp make_pair
#define uint unsigned
#define PI pair<int, int>
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
#define gc getchar
inline ll read() {
ll x = 0;
char ch = gc();
bool positive = 1;
for (; !isdigit(ch); ch = gc())
if (ch == '-')
positive = 0;
for (; isdigit(ch); ch = gc())
x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a) {
if (a < 0) {
a = -a;
putchar('-');
}
if (a >= 10)
write(a / 10);
putchar('0' + a % 10);
}
inline void writeln(ll a) {
write(a);
puts("");
}
inline void wri(ll a) {
write(a);
putchar(' ');
}
inline ull rnd() { return ((ull)rand() << 30 ^ rand()) << 4 | rand() % 4; }
const int N = 100005;
int ss, s;
vector<int> v[N];
void dfs(int p, int fa, int dep) {
if (dep > ss) {
ss = dep;
s = p;
}
for (auto i : v[p])
if (i != fa)
dfs(i, p, dep + 1);
}
int main() {
int n = read();
for (int i = 1; i < n; i++) {
int s = read(), t = read();
v[s].push_back(t);
v[t].push_back(s);
}
dfs(1, 0, 1);
ss = 0;
dfs(s, 0, 1);
if (ss % 3 == 2)
puts("Second");
else
puts("First");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sqr(x) ((x) * (x))
#define mp make_pair
#define uint unsigned
#define PI pair<int, int>
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
#define gc getchar
inline ll read() {
ll x = 0;
char ch = gc();
bool positive = 1;
for (; !isdigit(ch); ch = gc())
if (ch == '-')
positive = 0;
for (; isdigit(ch); ch = gc())
x = x * 10 + ch - '0';
return positive ? x : -x;
}
inline void write(ll a) {
if (a < 0) {
a = -a;
putchar('-');
}
if (a >= 10)
write(a / 10);
putchar('0' + a % 10);
}
inline void writeln(ll a) {
write(a);
puts("");
}
inline void wri(ll a) {
write(a);
putchar(' ');
}
inline ull rnd() { return ((ull)rand() << 30 ^ rand()) << 4 | rand() % 4; }
const int N = 200005;
int ss, s;
vector<int> v[N];
void dfs(int p, int fa, int dep) {
if (dep > ss) {
ss = dep;
s = p;
}
for (auto i : v[p])
if (i != fa)
dfs(i, p, dep + 1);
}
int main() {
int n = read();
for (int i = 1; i < n; i++) {
int s = read(), t = read();
v[s].push_back(t);
v[t].push_back(s);
}
dfs(1, 0, 1);
ss = 0;
dfs(s, 0, 1);
if (ss % 3 == 2)
puts("Second");
else
puts("First");
} | replace | 45 | 46 | 45 | 46 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
#define mod 1000000007
using namespace std;
typedef long long ll;
bool chmax(ll &a, ll b) {
if (a > b)
return 0;
a = b;
return 1;
}
bool chmin(ll &a, ll b) {
if (a < b)
return 0;
a = b;
return 1;
}
#define mad(a, b) a = (a + b) % mod
#define mul(a, b) a = a * b % mod
ll n;
vector<ll> g[200010];
ll ma, pnt;
void dfs(ll x, ll from, ll d) {
if (d >= ma)
ma = d, pnt = x;
for (auto y : g[x])
if (y != from) {
dfs(y, x, d + 1);
}
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
ma = -1;
dfs(1, 0, 0);
dfs(pnt, 0, 0);
if (ma % 3 != 1)
cout << "First" << endl;
else
cout << "Second" << endl;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
#define mod 1000000007
using namespace std;
typedef long long ll;
bool chmax(ll &a, ll b) {
if (a > b)
return 0;
a = b;
return 1;
}
bool chmin(ll &a, ll b) {
if (a < b)
return 0;
a = b;
return 1;
}
#define mad(a, b) a = (a + b) % mod
#define mul(a, b) a = a * b % mod
ll n;
vector<ll> g[200010];
ll ma, pnt;
void dfs(ll x, ll from, ll d) {
if (d >= ma)
ma = d, pnt = x;
for (auto y : g[x])
if (y != from) {
dfs(y, x, d + 1);
}
}
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
ll a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
ma = -1;
dfs(1, 0, 0);
dfs(pnt, 0, 0);
if (ma % 3 != 1)
cout << "First" << endl;
else
cout << "Second" << endl;
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03055 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG_
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) (void)0
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int MAXN = 2e5 + 100;
VI e[MAXN];
int d1[MAXN], d2[MAXN];
void DFS(int x, int par, int dep, int *dis) {
dis[x] = dep;
for (int u : e[x]) {
if (u == par)
continue;
DFS(u, x, dep + 1, dis);
}
}
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i < N; i++) {
int a, b;
scanf("%d%d", &a, &b);
e[a].PB(b);
e[b].PB(a);
}
DFS(1, 0, 0, d1);
int p = 1;
for (int i = 2; i <= N; i++)
if (d1[i] > d1[p])
p = i;
DFS(p, 0, 0, d2);
int len = 0;
for (int i = 1; i <= N; i++)
len = max(len, d2[i]);
debug("%d\n", len);
if (len % 3 == 1)
puts("Second");
else
puts("First");
return 0;
}
| #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG_
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) (void)0
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int MAXN = 2e5 + 100;
VI e[MAXN];
int d1[MAXN], d2[MAXN];
void DFS(int x, int par, int dep, int *dis) {
dis[x] = dep;
// for (int u : e[x]) {
for (size_t i = 0; i < e[x].size(); i++) {
int u = e[x][i];
if (u == par)
continue;
DFS(u, x, dep + 1, dis);
}
}
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i < N; i++) {
int a, b;
scanf("%d%d", &a, &b);
e[a].PB(b);
e[b].PB(a);
}
DFS(1, 0, 0, d1);
int p = 1;
for (int i = 2; i <= N; i++)
if (d1[i] > d1[p])
p = i;
DFS(p, 0, 0, d2);
int len = 0;
for (int i = 1; i <= N; i++)
len = max(len, d2[i]);
debug("%d\n", len);
if (len % 3 == 1)
puts("Second");
else
puts("First");
return 0;
}
| replace | 23 | 24 | 23 | 26 | TLE | |
p03055 | C++ | Runtime Error | /*
* =template=.cpp
* Copyright (C) 2017 hzw <hzw@huzhenweideMacBook.local>
*
* Distributed under terms of the MIT license.
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <signal.h>
#include <string>
#include <unistd.h>
#define FR first
#define SC second
#define MP make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define ws wss
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
void read(int &x) {
char ch;
int fu = 1;
while ((ch = getchar()) <= 32)
;
x = 0;
if (ch == '-')
fu = -1;
else
x = ch - 48;
while ((ch = getchar()) > 32)
x = x * 10 + ch - 48;
x *= fu;
}
template <class T> void upmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void upmin(T &a, T b) {
if (a > b)
a = b;
}
//---------template--------------
const int N = 210000, p = 1000000007;
struct Edge {
int y, ne;
};
int n, num;
int d[N];
Edge e[N];
int last[N];
void dfs(int i) {
for (int j = last[i]; j; j = e[j].ne)
if (d[e[j].y] == 0) {
d[e[j].y] = d[i] + 1;
dfs(e[j].y);
}
}
void add(int x, int y) {
e[++num] = (Edge){y, last[x]};
last[x] = num;
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
d[1] = 1;
dfs(1);
int q = 1;
for (int i = 2; i <= n; i++)
if (d[i] > d[q])
q = i;
for (int i = 1; i <= n; i++)
d[i] = 0;
d[q] = 1;
dfs(q);
int r = 0;
for (int i = 1; i <= n; i++)
r = max(r, d[i]);
puts(r % 3 == 2 ? "Second" : "First");
}
/*
0 1 2 3 4 5
0 1 0 1 1 0
*/
| /*
* =template=.cpp
* Copyright (C) 2017 hzw <hzw@huzhenweideMacBook.local>
*
* Distributed under terms of the MIT license.
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <signal.h>
#include <string>
#include <unistd.h>
#define FR first
#define SC second
#define MP make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define pb push_back
#define ws wss
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
void read(int &x) {
char ch;
int fu = 1;
while ((ch = getchar()) <= 32)
;
x = 0;
if (ch == '-')
fu = -1;
else
x = ch - 48;
while ((ch = getchar()) > 32)
x = x * 10 + ch - 48;
x *= fu;
}
template <class T> void upmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void upmin(T &a, T b) {
if (a > b)
a = b;
}
//---------template--------------
const int N = 210000, p = 1000000007;
struct Edge {
int y, ne;
};
int n, num;
int d[N];
Edge e[N * 2];
int last[N];
void dfs(int i) {
for (int j = last[i]; j; j = e[j].ne)
if (d[e[j].y] == 0) {
d[e[j].y] = d[i] + 1;
dfs(e[j].y);
}
}
void add(int x, int y) {
e[++num] = (Edge){y, last[x]};
last[x] = num;
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
d[1] = 1;
dfs(1);
int q = 1;
for (int i = 2; i <= n; i++)
if (d[i] > d[q])
q = i;
for (int i = 1; i <= n; i++)
d[i] = 0;
d[q] = 1;
dfs(q);
int r = 0;
for (int i = 1; i <= n; i++)
r = max(r, d[i]);
puts(r % 3 == 2 ? "Second" : "First");
}
/*
0 1 2 3 4 5
0 1 0 1 1 0
*/
| replace | 58 | 59 | 58 | 59 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using P = pair<int, int>;
const int MAX = 1e5;
struct edge {
int to, cost;
};
struct Diameter {
int from, to, d;
};
vector<edge> g[MAX];
P farthest(int u, int p) {
P r(0, u);
for (auto e : g[u]) {
if (e.to == p)
continue;
P c = farthest(e.to, u);
c.first += e.cost;
r = max(r, c);
}
return r;
}
Diameter tree_diameter() {
P p = farthest(0, -1);
P q = farthest(p.second, -1);
return Diameter{p.second, q.second, q.first};
}
int main() {
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(edge{b, 1});
g[b].push_back(edge{a, 1});
}
Diameter d = tree_diameter();
cout << (d.d % 3 == 1 ? "Second" : "First") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using P = pair<int, int>;
const int MAX = 2e5;
struct edge {
int to, cost;
};
struct Diameter {
int from, to, d;
};
vector<edge> g[MAX];
P farthest(int u, int p) {
P r(0, u);
for (auto e : g[u]) {
if (e.to == p)
continue;
P c = farthest(e.to, u);
c.first += e.cost;
r = max(r, c);
}
return r;
}
Diameter tree_diameter() {
P p = farthest(0, -1);
P q = farthest(p.second, -1);
return Diameter{p.second, q.second, q.first};
}
int main() {
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(edge{b, 1});
g[b].push_back(edge{a, 1});
}
Diameter d = tree_diameter();
cout << (d.d % 3 == 1 ? "Second" : "First") << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef RUS_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef RUS_HOME
freopen("input", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef RUS_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
const int N = 2e5 + 100;
vi g[N];
int d[N], otv[N];
void dfs(int v, int pr, int h) {
d[v] = h;
for (auto p : g[v]) {
if (p == pr)
continue;
dfs(p, v, d[v] + 1);
}
}
void smain() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(1, 1, 0);
int cur = 0, vert = 1;
for (int i = 1; i <= n; i++) {
if (d[i] > cur) {
cur = d[i];
vert = i;
}
}
dfs(vert, vert, 0);
cur = 0;
for (int i = 1; i <= n; i++) {
if (d[i] > cur) {
cur = d[i];
}
}
vi dp(cur + 1);
dp[0] = 1;
for (int i = 1; i <= cur; i++) {
if (dp[i - 1] == 2) {
dp[i] = 1;
continue;
}
if (i > 1 && dp[i - 2] == 2) {
dp[i] = 1;
continue;
}
dp[i] = 2;
}
if (dp[cur] == 1)
cout << "First";
else
cout << "Second";
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef RUS_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef RUS_HOME
freopen("input", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef RUS_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
const int N = 2e5 + 100;
vi g[N];
int d[N], otv[N];
void dfs(int v, int pr, int h) {
d[v] = h;
for (auto p : g[v]) {
if (p == pr)
continue;
dfs(p, v, d[v] + 1);
}
}
void smain() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(1, 1, 0);
int cur = 0, vert = 1;
for (int i = 1; i <= n; i++) {
if (d[i] > cur) {
cur = d[i];
vert = i;
}
}
dfs(vert, vert, 0);
cur = 0;
for (int i = 1; i <= n; i++) {
if (d[i] > cur) {
cur = d[i];
}
}
vi dp(cur + 1);
dp[0] = 1;
for (int i = 1; i <= cur; i++) {
if (dp[i - 1] == 2) {
dp[i] = 1;
continue;
}
if (i > 1 && dp[i - 2] == 2) {
dp[i] = 1;
continue;
}
dp[i] = 2;
}
if (dp[cur] == 1)
cout << "First";
else
cout << "Second";
} | replace | 124 | 125 | 124 | 125 | 0 | |
p03055 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>;
#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP \
{ \
cin.tie(NULL); \
ios::sync_with_stdio(false); \
}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
for (int i = 0; i < M; ++i)
Fill(dest[i], val);
}
template <class T> T Next() {
T buf;
cin >> buf;
return buf;
}
istream &Ignore(istream &ist) {
string s;
ist >> s;
return ist;
}
bool Inside(int i, int j, int h, int w) {
return i >= 0 && i < h && j >= 0 && j < w;
}
#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BIT.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "FFT.h"
#include "Factorization.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "Interpolation.h"
#include "KDTree.h"
#include "LIS.h"
#include "LazySegmentTree.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif
#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
LL tmp;
ist >> tmp;
val = tmp;
return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
LL tmp = val;
ost << tmp;
return ost;
}
#endif
int n;
vector<int> G[100000];
int D[100000];
void rec(int from, int prev, int dep) {
D[from] = dep;
for (int to : G[from]) {
if (to == prev)
continue;
rec(to, from, dep + 1);
}
}
int sub(int from) {
Fill(D, 0);
rec(from, -1, 0);
return max_element(D, D + n) - D;
}
int main() {
cin >> n;
REP(i, 1, n) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
int v = sub(0);
int u = sub(v);
int d = D[u];
cout << (d % 3 == 1 ? "Second" : "First") << endl;
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>;
#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP \
{ \
cin.tie(NULL); \
ios::sync_with_stdio(false); \
}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
for (int i = 0; i < M; ++i)
Fill(dest[i], val);
}
template <class T> T Next() {
T buf;
cin >> buf;
return buf;
}
istream &Ignore(istream &ist) {
string s;
ist >> s;
return ist;
}
bool Inside(int i, int j, int h, int w) {
return i >= 0 && i < h && j >= 0 && j < w;
}
#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BIT.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "FFT.h"
#include "Factorization.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "Interpolation.h"
#include "KDTree.h"
#include "LIS.h"
#include "LazySegmentTree.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif
#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
LL tmp;
ist >> tmp;
val = tmp;
return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
LL tmp = val;
ost << tmp;
return ost;
}
#endif
int n;
vector<int> G[200000];
int D[200000];
void rec(int from, int prev, int dep) {
D[from] = dep;
for (int to : G[from]) {
if (to == prev)
continue;
rec(to, from, dep + 1);
}
}
int sub(int from) {
Fill(D, 0);
rec(from, -1, 0);
return max_element(D, D + n) - D;
}
int main() {
cin >> n;
REP(i, 1, n) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
int v = sub(0);
int u = sub(v);
int d = D[u];
cout << (d % 3 == 1 ? "Second" : "First") << endl;
return 0;
}
| replace | 157 | 159 | 157 | 159 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#define cauto const auto &
#else
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2((i), 0, (n))
#define _rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
vvint vv;
void dfs(int ind, int d, int pre, vint &vis) {
if (vis[ind] != -1) {
return;
}
vis[ind] = d;
for (int x : vv[ind]) {
if (x == pre) {
continue;
}
dfs(x, d + 1, ind, vis);
}
}
void main2() {
int N;
cin >> N;
vv = vvint(N);
rep(i, N) {
int a, b;
cin >> a >> b;
a--, b--;
vv[a].PB(b);
swap(a, b);
vv[a].PB(b);
}
vint vis(N, -1);
dfs(0, 0, -1, vis);
int ind = 0;
rep(i, N) {
if (vis[ind] < vis[i]) {
ind = i;
}
}
vis = vint(N, -1);
dfs(ind, 0, -1, vis);
int ans = 0;
rep(i, N) { maxs(ans, vis[i]); }
if (ans % 3 == 1) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
}
signed main() { main2(); } | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#define cauto const auto &
#else
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2((i), 0, (n))
#define _rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(), (v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
vvint vv;
void dfs(int ind, int d, int pre, vint &vis) {
if (vis[ind] != -1) {
return;
}
vis[ind] = d;
for (int x : vv[ind]) {
if (x == pre) {
continue;
}
dfs(x, d + 1, ind, vis);
}
}
void main2() {
int N;
cin >> N;
vv = vvint(N);
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--, b--;
vv[a].PB(b);
swap(a, b);
vv[a].PB(b);
}
vint vis(N, -1);
dfs(0, 0, -1, vis);
int ind = 0;
rep(i, N) {
if (vis[ind] < vis[i]) {
ind = i;
}
}
vis = vint(N, -1);
dfs(ind, 0, -1, vis);
int ans = 0;
rep(i, N) { maxs(ans, vis[i]); }
if (ans % 3 == 1) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
}
signed main() { main2(); } | replace | 113 | 114 | 113 | 114 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI(N);
vector<vector<int>> G(N);
FOR(i, N - 1) {
GI2(a, b);
G[a - 1].push_back(b - 1);
G[b - 1].push_back(a - 1);
}
stack<P> s;
vector<int> visited(N);
s.push(P(0, 0));
int max_d = 0;
int max_n;
while (!s.empty()) {
P p = s.top();
int v = p.second;
int d = p.first;
s.pop();
if (max_d < d) {
max_d = d;
max_n = v;
}
for (int i : G[v]) {
if (!visited[i]) {
visited[i] = 1;
s.push(P(d + 1, i));
}
}
}
s = stack<P>();
visited = vector<int>(N);
s.push(P(0, max_n));
max_d = 0;
while (!s.empty()) {
P p = s.top();
int v = p.second;
int d = p.first;
s.pop();
if (max_d < d) {
max_d = d;
}
for (int i : G[v]) {
if (!visited[i]) {
visited[i] = 1;
s.push(P(d + 1, i));
}
}
}
print(max_d % 3 == 1 ? "Second" : "First");
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
#define GI(name) \
int(name); \
scanf("%d", &(name))
#define GI2(name1, name2) \
int(name1), (name2); \
scanf("%d %d", &(name1), &(name2))
#define GI3(name1, name2, name3) \
int(name1), (name2), (name3); \
scanf("%d %d %d", &(name1), &(name2), &(name3))
#define GVI(name, size) \
vector<int>(name)(size); \
FOR(i, (size)) scanf("%d", &(name)[i])
#define MOD 1000000007
using namespace std;
string to_hex(int x) {
stringstream ss;
ss << hex << x;
return ss.str();
}
inline int get_int() {
int ret;
scanf("%d", &ret);
return ret;
}
inline vector<int> get_ints(int n) {
vector<int> ret(n);
FOR(i, n) { scanf("%d", &ret[i]); }
return ret;
}
inline string get_str() {
string ret;
cin >> ret;
return ret;
}
bool is_prime(int n) {
int s = sqrt(n) + 1;
for (int i = 2; i <= s; ++i) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
vector<P> prime_division(int n) {
vector<P> ret;
int s = sqrt(n) + 1;
int c = 0;
for (int i = 2; i <= n; ++i) {
if (n % i == 0) {
c = 0;
do {
++c;
n /= i;
} while (n % i == 0);
ret.push_back(P(i, c));
}
}
return ret;
}
struct UnionFind {
vector<int> data;
UnionFind(int size) { data = vector<int>(size, -1); }
bool union_set(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool find(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T> string to_string(vector<T> v) {
string ret = "{";
FOR(i, v.size() - 1) { ret += to_string(v[i]) + ","; }
if (v.size() > 0) {
ret += to_string(LAST(v));
}
ret += "}";
return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail> void debug_print(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug_print(tail...);
}
template <class... T> void debug(T... args) {
cerr << "[" << __LINE__ << "]: ";
debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
GI(N);
vector<vector<int>> G(N);
FOR(i, N - 1) {
GI2(a, b);
G[a - 1].push_back(b - 1);
G[b - 1].push_back(a - 1);
}
if (N == 1) {
print("First");
return 0;
}
stack<P> s;
vector<int> visited(N);
s.push(P(0, 0));
int max_d = 0;
int max_n;
while (!s.empty()) {
P p = s.top();
int v = p.second;
int d = p.first;
s.pop();
if (max_d < d) {
max_d = d;
max_n = v;
}
for (int i : G[v]) {
if (!visited[i]) {
visited[i] = 1;
s.push(P(d + 1, i));
}
}
}
s = stack<P>();
visited = vector<int>(N);
s.push(P(0, max_n));
max_d = 0;
while (!s.empty()) {
P p = s.top();
int v = p.second;
int d = p.first;
s.pop();
if (max_d < d) {
max_d = d;
}
for (int i : G[v]) {
if (!visited[i]) {
visited[i] = 1;
s.push(P(d + 1, i));
}
}
}
print(max_d % 3 == 1 ? "Second" : "First");
return 0;
} | insert | 144 | 144 | 144 | 148 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
int MAX_V = 100100;
vector<vector<pair<int, int>>> g(MAX_V, vector<pair<int, int>>());
pair<int, int> treedfs(int now, vector<bool> &v, int cost = 0) {
if (v[now])
return {-1, -1};
else
v[now] = true;
pair<int, int> ret = {cost, now};
for (int i = 0; i < g[now].size(); i++) {
ret = max(ret, treedfs(g[now][i].F, v, cost + g[now][i].S));
}
return ret;
}
int Tree_diameter() {
vector<bool> v(MAX_V);
pair<int, int> step1 = treedfs(0, v, 0);
vector<bool> v2(MAX_V);
pair<int, int> step2 = treedfs(step1.S, v2, 0);
return step2.F;
}
signed main(void) {
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back({b, 1});
g[b].push_back({a, 1});
}
int x = Tree_diameter();
if (x % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
int MAX_V = 200100;
vector<vector<pair<int, int>>> g(MAX_V, vector<pair<int, int>>());
pair<int, int> treedfs(int now, vector<bool> &v, int cost = 0) {
if (v[now])
return {-1, -1};
else
v[now] = true;
pair<int, int> ret = {cost, now};
for (int i = 0; i < g[now].size(); i++) {
ret = max(ret, treedfs(g[now][i].F, v, cost + g[now][i].S));
}
return ret;
}
int Tree_diameter() {
vector<bool> v(MAX_V);
pair<int, int> step1 = treedfs(0, v, 0);
vector<bool> v2(MAX_V);
pair<int, int> step2 = treedfs(step1.S, v2, 0);
return step2.F;
}
signed main(void) {
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back({b, 1});
g[b].push_back({a, 1});
}
int x = Tree_diameter();
if (x % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
// —————————————————BFSグラフ————————————————
using Graph = vector<vector<int>>;
int main() {
// 頂点数と辺数
int n;
cin >> n;
// グラフ入力受取 (ここでは無向グラフを想定)
Graph G(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a - 1].pb(b - 1);
G[b - 1].pb(a - 1);
}
// BFS のためのデータ構造
vector<int> dist(n, -1); // 全頂点を「未訪問」に初期化
deque<int> que;
// 初期条件 (頂点 0 を初期ノードとする)
dist[0] = 0;
que.pb(0); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop_front();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1)
continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.pb(nv);
}
}
// 結果出力 (各頂点の頂点 0 からの距離を見る)
int cho = 0;
int memo;
rep(i, n) {
if (cho < dist[i])
memo = i;
cho = max(cho, dist[i]);
}
rep(i, n) { dist[i] = -1; }
// 初期条件 (頂点 0 を初期ノードとする)
dist[memo] = 0;
que.pb(memo); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop_front();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1)
continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.pb(nv);
}
}
cho = 0;
rep(i, n) { cho = max(cho, dist[i]); }
cout << (cho % 3 == 1 ? "Second" : "First") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL << 61;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = jou(N, P / 2);
return t * t % mod;
}
return (N * jou(N, P - 1)) % mod;
} // jou(n,mod-2)で逆元
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
// —————————————————BFSグラフ————————————————
using Graph = vector<vector<int>>;
int main() {
// 頂点数と辺数
int n;
cin >> n;
if (n == 1) {
cout << "First" << endl;
return 0;
}
// グラフ入力受取 (ここでは無向グラフを想定)
Graph G(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a - 1].pb(b - 1);
G[b - 1].pb(a - 1);
}
// BFS のためのデータ構造
vector<int> dist(n, -1); // 全頂点を「未訪問」に初期化
deque<int> que;
// 初期条件 (頂点 0 を初期ノードとする)
dist[0] = 0;
que.pb(0); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop_front();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1)
continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.pb(nv);
}
}
// 結果出力 (各頂点の頂点 0 からの距離を見る)
int cho = 0;
int memo;
rep(i, n) {
if (cho < dist[i])
memo = i;
cho = max(cho, dist[i]);
}
rep(i, n) { dist[i] = -1; }
// 初期条件 (頂点 0 を初期ノードとする)
dist[memo] = 0;
que.pb(memo); // 0 を橙色頂点にする
// BFS 開始 (キューが空になるまで探索を行う)
while (!que.empty()) {
int v = que.front(); // キューから先頭頂点を取り出す
que.pop_front();
// v から辿れる頂点をすべて調べる
for (int nv : G[v]) {
if (dist[nv] != -1)
continue; // すでに発見済みの頂点は探索しない
// 新たな白色頂点 nv について距離情報を更新してキューに追加する
dist[nv] = dist[v] + 1;
que.pb(nv);
}
}
cho = 0;
rep(i, n) { cho = max(cho, dist[i]); }
cout << (cho % 3 == 1 ? "Second" : "First") << endl;
}
| insert | 42 | 42 | 42 | 47 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using PII = pair<int, int>;
int main() {
int n, a, b;
cin >> n;
vector<vector<int>> connect(n + 1, vector<int>());
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
connect[a].emplace_back(b);
connect[b].emplace_back(a);
}
vector<bool> used(n + 1, false);
queue<int> que;
used[1] = true;
que.push(1);
int node1 = -1;
while (!que.empty()) {
auto x = que.front();
// printf("x1 %d\n", x);
que.pop();
for (auto y : connect[x]) {
if (used[y]) {
continue;
}
used[y] = true;
que.push(y);
node1 = y;
}
}
// printf("node %d\n", node1);
queue<PII> que2;
int dist = 0;
used.assign(n + 1, false);
used[node1] = true;
que2.push(make_pair(node1, 0));
while (!que2.empty()) {
auto p = que2.front();
que2.pop();
int x = p.first;
dist = max(dist, p.second);
// printf("p %d %d\n", p.first, p.second);
for (auto y : connect[x]) {
if (used[y]) {
continue;
}
used[y] = true;
que2.push(make_pair(y, p.second + 1));
}
}
// printf("dist %d\n", dist);
// v1 = win
// v2 = lose
// vi2 = (vi1 == lose || vi0 == lose) ? win : lose
// win lose win が繰り返す
string ans = (dist + 1) % 3 == 2 ? "Second" : "First";
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using PII = pair<int, int>;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "First" << endl;
return 0;
}
vector<vector<int>> connect(n + 1, vector<int>());
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
connect[a].emplace_back(b);
connect[b].emplace_back(a);
}
vector<bool> used(n + 1, false);
queue<int> que;
used[1] = true;
que.push(1);
int node1 = -1;
while (!que.empty()) {
auto x = que.front();
// printf("x1 %d\n", x);
que.pop();
for (auto y : connect[x]) {
if (used[y]) {
continue;
}
used[y] = true;
que.push(y);
node1 = y;
}
}
// printf("node %d\n", node1);
queue<PII> que2;
int dist = 0;
used.assign(n + 1, false);
used[node1] = true;
que2.push(make_pair(node1, 0));
while (!que2.empty()) {
auto p = que2.front();
que2.pop();
int x = p.first;
dist = max(dist, p.second);
// printf("p %d %d\n", p.first, p.second);
for (auto y : connect[x]) {
if (used[y]) {
continue;
}
used[y] = true;
que2.push(make_pair(y, p.second + 1));
}
}
// printf("dist %d\n", dist);
// v1 = win
// v2 = lose
// vi2 = (vi1 == lose || vi0 == lose) ? win : lose
// win lose win が繰り返す
string ans = (dist + 1) % 3 == 2 ? "Second" : "First";
cout << ans << endl;
return 0;
}
| insert | 14 | 14 | 14 | 19 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> g[200005];
int n, d[200005];
void dfs(int x, int p = 0) {
d[x] = d[p] + 1;
for (auto t : g[x])
if (t != p)
dfs(t, x);
}
int main() {
cin >> n;
d[0] = -1;
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(1);
memset(d + 1, 0, sizeof d + 1);
dfs(max_element(d + 1, d + n + 1) - d);
cout << (((*max_element(d + 1, d + n + 1)) % 3 == 1) ? "Second" : "First")
<< endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> g[200005];
int n, d[200005];
void dfs(int x, int p = 0) {
d[x] = d[p] + 1;
for (auto t : g[x])
if (t != p)
dfs(t, x);
}
int main() {
cin >> n;
d[0] = -1;
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
dfs(1);
dfs(max_element(d + 1, d + n + 1) - d);
cout << (((*max_element(d + 1, d + n + 1)) % 3 == 1) ? "Second" : "First")
<< endl;
return 0;
} | delete | 20 | 21 | 20 | 20 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <assert.h>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// ---------------------------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<vector<int>> G(N);
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
auto bfs = [&](int root) {
vector<int> dist(N, -1);
queue<int> que;
que.emplace(root);
dist[root] = 0;
while (que.size()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
que.emplace(nv);
}
}
int id;
int mx = 0;
for (int i = 0; i < N; i++) {
if (chmax(mx, dist[i])) {
id = i;
}
}
return P(id, mx);
};
P p = bfs(0);
p = bfs(p.first);
if (p.second % 3 == 1) {
cout << "Second\n";
} else {
cout << "First\n";
}
return 0;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <assert.h>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip> // setprecision
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// ---------------------------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<vector<int>> G(N);
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
}
auto bfs = [&](int root) {
vector<int> dist(N, -1);
queue<int> que;
que.emplace(root);
dist[root] = 0;
while (que.size()) {
int v = que.front();
que.pop();
for (int nv : G[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
que.emplace(nv);
}
}
int id;
int mx = -1;
for (int i = 0; i < N; i++) {
if (chmax(mx, dist[i])) {
id = i;
}
}
return P(id, mx);
};
P p = bfs(0);
p = bfs(p.first);
if (p.second % 3 == 1) {
cout << "Second\n";
} else {
cout << "First\n";
}
return 0;
} | replace | 79 | 80 | 79 | 80 | 0 | |
p03055 | C++ | Runtime Error | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
using namespace std;
int MOD = 998244353;
int n;
vector<int> G[200010];
int d1[200001] = {0};
int d2[200001] = {0};
void dfs1(int s, int dis) {
for (auto x : G[s]) {
if (d1[x] == INF) {
d1[x] = dis + 1;
dfs1(x, dis + 1);
}
}
}
void dfs2(int s, int dis) {
for (auto x : G[s]) {
if (d2[x] == INF) {
d2[x] = dis + 1;
dfs2(x, dis + 1);
}
}
}
signed main() {
cin >> n;
rep(i, n) {
int a, b;
cin >> a >> b;
G[a - 1].pb(b - 1);
G[b - 1].pb(a - 1);
}
rep(i, n) {
d1[i] = INF;
d2[i] = INF;
}
d1[0] = 0;
dfs1(0, 0);
int m = -1;
int u = -1;
rep(i, n) {
if (d1[i] > m) {
m = d1[i];
u = i;
}
}
d2[u] = 0;
dfs2(u, 0);
int m1 = -1;
rep(i, n) {
if (d2[i] > m1) {
m1 = d2[i];
}
}
if (m1 % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
cerr << m1 << endl;
return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl
// https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a rm -r -f
// test;oj dl http://agc033.contest.atcoder.jp/tasks/agc033_a | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
using namespace std;
int MOD = 998244353;
int n;
vector<int> G[200010];
int d1[200001] = {0};
int d2[200001] = {0};
void dfs1(int s, int dis) {
for (auto x : G[s]) {
if (d1[x] == INF) {
d1[x] = dis + 1;
dfs1(x, dis + 1);
}
}
}
void dfs2(int s, int dis) {
for (auto x : G[s]) {
if (d2[x] == INF) {
d2[x] = dis + 1;
dfs2(x, dis + 1);
}
}
}
signed main() {
cin >> n;
if (n == 1) {
cout << "First" << endl;
return 0;
}
rep(i, n) {
int a, b;
cin >> a >> b;
G[a - 1].pb(b - 1);
G[b - 1].pb(a - 1);
}
rep(i, n) {
d1[i] = INF;
d2[i] = INF;
}
d1[0] = 0;
dfs1(0, 0);
int m = -1;
int u = -1;
rep(i, n) {
if (d1[i] > m) {
m = d1[i];
u = i;
}
}
d2[u] = 0;
dfs2(u, 0);
int m1 = -1;
rep(i, n) {
if (d2[i] > m1) {
m1 = d2[i];
}
}
if (m1 % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
cerr << m1 << endl;
return 0;
}
// g++ -std=c++14 code1.cpp
// rm -r -f test;oj dl
// https://cf17-final-open.contest.atcoder.jp/tasks/cf17_final_a rm -r -f
// test;oj dl http://agc033.contest.atcoder.jp/tasks/agc033_a | insert | 42 | 42 | 42 | 46 | 0 | 2
|
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
struct Edge {
int to, w;
Edge(int t, int w) : to(t), w(w) {}
};
struct Tree {
int N;
vector<vector<Edge>> edges;
void addEdge(int a, int b) { addEdge(a, b, 1); }
void addEdge(int a, int b, int w) { edges[a].emplace_back(b, w); }
Tree(int N) : N(N), edges(N) {}
long long diam() {
setDist(0);
int start;
long long maxd = 0;
rep(i, N) {
if (dist[i] > maxd) {
maxd = dist[i];
start = i;
}
}
setDist(start);
rep(i, N) maxd = max(maxd, dist[i]);
return maxd;
}
vector<long long> dist;
void setDist(int s) {
dist = vector<long long>(N, -1);
dist[s] = 0;
queue<int> q;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
for (Edge e : edges[x]) {
if (dist[e.to] != -1)
continue;
dist[e.to] = dist[x] + e.w;
q.push(e.to);
}
}
}
};
int main() {
int N;
cin >> N;
Tree G(N);
rep(i, N - 1) {
int x, y;
cin >> x >> y;
x--;
y--;
G.addEdge(x, y);
G.addEdge(y, x);
}
long long diam = G.diam();
if ((diam + 1) % 3 == 2)
cout << "Second" << endl;
else
cout << "First" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
struct Edge {
int to, w;
Edge(int t, int w) : to(t), w(w) {}
};
struct Tree {
int N;
vector<vector<Edge>> edges;
void addEdge(int a, int b) { addEdge(a, b, 1); }
void addEdge(int a, int b, int w) { edges[a].emplace_back(b, w); }
Tree(int N) : N(N), edges(N) {}
long long diam() {
setDist(0);
int start;
long long maxd = -1;
rep(i, N) {
if (dist[i] > maxd) {
maxd = dist[i];
start = i;
}
}
setDist(start);
rep(i, N) maxd = max(maxd, dist[i]);
return maxd;
}
vector<long long> dist;
void setDist(int s) {
dist = vector<long long>(N, -1);
dist[s] = 0;
queue<int> q;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
for (Edge e : edges[x]) {
if (dist[e.to] != -1)
continue;
dist[e.to] = dist[x] + e.w;
q.push(e.to);
}
}
}
};
int main() {
int N;
cin >> N;
Tree G(N);
rep(i, N - 1) {
int x, y;
cin >> x >> y;
x--;
y--;
G.addEdge(x, y);
G.addEdge(y, x);
}
long long diam = G.diam();
if ((diam + 1) % 3 == 2)
cout << "Second" << endl;
else
cout << "First" << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> e[100010];
pair<int, int> tddfs(int v, int par = -1) {
pair<int, int> ret = {0, v};
for (auto &x : e[v]) {
if (x == par)
continue;
auto r = tddfs(x, v);
ret = max(ret, {1 + r.first, r.second});
}
return ret;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
e[u].emplace_back(v);
e[v].emplace_back(u);
}
auto c = tddfs(0);
auto w = tddfs(c.second);
if (w.first % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> e[200010];
pair<int, int> tddfs(int v, int par = -1) {
pair<int, int> ret = {0, v};
for (auto &x : e[v]) {
if (x == par)
continue;
auto r = tddfs(x, v);
ret = max(ret, {1 + r.first, r.second});
}
return ret;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
e[u].emplace_back(v);
e[v].emplace_back(u);
}
auto c = tddfs(0);
auto w = tddfs(c.second);
if (w.first % 3 == 1)
cout << "Second" << endl;
else
cout << "First" << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | Python | Runtime Error | import sys
sys.setrecursionlimit(2 * 10**5)
def dfs(v, p, links):
farthest_d = 0
farthest_v = v
for u in links[v]:
if u == p:
continue
res_d, res_v = dfs(u, v, links)
if res_d > farthest_d:
farthest_d = res_d
farthest_v = res_v
return farthest_d + 1, farthest_v
def solve(n, links):
if n == 1:
return True
d, v = dfs(0, -1, links)
d, v = dfs(v, -1, links)
if (d + 1) % 3 == 0:
return False
return True
n = int(input())
links = [set() for _ in [0] * n]
for line in sys.stdin:
a, b = map(int, line.split())
a -= 1
b -= 1
links[a].add(b)
links[b].add(a)
print("First" if solve(n, links) else "Second")
| import sys
sys.setrecursionlimit(2 * 10**5 + 5)
def dfs(v, p, links):
farthest_d = 0
farthest_v = v
for u in links[v]:
if u == p:
continue
res_d, res_v = dfs(u, v, links)
if res_d > farthest_d:
farthest_d = res_d
farthest_v = res_v
return farthest_d + 1, farthest_v
def solve(n, links):
if n == 1:
return True
d, v = dfs(0, -1, links)
d, v = dfs(v, -1, links)
if (d + 1) % 3 == 0:
return False
return True
n = int(input())
links = [set() for _ in [0] * n]
for line in sys.stdin:
a, b = map(int, line.split())
a -= 1
b -= 1
links[a].add(b)
links[b].add(a)
print("First" if solve(n, links) else "Second")
| replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 100010;
struct Edge {
int nex, v;
} edge[N << 1];
int tp;
int n, e[N], sg[N], f[N], Ans;
inline void add(int x, int y) {
edge[++tp].v = y;
edge[tp].nex = e[x];
e[x] = tp;
return;
}
void DFS(int x, int fa) {
int a = 1, b = 0;
for (int i = e[x]; i; i = edge[i].nex) {
int y = edge[i].v;
if (y == fa)
continue;
DFS(y, x);
if (a < f[y] + 1) {
b = a;
a = f[y] + 1;
} else {
b = std::max(b, f[y] + 1);
}
}
Ans = std::max(Ans, std::max(a + b - 1, a));
f[x] = a;
return;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1, x, y; i < n; i++) {
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
DFS(1, 0);
/// cal Ans
sg[1] = 1;
sg[2] = 0;
for (int i = 3; i <= Ans; i++) {
if (std::min(sg[i - 1], sg[i - 2]) == 0) {
sg[i] = 1;
} else {
sg[i] = 0;
}
}
if (sg[Ans]) {
printf("First\n");
} else {
printf("Second\n");
}
return 0;
}
| #include <bits/stdc++.h>
const int N = 200010;
struct Edge {
int nex, v;
} edge[N << 1];
int tp;
int n, e[N], sg[N], f[N], Ans;
inline void add(int x, int y) {
edge[++tp].v = y;
edge[tp].nex = e[x];
e[x] = tp;
return;
}
void DFS(int x, int fa) {
int a = 1, b = 0;
for (int i = e[x]; i; i = edge[i].nex) {
int y = edge[i].v;
if (y == fa)
continue;
DFS(y, x);
if (a < f[y] + 1) {
b = a;
a = f[y] + 1;
} else {
b = std::max(b, f[y] + 1);
}
}
Ans = std::max(Ans, std::max(a + b - 1, a));
f[x] = a;
return;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 1, x, y; i < n; i++) {
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
DFS(1, 0);
/// cal Ans
sg[1] = 1;
sg[2] = 0;
for (int i = 3; i <= Ans; i++) {
if (std::min(sg[i - 1], sg[i - 2]) == 0) {
sg[i] = 1;
} else {
sg[i] = 0;
}
}
if (sg[Ans]) {
printf("First\n");
} else {
printf("Second\n");
}
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct edge {
ll to, cost;
};
V<edge> graph[100005];
V<ll> dist;
void dfs1(int now, int par) {
for (edge &e : graph[now]) {
if (e.to == par)
continue;
dfs1(e.to, now);
chmax(dist[now], dist[e.to] + e.cost);
}
}
ll dfs2(int now, int d_par, int par) {
V<P> dc;
dc.emplace_back(0, -1);
for (edge &e : graph[now]) {
if (e.to == par)
dc.emplace_back(d_par + e.cost, e.to);
else
dc.emplace_back(e.cost + dist[e.to], e.to);
}
sort(all(dc), greater<P>());
ll res = dc[0].fi + dc[1].fi;
for (edge &e : graph[now]) {
if (e.to == par)
continue;
chmax(res, dfs2(e.to, dc[dc[0].se == e.to].fi, now));
}
return res;
}
int main() {
int n;
cin >> n;
dist.assign(n, 0);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].emplace_back(edge{b, 1});
graph[b].emplace_back(edge{a, 1});
}
if (n == 1) {
cout << "First"
<< "\n";
return 0;
}
dfs1(n / 2, -1);
ll ma = dfs2(n / 2, 0, -1);
ma--;
if (ma % 3 == 0)
cout << "Second"
<< "\n";
else
cout << "First"
<< "\n";
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct edge {
ll to, cost;
};
V<edge> graph[200005];
V<ll> dist;
void dfs1(int now, int par) {
for (edge &e : graph[now]) {
if (e.to == par)
continue;
dfs1(e.to, now);
chmax(dist[now], dist[e.to] + e.cost);
}
}
ll dfs2(int now, int d_par, int par) {
V<P> dc;
dc.emplace_back(0, -1);
for (edge &e : graph[now]) {
if (e.to == par)
dc.emplace_back(d_par + e.cost, e.to);
else
dc.emplace_back(e.cost + dist[e.to], e.to);
}
sort(all(dc), greater<P>());
ll res = dc[0].fi + dc[1].fi;
for (edge &e : graph[now]) {
if (e.to == par)
continue;
chmax(res, dfs2(e.to, dc[dc[0].se == e.to].fi, now));
}
return res;
}
int main() {
int n;
cin >> n;
dist.assign(n, 0);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].emplace_back(edge{b, 1});
graph[b].emplace_back(edge{a, 1});
}
if (n == 1) {
cout << "First"
<< "\n";
return 0;
}
dfs1(n / 2, -1);
ll ma = dfs2(n / 2, 0, -1);
ma--;
if (ma % 3 == 0)
cout << "Second"
<< "\n";
else
cout << "First"
<< "\n";
} | replace | 37 | 38 | 37 | 38 | 0 | |
p03055 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define nmax 100005
using namespace std;
int n, nod1, viz1[nmax], viz2[nmax], maxi1, maxi2, nod2;
vector<int> v[nmax];
void dfs1(int nod) {
for (auto it = v[nod].begin(); it != v[nod].end(); ++it)
if (!viz1[*it]) {
viz1[*(it)] = viz1[nod] + 1;
if (maxi1 < (viz1[*(it)])) {
nod1 = *(it);
maxi1 = viz1[*(it)];
}
dfs1(*it);
}
}
void dfs2(int nod) {
for (auto it = v[nod].begin(); it != v[nod].end(); ++it)
if (!viz2[*it]) {
viz2[*(it)] = viz2[nod] + 1;
if (maxi2 < (viz2[*(it)])) {
nod2 = *(it);
maxi2 = viz2[*(it)];
}
dfs2(*it);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, x, y;
cin >> n;
for (i = 1; i < n; i++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
maxi1 = 1;
nod1 = 1;
viz1[1] = 1;
dfs1(1);
viz2[nod1] = 1;
maxi2 = 1;
dfs2(nod1);
if (maxi2 % 3 == 2)
cout << "Second\n";
else
cout << "First\n";
return 0;
} | #include <iostream>
#include <vector>
#define nmax 200005
using namespace std;
int n, nod1, viz1[nmax], viz2[nmax], maxi1, maxi2, nod2;
vector<int> v[nmax];
void dfs1(int nod) {
for (auto it = v[nod].begin(); it != v[nod].end(); ++it)
if (!viz1[*it]) {
viz1[*(it)] = viz1[nod] + 1;
if (maxi1 < (viz1[*(it)])) {
nod1 = *(it);
maxi1 = viz1[*(it)];
}
dfs1(*it);
}
}
void dfs2(int nod) {
for (auto it = v[nod].begin(); it != v[nod].end(); ++it)
if (!viz2[*it]) {
viz2[*(it)] = viz2[nod] + 1;
if (maxi2 < (viz2[*(it)])) {
nod2 = *(it);
maxi2 = viz2[*(it)];
}
dfs2(*it);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, x, y;
cin >> n;
for (i = 1; i < n; i++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
maxi1 = 1;
nod1 = 1;
viz1[1] = 1;
dfs1(1);
viz2[nod1] = 1;
maxi2 = 1;
dfs2(nod1);
if (maxi2 % 3 == 2)
cout << "Second\n";
else
cout << "First\n";
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define int long long
#define all(a) (a).begin(), (a).end()
#define EPS (1e-13)
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define P pair<int, int>
#define Q pair<int, pair<int, int>>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define mkp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
const int Mod = 1e9 + 7;
const int mod = 998244353;
const ll Inf = 3 * 1e18;
const int inf = 15 * 1e8;
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
ll bcount(ll x) {
int sum = 0;
for (int i = 0; i < 20; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*const int fn_ = 2000000;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll mod = Mod) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++) {
fact_[i] = fact_[i - 1] * i % mod;
comp_[i] = mod_pow(fact_[i], mod - 2, mod);
}
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % mod * comp_[y] % mod;
}*/
//---------------------------------------------------
int n;
int a[200000];
vector<int> e[200000];
int dp[200000];
signed main() {
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
e[u].push_back(v);
e[v].push_back(u);
}
fill(a + 2, a + n + 1, inf);
queue<int> q;
q.push(1);
while (!q.empty()) {
int t = q.front();
q.pop();
for (auto g : e[t]) {
if (a[g] > a[t] + 1) {
a[g] = a[t] + 1;
q.push(g);
}
}
}
int mx = 1;
for (int i = 2; i <= n; i++) {
if (a[mx] < a[i])
mx = i;
}
int r = 1;
q.push(mx);
fill(a + 1, a + n + 1, inf);
a[mx] = 0;
while (!q.empty()) {
int t = q.front();
q.pop();
for (auto g : e[t]) {
if (a[g] > a[t] + 1) {
a[g] = a[t] + 1;
q.push(g);
}
}
}
mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
}
// mx=直径
dp[1] = 1;
dp[2] = 0; // このタイミングで始まった人が勝つか
for (int i = 3; i <= mx + 1; i++) {
if (!dp[i - 2] || !dp[i - 1])
dp[i] = 1;
else
dp[i] = 0;
}
if (dp[mx + 1])
cout << "First\n";
else
cout << "Second\n";
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ld long double
#define int long long
#define all(a) (a).begin(), (a).end()
#define EPS (1e-13)
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define P pair<int, int>
#define Q pair<int, pair<int, int>>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define mkp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) \
sort(all((b))); \
(b).erase(unique(all((b))), (b).end())
const int Mod = 1e9 + 7;
const int mod = 998244353;
const ll Inf = 3 * 1e18;
const int inf = 15 * 1e8;
ll read() {
ll u, k = scanf("%lld", &u);
return u;
}
ll gcd(ll i, ll j) {
if (i > j)
swap(i, j);
if (i == 0)
return j;
return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
ll bcount(ll x) {
int sum = 0;
for (int i = 0; i < 20; i++)
if ((1ll << i) & x)
sum++;
return sum;
}
/*const int fn_ = 2000000;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll mod = Mod) {
if (!fact_[0]) {
fact_[0] = 1; comp_[0] = 1;
for (int i = 1; i < fn_; i++) {
fact_[i] = fact_[i - 1] * i % mod;
comp_[i] = mod_pow(fact_[i], mod - 2, mod);
}
}
if (x < y) return 0;
return fact_[x] * comp_[x - y] % mod * comp_[y] % mod;
}*/
//---------------------------------------------------
int n;
int a[500000];
vector<int> e[500000];
int dp[500000];
signed main() {
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
e[u].push_back(v);
e[v].push_back(u);
}
fill(a + 2, a + n + 1, inf);
queue<int> q;
q.push(1);
while (!q.empty()) {
int t = q.front();
q.pop();
for (auto g : e[t]) {
if (a[g] > a[t] + 1) {
a[g] = a[t] + 1;
q.push(g);
}
}
}
int mx = 1;
for (int i = 2; i <= n; i++) {
if (a[mx] < a[i])
mx = i;
}
int r = 1;
q.push(mx);
fill(a + 1, a + n + 1, inf);
a[mx] = 0;
while (!q.empty()) {
int t = q.front();
q.pop();
for (auto g : e[t]) {
if (a[g] > a[t] + 1) {
a[g] = a[t] + 1;
q.push(g);
}
}
}
mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, a[i]);
}
// mx=直径
dp[1] = 1;
dp[2] = 0; // このタイミングで始まった人が勝つか
for (int i = 3; i <= mx + 1; i++) {
if (!dp[i - 2] || !dp[i - 1])
dp[i] = 1;
else
dp[i] = 0;
}
if (dp[mx + 1])
cout << "First\n";
else
cout << "Second\n";
} | replace | 91 | 94 | 91 | 94 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
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;
}
struct UndirectedGraph {
vector<vector<int>> g;
vector<int> clr;
vector<int> dis;
int V;
UndirectedGraph(int V)
: V(V), g(vector<vector<int>>(V)), clr(vector<int>(V, 0)) {}
// don't add (v,u) after adding (u,v)
void add_edge(int u, int v) {
g[u].push_back(v);
g[v].push_back(u);
}
// 二部グラフ判定
bool dfs_nib(int v, int c) {
clr[v] = c;
for (auto x : g[v]) {
if (clr[x] == c)
return false;
if (clr[x] == 0 && !dfs_nib(x, -c))
return false;
}
return true;
}
bool isNib() {
bool ret = true;
for (int i = 0; i < V; i++)
if (clr[i] == 0) {
if (!dfs_nib(i, 1)) {
ret = false;
break;
}
}
return ret;
}
// distance
void bfs(int st) {
dis = vector<int>(V, INF);
vector<bool> checked(V, false);
dis[st] = 0;
checked[st] = true;
queue<int> q;
q.push(st);
while (!q.empty()) {
auto now = q.front();
q.pop();
for (auto x : g[now]) {
if (checked[x])
continue;
checked[x] = true;
dis[x] = dis[now] + 1;
q.push(x);
}
}
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
UndirectedGraph g(n);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--, v--;
g.add_edge(u, v);
}
g.bfs(0);
int d = 0, a = -1;
rep(i, n) {
if (chmax(d, g.dis[i]))
a = i;
}
g.bfs(a);
int R = 0;
rep(i, n) { chmax(R, g.dis[i]); }
R++;
if (R % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
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;
}
struct UndirectedGraph {
vector<vector<int>> g;
vector<int> clr;
vector<int> dis;
int V;
UndirectedGraph(int V)
: V(V), g(vector<vector<int>>(V)), clr(vector<int>(V, 0)) {}
// don't add (v,u) after adding (u,v)
void add_edge(int u, int v) {
g[u].push_back(v);
g[v].push_back(u);
}
// 二部グラフ判定
bool dfs_nib(int v, int c) {
clr[v] = c;
for (auto x : g[v]) {
if (clr[x] == c)
return false;
if (clr[x] == 0 && !dfs_nib(x, -c))
return false;
}
return true;
}
bool isNib() {
bool ret = true;
for (int i = 0; i < V; i++)
if (clr[i] == 0) {
if (!dfs_nib(i, 1)) {
ret = false;
break;
}
}
return ret;
}
// distance
void bfs(int st) {
dis = vector<int>(V, INF);
vector<bool> checked(V, false);
dis[st] = 0;
checked[st] = true;
queue<int> q;
q.push(st);
while (!q.empty()) {
auto now = q.front();
q.pop();
for (auto x : g[now]) {
if (checked[x])
continue;
checked[x] = true;
dis[x] = dis[now] + 1;
q.push(x);
}
}
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
if (n == 1) {
cout << "First" << endl;
return 0;
}
UndirectedGraph g(n);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--, v--;
g.add_edge(u, v);
}
g.bfs(0);
int d = 0, a = -1;
rep(i, n) {
if (chmax(d, g.dis[i]))
a = i;
}
g.bfs(a);
int R = 0;
rep(i, n) { chmax(R, g.dis[i]); }
R++;
if (R % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
}
| insert | 98 | 98 | 98 | 102 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
int N = 1e6, SZ = 320, INF = 1 << 29;
long long LINF = (1LL << 60), mod = 1e9 + 7;
const long double eps = 1e-9, PI = acos(-1.0);
#define lowbit(x) (x & (-(x)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef complex<double> cpx;
char READ_DATA;
int SIGNAL_INPUT;
template <typename Type> inline Type ru(Type &v) {
SIGNAL_INPUT = 1;
while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
if (READ_DATA == '-')
SIGNAL_INPUT = -1;
else if (READ_DATA == EOF)
return EOF;
v = READ_DATA - '0';
while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9')
v = v * 10 + READ_DATA - '0';
v *= SIGNAL_INPUT;
return v;
}
inline ll modru(ll &v) {
ll p = 0;
SIGNAL_INPUT = 1;
while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
if (READ_DATA == '-')
SIGNAL_INPUT = -1;
else if (READ_DATA == EOF)
return EOF;
p = v = READ_DATA - '0';
while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9') {
v = (v * 10 + READ_DATA - '0') % mod;
p = (p * 10 + READ_DATA - '0') % (mod - 1);
}
v *= SIGNAL_INPUT;
return p;
}
template <typename A, typename B> inline int ru(A &x, B &y) {
if (ru(x) == EOF)
return EOF;
ru(y);
return 2;
}
template <typename A, typename B, typename C> inline int ru(A &x, B &y, C &z) {
if (ru(x) == EOF)
return EOF;
ru(y);
ru(z);
return 3;
}
template <typename A, typename B, typename C, typename D>
inline int ru(A &x, B &y, C &z, D &w) {
if (ru(x) == EOF)
return EOF;
ru(y);
ru(z);
ru(w);
return 4;
}
inline ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline ll ss(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= mod;
(a *= a) %= mod;
b >>= 1;
}
return ans;
}
template <typename Type> void brc(Type *a, int n) {
int k;
for (int i = 1, j = n / 2; i < n - 1; i++) {
if (i < j)
swap(a[i], a[j]);
k = n >> 1;
while (j >= k) {
j ^= k;
k >>= 1;
}
if (j < k)
j ^= k;
}
}
void fft(cpx *a, int n, int inv = 1) {
cpx u, t;
brc(a, n);
for (int h = 2; h <= n; h <<= 1) {
cpx wn(cos(inv * 2.0 * PI / h), sin(inv * 2.0 * PI / h));
for (int j = 0; j < n; j += h) {
cpx w(1, 0);
for (int k = j; k < j + (h >> 1); k++) {
u = a[k];
t = w * a[k + (h >> 1)];
a[k] = u + t;
a[k + (h >> 1)] = u - t;
w *= wn;
}
}
}
if (inv == -1)
for (int i = 0; i < n; i++) {
a[i] /= n;
}
}
void ntt(ll *a, int n, int inv = 1) {
ll u, t;
brc(a, n);
for (int h = 2; h <= n; h <<= 1) {
ll wn = ss(3, (mod - 1) / h);
if (inv == -1)
wn = ss(wn, mod - 2);
for (int j = 0; j < n; j += h) {
ll w = 1;
for (int k = j; k < j + (h >> 1); k++) {
u = a[k];
t = w * a[k + (h >> 1)] % mod;
a[k] = (u + t) % mod;
a[k + (h >> 1)] = (u - t + mod) % mod;
(w *= wn) %= mod;
}
}
}
if (inv == -1) {
ll tmp = ss(n, mod - 2);
for (int i = 0; i < n; i++)
(a[i] *= tmp) %= mod;
}
}
struct Edge {
int u, v, nxt;
ll w;
Edge(int _u = 0, int _v = 0, ll _w = 0, int _nxt = -1) {
u = _u;
v = _v;
w = _w;
nxt = _nxt;
}
int operator<(const Edge &b) const { return u < b.u; }
};
const int maxn = 3e5 + 5;
/*------------------------------------------------------------------------yah------------------------------------------------------------------------*/
Edge edg[maxn];
int ecnt, g[maxn];
int n;
int maxlen, ep;
void dfs(int u, int last, int len) {
if (len > maxlen) {
maxlen = len;
ep = u;
}
for (int i = g[u]; ~i; i = edg[i].nxt) {
int &v = edg[i].v;
if (v != last) {
dfs(v, u, len + 1);
}
}
}
int main() {
memset(g, ecnt = -1, sizeof(g));
ru(n);
for (int i = 1; i < n; i++) {
int u, v;
ru(u, v);
edg[++ecnt] = Edge(u, v, 0, g[u]);
g[u] = ecnt;
edg[++ecnt] = Edge(v, u, 0, g[v]);
g[v] = ecnt;
}
dfs(1, 0, 1);
dfs(ep, 0, 1);
if (maxlen == 0 || maxlen == 2 || (maxlen >= 3 && maxlen % 3 == 2)) {
cout << "Second";
} else {
cout << "First";
}
return 0;
} | #include <bits/stdc++.h>
int N = 1e6, SZ = 320, INF = 1 << 29;
long long LINF = (1LL << 60), mod = 1e9 + 7;
const long double eps = 1e-9, PI = acos(-1.0);
#define lowbit(x) (x & (-(x)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef complex<double> cpx;
char READ_DATA;
int SIGNAL_INPUT;
template <typename Type> inline Type ru(Type &v) {
SIGNAL_INPUT = 1;
while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
if (READ_DATA == '-')
SIGNAL_INPUT = -1;
else if (READ_DATA == EOF)
return EOF;
v = READ_DATA - '0';
while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9')
v = v * 10 + READ_DATA - '0';
v *= SIGNAL_INPUT;
return v;
}
inline ll modru(ll &v) {
ll p = 0;
SIGNAL_INPUT = 1;
while ((READ_DATA = getchar()) < '0' || READ_DATA > '9')
if (READ_DATA == '-')
SIGNAL_INPUT = -1;
else if (READ_DATA == EOF)
return EOF;
p = v = READ_DATA - '0';
while ((READ_DATA = getchar()) >= '0' && READ_DATA <= '9') {
v = (v * 10 + READ_DATA - '0') % mod;
p = (p * 10 + READ_DATA - '0') % (mod - 1);
}
v *= SIGNAL_INPUT;
return p;
}
template <typename A, typename B> inline int ru(A &x, B &y) {
if (ru(x) == EOF)
return EOF;
ru(y);
return 2;
}
template <typename A, typename B, typename C> inline int ru(A &x, B &y, C &z) {
if (ru(x) == EOF)
return EOF;
ru(y);
ru(z);
return 3;
}
template <typename A, typename B, typename C, typename D>
inline int ru(A &x, B &y, C &z, D &w) {
if (ru(x) == EOF)
return EOF;
ru(y);
ru(z);
ru(w);
return 4;
}
inline ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline ll ss(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= mod;
(a *= a) %= mod;
b >>= 1;
}
return ans;
}
template <typename Type> void brc(Type *a, int n) {
int k;
for (int i = 1, j = n / 2; i < n - 1; i++) {
if (i < j)
swap(a[i], a[j]);
k = n >> 1;
while (j >= k) {
j ^= k;
k >>= 1;
}
if (j < k)
j ^= k;
}
}
void fft(cpx *a, int n, int inv = 1) {
cpx u, t;
brc(a, n);
for (int h = 2; h <= n; h <<= 1) {
cpx wn(cos(inv * 2.0 * PI / h), sin(inv * 2.0 * PI / h));
for (int j = 0; j < n; j += h) {
cpx w(1, 0);
for (int k = j; k < j + (h >> 1); k++) {
u = a[k];
t = w * a[k + (h >> 1)];
a[k] = u + t;
a[k + (h >> 1)] = u - t;
w *= wn;
}
}
}
if (inv == -1)
for (int i = 0; i < n; i++) {
a[i] /= n;
}
}
void ntt(ll *a, int n, int inv = 1) {
ll u, t;
brc(a, n);
for (int h = 2; h <= n; h <<= 1) {
ll wn = ss(3, (mod - 1) / h);
if (inv == -1)
wn = ss(wn, mod - 2);
for (int j = 0; j < n; j += h) {
ll w = 1;
for (int k = j; k < j + (h >> 1); k++) {
u = a[k];
t = w * a[k + (h >> 1)] % mod;
a[k] = (u + t) % mod;
a[k + (h >> 1)] = (u - t + mod) % mod;
(w *= wn) %= mod;
}
}
}
if (inv == -1) {
ll tmp = ss(n, mod - 2);
for (int i = 0; i < n; i++)
(a[i] *= tmp) %= mod;
}
}
struct Edge {
int u, v, nxt;
ll w;
Edge(int _u = 0, int _v = 0, ll _w = 0, int _nxt = -1) {
u = _u;
v = _v;
w = _w;
nxt = _nxt;
}
int operator<(const Edge &b) const { return u < b.u; }
};
const int maxn = 3e5 + 5;
/*------------------------------------------------------------------------yah------------------------------------------------------------------------*/
Edge edg[maxn << 1];
int ecnt, g[maxn];
int n;
int maxlen, ep;
void dfs(int u, int last, int len) {
if (len > maxlen) {
maxlen = len;
ep = u;
}
for (int i = g[u]; ~i; i = edg[i].nxt) {
int &v = edg[i].v;
if (v != last) {
dfs(v, u, len + 1);
}
}
}
int main() {
memset(g, ecnt = -1, sizeof(g));
ru(n);
for (int i = 1; i < n; i++) {
int u, v;
ru(u, v);
edg[++ecnt] = Edge(u, v, 0, g[u]);
g[u] = ecnt;
edg[++ecnt] = Edge(v, u, 0, g[v]);
g[v] = ecnt;
}
dfs(1, 0, 1);
dfs(ep, 0, 1);
if (maxlen == 0 || maxlen == 2 || (maxlen >= 3 && maxlen % 3 == 2)) {
cout << "Second";
} else {
cout << "First";
}
return 0;
} | replace | 162 | 163 | 162 | 163 | 0 | |
p03055 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> adj(200200);
int depth[200200];
int dfs2(int i, int p, int d = 0) {
depth[i] = d;
for (int j : adj[i])
if (p != j)
dfs2(j, i, d + 1);
}
int main() {
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs2(0, -1);
int s, t, dmax = 0;
for (int i = 0; i < n; i++)
if (dmax < depth[i]) {
dmax = depth[i];
s = i;
}
dmax = 0;
memset(depth, 0, sizeof(depth));
dfs2(s, -1);
for (int i = 0; i < n; i++)
if (dmax < depth[i]) {
dmax = depth[i];
t = i;
}
cerr << s << ' ' << t << ' ' << depth[t] << endl;
cout << ((depth[t] % 3 != 1) ? "First" : "Second") << endl;
}
| #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> adj(200200);
int depth[200200];
int dfs2(int i, int p, int d = 0) {
depth[i] = d;
for (int j : adj[i])
if (p != j)
dfs2(j, i, d + 1);
}
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "First\n";
return 0;
}
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs2(0, -1);
int s, t, dmax = 0;
for (int i = 0; i < n; i++)
if (dmax < depth[i]) {
dmax = depth[i];
s = i;
}
dmax = 0;
memset(depth, 0, sizeof(depth));
dfs2(s, -1);
for (int i = 0; i < n; i++)
if (dmax < depth[i]) {
dmax = depth[i];
t = i;
}
cerr << s << ' ' << t << ' ' << depth[t] << endl;
cout << ((depth[t] % 3 != 1) ? "First" : "Second") << endl;
}
| insert | 17 | 17 | 17 | 21 | 0 | 2 0 2
|
p03055 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
constexpr int INF = numeric_limits<int>::max() / 3;
void dfs(Graph const &tree, vector<int> &dists, int pos) {
for (auto v : tree[pos]) {
if (dists[v] < INF)
continue;
dists[v] = dists[pos] + 1;
dfs(tree, dists, v);
}
}
int diameter(Graph const &tree) {
int V = tree.size();
vector<int> dists(V, INF);
dists[0] = 0;
dfs(tree, dists, 0);
auto farthest = max_element(begin(dists), end(dists));
int v = farthest - begin(dists);
vector<int> dists2(V, INF);
dists2[v] = 0;
dfs(tree, dists2, v);
return *max_element(begin(dists2), end(dists2));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
Graph tree(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
tree[a].push_back(b);
tree[b].push_back(a);
}
int d = diameter(tree);
cout << (d % 3 == 1 ? "Second" : "First") << endl;
}
| #include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
constexpr int INF = numeric_limits<int>::max() / 3;
void dfs(Graph const &tree, vector<int> &dists, int pos) {
for (auto v : tree[pos]) {
if (dists[v] < INF)
continue;
dists[v] = dists[pos] + 1;
dfs(tree, dists, v);
}
}
int diameter(Graph const &tree) {
int V = tree.size();
vector<int> dists(V, INF);
dists[0] = 0;
dfs(tree, dists, 0);
auto farthest = max_element(begin(dists), end(dists));
int v = farthest - begin(dists);
vector<int> dists2(V, INF);
dists2[v] = 0;
dfs(tree, dists2, v);
return *max_element(begin(dists2), end(dists2));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
Graph tree(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
tree[a].push_back(b);
tree[b].push_back(a);
}
int d = diameter(tree);
cout << (d % 3 == 1 ? "Second" : "First") << endl;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
vector<vector<int>> neighbor;
void dfs(int node, int d, vector<int> &dist, vector<bool> &isVisited) {
isVisited[node] = true;
dist[node] = d;
for (int ch : neighbor[node]) {
if (!isVisited[ch]) {
dfs(ch, d + 1, dist, isVisited);
}
}
}
int main() {
int n;
cin >> n;
neighbor.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
neighbor[a].push_back(b);
neighbor[b].push_back(a);
}
vector<int> dist(n);
vector<bool> isVisited(n, false);
dfs(0, 0, dist, isVisited);
int d = 0, v;
rep(i, n) {
if (d < dist[i]) {
d = dist[i];
v = i;
}
}
fill(isVisited.begin(), isVisited.end(), false);
dfs(v, 0, dist, isVisited);
int diameter = 0;
rep(i, n) { diameter = max(diameter, dist[i]); }
if ((diameter + 1) % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, n) for (int64_t i = (n)-1; i >= 0; i--)
#define rirep(i, n) for (int64_t i = n; i >= 0; i--)
vector<vector<int>> neighbor;
void dfs(int node, int d, vector<int> &dist, vector<bool> &isVisited) {
isVisited[node] = true;
dist[node] = d;
for (int ch : neighbor[node]) {
if (!isVisited[ch]) {
dfs(ch, d + 1, dist, isVisited);
}
}
}
int main() {
int n;
cin >> n;
neighbor.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
neighbor[a].push_back(b);
neighbor[b].push_back(a);
}
vector<int> dist(n);
vector<bool> isVisited(n, false);
dfs(0, 0, dist, isVisited);
int d = 0, v = 0;
rep(i, n) {
if (d < dist[i]) {
d = dist[i];
v = i;
}
}
fill(isVisited.begin(), isVisited.end(), false);
dfs(v, 0, dist, isVisited);
int diameter = 0;
rep(i, n) { diameter = max(diameter, dist[i]); }
if ((diameter + 1) % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
}
vector<int> d(n + 1);
using P = pair<int, int>;
function<void(int, vector<int> &)> dfs = [&](int s, vector<int> &d) {
queue<P> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.front();
int v = p.second;
int cost = p.first;
que.pop();
for (auto next : e[v]) {
if (next != s && d[next] == 0) {
que.push(P(cost + 1, next));
d[next] = cost + 1;
}
}
}
};
dfs(1, d);
int ma = 0;
int pos = 0;
for (int i = 1; i <= n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
vector<int> d2(n + 1);
dfs(pos, d2);
int ma2 = 0;
for (int i = 1; i <= n; i++) {
if (ma2 < d2[i]) {
ma2 = d2[i];
}
}
if ((ma2 + 1) % 3 != 2) {
cout << "First" << endl;
} else
cout << "Second" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> e(n + 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
}
vector<int> d(n + 1);
using P = pair<int, int>;
function<void(int, vector<int> &)> dfs = [&](int s, vector<int> &d) {
queue<P> que;
que.push(P(0, s));
while (!que.empty()) {
P p = que.front();
int v = p.second;
int cost = p.first;
que.pop();
for (auto next : e[v]) {
if (next != s && d[next] == 0) {
que.push(P(cost + 1, next));
d[next] = cost + 1;
}
}
}
};
dfs(1, d);
int ma = 0;
int pos = 0;
for (int i = 1; i <= n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
vector<int> d2(n + 1);
dfs(pos, d2);
int ma2 = 0;
for (int i = 1; i <= n; i++) {
if (ma2 < d2[i]) {
ma2 = d2[i];
}
}
if ((ma2 + 1) % 3 != 2) {
cout << "First" << endl;
} else
cout << "Second" << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> d(n);
for (int i = 0; i < n; i++) {
d[i] = -1;
}
function<void(int)> dfs = [&](int v) {
for (int nx : g[v]) {
if (d[nx] != -1)
continue;
d[nx] = d[v] + 1;
dfs(nx);
}
};
d[0] = 0;
dfs(0);
int pos = 0;
int ma = 0;
for (int i = 0; i < n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
for (int i = 0; i < n; i++) {
d[i] = -1;
}
d[pos] = 0;
dfs(pos);
ma = 0;
pos = 0;
for (int i = 0; i < n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
ma++;
if (ma % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> d(n);
for (int i = 0; i < n; i++) {
d[i] = -1;
}
function<void(int)> dfs = [&](int v) {
for (int nx : g[v]) {
if (d[nx] != -1)
continue;
d[nx] = d[v] + 1;
dfs(nx);
}
};
d[0] = 0;
dfs(0);
int pos = 0;
int ma = 0;
for (int i = 0; i < n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
for (int i = 0; i < n; i++) {
d[i] = -1;
}
d[pos] = 0;
dfs(pos);
ma = 0;
pos = 0;
for (int i = 0; i < n; i++) {
if (ma < d[i]) {
ma = d[i];
pos = i;
}
}
ma++;
if (ma % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
const int MAXN = 8e4 + 5, MAXM = 2e5 + 5, BOUND = 1e7, MOD = 1073741824,
INF = 0x3f3f3f3f, base = 10000;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0), eps = 1e-9;
#define mid l + ((r - l) >> 1)
#define lson o << 1, l, m
#define rson o << 1 | 1, m + 1, r
#define lc(x) ch[x][0]
#define pii pair<int, int>
#define vi vector<int>
#define RR register int
#define rc(x) ch[x][1]
#define rep(i, a, b) for (RR i = (a); i <= (b); ++i)
#define random(a, b) ((a) + rand() % ((b) - (a) + 1))
int n, x, y, d[MAXN], diameter;
vi G[MAXN];
void dfs(int u, int f) {
int mx = 0;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (v == f)
continue;
dfs(v, u);
diameter = max(diameter, mx + d[v] + 1);
mx = max(mx, d[v] + 1);
d[u] = max(d[v] + 1, d[u]);
}
}
int main() {
cin >> n;
rep(i, 2, n) {
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(1, 0);
if (diameter % 3 == 1)
cout << "Second\n";
else
cout << "First\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
const int MAXN = 2e5 + 5, MAXM = 2e5 + 5, BOUND = 1e7, MOD = 1073741824,
INF = 0x3f3f3f3f, base = 10000;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0), eps = 1e-9;
#define mid l + ((r - l) >> 1)
#define lson o << 1, l, m
#define rson o << 1 | 1, m + 1, r
#define lc(x) ch[x][0]
#define pii pair<int, int>
#define vi vector<int>
#define RR register int
#define rc(x) ch[x][1]
#define rep(i, a, b) for (RR i = (a); i <= (b); ++i)
#define random(a, b) ((a) + rand() % ((b) - (a) + 1))
int n, x, y, d[MAXN], diameter;
vi G[MAXN];
void dfs(int u, int f) {
int mx = 0;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (v == f)
continue;
dfs(v, u);
diameter = max(diameter, mx + d[v] + 1);
mx = max(mx, d[v] + 1);
d[u] = max(d[v] + 1, d[u]);
}
}
int main() {
cin >> n;
rep(i, 2, n) {
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(1, 0);
if (diameter % 3 == 1)
cout << "Second\n";
else
cout << "First\n";
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, top, x, y, ans, ma, dis[N], head[N];
struct node {
int too, next;
} edge[N * 2];
void add(int a, int b) {
edge[++top].too = b;
edge[top].next = head[a];
head[a] = top;
}
void dfs(int u, int fa) {
dis[u] = dis[fa] + 1;
if (dis[u] > ma) {
ma = dis[u];
ans = u;
}
for (int i = head[u]; i; i = edge[i].next) {
int v = edge[i].too;
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int T;
T = 1;
while (T--) {
scanf("%d", &n);
top = 0;
memset(head, 0, sizeof(head));
for (int i = 1; i < n; i++) {
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
memset(dis, 0, sizeof(dis));
ma = 0, ans = 0;
dfs(1, 0);
memset(dis, 0, sizeof(dis));
x = ans;
ma = 0, ans = 0;
dfs(x, 0);
if (ma == 1) {
puts("First");
continue;
}
if ((ma - 2) % 3 == 0)
puts("Second");
else
puts("First");
}
}
/*
如果选的是叶子，最后一层就只有这一个点了
如果不是叶子，叶子全消除
说明要么去掉一层，要么去掉两层
直径一定是两个叶子
*/
/*
3
3
1 2
2 3
6
1 2
2 3
2 4
4 6
5 6
7
1 7
7 4
3 4
7 5
6 3
2 1
*/ | #include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, top, x, y, ans, ma, dis[N], head[N];
struct node {
int too, next;
} edge[N * 2];
void add(int a, int b) {
edge[++top].too = b;
edge[top].next = head[a];
head[a] = top;
}
void dfs(int u, int fa) {
dis[u] = dis[fa] + 1;
if (dis[u] > ma) {
ma = dis[u];
ans = u;
}
for (int i = head[u]; i; i = edge[i].next) {
int v = edge[i].too;
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int T;
T = 1;
while (T--) {
scanf("%d", &n);
top = 0;
memset(head, 0, sizeof(head));
for (int i = 1; i < n; i++) {
scanf("%d%d", &x, &y);
add(x, y);
add(y, x);
}
memset(dis, 0, sizeof(dis));
ma = 0, ans = 0;
dfs(1, 0);
memset(dis, 0, sizeof(dis));
x = ans;
ma = 0, ans = 0;
dfs(x, 0);
if (ma == 1) {
puts("First");
continue;
}
if ((ma - 2) % 3 == 0)
puts("Second");
else
puts("First");
}
}
/*
如果选的是叶子，最后一层就只有这一个点了
如果不是叶子，叶子全消除
说明要么去掉一层，要么去掉两层
直径一定是两个叶子
*/
/*
3
3
1 2
2 3
6
1 2
2 3
2 4
4 6
5 6
7
1 7
7 4
3 4
7 5
6 3
2 1
*/ | replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
// T1: Give you a tree.
// You can delete all of the leaves or save one leave when it's your turn.
// The person who can't do anything will lose the game.
const int N = 200005;
int n, head[N];
struct Edge {
int next, to;
};
Edge E[N << 1];
int tot;
void add(int u, int v) {
E[++tot].next = head[u];
E[tot].to = v;
head[u] = tot;
}
namespace subtask3 {
int main() {
if (n % 3 == 2)
puts("Second");
else
puts("First");
return 0;
}
} // namespace subtask3
int dis[N];
void dfs(int u, int fa) {
for (int i = head[u]; i; i = E[i].next) {
int v = E[i].to;
if (v == fa)
continue;
dis[v] = dis[u] + 1;
dfs(v, u);
}
}
int rho() {
dis[1] = 0;
dfs(1, 0);
int res = 0;
for (int i = 1; i <= n; ++i) {
if (dis[i] > dis[res])
res = i;
}
dis[res] = 0;
dfs(res, 0);
for (int i = 1; i <= n; ++i) {
if (dis[i] > dis[res])
res = i;
}
return dis[res] + 1;
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
bool s3_flag = 1;
tot = 0;
memset(head, 0x00, sizeof(head));
scanf("%d", &n);
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
if (u != i || v != i + 1)
s3_flag = 0;
}
if (s3_flag) {
subtask3::main();
continue;
}
n = rho();
subtask3::main();
}
}
| #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
// T1: Give you a tree.
// You can delete all of the leaves or save one leave when it's your turn.
// The person who can't do anything will lose the game.
const int N = 200005;
int n, head[N];
struct Edge {
int next, to;
};
Edge E[N << 1];
int tot;
void add(int u, int v) {
E[++tot].next = head[u];
E[tot].to = v;
head[u] = tot;
}
namespace subtask3 {
int main() {
if (n % 3 == 2)
puts("Second");
else
puts("First");
return 0;
}
} // namespace subtask3
int dis[N];
void dfs(int u, int fa) {
for (int i = head[u]; i; i = E[i].next) {
int v = E[i].to;
if (v == fa)
continue;
dis[v] = dis[u] + 1;
dfs(v, u);
}
}
int rho() {
dis[1] = 0;
dfs(1, 0);
int res = 0;
for (int i = 1; i <= n; ++i) {
if (dis[i] > dis[res])
res = i;
}
dis[res] = 0;
dfs(res, 0);
for (int i = 1; i <= n; ++i) {
if (dis[i] > dis[res])
res = i;
}
return dis[res] + 1;
}
int main() {
int T = 1;
while (T--) {
bool s3_flag = 1;
tot = 0;
memset(head, 0x00, sizeof(head));
scanf("%d", &n);
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
add(v, u);
if (u != i || v != i + 1)
s3_flag = 0;
}
if (s3_flag) {
subtask3::main();
continue;
}
n = rho();
subtask3::main();
}
}
| replace | 65 | 67 | 65 | 66 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 200000;
int n;
vector<int> graph[N];
void dfs(int cur, int par, int d, int &dist, int &deepest) {
if (d > dist) {
deepest = cur;
dist = d;
}
for (int child : graph[cur]) {
if (child != par) {
dfs(child, cur, d + 1, dist, deepest);
}
}
}
int findDiam() {
int deepest = 1, dist = 0;
dfs(1, 0, 0, dist, deepest);
int ignore = 1, diam = 0;
dfs(deepest, 0, 0, diam, ignore);
return diam;
}
bool firstWins(int diam) {
if (diam == 0)
return true;
int m = diam % 3;
return m == 0 || m == 2;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int diam = findDiam();
if (firstWins(diam)) {
cout << "First\n";
} else {
cout << "Second\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 200000;
int n;
vector<int> graph[N + 1];
void dfs(int cur, int par, int d, int &dist, int &deepest) {
if (d > dist) {
deepest = cur;
dist = d;
}
for (int child : graph[cur]) {
if (child != par) {
dfs(child, cur, d + 1, dist, deepest);
}
}
}
int findDiam() {
int deepest = 1, dist = 0;
dfs(1, 0, 0, dist, deepest);
int ignore = 1, diam = 0;
dfs(deepest, 0, 0, diam, ignore);
return diam;
}
bool firstWins(int diam) {
if (diam == 0)
return true;
int m = diam % 3;
return m == 0 || m == 2;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
int diam = findDiam();
if (firstWins(diam)) {
cout << "First\n";
} else {
cout << "Second\n";
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03055 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<vector<ll>> edges(N);
for (ll i = 0; i < N - 1; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
struct Element {
ll cost, node;
bool operator<(const Element &rhs) const { return cost > rhs.cost; }
};
vector<ll> cost1(N, INT_MAX);
{
priority_queue<Element> pq;
cost1[0] = 0;
pq.push({0, 0});
while (!pq.empty()) {
auto t = pq.top();
pq.pop();
for (auto next : edges[t.node]) {
if (t.cost + 1 < cost1[next]) {
cost1[next] = t.cost + 1;
pq.push({t.cost + 1, next});
}
}
}
}
ll max_cost = 0, max_index = -1;
for (ll i = 0; i < N; i++) {
if (cost1[i] > max_cost) {
max_cost = cost1[i];
max_index = i;
}
}
vector<ll> cost2(N, INT_MAX);
{
priority_queue<Element> pq;
cost2[max_index] = 0;
pq.push({0, max_index});
while (!pq.empty()) {
auto t = pq.top();
pq.pop();
for (auto next : edges[t.node]) {
if (t.cost + 1 < cost2[next]) {
cost2[next] = t.cost + 1;
pq.push({t.cost + 1, next});
}
}
}
}
ll diameter = *max_element(cost2.begin(), cost2.end());
cout << (diameter % 3 == 1 ? "Second" : "First") << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
if (N == 1) {
cout << "First" << endl;
return 0;
}
vector<vector<ll>> edges(N);
for (ll i = 0; i < N - 1; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
struct Element {
ll cost, node;
bool operator<(const Element &rhs) const { return cost > rhs.cost; }
};
vector<ll> cost1(N, INT_MAX);
{
priority_queue<Element> pq;
cost1[0] = 0;
pq.push({0, 0});
while (!pq.empty()) {
auto t = pq.top();
pq.pop();
for (auto next : edges[t.node]) {
if (t.cost + 1 < cost1[next]) {
cost1[next] = t.cost + 1;
pq.push({t.cost + 1, next});
}
}
}
}
ll max_cost = 0, max_index = -1;
for (ll i = 0; i < N; i++) {
if (cost1[i] > max_cost) {
max_cost = cost1[i];
max_index = i;
}
}
vector<ll> cost2(N, INT_MAX);
{
priority_queue<Element> pq;
cost2[max_index] = 0;
pq.push({0, max_index});
while (!pq.empty()) {
auto t = pq.top();
pq.pop();
for (auto next : edges[t.node]) {
if (t.cost + 1 < cost2[next]) {
cost2[next] = t.cost + 1;
pq.push({t.cost + 1, next});
}
}
}
}
ll diameter = *max_element(cost2.begin(), cost2.end());
cout << (diameter % 3 == 1 ? "Second" : "First") << endl;
} | insert | 7 | 7 | 7 | 11 | 0 | |
p03055 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
void Calculate_Depth(vector<vector<int>> &edge, vector<int> &depth,
int stnode) {
depth[stnode] = 0;
queue<int> Q;
Q.push(stnode);
while (!Q.empty()) {
int cn = Q.front();
Q.pop();
for (auto i : edge[cn]) {
if (depth[i] > depth[cn] + 1) {
depth[i] = depth[cn] + 1;
Q.push(i);
}
}
}
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<vector<int>> edge(N);
for (int i = 1; i < N; i++) {
cin >> L >> R;
L--;
R--;
edge[L].push_back(R);
edge[R].push_back(L);
}
vector<int> depth(N, MOD);
Calculate_Depth(edge, depth, 0);
int index = 1;
for (int i = 2; i < N; i++)
if (depth[i] > depth[index])
index = i;
for (auto &i : depth)
i = MOD;
Calculate_Depth(edge, depth, index);
int num = *max_element(depth.begin(), depth.end());
vector<int> dp(N + 1);
dp[0] = 1;
for (int i = 2; i <= N; i++) {
dp[i] = 1;
if (dp[i - 2] && dp[i - 1])
dp[i] = 0;
}
if (dp[num])
cout << "First\n";
else
cout << "Second\n";
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
void Calculate_Depth(vector<vector<int>> &edge, vector<int> &depth,
int stnode) {
depth[stnode] = 0;
queue<int> Q;
Q.push(stnode);
while (!Q.empty()) {
int cn = Q.front();
Q.pop();
for (auto i : edge[cn]) {
if (depth[i] > depth[cn] + 1) {
depth[i] = depth[cn] + 1;
Q.push(i);
}
}
}
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
vector<vector<int>> edge(N);
for (int i = 1; i < N; i++) {
cin >> L >> R;
L--;
R--;
edge[L].push_back(R);
edge[R].push_back(L);
}
vector<int> depth(N, MOD);
Calculate_Depth(edge, depth, 0);
int index = 0;
for (int i = 1; i < N; i++)
if (depth[i] > depth[index])
index = i;
for (auto &i : depth)
i = MOD;
Calculate_Depth(edge, depth, index);
int num = *max_element(depth.begin(), depth.end());
vector<int> dp(N + 1);
dp[0] = 1;
for (int i = 2; i <= N; i++) {
dp[i] = 1;
if (dp[i - 2] && dp[i - 1])
dp[i] = 0;
}
if (dp[num])
cout << "First\n";
else
cout << "Second\n";
return 0;
} | replace | 63 | 65 | 63 | 65 | 0 | |
p03055 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
const ll mod = 1000000007;
const ll INF = 1000000000000000;
ll bit[100010], num;
ll par[100010], sz[100010];
ll n, a, b, ans, dp[100010], leaf[100010], res[2];
vector<ll> road[100010];
bool flg[100010];
struct edge {
ll to, cost;
};
ll V;
vector<edge> G[300010];
ll d[300010];
ll root(int x) { // �f�[�^x��������̍����ċA�œ���Froot(x) =
// {x�̖̍�}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // x��y�̖�
int rx = root(x); // x�̍���rx
int ry = root(y); // y�̍���ry
if (rx == ry)
return; // x��y�̍�������(=�����ɂ���)���͂��̂܂�
par[rx] =
ry; // x��y�̍��������łȂ�(=�����ɂȂ�)���Fx�̍�rx��y�̍�ry�ɂ���
}
bool same(
int x,
int y) { // 2�̃f�[�^x,
// y��������������Ȃ�true��Ԃ�
int rx = root(x);
int ry = root(y);
return rx == ry;
}
ll sum(ll i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(ll i, ll x) {
while (i <= num) {
bit[i] += x;
i += i & -i;
}
}
ll po(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return po(x, y - 1) * x % mod;
} else {
ll yyy = po(x, y / 2);
return yyy * yyy % mod;
}
}
ll pow_mod(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y % 2 == 1) {
(res *= x) %= mod;
}
(x *= x) %= mod;
y /= 2;
}
return res;
}
ll div(ll x) { return po(x, mod - 2); }
ll dfs(ll x) {
flg[x] = true;
vector<ll> vec;
vec.push_back(0);
for (int i = 0; i < road[x].size(); i++) {
if (flg[road[x][i]])
continue;
vec.push_back(dfs(road[x][i]));
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
if (vec.size() != 1) {
ans = max(ans, vec[0] + vec[1] + 1);
}
return vec[0] + 1;
}
int main(void) {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a >> b;
road[a].push_back(b);
road[b].push_back(a);
}
if (n == 1) {
cout << "First" << endl;
return 0;
}
if (n == 2) {
cout << "Second" << endl;
return 0;
}
dfs(1);
if (ans % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
int www;
cin >> www;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
const ll mod = 1000000007;
const ll INF = 1000000000000000;
ll bit[100010], num;
ll par[100010], sz[100010];
ll n, a, b, ans, dp[100010], leaf[100010], res[2];
vector<ll> road[200010];
bool flg[200010];
struct edge {
ll to, cost;
};
ll V;
vector<edge> G[300010];
ll d[300010];
ll root(int x) { // �f�[�^x��������̍����ċA�œ���Froot(x) =
// {x�̖̍�}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // x��y�̖�
int rx = root(x); // x�̍���rx
int ry = root(y); // y�̍���ry
if (rx == ry)
return; // x��y�̍�������(=�����ɂ���)���͂��̂܂�
par[rx] =
ry; // x��y�̍��������łȂ�(=�����ɂȂ�)���Fx�̍�rx��y�̍�ry�ɂ���
}
bool same(
int x,
int y) { // 2�̃f�[�^x,
// y��������������Ȃ�true��Ԃ�
int rx = root(x);
int ry = root(y);
return rx == ry;
}
ll sum(ll i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(ll i, ll x) {
while (i <= num) {
bit[i] += x;
i += i & -i;
}
}
ll po(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return po(x, y - 1) * x % mod;
} else {
ll yyy = po(x, y / 2);
return yyy * yyy % mod;
}
}
ll pow_mod(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y % 2 == 1) {
(res *= x) %= mod;
}
(x *= x) %= mod;
y /= 2;
}
return res;
}
ll div(ll x) { return po(x, mod - 2); }
ll dfs(ll x) {
flg[x] = true;
vector<ll> vec;
vec.push_back(0);
for (int i = 0; i < road[x].size(); i++) {
if (flg[road[x][i]])
continue;
vec.push_back(dfs(road[x][i]));
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
if (vec.size() != 1) {
ans = max(ans, vec[0] + vec[1] + 1);
}
return vec[0] + 1;
}
int main(void) {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a >> b;
road[a].push_back(b);
road[b].push_back(a);
}
if (n == 1) {
cout << "First" << endl;
return 0;
}
if (n == 2) {
cout << "Second" << endl;
return 0;
}
dfs(1);
if (ans % 3 == 2) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
int www;
cin >> www;
}
| replace | 17 | 19 | 17 | 19 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
const ll MOD2 = 998244353;
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
int a, b;
for (int i = 0; i < N - 1; i++) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
queue<int> q;
vector<int> ds(N, inINF);
ds[0] = 0;
q.push(0);
int tmp;
while (!q.empty()) {
tmp = q.front();
q.pop();
for (int v : G[tmp]) {
if (ds[v] < inINF) {
continue;
}
ds[v] = ds[tmp] + 1;
q.push(v);
}
}
int m = 0;
int ind;
for (int i = 0; i < N; i++) {
if (ds[i] > m) {
ind = i;
m = ds[i];
}
}
fill(ALL(ds), inINF);
q.push(ind);
ds[ind] = 0;
while (!q.empty()) {
tmp = q.front();
q.pop();
for (int v : G[tmp]) {
if (ds[v] < inINF) {
continue;
}
ds[v] = ds[tmp] + 1;
q.push(v);
}
}
m = 0;
for (int i = 0; i < N; i++) {
if (ds[i] > m) {
ind = i;
m = ds[i];
}
}
if (m % 3 == 1) {
printf("Second\n");
} else {
printf("First\n");
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> iint;
typedef pair<ll, ll> llll;
#define ALL(x) (x).begin(), (x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; // 10^18
const int inINF = 1000000000; // 10^9
const ll MOD = 1000000007; // 10^9+7
const ll MOD2 = 998244353;
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }
int main() {
int N;
cin >> N;
if (N == 1) {
printf("First\n");
return 0;
}
vector<vector<int>> G(N);
int a, b;
for (int i = 0; i < N - 1; i++) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
queue<int> q;
vector<int> ds(N, inINF);
ds[0] = 0;
q.push(0);
int tmp;
while (!q.empty()) {
tmp = q.front();
q.pop();
for (int v : G[tmp]) {
if (ds[v] < inINF) {
continue;
}
ds[v] = ds[tmp] + 1;
q.push(v);
}
}
int m = 0;
int ind;
for (int i = 0; i < N; i++) {
if (ds[i] > m) {
ind = i;
m = ds[i];
}
}
fill(ALL(ds), inINF);
q.push(ind);
ds[ind] = 0;
while (!q.empty()) {
tmp = q.front();
q.pop();
for (int v : G[tmp]) {
if (ds[v] < inINF) {
continue;
}
ds[v] = ds[tmp] + 1;
q.push(v);
}
}
m = 0;
for (int i = 0; i < N; i++) {
if (ds[i] > m) {
ind = i;
m = ds[i];
}
}
if (m % 3 == 1) {
printf("Second\n");
} else {
printf("First\n");
}
} | insert | 19 | 19 | 19 | 23 | 0 | |
p03055 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#pragma region macros_and_aliases
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define foa(s, v) for (auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
#define endk endl
#define ednl endl
#define enld endl
using ll = long long;
using ld = long double;
using vb = vector<bool>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using qll = queue<long long>;
using sll = set<long long>;
using vpll = vector<pair<long long, long long>>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
template <class T = ll> using VVV = V<V<V<T>>>;
// 昇順pq(小さい方から取り出す)
template <class T = ll> using pqup = priority_queue<T, vector<T>, greater<T>>;
// 降順pq(大きい方から取り出す)
template <class T = ll> using pqdn = priority_queue<T>;
#define debug(var) \
std::cout << #var << " : "; \
view(var)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
cout << "\n";
for (const auto &v : vv) {
view(v);
}
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
#pragma endregion
#pragma region constants
long long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18
long long const dekai = 3e16;
const long double pi = acos(-1);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int mod = 1000000007;
// const int mod = 998244353;
#pragma endregion
#pragma region basic_procedure
template <class T> inline bool isin(T x, T lef, T rig) {
return ((lef <= x) && (x < rig));
}
template <class T> inline bool isin(T x, T y, T lef, T rig) {
return isin(x, lef, rig) && isin(y, lef, rig);
}
template <class T> inline bool isin(T X, T lefX, T rigX, T Y, T lefY, T rigY) {
return isin(X, lefX, rigX) && isin(Y, lefY, rigY);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << "\n"; }
void No() { cout << "No\n"; }
void YES(bool f = 1) { cout << (f ? "YES" : "NO") << "\n"; }
void NO() { cout << "NO\n"; }
void err() { cout << -1 << "\n"; }
vector<long long>
vin(long long n) { // 整数n個の入力を受け取ってベクトルに突っ込んで返す
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
// ベクトルの出力(検証済)
// vectorの中身を出力する 答えの出力に利用可能
template <class T> void vout(vector<T> &v, bool tate = 0) {
if (v.size() > 0) {
for (auto it = v.begin(); it < v.end(); it++) {
cout << *it;
if (it != v.end() - 1) {
if (tate)
cout << endl;
else
cout << " ";
}
}
}
cout << endl;
}
template <class T> void add(vector<T> &v, T val) { // ベクトルの各要素に加算
for (auto &a : v)
a += val;
return;
}
// vectorの中身を数える map<要素,個数>を返す
template <class T> map<T, long long> cntv(vector<T> v) {
map<T, long long> m;
for (auto &g : v) {
if (m.count(g))
m[g]++;
else
m[g] = 1;
}
return m;
}
// 配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
template <class T> vector<long long> press(vector<T> &v) {
long long n = v.size();
vector<long long> w(n);
map<T, long long> m;
for (T &p : v)
m[p] = 0;
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++)
w.at(i) = m[v.at(i)];
return w;
}
template <class T> T divup(T a, T b) {
// 端数繰りあがり割り算
assert(b != 0);
T x = abs(a);
T y = abs(b);
T z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
long long POW(long long a, long long n) {
// 整数のとき限定の普通のPOW関数
// 標準機能のpow(a,n)は整数だとバグるのでこちらを使う
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
template <class T> int sgn(T x) { // 符号関数
if (x < 0)
return -1;
if (x == 0)
return x;
return 1;
}
long long modpow(long long a, long long n, long long mod) { // a^n mod
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { // a^{-1} mod
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
return modpow(a, mod - 2, mod);
}
vvll comb(100, vll(100, -1));
long long com(long long n, long long k) { // 普通の二項計数(overflowに注意)
assert(n < 100 && k < 100);
if (n < k || k < 0 || n < 0)
return 0;
if (comb[n][k] != -1)
return comb[n][k];
ll res;
if (n - k < k)
res = com(n, n - k);
else if (k == 0)
res = 1;
else
res = com(n - 1, k - 1) + com(n - 1, k);
comb[n][k] = res;
return res;
}
// nCk modを求める
const ll MAX = 5100000;
// この値は求める二項計数の値に応じて変える
// MAX=3*10^7のとき1900msほど、ほぼ比例
// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)
long long fac[MAX], finv[MAX], inv[MAX];
void cominit() {
// テーブルを作る前処理
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long commod(ll n, ll k) { // 二項係数計算
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long pmod(ll n, ll k) { // 順列計算
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % mod;
}
long long hmod(ll n, ll k) { // nHk計算
// n個の区別しないoを区別するk個の箱に入れる方法の総数
//(n+k-1)C(k-1)と等しい
return commod(n + k - 1, n);
}
#pragma endregion
template <class T> // WarshallFloyd
void warshall(vector<vector<T>> &v) {
ll n = v.size();
rep(i, n) rep(j, n) rep(k, n) {
if (v[j][i] == dekai || v[i][k] == dekai)
continue;
v[j][k] = min(v[j][k], v[j][i] + v[i][k]);
}
return;
}
template <class T = long long> struct edge {
T len;
int from;
int to;
bool operator<(const edge a) const {
if (len != a.len)
return len < a.len;
if (from != a.from)
return from < a.from;
return to < a.to;
}
bool operator>(const edge a) const {
if (len != a.len)
return len > a.len;
if (from != a.from)
return from > a.from;
return to > a.to;
}
};
template <class T = long long> struct graph { // 0-indexed
vector<vector<edge<T>>> edges;
bool directed, weight;
int ver;
// constructor
graph(int vertex, bool direction = 0, bool weigh = 0) : edges(vertex) {
ver = vertex;
directed = direction;
weight = weigh;
edges.resize(vertex);
}
// 辺の追加 (0-indexed)
void update(int from, int to, T len = 1, bool direction = 1) {
edge<T> e;
e.len = len;
e.from = from;
e.to = to;
edges[from].push_back(e);
if (!direction) {
swap(e.to, e.from);
edges[to].push_back(e);
}
}
// 入力受取 (1-indexed)
void input(int edge_num, int index = 1) {
for (int i = 0; i < edge_num; i++) {
int a;
int b;
cin >> a >> b;
a -= index;
b -= index;
T c;
if (weight)
cin >> c;
else
c = 1;
update(a, b, c, directed);
}
}
// 辺の長さを全て1とみたときの単一始点最短経路 (無理なときはdekai)
vector<long long> bfs(int start) {
// https://atcoder.jp/contests/abc007/submissions/me
vector<long long> ret(ver, dekai);
queue<int> q;
q.push(start);
ret[start] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto &e : edges[now]) {
if (ret[e.to] != dekai)
continue;
q.push(e.to);
ret[e.to] = ret[now] + 1;
}
}
return ret;
}
// 長さが負のpathがないときの単一始点最短経路<vll> O((ver)log(ver)+(edge))
vector<T> dijkstra(int start) {
vector<T> ret(ver, (T)dekai);
pqup<pair<T, int>> p; //{dist,place}
p.push({0, start});
ret[start] = 0;
while (!p.empty()) {
T dist = p.top().first;
int place = p.top().second;
p.pop();
if (ret[place] < dist)
continue;
for (auto &next : edges[place]) {
int nextplace = next.to;
T dis = next.len;
if (chmin(ret[nextplace], dist + dis)) {
p.push({ret[nextplace], nextplace});
}
}
}
return ret;
}
// 単一始点最短経路 O((ver)*(edge))
// 辿り着けないとき ret[i] = dekai;
// ある頂点までのコストが無限に小さくなり得るとき→ ret[i] = -dekai;
vector<T> BellmanFord(int start) {
// https://onlinejudge.u-aizu.ac.jp/problems/GRL_1_B
vector<T> ret(ver, dekai);
ret[start] = 0;
rep(loop, ver - 1) {
rep(v, ver) {
if (ret[v] == dekai)
continue;
for (auto &e : edges[v]) {
chmin(ret[e.to], ret[v] + e.len);
}
}
}
// 無限降下点の検索
queue<int> q;
vector<bool> chk(ver, 0);
rep(v, ver) {
if (ret[v] == dekai)
continue;
for (auto &e : edges[v]) {
if (chmin(ret[e.to], ret[v] + e.len)) {
if (!chk[e.to]) {
q.push(e.to);
chk[e.to] = 1;
}
}
}
}
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto &e : edges[now]) {
if (!chk[e.to]) {
chk[e.to] = 1;
q.push(e.to);
}
}
}
rep(i, ver) if (chk[i]) ret[i] = -dekai;
return ret;
}
// 閉路に含まれない頂点列挙
// 要素数がver未満なら閉路が存在、そうでなければ閉路は存在しない
vector<int> topo_sort() {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_A
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_B
assert(directed);
vector<int> num_input(ver);
// 入次数
for (int i = 0; i < ver; i++) {
for (auto e : edges[i]) {
num_input[e.to]++;
}
}
// 入次数が0のノードをqueueで管理する
queue<int> que;
for (int i = 0; i < ver; i++) {
if (num_input[i] == 0) {
que.push(i);
}
}
vector<int> ans;
while (!que.empty()) {
auto node = que.front();
que.pop();
ans.push_back(node);
// 頂点の削除
for (auto e : edges[node]) {
num_input[e.to]--;
// 行き先の入次数が0になったらqueueに追加
if (num_input[e.to] == 0) {
que.push(e.to);
}
}
}
return ans;
}
//{{端点、端点},直径の大きさ}
pair<pair<int, int>, T> DiameterOfTree() {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_5_A
vector<T> vec;
weight ? vec = dijkstra(0) : bfs(0);
int v1 = -1;
T dia = -1;
rep(i, ver) if (chmax(dia, vec[i])) v1 = i;
dia = -1;
int v2 = -1;
weight ? vec = dijkstra(v1) : bfs(v1);
rep(i, ver) if (chmax(dia, vec[i])) v2 = i;
pair<pair<int, int>, T> ans = {{v1, v2}, dia};
return ans;
}
// 無向木構造を根から葉に伸びる有向木構造に書き換える
graph<T> RootToLeaf(int root) { // 0-indexed
graph<T> ret(ver, 1, weight);
vb chk(ver, 0);
chk[root] = 1;
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (chk[e.to] == 1)
continue;
chk[e.to] = 1;
ret.update(now, e.to, e.len, 1);
dfs(e.to);
}
};
dfs(root);
return ret;
}
// 無向木構造を葉から根に伸びる有向木構造に書き換える
graph<T> LeafToRoot(int root) { // 0-indexed
graph<T> ret(ver, 1, weight);
vb chk(ver, 0);
chk[root] = 1;
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (chk[e.to] == 1)
continue;
chk[e.to] = 1;
ret.update(e.to, now, e.len, 1);
dfs(e.to);
}
};
dfs(root);
ret.update(root, root, 0);
return ret;
}
// LeafToRootのvector版.par[i]=iの親の頂点
vector<int> par(int root) { // 0-indexed
vector<int> ret(ver, -1);
ret[root] = root; // rootの親はroot
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (ret[e.to] != -1)
continue;
ret[e.to] = now;
dfs(e.to);
}
};
dfs(root);
return ret;
}
vector<edge<T>> ParentAndDistance(int root) { // 0-indexed
V<edge<T>> ret(ver);
rep(i, ver) ret[i].to = -1;
ret[root].to = root; // rootの親はroot
ret[root].len = 0; // rootの親との距離は0
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (ret[e.to].to != -1)
continue;
ret[e.to].to = now;
ret[e.to].len = e.len;
dfs(e.to);
}
};
dfs(root);
return ret;
}
// 隣接sheet.主にwarshall用
vector<vector<T>> GraphArray(void) {
vector<vector<T>> ret(ver, V<T>(ver, dekai));
rep(from, ver) {
for (auto &e : edges[from]) {
ret[from][e.to] = e.len;
}
ret[from][from] = 0;
}
return ret;
}
graph<T> Prim(int start = 0) {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_2_A
graph<T> ret(ver, 0, 1);
pqup<edge<T>> p;
for (auto &e : edges[start]) {
p.push(e);
}
vector<bool> chk(ver, 0);
chk[start] = 1;
while (!p.empty()) {
auto ed = p.top();
p.pop();
if (chk[ed.to])
continue;
chk[ed.to] = 1;
ret.update(ed.from, ed.to, ed.len);
for (auto &e : edges[ed.to]) {
p.push(e);
}
}
return ret;
}
// 各頂点を根としたときの木の高さ
vector<T> height(int start = 0) {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_5_B
vector<T> fir(ver, -1), sec(ver, -1);
function<T(int, int)> dfs = [&](int now, int par) {
T f = 0, s = 0; // startを根としたときのnowからの深さ1番目、2番目
for (auto &e : edges[now]) {
if (e.to == par)
continue;
chmax(s, dfs(e.to, now) + e.len);
if (f < s)
swap(f, s);
}
sec[now] = s;
return fir[now] = f;
};
dfs(start, -1);
function<void(int, int, T, T, T)> sol = [&](int now, int par, T parf,
T pars, T parlen) {
if (fir[now] + parlen == parf)
parf = pars;
chmax(sec[now], parf + parlen);
if (fir[now] < sec[now])
swap(fir[now], sec[now]);
for (auto &e : edges[now]) {
if (e.to == par)
continue;
sol(e.to, now, fir[now], sec[now], e.len);
}
return;
};
sol(start, -1, -1, -1, -1);
return fir;
}
// lowest common ancestor
// max-flow -> 別ファイル
// 強連結成分分解
// HL分解
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
graph<> g(n);
g.input(n - 1);
// debug(n);
auto v = g.bfs(0);
ll dist = 0;
ll ver = -1;
rep(i, n) {
if (chmax(dist, v[i]))
ver = i;
}
v = g.bfs(ver);
rep(i, n) chmax(dist, v[i]);
string s;
if (dist % 3 == 1)
s = "Second";
else
s = "First";
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma region macros_and_aliases
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define foa(s, v) for (auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pq priority_queue
#define bcnt(n) __builtin_popcountll(n)
#define endk endl
#define ednl endl
#define enld endl
using ll = long long;
using ld = long double;
using vb = vector<bool>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using qll = queue<long long>;
using sll = set<long long>;
using vpll = vector<pair<long long, long long>>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
template <class T = ll> using VVV = V<V<V<T>>>;
// 昇順pq(小さい方から取り出す)
template <class T = ll> using pqup = priority_queue<T, vector<T>, greater<T>>;
// 降順pq(大きい方から取り出す)
template <class T = ll> using pqdn = priority_queue<T>;
#define debug(var) \
std::cout << #var << " : "; \
view(var)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
cout << "\n";
for (const auto &v : vv) {
view(v);
}
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
#pragma endregion
#pragma region constants
long long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18
long long const dekai = 3e16;
const long double pi = acos(-1);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int mod = 1000000007;
// const int mod = 998244353;
#pragma endregion
#pragma region basic_procedure
template <class T> inline bool isin(T x, T lef, T rig) {
return ((lef <= x) && (x < rig));
}
template <class T> inline bool isin(T x, T y, T lef, T rig) {
return isin(x, lef, rig) && isin(y, lef, rig);
}
template <class T> inline bool isin(T X, T lefX, T rigX, T Y, T lefY, T rigY) {
return isin(X, lefX, rigX) && isin(Y, lefY, rigY);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << "\n"; }
void No() { cout << "No\n"; }
void YES(bool f = 1) { cout << (f ? "YES" : "NO") << "\n"; }
void NO() { cout << "NO\n"; }
void err() { cout << -1 << "\n"; }
vector<long long>
vin(long long n) { // 整数n個の入力を受け取ってベクトルに突っ込んで返す
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
// ベクトルの出力(検証済)
// vectorの中身を出力する 答えの出力に利用可能
template <class T> void vout(vector<T> &v, bool tate = 0) {
if (v.size() > 0) {
for (auto it = v.begin(); it < v.end(); it++) {
cout << *it;
if (it != v.end() - 1) {
if (tate)
cout << endl;
else
cout << " ";
}
}
}
cout << endl;
}
template <class T> void add(vector<T> &v, T val) { // ベクトルの各要素に加算
for (auto &a : v)
a += val;
return;
}
// vectorの中身を数える map<要素,個数>を返す
template <class T> map<T, long long> cntv(vector<T> v) {
map<T, long long> m;
for (auto &g : v) {
if (m.count(g))
m[g]++;
else
m[g] = 1;
}
return m;
}
// 配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
template <class T> vector<long long> press(vector<T> &v) {
long long n = v.size();
vector<long long> w(n);
map<T, long long> m;
for (T &p : v)
m[p] = 0;
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++)
w.at(i) = m[v.at(i)];
return w;
}
template <class T> T divup(T a, T b) {
// 端数繰りあがり割り算
assert(b != 0);
T x = abs(a);
T y = abs(b);
T z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
long long POW(long long a, long long n) {
// 整数のとき限定の普通のPOW関数
// 標準機能のpow(a,n)は整数だとバグるのでこちらを使う
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
template <class T> int sgn(T x) { // 符号関数
if (x < 0)
return -1;
if (x == 0)
return x;
return 1;
}
long long modpow(long long a, long long n, long long mod) { // a^n mod
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { // a^{-1} mod
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
return modpow(a, mod - 2, mod);
}
vvll comb(100, vll(100, -1));
long long com(long long n, long long k) { // 普通の二項計数(overflowに注意)
assert(n < 100 && k < 100);
if (n < k || k < 0 || n < 0)
return 0;
if (comb[n][k] != -1)
return comb[n][k];
ll res;
if (n - k < k)
res = com(n, n - k);
else if (k == 0)
res = 1;
else
res = com(n - 1, k - 1) + com(n - 1, k);
comb[n][k] = res;
return res;
}
// nCk modを求める
const ll MAX = 5100000;
// この値は求める二項計数の値に応じて変える
// MAX=3*10^7のとき1900msほど、ほぼ比例
// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)
long long fac[MAX], finv[MAX], inv[MAX];
void cominit() {
// テーブルを作る前処理
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long commod(ll n, ll k) { // 二項係数計算
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long pmod(ll n, ll k) { // 順列計算
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % mod;
}
long long hmod(ll n, ll k) { // nHk計算
// n個の区別しないoを区別するk個の箱に入れる方法の総数
//(n+k-1)C(k-1)と等しい
return commod(n + k - 1, n);
}
#pragma endregion
template <class T> // WarshallFloyd
void warshall(vector<vector<T>> &v) {
ll n = v.size();
rep(i, n) rep(j, n) rep(k, n) {
if (v[j][i] == dekai || v[i][k] == dekai)
continue;
v[j][k] = min(v[j][k], v[j][i] + v[i][k]);
}
return;
}
template <class T = long long> struct edge {
T len;
int from;
int to;
bool operator<(const edge a) const {
if (len != a.len)
return len < a.len;
if (from != a.from)
return from < a.from;
return to < a.to;
}
bool operator>(const edge a) const {
if (len != a.len)
return len > a.len;
if (from != a.from)
return from > a.from;
return to > a.to;
}
};
template <class T = long long> struct graph { // 0-indexed
vector<vector<edge<T>>> edges;
bool directed, weight;
int ver;
// constructor
graph(int vertex, bool direction = 0, bool weigh = 0) : edges(vertex) {
ver = vertex;
directed = direction;
weight = weigh;
edges.resize(vertex);
}
// 辺の追加 (0-indexed)
void update(int from, int to, T len = 1, bool direction = 1) {
edge<T> e;
e.len = len;
e.from = from;
e.to = to;
edges[from].push_back(e);
if (!direction) {
swap(e.to, e.from);
edges[to].push_back(e);
}
}
// 入力受取 (1-indexed)
void input(int edge_num, int index = 1) {
for (int i = 0; i < edge_num; i++) {
int a;
int b;
cin >> a >> b;
a -= index;
b -= index;
T c;
if (weight)
cin >> c;
else
c = 1;
update(a, b, c, directed);
}
}
// 辺の長さを全て1とみたときの単一始点最短経路 (無理なときはdekai)
vector<long long> bfs(int start) {
// https://atcoder.jp/contests/abc007/submissions/me
vector<long long> ret(ver, dekai);
queue<int> q;
q.push(start);
ret[start] = 0;
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto &e : edges[now]) {
if (ret[e.to] != dekai)
continue;
q.push(e.to);
ret[e.to] = ret[now] + 1;
}
}
return ret;
}
// 長さが負のpathがないときの単一始点最短経路<vll> O((ver)log(ver)+(edge))
vector<T> dijkstra(int start) {
vector<T> ret(ver, (T)dekai);
pqup<pair<T, int>> p; //{dist,place}
p.push({0, start});
ret[start] = 0;
while (!p.empty()) {
T dist = p.top().first;
int place = p.top().second;
p.pop();
if (ret[place] < dist)
continue;
for (auto &next : edges[place]) {
int nextplace = next.to;
T dis = next.len;
if (chmin(ret[nextplace], dist + dis)) {
p.push({ret[nextplace], nextplace});
}
}
}
return ret;
}
// 単一始点最短経路 O((ver)*(edge))
// 辿り着けないとき ret[i] = dekai;
// ある頂点までのコストが無限に小さくなり得るとき→ ret[i] = -dekai;
vector<T> BellmanFord(int start) {
// https://onlinejudge.u-aizu.ac.jp/problems/GRL_1_B
vector<T> ret(ver, dekai);
ret[start] = 0;
rep(loop, ver - 1) {
rep(v, ver) {
if (ret[v] == dekai)
continue;
for (auto &e : edges[v]) {
chmin(ret[e.to], ret[v] + e.len);
}
}
}
// 無限降下点の検索
queue<int> q;
vector<bool> chk(ver, 0);
rep(v, ver) {
if (ret[v] == dekai)
continue;
for (auto &e : edges[v]) {
if (chmin(ret[e.to], ret[v] + e.len)) {
if (!chk[e.to]) {
q.push(e.to);
chk[e.to] = 1;
}
}
}
}
while (!q.empty()) {
int now = q.front();
q.pop();
for (auto &e : edges[now]) {
if (!chk[e.to]) {
chk[e.to] = 1;
q.push(e.to);
}
}
}
rep(i, ver) if (chk[i]) ret[i] = -dekai;
return ret;
}
// 閉路に含まれない頂点列挙
// 要素数がver未満なら閉路が存在、そうでなければ閉路は存在しない
vector<int> topo_sort() {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_A
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_4_B
assert(directed);
vector<int> num_input(ver);
// 入次数
for (int i = 0; i < ver; i++) {
for (auto e : edges[i]) {
num_input[e.to]++;
}
}
// 入次数が0のノードをqueueで管理する
queue<int> que;
for (int i = 0; i < ver; i++) {
if (num_input[i] == 0) {
que.push(i);
}
}
vector<int> ans;
while (!que.empty()) {
auto node = que.front();
que.pop();
ans.push_back(node);
// 頂点の削除
for (auto e : edges[node]) {
num_input[e.to]--;
// 行き先の入次数が0になったらqueueに追加
if (num_input[e.to] == 0) {
que.push(e.to);
}
}
}
return ans;
}
//{{端点、端点},直径の大きさ}
pair<pair<int, int>, T> DiameterOfTree() {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_5_A
vector<T> vec;
weight ? vec = dijkstra(0) : bfs(0);
int v1 = -1;
T dia = -1;
rep(i, ver) if (chmax(dia, vec[i])) v1 = i;
dia = -1;
int v2 = -1;
weight ? vec = dijkstra(v1) : bfs(v1);
rep(i, ver) if (chmax(dia, vec[i])) v2 = i;
pair<pair<int, int>, T> ans = {{v1, v2}, dia};
return ans;
}
// 無向木構造を根から葉に伸びる有向木構造に書き換える
graph<T> RootToLeaf(int root) { // 0-indexed
graph<T> ret(ver, 1, weight);
vb chk(ver, 0);
chk[root] = 1;
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (chk[e.to] == 1)
continue;
chk[e.to] = 1;
ret.update(now, e.to, e.len, 1);
dfs(e.to);
}
};
dfs(root);
return ret;
}
// 無向木構造を葉から根に伸びる有向木構造に書き換える
graph<T> LeafToRoot(int root) { // 0-indexed
graph<T> ret(ver, 1, weight);
vb chk(ver, 0);
chk[root] = 1;
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (chk[e.to] == 1)
continue;
chk[e.to] = 1;
ret.update(e.to, now, e.len, 1);
dfs(e.to);
}
};
dfs(root);
ret.update(root, root, 0);
return ret;
}
// LeafToRootのvector版.par[i]=iの親の頂点
vector<int> par(int root) { // 0-indexed
vector<int> ret(ver, -1);
ret[root] = root; // rootの親はroot
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (ret[e.to] != -1)
continue;
ret[e.to] = now;
dfs(e.to);
}
};
dfs(root);
return ret;
}
vector<edge<T>> ParentAndDistance(int root) { // 0-indexed
V<edge<T>> ret(ver);
rep(i, ver) ret[i].to = -1;
ret[root].to = root; // rootの親はroot
ret[root].len = 0; // rootの親との距離は0
function<void(int)> dfs = [&](int now) {
for (auto &e : edges[now]) {
if (ret[e.to].to != -1)
continue;
ret[e.to].to = now;
ret[e.to].len = e.len;
dfs(e.to);
}
};
dfs(root);
return ret;
}
// 隣接sheet.主にwarshall用
vector<vector<T>> GraphArray(void) {
vector<vector<T>> ret(ver, V<T>(ver, dekai));
rep(from, ver) {
for (auto &e : edges[from]) {
ret[from][e.to] = e.len;
}
ret[from][from] = 0;
}
return ret;
}
graph<T> Prim(int start = 0) {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_2_A
graph<T> ret(ver, 0, 1);
pqup<edge<T>> p;
for (auto &e : edges[start]) {
p.push(e);
}
vector<bool> chk(ver, 0);
chk[start] = 1;
while (!p.empty()) {
auto ed = p.top();
p.pop();
if (chk[ed.to])
continue;
chk[ed.to] = 1;
ret.update(ed.from, ed.to, ed.len);
for (auto &e : edges[ed.to]) {
p.push(e);
}
}
return ret;
}
// 各頂点を根としたときの木の高さ
vector<T> height(int start = 0) {
// https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_5_B
vector<T> fir(ver, -1), sec(ver, -1);
function<T(int, int)> dfs = [&](int now, int par) {
T f = 0, s = 0; // startを根としたときのnowからの深さ1番目、2番目
for (auto &e : edges[now]) {
if (e.to == par)
continue;
chmax(s, dfs(e.to, now) + e.len);
if (f < s)
swap(f, s);
}
sec[now] = s;
return fir[now] = f;
};
dfs(start, -1);
function<void(int, int, T, T, T)> sol = [&](int now, int par, T parf,
T pars, T parlen) {
if (fir[now] + parlen == parf)
parf = pars;
chmax(sec[now], parf + parlen);
if (fir[now] < sec[now])
swap(fir[now], sec[now]);
for (auto &e : edges[now]) {
if (e.to == par)
continue;
sol(e.to, now, fir[now], sec[now], e.len);
}
return;
};
sol(start, -1, -1, -1, -1);
return fir;
}
// lowest common ancestor
// max-flow -> 別ファイル
// 強連結成分分解
// HL分解
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
if (n == 1) {
cout << "First" << endl;
return 0;
}
graph<> g(n);
g.input(n - 1);
// debug(n);
auto v = g.bfs(0);
ll dist = 0;
ll ver = -1;
rep(i, n) {
if (chmax(dist, v[i]))
ver = i;
}
v = g.bfs(ver);
rep(i, n) chmax(dist, v[i]);
string s;
if (dist % 3 == 1)
s = "Second";
else
s = "First";
cout << s << endl;
}
| insert | 656 | 656 | 656 | 661 | -11 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) \
do { \
x = max(x, y); \
} while (0)
#define chmin(x, y) \
do { \
x = min(x, y); \
} while (0)
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) \
for (ll i = static_cast<ll>(a); i < static_cast<ll>(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__) // NOLINT
template <typename T>
using reversed_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
ll N;
vector<ll> edges[300000];
// 頂点 cur から最も遠い点に対して {vへの距離、v} を調べる
PLL f(ll cur, ll par = -1, ll d = 0) {
if (edges[cur].size() == 1 && edges[cur][0] == par)
return {d, cur};
PLL res(-1, -1);
for (auto nxt : edges[cur]) {
if (nxt == par)
continue;
chmax(res, f(nxt, cur, d + 1));
}
return res;
}
signed main() {
cin >> N;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
ll u, r, _, __;
tie(_, u) = f(0);
tie(r, __) = f(u);
cout << (r % 3 != 1 ? "First" : "Second") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) \
do { \
x = max(x, y); \
} while (0)
#define chmin(x, y) \
do { \
x = min(x, y); \
} while (0)
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) \
for (ll i = static_cast<ll>(a); i < static_cast<ll>(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__) // NOLINT
template <typename T>
using reversed_priority_queue =
std::priority_queue<T, std::vector<T>, std::greater<T>>;
ll N;
vector<ll> edges[300000];
// 頂点 cur から最も遠い点に対して {vへの距離、v} を調べる
PLL f(ll cur, ll par = -1, ll d = 0) {
if (edges[cur].size() == 1 && edges[cur][0] == par)
return {d, cur};
PLL res(-1, -1);
for (auto nxt : edges[cur]) {
if (nxt == par)
continue;
chmax(res, f(nxt, cur, d + 1));
}
return res;
}
signed main() {
cin >> N;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back(b);
edges[b].push_back(a);
}
if (N == 1) {
cout << "First" << endl;
return 0;
}
ll u, r, _, __;
tie(_, u) = f(0);
tie(r, __) = f(u);
cout << (r % 3 != 1 ? "First" : "Second") << endl;
return 0;
}
| insert | 48 | 48 | 48 | 52 | 0 | |
p03055 | C++ | Runtime Error | // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
const usize f, l;
public:
class itr {
friend rep;
usize i;
constexpr itr(const usize x) noexcept : i(x) {}
public:
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr rep(const usize first, const usize last) noexcept
: f(first), l(last) {}
constexpr itr begin() const noexcept { return itr(f); }
constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
const usize f, l;
public:
class itr {
friend revrep;
usize i;
constexpr itr(usize x) noexcept : i(x) {}
public:
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
constexpr itr begin() const noexcept { return itr(l); }
constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
return a < b ? b - a : a - b;
}
} // namespace n91
#include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
namespace n91 {
bool solve() {
usize n;
std::cin >> n;
auto g = md_vec(n, 0, static_cast<usize>(0));
for (const auto i : rep(1, n)) {
usize a, b;
std::cin >> a >> b;
--a;
--b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
std::vector<usize> dist(n, 0);
const auto dfs = [&](const auto &dfs, const usize v, const usize p) -> void {
for (const auto e : g[v]) {
if (e != p) {
dist[e] = dist[v] + 1;
dfs(dfs, e, v);
}
}
};
dfs(dfs, 0, n);
const auto itr = std::max_element(dist.begin(), dist.end());
*itr = 0;
dfs(dfs, itr - dist.begin(), n);
const usize diam = *std::max_element(dist.cbegin(), dist.cend());
if (diam % 3 == 2) {
assert(false);
}
return diam % 3 == 2;
}
void main_() { std::cout << (solve() ? "First" : "Second") << std::endl; }
} // namespace n91
int main() {
n91::main_();
return 0;
}
| // #define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
const usize f, l;
public:
class itr {
friend rep;
usize i;
constexpr itr(const usize x) noexcept : i(x) {}
public:
void operator++() noexcept { ++i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr rep(const usize first, const usize last) noexcept
: f(first), l(last) {}
constexpr itr begin() const noexcept { return itr(f); }
constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
const usize f, l;
public:
class itr {
friend revrep;
usize i;
constexpr itr(usize x) noexcept : i(x) {}
public:
void operator++() noexcept { --i; }
constexpr usize operator*() const noexcept { return i; }
constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
};
constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
constexpr itr begin() const noexcept { return itr(l); }
constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
return a < b ? b - a : a - b;
}
} // namespace n91
#include <algorithm>
#include <cassert>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
namespace n91 {
bool solve() {
usize n;
std::cin >> n;
auto g = md_vec(n, 0, static_cast<usize>(0));
for (const auto i : rep(1, n)) {
usize a, b;
std::cin >> a >> b;
--a;
--b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
std::vector<usize> dist(n, 0);
const auto dfs = [&](const auto &dfs, const usize v, const usize p) -> void {
for (const auto e : g[v]) {
if (e != p) {
dist[e] = dist[v] + 1;
dfs(dfs, e, v);
}
}
};
dfs(dfs, 0, n);
const auto itr = std::max_element(dist.begin(), dist.end());
*itr = 0;
dfs(dfs, itr - dist.begin(), n);
const usize diam = *std::max_element(dist.cbegin(), dist.cend());
return diam % 3 == 2 || diam % 3 == 0;
}
void main_() { std::cout << (solve() ? "First" : "Second") << std::endl; }
} // namespace n91
int main() {
n91::main_();
return 0;
}
| replace | 100 | 104 | 100 | 101 | -6 | 45661ea8-9fcf-4d85-9b8c-a2b03fd7fa3a.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03055/C++/s496035584.cpp:102: bool n91::solve(): Assertion `false' failed.
|
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<set<ll>> E(n);
for (ll i = 0; i < n - 1; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
E[a].insert(b);
E[b].insert(a);
}
vector<ll> d1(n, -1);
vector<ll> d2(n, -1);
queue<ll> q;
q.push(0);
d1[0] = 0;
while (q.size()) {
ll f = q.front();
q.pop();
for (ll t : E[f]) {
if (d1[t] < 0) {
d1[t] = d1[f] + 1;
q.push(t);
}
}
}
ll mx = 0, mi;
for (ll i = 0; i < n; i++) {
if (d1[i] > mx) {
mx = d1[i];
mi = i;
}
}
d2[mi] = 0;
q.push(mi);
while (q.size()) {
ll f = q.front();
q.pop();
for (ll t : E[f]) {
if (d2[t] < 0) {
d2[t] = d2[f] + 1;
q.push(t);
}
}
}
mx = 0;
for (ll i = 0; i < n; i++) {
mx = max(mx, d2[i]);
}
if (mx % 3 == 1) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<set<ll>> E(n);
for (ll i = 0; i < n - 1; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
E[a].insert(b);
E[b].insert(a);
}
vector<ll> d1(n, -1);
vector<ll> d2(n, -1);
queue<ll> q;
q.push(0);
d1[0] = 0;
while (q.size()) {
ll f = q.front();
q.pop();
for (ll t : E[f]) {
if (d1[t] < 0) {
d1[t] = d1[f] + 1;
q.push(t);
}
}
}
ll mx = 0, mi = 0;
for (ll i = 0; i < n; i++) {
if (d1[i] > mx) {
mx = d1[i];
mi = i;
}
}
d2[mi] = 0;
q.push(mi);
while (q.size()) {
ll f = q.front();
q.pop();
for (ll t : E[f]) {
if (d2[t] < 0) {
d2[t] = d2[f] + 1;
q.push(t);
}
}
}
mx = 0;
for (ll i = 0; i < n; i++) {
mx = max(mx, d2[i]);
}
if (mx % 3 == 1) {
cout << "Second" << endl;
} else {
cout << "First" << endl;
}
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
int dist = 0;
vector<int> v(n);
function<int(int, int)> dfs = [&](int v, int p) {
int res = 0;
vector<int> ds;
for (auto to : g[v]) {
if (to == p)
continue;
ds.push_back(dfs(to, v) + 1);
}
sort(rbegin(ds), rend(ds));
if (!ds.empty()) {
res = ds[0];
dist = max(dist, ds[0]);
}
if (ds.size() >= 2u) {
dist = max(dist, ds[0] + ds[1]);
}
if (ds.size())
dist = max(dist, res);
return res;
};
dfs(0, -1);
vector<int> dp(n + 1, -1);
function<int(int)> solve = [&](int x) {
int &res = dp[x];
if (x == 0)
return res = 1;
if (x == 1)
return res = 0;
if (res != -1)
return res;
return res = !solve(x - 1) || !solve(x - 2);
};
if (solve(dist) == 1) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
int dist = 0;
vector<int> v(n);
function<int(int, int)> dfs = [&](int v, int p) {
int res = 0;
vector<int> ds;
for (auto to : g[v]) {
if (to == p)
continue;
ds.push_back(dfs(to, v) + 1);
}
sort(rbegin(ds), rend(ds));
if (!ds.empty()) {
res = ds[0];
dist = max(dist, ds[0]);
}
if (ds.size() >= 2u) {
dist = max(dist, ds[0] + ds[1]);
}
if (ds.size())
dist = max(dist, res);
return res;
};
dfs(0, -1);
vector<int> dp(n + 1, -1);
function<int(int)> solve = [&](int x) {
int &res = dp[x];
if (x == 0)
return res = 1;
if (x == 1)
return res = 0;
if (res != -1)
return res;
return res = !solve(x - 1) || !solve(x - 2);
};
if (solve(dist) == 1) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N = 1e5 + 5;
vector<ll> adj[N];
ll node, dist;
void dfs(ll src, ll pr, ll d) {
if (d >= dist) {
node = src;
dist = d;
}
for (auto &v : adj[src])
if (v != pr)
dfs(v, src, d + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
for (ll i = 0, u, v; i < n - 1; i++)
cin >> u >> v, adj[u].push_back(v), adj[v].push_back(u);
dfs(1, 1, 0);
dist = 0;
dfs(node, node, 0);
if (dist % 3 == 1)
cout << "Second";
else
cout << "First";
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N = 2e5 + 5;
vector<ll> adj[N];
ll node, dist;
void dfs(ll src, ll pr, ll d) {
if (d >= dist) {
node = src;
dist = d;
}
for (auto &v : adj[src])
if (v != pr)
dfs(v, src, d + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
for (ll i = 0, u, v; i < n - 1; i++)
cin >> u >> v, adj[u].push_back(v), adj[v].push_back(u);
dfs(1, 1, 0);
dist = 0;
dfs(node, node, 0);
if (dist % 3 == 1)
cout << "Second";
else
cout << "First";
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x, -1, sizeof(x))
#define zero(x) memset(x, 0, sizeof(x))
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define si(x) int(x.size())
#define inf INT_MAX / 2 - 100
#define infl LLONG_MAX / 3
#ifdef LOCAL
#define dmp(x) cerr << __LINE__ << ' ' << #x << ' ' << x << endl
#else
#define dmp(x) void(0)
#endif
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vector<vector<t>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vc<int>;
using vl = vc<ll>;
ll readl(void) {
ll x;
cin >> x;
return x;
}
int readi(void) {
int x;
cin >> x;
return x;
}
string readstr() {
string s;
cin >> s;
return s;
}
vi readvi(int n, int off = 0) {
vi v(n);
rep(i, n) v[i] = readi(), v[i] += off;
return v;
}
vl readvl(int n, int off = 0) {
vl v(n);
rep(i, n) v[i] = readl(), v[i] += off;
return v;
}
template <class t> void print(t x, int suc = 1) {
cout << x;
if (suc == 1)
cout << "\n";
if (suc == 2)
cout << " ";
}
template <class t> void print(const vc<t> &v, int suc = 1) {
rep(i, si(v)) print(v[i], i == int(si(v)) - 1 ? 1 : suc);
}
template <class t> bool inc(t a, t b, t c) { return !(c < b || b < a); }
template <class t> void compress(vc<t> &v) {
sort(all(v));
v.erase(unique(all(v)), v.ed);
}
template <class t> int lwb(const vc<t> &v, const t &a) {
return lower_bound(all(v), a) - v.bg;
}
template <class t> struct Compress {
vc<t> v;
Compress() = default;
Compress(const vc<t> &x) { add(x); }
Compress(const initializer_list<vc<t>> &x) {
for (auto &p : x)
add(p);
}
void add(const t &x) { v.eb(x); }
void add(const vc<t> &x) { copy(all(x), back_inserter(v)); }
void build() { compress(v); }
int get(const t &x) const { return lwb(v, x); }
vc<t> get(const vc<t> &x) const {
vc<t> res(x);
for (auto &p : res)
p = get(p);
return res;
}
const t &operator[](int x) const { return v[x]; }
};
void Yes(bool ex = true) {
cout << "Yes\n";
if (ex)
exit(0);
}
void YES(bool ex = true) {
cout << "YES\n";
if (ex)
exit(0);
}
void No(bool ex = true) {
cout << "No\n";
if (ex)
exit(0);
}
void NO(bool ex = true) {
cout << "NO\n";
if (ex)
exit(0);
}
void orYes(bool x, bool ex = true) {
if (x)
Yes(ex);
else
No(ex);
}
void orYES(bool x, bool ex = true) {
if (x)
YES(ex);
else
NO(ex);
}
void Possible(bool ex = true) {
cout << "Possible\n";
if (ex)
exit(0);
}
void POSSIBLE(bool ex = true) {
cout << "POSSIBLE\n";
if (ex)
exit(0);
}
void Impossible(bool ex = true) {
cout << "Impossible\n";
if (ex)
exit(0);
}
void IMPOSSIBLE(bool ex = true) {
cout << "IMPOSSIBLE\n";
if (ex)
exit(0);
}
void orPossible(bool x, bool ex = true) {
if (x)
Possible(ex);
else
Impossible(ex);
}
void orPOSSIBLE(bool x, bool ex = true) {
if (x)
POSSIBLE(ex);
else
IMPOSSIBLE(ex);
}
using uint = unsigned;
using ull = unsigned long long;
template <uint const &MOD> struct Modular {
static constexpr uint const &mod = MOD;
uint v;
Modular(long long x = 0) { c(x % mod + mod); }
Modular &c(uint x) {
v = x < mod ? x : x - mod;
return *this;
}
Modular pow(int k) const {
Modular res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
Modular inv() const { return pow(mod - 2); }
Modular operator-() const { return Modular(mod - v); }
Modular &operator+=(const Modular &x) { return c(v + x.v); }
Modular &operator-=(const Modular &x) { return c(v + mod - x.v); }
Modular &operator*=(const Modular &x) {
v = ull(v) * x.v % mod;
return *this;
}
Modular &operator/=(const Modular &x) { return *this *= x.inv(); }
Modular operator+(const Modular &x) const { return Modular(*this) += x; }
Modular operator-(const Modular &x) const { return Modular(*this) -= x; }
Modular operator*(const Modular &x) const { return Modular(*this) *= x; }
Modular operator/(const Modular &x) const { return Modular(*this) /= x; }
friend Modular operator+(long long x, const Modular &y) {
return Modular(x) + y;
}
friend Modular operator-(long long x, const Modular &y) {
return Modular(x) - y;
}
friend Modular operator*(long long x, const Modular &y) {
return Modular(x) * y;
}
friend Modular operator/(long long x, const Modular &y) {
return Modular(x) / y;
}
friend ostream &operator<<(ostream &os, const Modular &x) {
return os << x.v;
}
friend istream &operator>>(istream &is, Modular &x) {
long long p;
is >> p;
x = Modular(p);
return is;
}
bool operator==(const Modular &x) const { return v == x.v; }
bool operator!=(const Modular &x) const { return v != x.v; }
bool operator<(const Modular &x) const { return v < x.v; }
explicit operator bool() const { return v; }
};
vi g[100005];
int d[100005];
void dfs(int v, int p, int x) {
d[v] = x;
for (auto &i : g[v]) {
if (i != p) {
dfs(i, v, x + 1);
}
}
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
g[--a].pb(--b);
g[b].pb(a);
}
dfs(0, -1, 0);
pi ma = mp(0, 0);
rep(i, n) { chmax(ma, mp(d[i], i)); }
dfs(ma.S, -1, 0);
ma = mp(0, ma.S);
rep(i, n) { chmax(ma, mp(d[i], i)); }
if ((ma.F + 1) % 3 == 2)
print("Second");
else
print("First");
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x, -1, sizeof(x))
#define zero(x) memset(x, 0, sizeof(x))
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define si(x) int(x.size())
#define inf INT_MAX / 2 - 100
#define infl LLONG_MAX / 3
#ifdef LOCAL
#define dmp(x) cerr << __LINE__ << ' ' << #x << ' ' << x << endl
#else
#define dmp(x) void(0)
#endif
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vector<vector<t>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vc<int>;
using vl = vc<ll>;
ll readl(void) {
ll x;
cin >> x;
return x;
}
int readi(void) {
int x;
cin >> x;
return x;
}
string readstr() {
string s;
cin >> s;
return s;
}
vi readvi(int n, int off = 0) {
vi v(n);
rep(i, n) v[i] = readi(), v[i] += off;
return v;
}
vl readvl(int n, int off = 0) {
vl v(n);
rep(i, n) v[i] = readl(), v[i] += off;
return v;
}
template <class t> void print(t x, int suc = 1) {
cout << x;
if (suc == 1)
cout << "\n";
if (suc == 2)
cout << " ";
}
template <class t> void print(const vc<t> &v, int suc = 1) {
rep(i, si(v)) print(v[i], i == int(si(v)) - 1 ? 1 : suc);
}
template <class t> bool inc(t a, t b, t c) { return !(c < b || b < a); }
template <class t> void compress(vc<t> &v) {
sort(all(v));
v.erase(unique(all(v)), v.ed);
}
template <class t> int lwb(const vc<t> &v, const t &a) {
return lower_bound(all(v), a) - v.bg;
}
template <class t> struct Compress {
vc<t> v;
Compress() = default;
Compress(const vc<t> &x) { add(x); }
Compress(const initializer_list<vc<t>> &x) {
for (auto &p : x)
add(p);
}
void add(const t &x) { v.eb(x); }
void add(const vc<t> &x) { copy(all(x), back_inserter(v)); }
void build() { compress(v); }
int get(const t &x) const { return lwb(v, x); }
vc<t> get(const vc<t> &x) const {
vc<t> res(x);
for (auto &p : res)
p = get(p);
return res;
}
const t &operator[](int x) const { return v[x]; }
};
void Yes(bool ex = true) {
cout << "Yes\n";
if (ex)
exit(0);
}
void YES(bool ex = true) {
cout << "YES\n";
if (ex)
exit(0);
}
void No(bool ex = true) {
cout << "No\n";
if (ex)
exit(0);
}
void NO(bool ex = true) {
cout << "NO\n";
if (ex)
exit(0);
}
void orYes(bool x, bool ex = true) {
if (x)
Yes(ex);
else
No(ex);
}
void orYES(bool x, bool ex = true) {
if (x)
YES(ex);
else
NO(ex);
}
void Possible(bool ex = true) {
cout << "Possible\n";
if (ex)
exit(0);
}
void POSSIBLE(bool ex = true) {
cout << "POSSIBLE\n";
if (ex)
exit(0);
}
void Impossible(bool ex = true) {
cout << "Impossible\n";
if (ex)
exit(0);
}
void IMPOSSIBLE(bool ex = true) {
cout << "IMPOSSIBLE\n";
if (ex)
exit(0);
}
void orPossible(bool x, bool ex = true) {
if (x)
Possible(ex);
else
Impossible(ex);
}
void orPOSSIBLE(bool x, bool ex = true) {
if (x)
POSSIBLE(ex);
else
IMPOSSIBLE(ex);
}
using uint = unsigned;
using ull = unsigned long long;
template <uint const &MOD> struct Modular {
static constexpr uint const &mod = MOD;
uint v;
Modular(long long x = 0) { c(x % mod + mod); }
Modular &c(uint x) {
v = x < mod ? x : x - mod;
return *this;
}
Modular pow(int k) const {
Modular res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
Modular inv() const { return pow(mod - 2); }
Modular operator-() const { return Modular(mod - v); }
Modular &operator+=(const Modular &x) { return c(v + x.v); }
Modular &operator-=(const Modular &x) { return c(v + mod - x.v); }
Modular &operator*=(const Modular &x) {
v = ull(v) * x.v % mod;
return *this;
}
Modular &operator/=(const Modular &x) { return *this *= x.inv(); }
Modular operator+(const Modular &x) const { return Modular(*this) += x; }
Modular operator-(const Modular &x) const { return Modular(*this) -= x; }
Modular operator*(const Modular &x) const { return Modular(*this) *= x; }
Modular operator/(const Modular &x) const { return Modular(*this) /= x; }
friend Modular operator+(long long x, const Modular &y) {
return Modular(x) + y;
}
friend Modular operator-(long long x, const Modular &y) {
return Modular(x) - y;
}
friend Modular operator*(long long x, const Modular &y) {
return Modular(x) * y;
}
friend Modular operator/(long long x, const Modular &y) {
return Modular(x) / y;
}
friend ostream &operator<<(ostream &os, const Modular &x) {
return os << x.v;
}
friend istream &operator>>(istream &is, Modular &x) {
long long p;
is >> p;
x = Modular(p);
return is;
}
bool operator==(const Modular &x) const { return v == x.v; }
bool operator!=(const Modular &x) const { return v != x.v; }
bool operator<(const Modular &x) const { return v < x.v; }
explicit operator bool() const { return v; }
};
vi g[200005];
int d[200005];
void dfs(int v, int p, int x) {
d[v] = x;
for (auto &i : g[v]) {
if (i != p) {
dfs(i, v, x + 1);
}
}
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
g[--a].pb(--b);
g[b].pb(a);
}
dfs(0, -1, 0);
pi ma = mp(0, 0);
rep(i, n) { chmax(ma, mp(d[i], i)); }
dfs(ma.S, -1, 0);
ma = mp(0, ma.S);
rep(i, n) { chmax(ma, mp(d[i], i)); }
if ((ma.F + 1) % 3 == 2)
print("Second");
else
print("First");
}
| replace | 246 | 248 | 246 | 248 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, x, y, ne[N], fi[N], zz[N], ans, tot, Maxsd[N], sd[N];
void jb(int x, int y) {
ne[++tot] = fi[x];
fi[x] = tot;
zz[tot] = y;
}
void dfs(int x, int y, int z) {
Maxsd[x] = sd[x] = z;
for (int i = fi[x]; i; i = ne[i])
if (zz[i] != y) {
dfs(zz[i], x, z + 1);
ans = max(ans, Maxsd[x] + Maxsd[zz[i]] - 2 * sd[x]);
Maxsd[x] = max(Maxsd[x], Maxsd[zz[i]]);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d%d", &x, &y);
jb(x, y);
jb(y, x);
}
dfs(1, 0, 0);
if (ans % 3 == 1)
puts("Second");
else
puts("First");
} | #include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int n, x, y, ne[N], fi[N], zz[N], ans, tot, Maxsd[N], sd[N];
void jb(int x, int y) {
ne[++tot] = fi[x];
fi[x] = tot;
zz[tot] = y;
}
void dfs(int x, int y, int z) {
Maxsd[x] = sd[x] = z;
for (int i = fi[x]; i; i = ne[i])
if (zz[i] != y) {
dfs(zz[i], x, z + 1);
ans = max(ans, Maxsd[x] + Maxsd[zz[i]] - 2 * sd[x]);
Maxsd[x] = max(Maxsd[x], Maxsd[zz[i]]);
}
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d%d", &x, &y);
jb(x, y);
jb(y, x);
}
dfs(1, 0, 0);
if (ans % 3 == 1)
puts("Second");
else
puts("First");
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03055 | C++ | Runtime Error | /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
// #include <bits/stdc++.h>
// #include <numeric>
// #include <iomanip>
// #include <cmath>
// #include <bitset>
// #include <fstream>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<vi> vii;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460LL;
const int Big = 336860180;
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) \
cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) \
cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' \
<< (z) << endl;
#define debug4(x, y, z, t) \
cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' \
<< (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) \
cout << #x << " -> " \
<< "(" << (x).ff << ", " << (x).ss << ")" << endl;
#define debuga(x, n) \
cout << #x << " -> "; \
fori(i1_da, n) { cout << (x)[i1_da] << ' '; } \
cout << endl
#define debugap(x, n) \
cout << #x << " ->\n"; \
fori(i1_dap, n) { \
cout << "(" << (x)[i1_dap].ff << ", " << (x)[i1_dap].ss << ")" << endl; \
} \
cout << endl
#define debugaa(x, n, m) \
cout << #x << " ->\n"; \
fori(i1_daa, n) { \
fori(i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugav(x, n) \
cout << #x << " ->\n"; \
fori(i1_dav, n) { \
fori(i2_dav, (x)[i1_da].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugia(x, n) \
cout << #x << " ->\n"; \
fori(i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } \
cout << endl
#define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for (ll i = (n)-1; i >= (e); --i)
#define fori(i, n) forifrom(i, 0, n)
#define forir(i, n) forirto(i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
// -----------------------------------------------------------------------
const ll maxn = 100010;
ll n;
vi g[maxn];
ll maxh[maxn];
ll diam = 0;
void dfs(ll x, ll par) {
vi hs;
for (auto y : g[x]) {
if (y == par)
continue;
dfs(y, x);
hs.pb(maxh[y] + 1);
smax(maxh[x], maxh[y] + 1);
}
if (hs.size() >= 1) {
auto it = max_element(all(hs));
ll a = *it;
hs.erase(it);
smax(diam, a);
if (hs.size() >= 1) {
it = max_element(all(hs));
ll b = *it;
smax(diam, a + b);
}
}
}
void MAIN() {
cin >> n;
fori(i, n - 1) {
ll a, b;
cin >> a >> b;
--a, --b;
g[a].pb(b);
g[b].pb(a);
}
dfs(0, 0);
cout << (diam % 3 == 1 ? "Second" : "First") << '\n';
}
// -----------------------------------------------------------------------
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(10);
sss << R"(
6
1 2
2 3
2 4
4 6
5 6
)";
MAIN();
return 0;
}
| /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
// #include <bits/stdc++.h>
// #include <numeric>
// #include <iomanip>
// #include <cmath>
// #include <bitset>
// #include <fstream>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<vi> vii;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460LL;
const int Big = 336860180;
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) \
cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) \
cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' \
<< (z) << endl;
#define debug4(x, y, z, t) \
cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' \
<< (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) \
cout << #x << " -> " \
<< "(" << (x).ff << ", " << (x).ss << ")" << endl;
#define debuga(x, n) \
cout << #x << " -> "; \
fori(i1_da, n) { cout << (x)[i1_da] << ' '; } \
cout << endl
#define debugap(x, n) \
cout << #x << " ->\n"; \
fori(i1_dap, n) { \
cout << "(" << (x)[i1_dap].ff << ", " << (x)[i1_dap].ss << ")" << endl; \
} \
cout << endl
#define debugaa(x, n, m) \
cout << #x << " ->\n"; \
fori(i1_daa, n) { \
fori(i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugav(x, n) \
cout << #x << " ->\n"; \
fori(i1_dav, n) { \
fori(i2_dav, (x)[i1_da].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } \
cout << '\n'; \
} \
cout << endl
#define debugia(x, n) \
cout << #x << " ->\n"; \
fori(i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } \
cout << endl
#define forifrom(i, s, n) for (ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for (ll i = (n)-1; i >= (e); --i)
#define fori(i, n) forifrom(i, 0, n)
#define forir(i, n) forirto(i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
// -----------------------------------------------------------------------
const ll maxn = 200010;
ll n;
vi g[maxn];
ll maxh[maxn];
ll diam = 0;
void dfs(ll x, ll par) {
vi hs;
for (auto y : g[x]) {
if (y == par)
continue;
dfs(y, x);
hs.pb(maxh[y] + 1);
smax(maxh[x], maxh[y] + 1);
}
if (hs.size() >= 1) {
auto it = max_element(all(hs));
ll a = *it;
hs.erase(it);
smax(diam, a);
if (hs.size() >= 1) {
it = max_element(all(hs));
ll b = *it;
smax(diam, a + b);
}
}
}
void MAIN() {
cin >> n;
fori(i, n - 1) {
ll a, b;
cin >> a >> b;
--a, --b;
g[a].pb(b);
g[b].pb(a);
}
dfs(0, 0);
cout << (diam % 3 == 1 ? "Second" : "First") << '\n';
}
// -----------------------------------------------------------------------
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(10);
sss << R"(
6
1 2
2 3
2 4
4 6
5 6
)";
MAIN();
return 0;
}
| replace | 107 | 108 | 107 | 108 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int n;
vector<int> g[100100];
int dist[100100];
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, n) dist[i] = INF;
dist[0] = 0;
queue<int> que;
que.push(0);
int vfar = 0, dfar = 0;
while (que.size()) {
int v = que.front();
que.pop();
if (chmax(dfar, dist[v]))
vfar = v;
rep(i, g[v].size()) {
if (dist[g[v].at(i)] > dist[v] + 1) {
dist[g[v].at(i)] = dist[v] + 1;
que.push(g[v].at(i));
}
}
}
rep(i, n) dist[i] = INF;
dist[vfar] = 0;
queue<int> que2;
que2.push(vfar);
dfar = 0;
while (que2.size()) {
int v = que2.front();
que2.pop();
chmax(dfar, dist[v]);
rep(i, g[v].size()) {
if (dist[g[v].at(i)] > dist[v] + 1) {
dist[g[v].at(i)] = dist[v] + 1;
que2.push(g[v].at(i));
}
}
}
cout << (dfar % 3 != 1 ? "First" : "Second") << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
#define endl '\n'
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int n;
vector<int> g[200100];
int dist[200100];
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, n) dist[i] = INF;
dist[0] = 0;
queue<int> que;
que.push(0);
int vfar = 0, dfar = 0;
while (que.size()) {
int v = que.front();
que.pop();
if (chmax(dfar, dist[v]))
vfar = v;
rep(i, g[v].size()) {
if (dist[g[v].at(i)] > dist[v] + 1) {
dist[g[v].at(i)] = dist[v] + 1;
que.push(g[v].at(i));
}
}
}
rep(i, n) dist[i] = INF;
dist[vfar] = 0;
queue<int> que2;
que2.push(vfar);
dfar = 0;
while (que2.size()) {
int v = que2.front();
que2.pop();
chmax(dfar, dist[v]);
rep(i, g[v].size()) {
if (dist[g[v].at(i)] > dist[v] + 1) {
dist[g[v].at(i)] = dist[v] + 1;
que2.push(g[v].at(i));
}
}
}
cout << (dfar % 3 != 1 ? "First" : "Second") << endl;
} | replace | 28 | 30 | 28 | 30 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define CLR(t, v) memset(t, (v), sizeof(t))
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << "(" << a.first << "," << a.second << ")";
}
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << (*i) << " ";
cout << endl;
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int nextInt() {
int x;
scanf("%d", &x);
return x;
}
ll nextLong() {
ll x;
scanf("%lld", &x);
return x;
}
const int MAX_N = 112345;
vector<int> g[MAX_N];
bool grundy[MAX_N];
pair<int, int> dfs(int cur, int prev) {
pair<int, int> res = {0, cur};
for (int nxt : g[cur])
if (nxt != prev) {
auto p = dfs(nxt, cur);
p.first++;
if (res.first < p.first) {
res = p;
}
}
return res;
}
int main2() {
REP(i, MAX_N) g[i].clear();
int N = nextInt();
REP(i, N - 1) {
int a = nextInt() - 1;
int b = nextInt() - 1;
g[a].push_back(b);
g[b].push_back(a);
}
auto p1 = dfs(0, -1);
auto p2 = dfs(p1.second, -1);
if (grundy[p2.first + 1]) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
return 0;
}
int main() {
grundy[0] = 0;
grundy[1] = 1;
grundy[2] = 0;
for (int i = 3; i < MAX_N; i++) {
grundy[i] = (grundy[i - 1] == 0 || grundy[i - 2] == 0) ? 1 : 0;
}
#ifdef LOCAL
for (; !cin.eof(); cin >> ws)
#endif
main2();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)
#define ALL(v) (v).begin(), (v).end()
#define CLR(t, v) memset(t, (v), sizeof(t))
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << "(" << a.first << "," << a.second << ")";
}
template <class T> void pv(T a, T b) {
for (T i = a; i != b; ++i)
cout << (*i) << " ";
cout << endl;
}
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
int nextInt() {
int x;
scanf("%d", &x);
return x;
}
ll nextLong() {
ll x;
scanf("%lld", &x);
return x;
}
const int MAX_N = 212345;
vector<int> g[MAX_N];
bool grundy[MAX_N];
pair<int, int> dfs(int cur, int prev) {
pair<int, int> res = {0, cur};
for (int nxt : g[cur])
if (nxt != prev) {
auto p = dfs(nxt, cur);
p.first++;
if (res.first < p.first) {
res = p;
}
}
return res;
}
int main2() {
REP(i, MAX_N) g[i].clear();
int N = nextInt();
REP(i, N - 1) {
int a = nextInt() - 1;
int b = nextInt() - 1;
g[a].push_back(b);
g[b].push_back(a);
}
auto p1 = dfs(0, -1);
auto p2 = dfs(p1.second, -1);
if (grundy[p2.first + 1]) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
return 0;
}
int main() {
grundy[0] = 0;
grundy[1] = 1;
grundy[2] = 0;
for (int i = 3; i < MAX_N; i++) {
grundy[i] = (grundy[i - 1] == 0 || grundy[i - 2] == 0) ? 1 : 0;
}
#ifdef LOCAL
for (; !cin.eof(); cin >> ws)
#endif
main2();
return 0;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p03055 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N;
cin >> N;
Graph graph(N);
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<P> queue1;
queue1.push({0, 0});
vector<bool> visited(N, false);
vector<ll> dist(N, 0);
visited[0] = true;
while (!queue1.empty()) {
P p = queue1.front();
queue1.pop();
dist[p.first] = p.second;
for (ll v : graph[p.first]) {
if (!visited[v]) {
visited[v] = true;
queue1.push({v, p.second + 1});
}
}
}
ll max_v = -1;
ll max_dist = -1;
rep2(i, 1, N) {
if (dist[i] > max_dist) {
max_dist = dist[i];
max_v = i;
}
}
queue<P> queue2;
queue2.push({max_v, 0});
visited.assign(N, false);
dist.assign(N, 0);
visited[max_v] = true;
while (!queue2.empty()) {
P p = queue2.front();
queue2.pop();
dist[p.first] = p.second;
for (ll v : graph[p.first]) {
if (!visited[v]) {
visited[v] = true;
queue2.push({v, p.second + 1});
}
}
}
ll max_v2 = -1;
ll max_dist2 = -1;
rep(i, N) {
if (max_v == i)
continue;
if (dist[i] > max_dist2) {
max_dist2 = dist[i];
max_v2 = i;
}
}
if (max_dist2 % 3 == 1) {
cout << "Second" << '\n';
} else {
cout << "First" << '\n';
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void Main() {
ll N;
cin >> N;
Graph graph(N);
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
if (N == 1) {
cout << "First" << '\n';
return;
}
queue<P> queue1;
queue1.push({0, 0});
vector<bool> visited(N, false);
vector<ll> dist(N, 0);
visited[0] = true;
while (!queue1.empty()) {
P p = queue1.front();
queue1.pop();
dist[p.first] = p.second;
for (ll v : graph[p.first]) {
if (!visited[v]) {
visited[v] = true;
queue1.push({v, p.second + 1});
}
}
}
ll max_v = -1;
ll max_dist = -1;
rep2(i, 1, N) {
if (dist[i] > max_dist) {
max_dist = dist[i];
max_v = i;
}
}
queue<P> queue2;
queue2.push({max_v, 0});
visited.assign(N, false);
dist.assign(N, 0);
visited[max_v] = true;
while (!queue2.empty()) {
P p = queue2.front();
queue2.pop();
dist[p.first] = p.second;
for (ll v : graph[p.first]) {
if (!visited[v]) {
visited[v] = true;
queue2.push({v, p.second + 1});
}
}
}
ll max_v2 = -1;
ll max_dist2 = -1;
rep(i, N) {
if (max_v == i)
continue;
if (dist[i] > max_dist2) {
max_dist2 = dist[i];
max_v2 = i;
}
}
if (max_dist2 % 3 == 1) {
cout << "Second" << '\n';
} else {
cout << "First" << '\n';
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| insert | 37 | 37 | 37 | 41 | 0 | |
p03055 | C++ | Runtime Error | // Hacheylight
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define SC(t, x) static_cast<t>(x)
#define ub upper_bound
#define lb lower_bound
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define y1 y1_
#define Pi acos(-1.0)
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 100010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void add(T &a, T b) { a = (1ll * a + b) % MOD; }
template <class T> void mul(T &a, T b) { a = (ll)a * b % MOD; }
template <class T> T read() {
int f = 1;
T x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
// pair <从端点开始的顶点的个数, 端点>
vi g[N];
int n;
pii dfs(int x, int fat) {
pii ans = mp(0, x);
for (int to : g[x]) {
if (to == fat)
continue;
chmax(ans, dfs(to, x));
}
ans.fi++;
return ans;
}
signed main() {
scanf("%d", &n);
rep(i, 1, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
g[a].pb(b);
g[b].pb(a);
}
int dia = dfs(dfs(1, -1).se, -1).fi;
puts((dia % 3 != 2) ? "First" : "Second");
return 0;
}
/*
写代码时请注意：
1.ll？数组大小，边界？数据范围？
2.精度？
3.特判？
4.至少做一些
思考提醒：
1.最大值最小->二分？
2.可以贪心么？不行dp可以么
3.可以优化么
4.维护区间用什么数据结构？
5.统计方案是用dp？模了么？
6.逆向思维？
*/
| // Hacheylight
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define SC(t, x) static_cast<t>(x)
#define ub upper_bound
#define lb lower_bound
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define y1 y1_
#define Pi acos(-1.0)
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 200010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void add(T &a, T b) { a = (1ll * a + b) % MOD; }
template <class T> void mul(T &a, T b) { a = (ll)a * b % MOD; }
template <class T> T read() {
int f = 1;
T x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
// pair <从端点开始的顶点的个数, 端点>
vi g[N];
int n;
pii dfs(int x, int fat) {
pii ans = mp(0, x);
for (int to : g[x]) {
if (to == fat)
continue;
chmax(ans, dfs(to, x));
}
ans.fi++;
return ans;
}
signed main() {
scanf("%d", &n);
rep(i, 1, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
g[a].pb(b);
g[b].pb(a);
}
int dia = dfs(dfs(1, -1).se, -1).fi;
puts((dia % 3 != 2) ? "First" : "Second");
return 0;
}
/*
写代码时请注意：
1.ll？数组大小，边界？数据范围？
2.精度？
3.特判？
4.至少做一些
思考提醒：
1.最大值最小->二分？
2.可以贪心么？不行dp可以么
3.可以优化么
4.维护区间用什么数据结构？
5.统计方案是用dp？模了么？
6.逆向思维？
*/
| replace | 57 | 58 | 57 | 58 | 0 | |
p03056 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define N 200
int n, m, ans, f[N][N][N], g[N][N][N];
char s[N][N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
for (int l = n; l; --l) {
for (int r = l; r <= n; ++r) {
for (int h = m; h; --h) {
if (l == r || (s[l][h] == s[l + 1][h] && f[l + 1][r][h] > h)) {
if (h + 1 <= m && s[l][h] == s[l][h + 1]) {
f[l][r][h] = f[l][r][h + 1];
} else {
f[l][r][h] = h + 1;
}
} else {
f[l][r][h] = h;
}
}
}
}
while (f[1][n][1] <= m) {
for (int l = n; l; --l) {
for (int r = l; r <= n; ++r) {
for (int h = m; h; --h) {
g[l][r][h] = f[l][r][h] <= m ? f[l][r][f[l][r][h]] : m;
if (l < r) {
int mn = l, mx = r - 1;
while (mn <= mx) {
int mid = (mn + mx) >> 1;
g[l][r][h] = max(g[l][r][h], min(f[l][mid][h], f[mid + 1][r][h]));
if (f[l][mid][h] > f[mid + 1][r][h])
mn = mid + 1;
else
mx = mid - 1;
}
}
}
}
}
memcpy(f, g, sizeof f);
++ans;
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define N 200
int n, m, ans, f[N][N][N], g[N][N][N];
char s[N][N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
for (int l = n; l; --l) {
for (int r = l; r <= n; ++r) {
for (int h = m; h; --h) {
if (l == r || (s[l][h] == s[l + 1][h] && f[l + 1][r][h] > h)) {
if (h + 1 <= m && s[l][h] == s[l][h + 1]) {
f[l][r][h] = f[l][r][h + 1];
} else {
f[l][r][h] = h + 1;
}
} else {
f[l][r][h] = h;
}
}
}
}
while (f[1][n][1] < m) {
for (int l = n; l; --l) {
for (int r = l; r <= n; ++r) {
for (int h = m; h; --h) {
g[l][r][h] = f[l][r][h] <= m ? f[l][r][f[l][r][h]] : m;
if (l < r) {
int mn = l, mx = r - 1;
while (mn <= mx) {
int mid = (mn + mx) >> 1;
g[l][r][h] = max(g[l][r][h], min(f[l][mid][h], f[mid + 1][r][h]));
if (f[l][mid][h] > f[mid + 1][r][h])
mn = mid + 1;
else
mx = mid - 1;
}
}
}
}
}
memcpy(f, g, sizeof f);
++ans;
}
printf("%d\n", ans);
return 0;
}
| replace | 29 | 30 | 29 | 30 | TLE | |
p03056 | C++ | Memory Limit Exceeded | // 第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
// ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
// 今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define N 190
#define M 20
int dp[N][N][N][M];
int sum[N][N];
string ma[N];
int h, W;
int num(int lx, int hx, int ly, int hy) {
return sum[hx][hy] - sum[hx][ly] - sum[lx][hy] + sum[lx][ly];
}
int cal(int x, int y, int z, int w) {
if (dp[x][y][z][w] >= 0)
return dp[x][y][z][w];
if (w == 0) {
int lo = z, hi = W;
if (x == 0 && y == 3 && z == 0 && w == 0) {
// cout<<lo<<hi<<endl;
}
while (hi > lo) {
int mi = (hi + lo + 1) / 2;
if (num(x, y, z, mi) == 0 || num(x, y, z, mi) == (y - x) * (mi - z))
lo = mi;
else
hi = mi - 1;
}
// cout<<x<<' '<<y<<' '<<z<<' '<<w<<' '<<lo<<endl;
return dp[x][y][z][w] = lo;
}
int ret = cal(x, y, cal(x, y, z, w - 1), w - 1), lo = x + 1, hi = y - 1;
if (hi >= lo) {
while (hi > lo) {
int mi = (hi + lo + 1) / 2;
if (cal(x, mi, z, w - 1) < cal(mi, y, z, w - 1))
hi = mi - 1;
else
lo = mi;
}
ret = max(ret, min(cal(x, lo, z, w - 1), cal(lo, y, z, w - 1)));
if (lo < y - 1)
ret = max(ret, min(cal(x, lo + 1, z, w - 1), cal(lo + 1, y, z, w - 1)));
}
// cout<<x<<' '<<y<<' '<<z<<' '<<w<<' '<<ret<<endl;
return dp[x][y][z][w] = ret;
}
int main() {
cin >> h >> W;
rep(i, h) cin >> ma[i];
memset(sum, 0, sizeof(sum));
rep(i, h) rep(j, W) {
sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j];
if (ma[i][j] == '#')
sum[i + 1][j + 1]++;
}
memset(dp, -1, sizeof(dp));
// cout<<cal(0,3,0,1)<<endl;
// cout<<cal(1,3,1,0)<<endl;
rep(i, M) {
if (cal(0, h, 0, i) >= W) {
cout << i << endl;
return 0;
}
}
}
| // 第8回シンデレラガール総選挙は是非本田未央ちゃんに投票をお願いします！
// ファンのことも他のアイドルの子たちのことも本当に大事にしてて、今まで周りに色んなものを与えてくれました。
// 今度は私たちが未央ちゃんにお返しをする番です。みんなでガラスの靴を履かせてあげましょう！
// #本田未央を一番星に #本田未央を令和のシンデレラガールに
// #第8回シンデレラガール総選挙
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begin(), s.end()
#define rAll(s) s.rbegin(), s.rend()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define N 190
#define M 20
short dp[N][N][N][M];
int sum[N][N];
string ma[N];
int h, W;
int num(int lx, int hx, int ly, int hy) {
return sum[hx][hy] - sum[hx][ly] - sum[lx][hy] + sum[lx][ly];
}
int cal(int x, int y, int z, int w) {
if (dp[x][y][z][w] >= 0)
return dp[x][y][z][w];
if (w == 0) {
int lo = z, hi = W;
if (x == 0 && y == 3 && z == 0 && w == 0) {
// cout<<lo<<hi<<endl;
}
while (hi > lo) {
int mi = (hi + lo + 1) / 2;
if (num(x, y, z, mi) == 0 || num(x, y, z, mi) == (y - x) * (mi - z))
lo = mi;
else
hi = mi - 1;
}
// cout<<x<<' '<<y<<' '<<z<<' '<<w<<' '<<lo<<endl;
return dp[x][y][z][w] = lo;
}
int ret = cal(x, y, cal(x, y, z, w - 1), w - 1), lo = x + 1, hi = y - 1;
if (hi >= lo) {
while (hi > lo) {
int mi = (hi + lo + 1) / 2;
if (cal(x, mi, z, w - 1) < cal(mi, y, z, w - 1))
hi = mi - 1;
else
lo = mi;
}
ret = max(ret, min(cal(x, lo, z, w - 1), cal(lo, y, z, w - 1)));
if (lo < y - 1)
ret = max(ret, min(cal(x, lo + 1, z, w - 1), cal(lo + 1, y, z, w - 1)));
}
// cout<<x<<' '<<y<<' '<<z<<' '<<w<<' '<<ret<<endl;
return dp[x][y][z][w] = ret;
}
int main() {
cin >> h >> W;
rep(i, h) cin >> ma[i];
memset(sum, 0, sizeof(sum));
rep(i, h) rep(j, W) {
sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j];
if (ma[i][j] == '#')
sum[i + 1][j + 1]++;
}
memset(dp, -1, sizeof(dp));
// cout<<cal(0,3,0,1)<<endl;
// cout<<cal(1,3,1,0)<<endl;
rep(i, M) {
if (cal(0, h, 0, i) >= W) {
cout << i << endl;
return 0;
}
}
}
| replace | 40 | 41 | 40 | 41 | MLE | |
p03056 | C++ | Runtime Error | /*
Author: QAQAutomaton
Lang: C++
Code: D.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define all(x) x.begin(), x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> cp;
typedef pair<int, int> pii;
int inf;
const double eps = 1e-8;
const double pi = acos(-1.0);
template <class T> int chkmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <class T> int chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <class T> T sqr(T a) { return a * a; }
template <class T, class T2> T mmin(T a, T2 b) { return a < b ? a : b; }
template <class T, class T2> T mmax(T a, T2 b) { return a > b ? a : b; }
template <class T> T aabs(T a) { return a < 0 ? -a : a; }
template <class T> int dcmp(T a, T b) { return a > b; }
template <int *a> int cmp_a(int x, int y) { return a[x] < a[y]; }
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__ {
__INIT__() { memset(&inf, 0x3f, sizeof(inf)); }
} __INIT___;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
// getchar
#define gc() \
(iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), \
(iS == iT ? EOF : *iS++)) \
: *iS++)
// print the remaining part
inline void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
// putchar
inline void putc(char x) {
*oS++ = x;
if (oS == oT)
flush();
}
template <typename A> inline bool read(A &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())
if (c == '-')
f = -1;
else if (c == EOF)
return 0;
for (x = 0; c <= '9' && c >= '0'; c = gc())
x = x * 10 + (c & 15);
x *= f;
return 1;
}
inline bool read(char &x) {
while ((x = gc()) == ' ' || x == '\n' || x == '\r')
;
return x != EOF;
}
inline bool read(char *x) {
while ((*x = gc()) == '\n' || *x == ' ' || *x == '\r')
;
if (*x == EOF)
return 0;
while (!(*x == '\n' || *x == ' ' || *x == '\r' || *x == EOF))
*(++x) = gc();
*x = 0;
return 1;
}
template <typename A, typename... B> inline bool read(A &x, B &...y) {
return read(x) && read(y...);
}
template <typename A> inline bool write(A x) {
if (!x)
putc('0');
if (x < 0)
putc('-'), x = -x;
while (x)
qu[++qr] = x % 10 + '0', x /= 10;
while (qr)
putc(qu[qr--]);
return 0;
}
inline bool write(char x) {
putc(x);
return 0;
}
inline bool write(const char *x) {
while (*x) {
putc(*x);
++x;
}
return 0;
}
inline bool write(char *x) {
while (*x) {
putc(*x);
++x;
}
return 0;
}
template <typename A, typename... B> inline bool write(A x, B... y) {
return write(x) || write(y...);
}
// no need to call flush at the end manually!
struct Flusher_ {
~Flusher_() { flush(); }
} io_flusher_;
} // namespace io
using io ::putc;
using io ::read;
using io ::write;
unsigned char f[200000005];
int n, m, s1, s2;
int x[205][205], y[205][205];
int s[205][205];
char str[205];
unsigned char w = -1, I = 1;
int dp(int xl, int xr, int yl, int yr) {
unsigned char &cal = f[x[xl][xr] + y[yl][yr]];
if (cal ^ w)
return cal;
int w = s[xr][yr] - s[xl - 1][yr] - s[xr][yl - 1] + s[xl - 1][yl - 1];
// write(xl,' ',xr,' ',yl,' ',yr,' ',w,'\n');
if (!w || w == (xr - xl + 1) * (yr - yl + 1))
return cal = 0;
if (xl != xr) {
int l = xl, r = xr - 1, mid;
while (l <= r) {
mid = (l + r) >> 1;
unsigned char f1 = dp(xl, mid, yl, yr), f2 = dp(mid + 1, xr, yl, yr);
chkmin(cal, (unsigned char)(max(f1, f2) + 1));
if (f1 > f2)
r = mid - 1;
else if (f1 < f2)
l = mid + 1;
else
break;
}
}
if (yl != yr) {
int l = yl, r = yr - 1, mid;
while (l <= r) {
mid = (l + r) >> 1;
unsigned char f1 = dp(xl, xr, yl, mid), f2 = dp(xl, xr, mid + 1, yr);
chkmin(cal, (unsigned char)(max(f1, f2) + 1));
if (f1 > f2)
r = mid - 1;
else if (f1 < f2)
l = mid + 1;
else
break;
}
}
return cal;
}
signed main() {
#ifdef QAQAutoMaton
freopen("D.in", "r", stdin);
freopen("D.out", "w", stdout);
#endif
read(n, m);
for (int i = 1; i <= m; ++i)
for (int j = i; j <= m; ++j) {
y[i][j] = s2;
++s2;
}
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j) {
x[i][j] = s1;
s1 += s2;
}
for (int i = 0; i < s1; ++i)
f[i] = w;
for (int i = 1; i <= n; ++i) {
read(str + 1);
for (int j = 1; j <= m; ++j) {
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (str[j] == '#');
}
}
write(dp(1, n, 1, m), '\n');
return 0;
}
| /*
Author: QAQAutomaton
Lang: C++
Code: D.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define all(x) x.begin(), x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> cp;
typedef pair<int, int> pii;
int inf;
const double eps = 1e-8;
const double pi = acos(-1.0);
template <class T> int chkmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <class T> int chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <class T> T sqr(T a) { return a * a; }
template <class T, class T2> T mmin(T a, T2 b) { return a < b ? a : b; }
template <class T, class T2> T mmax(T a, T2 b) { return a > b ? a : b; }
template <class T> T aabs(T a) { return a < 0 ? -a : a; }
template <class T> int dcmp(T a, T b) { return a > b; }
template <int *a> int cmp_a(int x, int y) { return a[x] < a[y]; }
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__ {
__INIT__() { memset(&inf, 0x3f, sizeof(inf)); }
} __INIT___;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
// getchar
#define gc() \
(iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), \
(iS == iT ? EOF : *iS++)) \
: *iS++)
// print the remaining part
inline void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
// putchar
inline void putc(char x) {
*oS++ = x;
if (oS == oT)
flush();
}
template <typename A> inline bool read(A &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())
if (c == '-')
f = -1;
else if (c == EOF)
return 0;
for (x = 0; c <= '9' && c >= '0'; c = gc())
x = x * 10 + (c & 15);
x *= f;
return 1;
}
inline bool read(char &x) {
while ((x = gc()) == ' ' || x == '\n' || x == '\r')
;
return x != EOF;
}
inline bool read(char *x) {
while ((*x = gc()) == '\n' || *x == ' ' || *x == '\r')
;
if (*x == EOF)
return 0;
while (!(*x == '\n' || *x == ' ' || *x == '\r' || *x == EOF))
*(++x) = gc();
*x = 0;
return 1;
}
template <typename A, typename... B> inline bool read(A &x, B &...y) {
return read(x) && read(y...);
}
template <typename A> inline bool write(A x) {
if (!x)
putc('0');
if (x < 0)
putc('-'), x = -x;
while (x)
qu[++qr] = x % 10 + '0', x /= 10;
while (qr)
putc(qu[qr--]);
return 0;
}
inline bool write(char x) {
putc(x);
return 0;
}
inline bool write(const char *x) {
while (*x) {
putc(*x);
++x;
}
return 0;
}
inline bool write(char *x) {
while (*x) {
putc(*x);
++x;
}
return 0;
}
template <typename A, typename... B> inline bool write(A x, B... y) {
return write(x) || write(y...);
}
// no need to call flush at the end manually!
struct Flusher_ {
~Flusher_() { flush(); }
} io_flusher_;
} // namespace io
using io ::putc;
using io ::read;
using io ::write;
unsigned char f[300000005];
int n, m, s1, s2;
int x[205][205], y[205][205];
int s[205][205];
char str[205];
unsigned char w = -1, I = 1;
int dp(int xl, int xr, int yl, int yr) {
unsigned char &cal = f[x[xl][xr] + y[yl][yr]];
if (cal ^ w)
return cal;
int w = s[xr][yr] - s[xl - 1][yr] - s[xr][yl - 1] + s[xl - 1][yl - 1];
// write(xl,' ',xr,' ',yl,' ',yr,' ',w,'\n');
if (!w || w == (xr - xl + 1) * (yr - yl + 1))
return cal = 0;
if (xl != xr) {
int l = xl, r = xr - 1, mid;
while (l <= r) {
mid = (l + r) >> 1;
unsigned char f1 = dp(xl, mid, yl, yr), f2 = dp(mid + 1, xr, yl, yr);
chkmin(cal, (unsigned char)(max(f1, f2) + 1));
if (f1 > f2)
r = mid - 1;
else if (f1 < f2)
l = mid + 1;
else
break;
}
}
if (yl != yr) {
int l = yl, r = yr - 1, mid;
while (l <= r) {
mid = (l + r) >> 1;
unsigned char f1 = dp(xl, xr, yl, mid), f2 = dp(xl, xr, mid + 1, yr);
chkmin(cal, (unsigned char)(max(f1, f2) + 1));
if (f1 > f2)
r = mid - 1;
else if (f1 < f2)
l = mid + 1;
else
break;
}
}
return cal;
}
signed main() {
#ifdef QAQAutoMaton
freopen("D.in", "r", stdin);
freopen("D.out", "w", stdout);
#endif
read(n, m);
for (int i = 1; i <= m; ++i)
for (int j = i; j <= m; ++j) {
y[i][j] = s2;
++s2;
}
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j) {
x[i][j] = s1;
s1 += s2;
}
for (int i = 0; i < s1; ++i)
f[i] = w;
for (int i = 1; i <= n; ++i) {
read(str + 1);
for (int j = 1; j <= m; ++j) {
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (str[j] == '#');
}
}
write(dp(1, n, 1, m), '\n');
return 0;
}
| replace | 126 | 127 | 126 | 127 | -11 | |
p03056 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int h, w;
char g[190][190];
int dp[190][190][190][18], lim, pre[190][190];
int query(int l, int r, int d, int u) {
return pre[u][r] - pre[d - 1][r] - pre[u][l - 1] + pre[d - 1][l - 1];
}
int dfs(int i, int l, int r, int k) {
int &res = dp[i][l][r][k];
if (res != -1)
return res;
int aa = query(l, r, i, h);
if (aa == 0 || aa == (r - l + 1) * (h - i + 1))
return res = 0;
res = max(res, dfs(dfs(i, l, r, k - 1) + 1, l, r, k - 1));
int dl = l, dr = r - 1;
while (dl < dr) {
int mid = (dl + dr) >> 1;
if (dfs(i, l, mid, k) < dfs(i, mid + 1, r, k))
l = mid + 1;
else
r = mid;
}
res = max(res, min(dp[i][l][dl][k], dp[i][dl + 1][r][k]));
if (dl != l)
res = max(res, min(dp[i][l][dl - 1][k], dp[i][dl][r][k]));
return res;
}
int logg(int x) {
int res = 0;
while (x)
res++, x >>= 1;
return res;
}
int main() {
freopen("data.in", "r", stdin);
freopen("ans1.out", "w", stdout);
scanf("%d%d", &h, &w);
rep(i, 1, h) scanf("%s", g[i] + 1);
lim = logg(h - 1) + logg(w - 1);
rep(i, 1, h) rep(j, 1, w) rep(k, 1, h) rep(m, 0, lim) dp[i][j][k][m] = -1;
rep(i, 1, h) rep(j, 1, w) pre[i][j] =
pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + (g[i][j] == '#');
per(i, h, 1) rep(k, 0, lim) rep(len, 1, w) rep(l, 1, w) {
int r = l + len - 1;
if (r > w)
break;
int &res = dp[i][l][r][k];
// if(res!=-1) continue;
res = i - 1;
int dl = i, dr = h;
while (dl < dr) {
int mid = (dl + dr + 1) >> 1;
int x = query(l, r, i, mid);
if ((x == 0) || (x == (r - l + 1) * (mid - i + 1)))
dl = mid;
else
dr = mid - 1;
}
int x = query(l, r, i, i);
if (!(x == 0 || x == r - l + 1))
dl = i - 1;
res = dl;
if (k) {
// printf("%d %d %d %d is going\n",i,l,r,k);
int nxt = dp[i][l][r][k - 1] + 1;
if (nxt > h)
res = h;
else
res = max(res, dp[nxt][l][r][k - 1]);
// rap(w,l,r) printf("%d %d\n",dp[i][l][w][k-1],dp[i][w+1][r][k-1]);
int dl = l, dr = r - 1;
while (dl < dr) {
int mid = (dl + dr) >> 1;
if (dp[i][l][mid][k - 1] > dp[i][mid + 1][r][k - 1])
dl = mid + 1;
else
dr = mid;
}
// printf("%d\n",dl);
if (dl > l)
res = max(res, min(dp[i][l][dl - 1][k - 1], dp[i][dl][r][k - 1]));
if (dl < r)
res = max(res, min(dp[i][l][dl + 1][k - 1], dp[i][dl + 2][r][k - 1]));
res = max(res, min(dp[i][l][dl][k - 1], dp[i][dl + 1][r][k - 1]));
// printf("! %d %d",dp[i][l][dl][k-1],dp[i][dl+1][r][k-1]);
// if(dl>l) printf(" %d %d",dp[i][l][dl-1][k-1],dp[i][dl][r][k-1]);
// putchar('\n');
}
}
rep(i, 0, lim) if (dp[1][1][w][i] == h) {
printf("%d\n", i);
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int, int>::iterator
#define sit set<int>::iterator
#define itrm(g, x) for (mit g = x.begin(); g != x.end(); g++)
#define itrs(g, x) for (sit g = x.begin(); g != x.end(); g++)
#define ltype int
#define rep(i, j, k) for (ltype(i) = (j); (i) <= (k); (i)++)
#define rap(i, j, k) for (ltype(i) = (j); (i) < (k); (i)++)
#define per(i, j, k) for (ltype(i) = (j); (i) >= (k); (i)--)
#define pii pair<int, int>
#define fi first
#define se second
#define mpr make_pair
#define pb push_back
#define fastio ios::sync_with_stdio(false)
const int inf = 0x3f3f3f3f, mod = 1000000007;
const double pi = 3.1415926535897932, eps = 1e-6;
int h, w;
char g[190][190];
int dp[190][190][190][18], lim, pre[190][190];
int query(int l, int r, int d, int u) {
return pre[u][r] - pre[d - 1][r] - pre[u][l - 1] + pre[d - 1][l - 1];
}
int dfs(int i, int l, int r, int k) {
int &res = dp[i][l][r][k];
if (res != -1)
return res;
int aa = query(l, r, i, h);
if (aa == 0 || aa == (r - l + 1) * (h - i + 1))
return res = 0;
res = max(res, dfs(dfs(i, l, r, k - 1) + 1, l, r, k - 1));
int dl = l, dr = r - 1;
while (dl < dr) {
int mid = (dl + dr) >> 1;
if (dfs(i, l, mid, k) < dfs(i, mid + 1, r, k))
l = mid + 1;
else
r = mid;
}
res = max(res, min(dp[i][l][dl][k], dp[i][dl + 1][r][k]));
if (dl != l)
res = max(res, min(dp[i][l][dl - 1][k], dp[i][dl][r][k]));
return res;
}
int logg(int x) {
int res = 0;
while (x)
res++, x >>= 1;
return res;
}
int main() {
// freopen("data.in","r",stdin);
// freopen("ans1.out","w",stdout);
scanf("%d%d", &h, &w);
rep(i, 1, h) scanf("%s", g[i] + 1);
lim = logg(h - 1) + logg(w - 1);
rep(i, 1, h) rep(j, 1, w) rep(k, 1, h) rep(m, 0, lim) dp[i][j][k][m] = -1;
rep(i, 1, h) rep(j, 1, w) pre[i][j] =
pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + (g[i][j] == '#');
per(i, h, 1) rep(k, 0, lim) rep(len, 1, w) rep(l, 1, w) {
int r = l + len - 1;
if (r > w)
break;
int &res = dp[i][l][r][k];
// if(res!=-1) continue;
res = i - 1;
int dl = i, dr = h;
while (dl < dr) {
int mid = (dl + dr + 1) >> 1;
int x = query(l, r, i, mid);
if ((x == 0) || (x == (r - l + 1) * (mid - i + 1)))
dl = mid;
else
dr = mid - 1;
}
int x = query(l, r, i, i);
if (!(x == 0 || x == r - l + 1))
dl = i - 1;
res = dl;
if (k) {
// printf("%d %d %d %d is going\n",i,l,r,k);
int nxt = dp[i][l][r][k - 1] + 1;
if (nxt > h)
res = h;
else
res = max(res, dp[nxt][l][r][k - 1]);
// rap(w,l,r) printf("%d %d\n",dp[i][l][w][k-1],dp[i][w+1][r][k-1]);
int dl = l, dr = r - 1;
while (dl < dr) {
int mid = (dl + dr) >> 1;
if (dp[i][l][mid][k - 1] > dp[i][mid + 1][r][k - 1])
dl = mid + 1;
else
dr = mid;
}
// printf("%d\n",dl);
if (dl > l)
res = max(res, min(dp[i][l][dl - 1][k - 1], dp[i][dl][r][k - 1]));
if (dl < r)
res = max(res, min(dp[i][l][dl + 1][k - 1], dp[i][dl + 2][r][k - 1]));
res = max(res, min(dp[i][l][dl][k - 1], dp[i][dl + 1][r][k - 1]));
// printf("! %d %d",dp[i][l][dl][k-1],dp[i][dl+1][r][k-1]);
// if(dl>l) printf(" %d %d",dp[i][l][dl-1][k-1],dp[i][dl][r][k-1]);
// putchar('\n');
}
}
rep(i, 0, lim) if (dp[1][1][w][i] == h) {
printf("%d\n", i);
return 0;
}
return 0;
} | replace | 53 | 55 | 53 | 55 | TLE | |
p03056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 185 + 3;
int n, m;
int c[maxn][maxn];
int L[maxn][maxn];
int U[maxn][maxn];
int fl[maxn][maxn][maxn];
int fu[maxn][maxn][maxn];
int gl[maxn][maxn][maxn];
int gu[maxn][maxn][maxn];
char ch;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
scanf(" %c", &ch), c[i][j] = (ch == '#');
L[i][j] = (j == 1 ? 1 : (c[i][j - 1] == c[i][j] ? L[i][j - 1] + 1 : 1));
U[i][j] = (i == 1 ? 1 : (c[i - 1][j] == c[i][j] ? U[i - 1][j] + 1 : 1));
}
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x, Min = 666; xx <= n; ++xx) {
if (xx > x && c[xx][y] != c[xx - 1][y])
Min = 0;
fl[x][y][xx] = Min = std::min(Min, L[xx][y]);
}
for (int yy = y, Min = 666; yy <= m; ++yy) {
if (yy > y && c[x][yy] != c[x][yy - 1])
Min = 0;
fu[x][y][yy] = Min = std::min(Min, U[x][yy]);
}
}
for (int ans = 0; "Jumbo tql"; ++ans) {
if (fl[1][m][n] == m || fu[n][1][m] == n)
return printf("%d\n", ans), 0;
memcpy(gl, fl, sizeof(gl));
memcpy(gu, fu, sizeof(gu));
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x; xx <= n; ++xx)
fl[x][y][xx] += gl[x][y - gl[x][y][xx]][xx];
for (int yy = y; yy <= m; ++yy)
fu[x][y][yy] += gu[x - gu[x][y][yy]][y][yy];
}
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x; xx <= n; ++xx)
for (int yy = y - fl[x][y][xx] + 1; yy <= y; ++yy)
fu[xx][yy][y] = std::max(fu[xx][yy][y], xx - x + 1);
for (int yy = y; yy <= m; ++yy)
for (int xx = x - fu[x][y][yy] + 1; xx <= x; ++xx)
fl[xx][yy][x] = std::max(fl[xx][yy][x], yy - y + 1);
}
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 185 + 3;
int n, m;
int c[maxn][maxn];
int L[maxn][maxn];
int U[maxn][maxn];
int fl[maxn][maxn][maxn];
int fu[maxn][maxn][maxn];
int gl[maxn][maxn][maxn];
int gu[maxn][maxn][maxn];
char ch;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
scanf(" %c", &ch), c[i][j] = (ch == '#');
L[i][j] = (j == 1 ? 1 : (c[i][j - 1] == c[i][j] ? L[i][j - 1] + 1 : 1));
U[i][j] = (i == 1 ? 1 : (c[i - 1][j] == c[i][j] ? U[i - 1][j] + 1 : 1));
}
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x, Min = 666; xx <= n; ++xx) {
if (xx > x && c[xx][y] != c[xx - 1][y])
Min = 0;
fl[x][y][xx] = Min = std::min(Min, L[xx][y]);
}
for (int yy = y, Min = 666; yy <= m; ++yy) {
if (yy > y && c[x][yy] != c[x][yy - 1])
Min = 0;
fu[x][y][yy] = Min = std::min(Min, U[x][yy]);
}
}
for (int ans = 0; "Jumbo tql"; ++ans) {
if (fl[1][m][n] == m || fu[n][1][m] == n)
return printf("%d\n", ans), 0;
memcpy(gl, fl, sizeof(gl));
memcpy(gu, fu, sizeof(gu));
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x; xx <= n; ++xx)
fl[x][y][xx] += gl[x][y - gl[x][y][xx]][xx];
for (int yy = y; yy <= m; ++yy)
fu[x][y][yy] += gu[x - gu[x][y][yy]][y][yy];
}
for (int x = 1; x <= n; ++x)
for (int y = 1; y <= m; ++y) {
for (int xx = x, X = 1; xx <= n; ++xx, ++X)
for (int yy = y - fl[x][y][xx] + 1; yy <= y && fu[xx][yy][y] < X;
++yy)
fu[xx][yy][y] = X;
for (int yy = y, Y = 1; yy <= m; ++yy, ++Y)
for (int xx = x - fu[x][y][yy] + 1; xx <= x && fl[xx][yy][x] < Y;
++xx)
fl[xx][yy][x] = Y;
}
}
return 0;
}
| replace | 49 | 55 | 49 | 57 | TLE | |
p03056 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// #define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn], a[maxn][maxn], dp[maxn][maxn][maxn][20];
char ch[maxn][maxn];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
inline void write(int a) {
if (a < 0) {
putchar('-');
putchar('1');
} else {
if (a >= 10)
write(a / 10);
putchar(a % 10 + '0');
}
}
signed main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
scanf("%s", ch[i] + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
if (ch[i][j] == '.')
a[i][j] = 1;
else
a[i][j] = 0;
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
for (int shang = 1; shang <= n; ++shang)
for (int zuo = 1; zuo <= m; ++zuo)
for (int you = zuo; you <= m; ++you) {
int l = shang, r = n, xia = shang - 1;
while (l <= r) {
int mid = (l + r) >> 1;
int geshu = sum[mid][you] - sum[mid][zuo - 1] - sum[shang - 1][you] +
sum[shang - 1][zuo - 1];
if (!geshu || geshu == (mid - shang + 1) * (you - zuo + 1))
xia = mid, l = mid + 1;
else
r = mid - 1;
}
dp[shang][zuo][you][0] = xia;
// cout<<shang<<' '<<zuo<<' '<<you<<'
//'<<xia<<endl;
}
int k;
for (k = 1; dp[1][1][m][k - 1] < n; ++k)
for (int kuan = 1; kuan <= m; ++kuan)
for (int shang = 1; shang <= n; ++shang)
for (int zuo = 1, you = zuo + kuan - 1; you <= m; ++zuo, ++you) {
if (dp[shang][zuo][you][k - 1] == n) {
dp[shang][zuo][you][k] = n;
continue;
}
dp[shang][zuo][you][k] =
dp[dp[shang][zuo][you][k - 1] + 1][zuo][you][k - 1];
if (dp[shang][zuo][you][k] == n)
continue;
int l = zuo, r = you - 1, kotae = 0;
while (l <= r) {
int mid = (l + r) >> 1;
int x = dp[shang][zuo][mid][k - 1],
y = dp[shang][mid + 1][you][k - 1];
kotae = max(kotae, min(x, y));
if (x < y)
r = mid - 1;
else
l = mid + 1;
}
dp[shang][zuo][you][k] = max(dp[shang][zuo][you][k], kotae);
}
write(k - 1);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// #define int long long
#define lowbit(x) ((x) & (-x))
using namespace std;
const int maxn = 190;
int n, m, sum[maxn][maxn], a[maxn][maxn], dp[maxn][maxn][maxn][15];
char ch[maxn][maxn];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
inline void write(int a) {
if (a < 0) {
putchar('-');
putchar('1');
} else {
if (a >= 10)
write(a / 10);
putchar(a % 10 + '0');
}
}
signed main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
scanf("%s", ch[i] + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
if (ch[i][j] == '.')
a[i][j] = 1;
else
a[i][j] = 0;
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
for (int shang = 1; shang <= n; ++shang)
for (int zuo = 1; zuo <= m; ++zuo)
for (int you = zuo; you <= m; ++you) {
int l = shang, r = n, xia = shang - 1;
while (l <= r) {
int mid = (l + r) >> 1;
int geshu = sum[mid][you] - sum[mid][zuo - 1] - sum[shang - 1][you] +
sum[shang - 1][zuo - 1];
if (!geshu || geshu == (mid - shang + 1) * (you - zuo + 1))
xia = mid, l = mid + 1;
else
r = mid - 1;
}
dp[shang][zuo][you][0] = xia;
// cout<<shang<<' '<<zuo<<' '<<you<<'
//'<<xia<<endl;
}
int k;
for (k = 1; dp[1][1][m][k - 1] < n; ++k)
for (int kuan = 1; kuan <= m; ++kuan)
for (int shang = 1; shang <= n; ++shang)
for (int zuo = 1, you = zuo + kuan - 1; you <= m; ++zuo, ++you) {
if (dp[shang][zuo][you][k - 1] == n) {
dp[shang][zuo][you][k] = n;
continue;
}
dp[shang][zuo][you][k] =
dp[dp[shang][zuo][you][k - 1] + 1][zuo][you][k - 1];
if (dp[shang][zuo][you][k] == n)
continue;
int l = zuo, r = you - 1, kotae = 0;
while (l <= r) {
int mid = (l + r) >> 1;
int x = dp[shang][zuo][mid][k - 1],
y = dp[shang][mid + 1][you][k - 1];
kotae = max(kotae, min(x, y));
if (x < y)
r = mid - 1;
else
l = mid + 1;
}
dp[shang][zuo][you][k] = max(dp[shang][zuo][you][k], kotae);
}
write(k - 1);
return 0;
}
| replace | 15 | 16 | 15 | 16 | MLE | |
p03056 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int unsigned short
using namespace std;
#define gc getchar
inline int read() {
register int x = 0, f = 1;
char ch = gc();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = gc();
}
while (isdigit(ch)) {
x = (x << 3) + (x << 1) + ch - '0';
ch = gc();
}
return (f == 1) ? x : -x;
}
int n, m, a[188][188], sum[188][188];
inline bool ok(int _x1, int _y1, int _x2, int _y2) {
int xx = sum[_x2][_y2] - sum[_x2][_y1 - 1] - sum[_x1 - 1][_y2] +
sum[_x1 - 1][_y1 - 1];
return (xx == 0 || xx == (_x2 - _x1 + 1) * (_y2 - _y1 + 1));
}
int R[17][188][188][188], D[17][188][188][188];
inline void chkmax(int &a, const int &b) {
if (a < b)
a = b;
}
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char ch = gc();
while (ch != '.' && ch != '#')
ch = gc();
a[i][j] = (ch == '.' ? 0 : 1);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int las = -1;
for (int k = m; k; k--) {
if (ok(i, k, j, k)) {
if (las == -1 || !ok(i, k, j, las))
las = k;
} else
las = -1;
R[0][i][j][k] = las;
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
int las = -1;
for (int k = n; k; k--) {
if (ok(k, i, k, j)) {
if (las == -1 || !ok(k, i, las, j))
las = k;
} else
las = -1;
D[0][i][j][k] = las;
}
}
}
//
if (ok(1, 1, n, m)) {
puts("0");
return 0;
}
for (int as = 1;; as++) {
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
for (int k = 1; k <= m; k++) {
if (R[as - 1][i][j][k] == m)
R[as][i][j][k] = m;
else if (R[as - 1][i][j][k] == -1)
R[as][i][j][k] = -1;
R[as][i][j][k] =
max(R[as - 1][i][j][k], R[as - 1][i][j][R[as - 1][i][j][k] + 1]);
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
for (int k = 1; k <= n; k++) {
if (D[as - 1][i][j][k] == n)
D[as][i][j][k] = n;
else if (D[as - 1][i][j][k] == -1)
D[as][i][j][k] = -1;
D[as][i][j][k] =
max(D[as - 1][i][j][k], D[as - 1][i][j][D[as - 1][i][j][k] + 1]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int las = m + 1;
for (int k = m; k; k--) {
for (; las > k; las--) {
int nxt = D[as - 1][k][las - 1][i];
if (nxt == -1)
continue;
if (nxt < j) {
if (D[as - 1][k][las - 1][nxt + 1] >= j)
break;
} else
break;
}
if (las != k)
chkmax(R[as][i][j][k], las - 1);
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
int las = n + 1;
for (int k = n; k; k--) {
for (; las > k; las--) {
int nxt = R[as - 1][k][las - 1][i];
if (nxt == -1)
continue;
if (nxt < j) {
if (R[as - 1][k][las - 1][nxt + 1] >= j)
break;
} else
break;
}
if (las != k)
chkmax(D[as][i][j][k], las - 1);
}
}
}
if (R[as][1][n][1] == m) {
cout << as;
return 0;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define gc getchar
inline int read() {
register int x = 0, f = 1;
char ch = gc();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = gc();
}
while (isdigit(ch)) {
x = (x << 3) + (x << 1) + ch - '0';
ch = gc();
}
return (f == 1) ? x : -x;
}
int n, m, a[188][188], sum[188][188];
inline bool ok(int _x1, int _y1, int _x2, int _y2) {
int xx = sum[_x2][_y2] - sum[_x2][_y1 - 1] - sum[_x1 - 1][_y2] +
sum[_x1 - 1][_y1 - 1];
return (xx == 0 || xx == (_x2 - _x1 + 1) * (_y2 - _y1 + 1));
}
int R[17][188][188][188], D[17][188][188][188];
inline void chkmax(int &a, const int &b) {
if (a < b)
a = b;
}
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char ch = gc();
while (ch != '.' && ch != '#')
ch = gc();
a[i][j] = (ch == '.' ? 0 : 1);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int las = -1;
for (int k = m; k; k--) {
if (ok(i, k, j, k)) {
if (las == -1 || !ok(i, k, j, las))
las = k;
} else
las = -1;
R[0][i][j][k] = las;
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
int las = -1;
for (int k = n; k; k--) {
if (ok(k, i, k, j)) {
if (las == -1 || !ok(k, i, las, j))
las = k;
} else
las = -1;
D[0][i][j][k] = las;
}
}
}
//
if (ok(1, 1, n, m)) {
puts("0");
return 0;
}
for (int as = 1;; as++) {
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
for (int k = 1; k <= m; k++) {
if (R[as - 1][i][j][k] == m)
R[as][i][j][k] = m;
else if (R[as - 1][i][j][k] == -1)
R[as][i][j][k] = -1;
R[as][i][j][k] =
max(R[as - 1][i][j][k], R[as - 1][i][j][R[as - 1][i][j][k] + 1]);
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
for (int k = 1; k <= n; k++) {
if (D[as - 1][i][j][k] == n)
D[as][i][j][k] = n;
else if (D[as - 1][i][j][k] == -1)
D[as][i][j][k] = -1;
D[as][i][j][k] =
max(D[as - 1][i][j][k], D[as - 1][i][j][D[as - 1][i][j][k] + 1]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = i; j <= n; j++) {
int las = m + 1;
for (int k = m; k; k--) {
for (; las > k; las--) {
int nxt = D[as - 1][k][las - 1][i];
if (nxt == -1)
continue;
if (nxt < j) {
if (D[as - 1][k][las - 1][nxt + 1] >= j)
break;
} else
break;
}
if (las != k)
chkmax(R[as][i][j][k], las - 1);
}
}
}
for (int i = 1; i <= m; i++) {
for (int j = i; j <= m; j++) {
int las = n + 1;
for (int k = n; k; k--) {
for (; las > k; las--) {
int nxt = R[as - 1][k][las - 1][i];
if (nxt == -1)
continue;
if (nxt < j) {
if (R[as - 1][k][las - 1][nxt + 1] >= j)
break;
} else
break;
}
if (las != k)
chkmax(D[as][i][j][k], las - 1);
}
}
}
if (R[as][1][n][1] == m) {
cout << as;
return 0;
}
}
return 0;
}
| delete | 1 | 2 | 1 | 1 | -11 | |
p03056 | C++ | Memory Limit Exceeded | /****************************************************************
* Author: huhao
* Email: 826538400@qq.com
* Create time: 2020-02-03 16:33:26
****************************************************************/
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define fr(i, a, b) for (int i = (a), end_##i = (b); i <= end_##i; i++)
#define fd(i, a, b) for (int i = (a), end_##i = (b); i >= end_##i; i--)
int read() {
int r = 0, t = 1, c = getchar();
while (c < '0' || c > '9') {
t = c == '-' ? -1 : 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
r = (r << 3) + (r << 1) + (c ^ 48);
c = getchar();
}
return r * t;
}
const int N = 210, L = 16;
int n, m, s[N][N], f[N][N][N][L + 2];
char c[N][N];
int S(int x, int y, int X, int Y) {
return s[X][Y] - s[x - 1][Y] - s[X][y - 1] + s[x - 1][y - 1];
}
int main() {
n = read();
m = read();
fr(i, 1, n) scanf("%s", c[i] + 1);
fr(i, 1, n) fr(j, 1, m) s[i][j] =
s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (c[i][j] == '#');
// fr(i,1,n) fr(j,1,m) printf("%d%c",s[i][j],j==m?'\n':' ');
fr(st, 0, n - 1) fr(i, 1, n - st) {
int j = i + st;
fd(k, m, 1) if (S(i, k, j, k) == 0 || S(i, k, j, k) == st + 1) {
if (c[i][k] == c[i][k + 1])
f[i][j][k][0] = f[i][j][k + 1][0];
else
f[i][j][k][0] = k;
}
else f[i][j][k][0] = k - 1;
fr(l, 0, L) f[i][j][m + 1][l] = m;
fr(l, 1, L) fr(k, 1, m) {
f[i][j][k][l] = f[i][j][f[i][j][k][l - 1] + 1][l - 1];
int _l = i, _r = j - 1;
while (_l < _r) {
int mid = (_l + _r) >> 1;
if (f[i][mid][k][l - 1] > f[mid + 1][j][k][l - 1])
_l = mid + 1;
else
_r = mid;
}
fr(o, std::max(_l - 2, i), std::min(j - 1, _l + 2)) f[i][j][k][l] =
std::max(f[i][j][k][l],
std::min(f[i][o][k][l - 1], f[o + 1][j][k][l - 1]));
}
// fr(k,1,m) fr(l,0,L) printf("%d %d %d %d
//%d\n",i,j,k,l,f[i][j][k][l]);
}
int ans = 0;
while (f[1][n][1][ans] < m)
ans++;
printf("%d\n", ans);
return 0;
} | /****************************************************************
* Author: huhao
* Email: 826538400@qq.com
* Create time: 2020-02-03 16:33:26
****************************************************************/
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
#define fr(i, a, b) for (int i = (a), end_##i = (b); i <= end_##i; i++)
#define fd(i, a, b) for (int i = (a), end_##i = (b); i >= end_##i; i--)
int read() {
int r = 0, t = 1, c = getchar();
while (c < '0' || c > '9') {
t = c == '-' ? -1 : 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
r = (r << 3) + (r << 1) + (c ^ 48);
c = getchar();
}
return r * t;
}
const int N = 190, L = 16;
int n, m, s[N][N], f[N][N][N][L + 2];
char c[N][N];
int S(int x, int y, int X, int Y) {
return s[X][Y] - s[x - 1][Y] - s[X][y - 1] + s[x - 1][y - 1];
}
int main() {
n = read();
m = read();
fr(i, 1, n) scanf("%s", c[i] + 1);
fr(i, 1, n) fr(j, 1, m) s[i][j] =
s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + (c[i][j] == '#');
// fr(i,1,n) fr(j,1,m) printf("%d%c",s[i][j],j==m?'\n':' ');
fr(st, 0, n - 1) fr(i, 1, n - st) {
int j = i + st;
fd(k, m, 1) if (S(i, k, j, k) == 0 || S(i, k, j, k) == st + 1) {
if (c[i][k] == c[i][k + 1])
f[i][j][k][0] = f[i][j][k + 1][0];
else
f[i][j][k][0] = k;
}
else f[i][j][k][0] = k - 1;
fr(l, 0, L) f[i][j][m + 1][l] = m;
fr(l, 1, L) fr(k, 1, m) {
f[i][j][k][l] = f[i][j][f[i][j][k][l - 1] + 1][l - 1];
int _l = i, _r = j - 1;
while (_l < _r) {
int mid = (_l + _r) >> 1;
if (f[i][mid][k][l - 1] > f[mid + 1][j][k][l - 1])
_l = mid + 1;
else
_r = mid;
}
fr(o, std::max(_l - 2, i), std::min(j - 1, _l + 2)) f[i][j][k][l] =
std::max(f[i][j][k][l],
std::min(f[i][o][k][l - 1], f[o + 1][j][k][l - 1]));
}
// fr(k,1,m) fr(l,0,L) printf("%d %d %d %d
//%d\n",i,j,k,l,f[i][j][k][l]);
}
int ans = 0;
while (f[1][n][1][ans] < m)
ans++;
printf("%d\n", ans);
return 0;
} | replace | 23 | 24 | 23 | 24 | MLE | |
p03056 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define reg register
using namespace std;
int n, m;
char s[185][185];
int f[185][185];
short dp[185][185][185][21];
int pd(reg int sx, reg int sy, reg int ex, reg int ey) {
return f[ex][ey] + f[sx - 1][sy - 1] - f[sx - 1][ey] - f[ex][sy - 1];
}
int main() {
scanf("%d %d", &n, &m);
for (reg int i = 1; i <= n; i++)
scanf("%s", s[i] + 1);
for (reg int i = 1; i <= n; i++) {
for (reg int j = 1; j <= m; j++)
f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + (s[i][j] == '#');
}
for (reg int i = 1; i <= n; i++) {
for (reg int j1 = 1; j1 <= m; j1++) {
for (reg int j2 = j1; j2 <= m; j2++) {
reg int l = i, r = n, p = i - 1;
while (l <= r) {
reg int mid = (l + r) / 2;
reg int tot = pd(i, j1, mid, j2);
if (tot == 0 || tot == (mid - i + 1) * (j2 - j1 + 1))
p = max(p, mid), l = mid + 1;
else
r = mid - 1;
}
dp[i][j1][j2][0] = (short)p;
}
}
}
for (reg int k = 1;; k++) {
if (dp[1][1][m][k - 1] == n) {
printf("%d\n", k - 1);
return 0;
}
for (reg int len = 1; len <= m; len++) {
for (reg int i = 1; i <= n; i++) {
for (reg int j1 = 1; j1 <= m - len + 1; j1++) {
reg int j2 = j1 + len - 1;
if (dp[i][j1][j2][k - 1] == n) {
dp[i][j1][j2][k] = n;
continue;
}
reg int pre = (int)dp[i][j1][j2][k - 1] + 1;
dp[i][j1][j2][k] = dp[pre][j1][j2][k - 1];
if (dp[i][j1][j2][k] == n)
continue;
reg int l = j1, r = j2 - 1, p = 0;
while (l <= r) {
reg int mid = (l + r) / 2;
reg int x = (int)dp[i][j1][mid][k - 1],
y = (int)dp[i][mid + 1][j2][k - 1];
p = max(p, min(x, y));
if (x < y)
r = mid - 1;
else
l = mid + 1;
}
dp[i][j1][j2][k] = max(dp[i][j1][j2][k], (short)p);
}
}
}
}
return 0;
} | #include <bits/stdc++.h>
#define reg register
using namespace std;
int n, m;
char s[190][190];
int f[190][190];
short dp[190][190][190][21];
int pd(reg int sx, reg int sy, reg int ex, reg int ey) {
return f[ex][ey] + f[sx - 1][sy - 1] - f[sx - 1][ey] - f[ex][sy - 1];
}
int main() {
scanf("%d %d", &n, &m);
for (reg int i = 1; i <= n; i++)
scanf("%s", s[i] + 1);
for (reg int i = 1; i <= n; i++) {
for (reg int j = 1; j <= m; j++)
f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1] + (s[i][j] == '#');
}
for (reg int i = 1; i <= n; i++) {
for (reg int j1 = 1; j1 <= m; j1++) {
for (reg int j2 = j1; j2 <= m; j2++) {
reg int l = i, r = n, p = i - 1;
while (l <= r) {
reg int mid = (l + r) / 2;
reg int tot = pd(i, j1, mid, j2);
if (tot == 0 || tot == (mid - i + 1) * (j2 - j1 + 1))
p = max(p, mid), l = mid + 1;
else
r = mid - 1;
}
dp[i][j1][j2][0] = (short)p;
}
}
}
for (reg int k = 1;; k++) {
if (dp[1][1][m][k - 1] == n) {
printf("%d\n", k - 1);
return 0;
}
for (reg int len = 1; len <= m; len++) {
for (reg int i = 1; i <= n; i++) {
for (reg int j1 = 1; j1 <= m - len + 1; j1++) {
reg int j2 = j1 + len - 1;
if (dp[i][j1][j2][k - 1] == n) {
dp[i][j1][j2][k] = n;
continue;
}
reg int pre = (int)dp[i][j1][j2][k - 1] + 1;
dp[i][j1][j2][k] = dp[pre][j1][j2][k - 1];
if (dp[i][j1][j2][k] == n)
continue;
reg int l = j1, r = j2 - 1, p = 0;
while (l <= r) {
reg int mid = (l + r) / 2;
reg int x = (int)dp[i][j1][mid][k - 1],
y = (int)dp[i][mid + 1][j2][k - 1];
p = max(p, min(x, y));
if (x < y)
r = mid - 1;
else
l = mid + 1;
}
dp[i][j1][j2][k] = max(dp[i][j1][j2][k], (short)p);
}
}
}
}
return 0;
} | replace | 4 | 7 | 4 | 7 | TLE | |
p03056 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U> void chmin(T &t, const U &u) {
if (t > u)
t = u;
}
template <class T, class U> void chmax(T &t, const U &u) {
if (t < u)
t = u;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
const int MX = 190;
const int B = 18;
int r[MX][MX];
string s[MX];
int tor[B][MX][MX][MX], tou[B][MX][MX][MX];
int main() {
int h, w;
cin >> h >> w;
rep(i, h) {
cin >> s[i];
rep(j, w) {
r[i + 1][j + 1] = r[i][j + 1] + r[i + 1][j] - r[i][j];
if (s[i][j] == '#') {
++r[i + 1][j + 1];
}
}
}
memset(tor, -1, sizeof(tor));
memset(tou, -1, sizeof(tou));
auto get = [&](int a, int b, int c, int d) {
int num = r[c + 1][d + 1] - r[a][d + 1] - r[c + 1][b] + r[a][b];
return num == 0 || num == (c - a + 1) * (d - b + 1);
};
for (int i = 0; i < h; ++i) {
for (int j = i; j < h; ++j) {
int l = -1;
for (int k = 0; k < w; ++k) {
chmax(l, k - 1);
while (l + 1 < w) {
if (get(i, k, j, l + 1)) {
++l;
} else {
break;
}
}
tor[0][i][j][k] = l;
}
}
}
for (int k = 0; k < w; ++k) {
for (int l = k; l < w; ++l) {
int j = -1;
for (int i = 0; i < h; ++i) {
chmax(j, i - 1);
while (j + 1 < h) {
if (get(i, k, j + 1, l)) {
++j;
} else {
break;
}
}
tou[0][k][l][i] = j;
}
}
}
for (int t = 1; t < B; ++t) {
if (tor[t - 1][0][h - 1][0] == w - 1) {
cout << t - 1 << endl;
return 0;
}
for (int i = 0; i < h; ++i) {
for (int j = i; j < h; ++j) {
int r = -1;
for (int k = 0; k < w; ++k) {
chmax(tor[t][i][j][k], tor[t - 1][i][j][k]);
if (tor[t - 1][i][j][k] >= k) {
chmax(tor[t][i][j][k], tor[t - 1][i][j][tor[t - 1][i][j][k] + 1]);
}
chmax(r, k - 1);
while (r + 1 < w) {
if (tou[t - 1][k][r + 1][i] >= j ||
(tou[t - 1][k][r + 1][i] >= i &&
tou[t - 1][k][r + 1][tou[t - 1][k][r + 1][i] + 1] >= j)) {
++r;
} else {
break;
}
}
chmax(tor[t][i][j][k], r);
}
}
}
for (int k = 0; k < w; ++k) {
for (int l = k; l < w; ++l) {
int u = -1;
for (int i = 0; i < h; ++i) {
chmax(tou[t][k][l][i], tou[t - 1][k][l][i]);
if (tou[t - 1][k][l][i] >= i) {
chmax(tou[t][k][l][i], tou[t - 1][k][l][tou[t - 1][k][l][i] + 1]);
}
chmax(u, i - 1);
while (u + 1 < h) {
if (tor[t - 1][i][u + 1][k] >= l ||
(tor[t - 1][i][u + 1][k] >= k &&
tor[t - 1][i][u + 1][tor[t - 1][i][u + 1][k] + 1] >= l)) {
++u;
} else {
break;
}
}
chmax(tou[t][k][l][i], u);
}
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T, class U> void chmin(T &t, const U &u) {
if (t > u)
t = u;
}
template <class T, class U> void chmax(T &t, const U &u) {
if (t < u)
t = u;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
const int MX = 190;
const int B = 18;
int r[MX][MX];
string s[MX];
short tor[B][MX][MX][MX], tou[B][MX][MX][MX];
int main() {
int h, w;
cin >> h >> w;
rep(i, h) {
cin >> s[i];
rep(j, w) {
r[i + 1][j + 1] = r[i][j + 1] + r[i + 1][j] - r[i][j];
if (s[i][j] == '#') {
++r[i + 1][j + 1];
}
}
}
memset(tor, -1, sizeof(tor));
memset(tou, -1, sizeof(tou));
auto get = [&](int a, int b, int c, int d) {
int num = r[c + 1][d + 1] - r[a][d + 1] - r[c + 1][b] + r[a][b];
return num == 0 || num == (c - a + 1) * (d - b + 1);
};
for (int i = 0; i < h; ++i) {
for (int j = i; j < h; ++j) {
int l = -1;
for (int k = 0; k < w; ++k) {
chmax(l, k - 1);
while (l + 1 < w) {
if (get(i, k, j, l + 1)) {
++l;
} else {
break;
}
}
tor[0][i][j][k] = l;
}
}
}
for (int k = 0; k < w; ++k) {
for (int l = k; l < w; ++l) {
int j = -1;
for (int i = 0; i < h; ++i) {
chmax(j, i - 1);
while (j + 1 < h) {
if (get(i, k, j + 1, l)) {
++j;
} else {
break;
}
}
tou[0][k][l][i] = j;
}
}
}
for (int t = 1; t < B; ++t) {
if (tor[t - 1][0][h - 1][0] == w - 1) {
cout << t - 1 << endl;
return 0;
}
for (int i = 0; i < h; ++i) {
for (int j = i; j < h; ++j) {
int r = -1;
for (int k = 0; k < w; ++k) {
chmax(tor[t][i][j][k], tor[t - 1][i][j][k]);
if (tor[t - 1][i][j][k] >= k) {
chmax(tor[t][i][j][k], tor[t - 1][i][j][tor[t - 1][i][j][k] + 1]);
}
chmax(r, k - 1);
while (r + 1 < w) {
if (tou[t - 1][k][r + 1][i] >= j ||
(tou[t - 1][k][r + 1][i] >= i &&
tou[t - 1][k][r + 1][tou[t - 1][k][r + 1][i] + 1] >= j)) {
++r;
} else {
break;
}
}
chmax(tor[t][i][j][k], r);
}
}
}
for (int k = 0; k < w; ++k) {
for (int l = k; l < w; ++l) {
int u = -1;
for (int i = 0; i < h; ++i) {
chmax(tou[t][k][l][i], tou[t - 1][k][l][i]);
if (tou[t - 1][k][l][i] >= i) {
chmax(tou[t][k][l][i], tou[t - 1][k][l][tou[t - 1][k][l][i] + 1]);
}
chmax(u, i - 1);
while (u + 1 < h) {
if (tor[t - 1][i][u + 1][k] >= l ||
(tor[t - 1][i][u + 1][k] >= k &&
tor[t - 1][i][u + 1][tor[t - 1][i][u + 1][k] + 1] >= l)) {
++u;
} else {
break;
}
}
chmax(tou[t][k][l][i], u);
}
}
}
}
return 0;
} | replace | 49 | 50 | 49 | 50 | MLE | |
p03056 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#define max(x, y) ((x > y ? x : y))
#define min(x, y) ((x < y ? x : y))
using namespace std;
const int N = 200;
char f[20][N][N][N];
int n, m;
char a[N][N];
int sum[N][N];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf(" %c", &a[i][j]);
if (a[i][j] == '#')
sum[i][j] = 1;
sum[i][j] += sum[i - 1][j];
}
for (int cnt = 0; cnt < 20; cnt++) {
for (int i = m; i; i--)
for (int hr = 1; hr <= n; hr++) {
int mid = hr;
for (int hl = hr; hl; hl--) {
if (cnt) {
while (
mid - 1 > hl &&
min(f[cnt - 1][i][mid][hr], f[cnt - 1][i][hl][mid - 1]) <=
min(f[cnt - 1][i][mid - 1][hr], f[cnt - 1][i][hl][mid - 2]))
mid--;
if (mid != hl)
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr],
min(f[cnt - 1][i][mid][hr], f[cnt - 1][i][hl][mid - 1]));
if (f[cnt - 1][i][hl][hr] + i <= m)
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr],
f[cnt - 1][i][hl][hr] +
f[cnt - 1][i + f[cnt - 1][i][hl][hr]][hl][hr]);
else
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], f[cnt - 1][i][hl][hr]);
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], f[cnt - 1][i][hl][hr]);
} else {
if ((sum[hr][i] - sum[hl - 1][i]) % (hr - hl + 1) == 0) {
if (i == m)
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], 1);
else {
if ((sum[hr][i] - sum[hl - 1][i]) ==
(sum[hr][i + 1] - sum[hl - 1][i + 1]))
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr], f[cnt][i + 1][hl][hr] + 1);
else
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], 1);
}
}
}
}
}
if (f[cnt][1][1][n] == m) {
printf("%d\n", cnt);
return 0;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#define max(x, y) ((x > y ? x : y))
#define min(x, y) ((x < y ? x : y))
using namespace std;
const int N = 200;
short f[20][N][N][N];
int n, m;
char a[N][N];
int sum[N][N];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf(" %c", &a[i][j]);
if (a[i][j] == '#')
sum[i][j] = 1;
sum[i][j] += sum[i - 1][j];
}
for (int cnt = 0; cnt < 20; cnt++) {
for (int i = m; i; i--)
for (int hr = 1; hr <= n; hr++) {
int mid = hr;
for (int hl = hr; hl; hl--) {
if (cnt) {
while (
mid - 1 > hl &&
min(f[cnt - 1][i][mid][hr], f[cnt - 1][i][hl][mid - 1]) <=
min(f[cnt - 1][i][mid - 1][hr], f[cnt - 1][i][hl][mid - 2]))
mid--;
if (mid != hl)
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr],
min(f[cnt - 1][i][mid][hr], f[cnt - 1][i][hl][mid - 1]));
if (f[cnt - 1][i][hl][hr] + i <= m)
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr],
f[cnt - 1][i][hl][hr] +
f[cnt - 1][i + f[cnt - 1][i][hl][hr]][hl][hr]);
else
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], f[cnt - 1][i][hl][hr]);
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], f[cnt - 1][i][hl][hr]);
} else {
if ((sum[hr][i] - sum[hl - 1][i]) % (hr - hl + 1) == 0) {
if (i == m)
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], 1);
else {
if ((sum[hr][i] - sum[hl - 1][i]) ==
(sum[hr][i + 1] - sum[hl - 1][i + 1]))
f[cnt][i][hl][hr] =
max(f[cnt][i][hl][hr], f[cnt][i + 1][hl][hr] + 1);
else
f[cnt][i][hl][hr] = max(f[cnt][i][hl][hr], 1);
}
}
}
}
}
if (f[cnt][1][1][n] == m) {
printf("%d\n", cnt);
return 0;
}
}
return 0;
} | replace | 12 | 13 | 12 | 13 | -11 | |
p03056 | C++ | Memory Limit Exceeded | /*
* UM.
* J@B@1 iO@1
* Y@@@B@BB. 7B@B@B@
* :@B@i,B@B@O ,Z@B@B@B@Br
* @B@q i@B@BS 7@B@@@O5vMB@q
* 8@@B LB@B@i FB@@@BNjYjLE@B@
* ,B@B: 0@@@Z P@B@BM1JJ125JPB@B
* B@BB :@B@B XB@B@Z2LuU52F2u2@B@.
* :@B@ @@@B: v@B@B8uJj51F1525uUB@B7
* @B@O 0@@B. ..::ir7vvYUuU777r::.
B@B@OULU2F2F151F11Y@B@S
* B@B, 8B@B
:ruXMB@B@B@B@B@B@B@B@B@B@@@B@B@B@B@B@B@5Jj1211F1F1F2FUJO@BB
* U@B@
@B@B@B@B@B@@@B@B@B@MMqPS5JuYL7rq@B@OBB@B@B8Yu211F1515251515YGB@@
* @B@u v@@@@MSur:.
LB@MvvjJuU5YU252F1F1F25251F2uX@@@
* @@@. N@BML2U2UUU12F15252525251515Jk@@B
* r@B@ YB@Bju52121252515252F15251F2u5@B@
* PB@B @@@PYUF151F25151F152F2F1F15jF@@B
* @@BS N@@@UJ2F25252F251525151F1F1u5@B@
* @@@7 B@B@5Yj12F152F1F1F25252515jFB@B
* B@Bi M@B@O2Luu52525212F151121UY1@B@7
* O@B@: v@B@BMSuYJJuuUu2u2uujjYJJXB@B@M
* 7B@B@, 1B@@@B@GPF1uujuu21PNMB@B@B@B@@
* qB@B2 i8B@B@B@B@B@@@@@B@B@B@q: @@@B
* MB@B: 7SBB@B@B@B@B@Zu: @B@B
* ZB@B. ,v. @B@L
* LB@B, Y7 @B@Bu 7@B@
* :B@B@@B2: @@B7 @B@Z r@B@B@BP:
B@BE
* BB@@@B@B@B@BE r@B@B 7@B@B@B@Ou: iB@B
* :uM@@B@@2. :7::::ivk@B@B@0 :5B@B@B@B@B@B@G. @B@i
* BB@@@B@@ :@B@B@@@B@B@@1 .i5M@B@B@@@5 M@@2
* B@B ,@B1 L0EZZG0F7: .:, uB@MrP@M7
* 2@B@ ,O@B@B@B@B
* @B@1 :@B@@@r
:@@@@B@BL:,,
* B@Bi :2ZS; :@B@B@B@r
L@B@B@BU
* @B@. @@@B@B@ vB@B@B@B5
@B@i
* B@B 7B@B@B@BM OB@B@B@
,B@B
* @B@ @B@B@@@i rL7.
B@BM
* B@B7.: NB@@M. .@B@.
* .;JEB@@@B@B@B@B@. . @B@u
*@@@B@B@B@B@@@B@18U :B@B@B@BU, *7@BOui. ,@@B SP@B@B@B@B@Or
* @@@U B@BJ.YO@B@B@i
* r@B@ :B@Bk .k@B@
* B@B@ LB@@k 2i
* B@BM .7jXEGqF7: OB@@L
* .B@BM .B@B@B@B@B@B@. :@B@B:
* .B@B@ @@MYr::ivG@B .M@B@G
* B@@@S ,MB@B@,
* v@@@BF .1B@B@Br
* 2@@B@BL ,FB@@@B8,
* r@B@B@BF, :YBB@B@B@B
* L@B@B@B@P7, .ivXB@B@B@B@B@M@B@
* ,1B@B@B@B@@@BOP2L7i:,.
..,:i7LSNB@@B@B@@@B@B@B@Z5v;.LB@@
* @B@OEB@B@@@B@B@B@B@B@B@B@B@@@B@B@B@B@B@@@B@B@B@B@BM0SJ7i::::i:,u@B@
* B@Bu
::i;7vu2XNGOMB@B@BMB@B@B@B@B@B@@@B1UFuj77ii:::::::iir;r;i.YB@B
* @B@L.:i:i:i::::::::::..Y@B@BMYi:i;SB@B@N:.::i:iirir;r;rii::::ivO@B@
* B@@X::,::::iirir;riri:E@B@1
,@B@Br:;;r;rii:i::::i7JEB@@@@@B
* @@@B@BBq5v7ii:::::::.2@@@i ..,..
@B@@,,:::::irv2XMB@B@B@B@2@B@:
* .B@BBB@@@B@B@B@BMNP5u7@B@1 .,,:,, :.
@B@P50MB@B@B@B@B@@@BS: @@B1
* E@B@ ijGB@B@B@B@B@B@B@Bi .,:,,..@@B@7
B@B@B@B@B@B@BM57. kB@B
* .@B@: .,ivu5Nq@B@u ..,.. SB@B@@@B@PL7i,
,@B@
* @@@8 i@B@: . :B@B@@ B@@2
* i@@@@ 0@B@u B@@B. vB@B
* ,@B@G L@B@BOv:.:iFB@B@M @B@Bi
* vNi S@@B@B@B@B@BM: MB@N
* 758BMqJ,
*
* . YO. vq :G Z:
* SqOMBB@B@Br @@r rBE @B B@@@@@B@ONX8k
i::::.OB1.:::.u@O.::::i @B@B@U:@@B@@BPEBu
* B@@NB@k. 5@i uB@E. BM 1U2uUJvirB@@Z
r@@B@B@@@B@B@B@B@B@@@B@Bi LB@B@1 BX :@k uLLLvr@BJ:
* iB iBi 7@ .@M8@BGMZZ @@F ,B Pi v@
Bq @i v@ B@
* vuL7r8@S7vJL7N@Z7LLri;72. F7@Bvvv@@ @BX @@@B@B@@@@@B@@@B@B@B
7@ @F Bi @q @B@Bu @B
* N@B@G@@@8@BBOMB@G@BMNXG@, B@ @@ .Bk .:u; i@:
Zv 7@ Bk @,;@ ,BY @B B@
* r@ @G 5. ,@v BZ :::,.r@E .::i, @B B@
.@BL 7@ @F B:i@. .@ @M @B
* 7B: ,vO, @@ iB@: @B 7@:MB@B@B@@@B@B@BM @@. B:
2@q 7@ BS @i 0@ B. @O B@
* ,r2EBB@B@B@Bi G@ @BB B@ @B @S : r@
.. 7B @F @7 B7 @ @B @B
* E@B@UOBr @B@Bi L@0PB .BZ
.@B@B@B@B@B@B@B@B@B@B@B@, r@ BF @i @G B@B@B B@
* 7@, kB@U ;r @@@. .@Z GBuL@iBBi vB@B@q
BP:5@7 @u,. @B
* LBi YB@BrB@ @@ @B:L@Br BM .M@B rB
rB@J v@. Pi @XZ8r . B@
* . G@i B@BM. ,B@, @B iB@B N, 7r..q@k ,LB@B8 J@,
i@B@B1r Br @@
* MB@B@B ,i B@B@B, B@: @B@B@F .@BB: P@i
:OBZ .@U B@B@B:
* .ll rB.
:
.:: ,, .:
:, :. :LuqL 5B@ :v 77L21F5F5F5F1F5S15Uv7, :@B 0@U
.B@ L@P B@B@@@B@B@B@@B L@B B@B@, @BB2XSPSPkPXPkPXPF2B@B
.@B@B@B@B@@@B@B@B@B@@@B@B@B@B@B@ :@@@@BBMOB@BGM@B@BME@@@EMB@B@B@r ,Yi: @B2 iB@
2@@@7 B@, 8Bq vriii:.:0@@:ii::,:::B@B::iiii77
,E1uJuJJ7GB@7LUk2ULvB@B7LjJjjSq: B@7 @B i7 @B@B@B@B@B@B@B@B@B@B@k
@B .BZ u@. : ,@N 7B2
0EqEqX2@B@1N0Z0ZSqB@qX0ZNPUYLSZ8 B@ NBP :@B
1@BMX0uj2EEZN15, 8@B@B@@@GGB@7 5@B@BOM@B@B@B.
@B@B@B@@@B@B@B@B@B@B@B@B@B@B@B@B @B@B@B@B@B@B@B@B@B@B@q @B@B@B@B@@@u
S@B2qOOMOMM@BMB@L @@7 B@.
@Bv @@v . B@: k@v :i;.,...q5::B@k @Bi
8@@B@B@B@B@v BB@B@B@B@@@B. B@L .,7 0B@ SB@S
:5jj7vi::iiiii:..,:iii::;77LY25 B@ @B u@20B@B@B@B@N @@: B@ .:
B@ ::
.:v28P@B@@@B@B@, ,@@ u@B@. YB@B@ME0OB@B@@@B@BMB@B@BBOBB@B@. L@@ OBS B@:
JB@ @B. v@BLuXP0qXvL: 1@B7ukXE00SYvL
@@@B@B@B@Z. B@kLB@B: 7Ei @@; @B: B@ @B
.@O B@ LO1i , @B0 ;BX7. ,..P@B
@Bu 1B@B5 :: :@B B@@@B@B@@@B@B@ 7@@ U@u
B@i,::.PB@ @B .7OBGu Z@v rNBOFi 7B8 B@5 7B@B@B@ B@B i@B@7
@BN.::i:i:i:ii 17 @B @B@B@B@MMY B@ u@OBUMBi :@BNBYv@F
@B0 u@B@B@L kB@; @@; 0@B.J@@O: B@i ,:ii7@B@B@@@u
SZ i@B LB@@@B@5Y, B@, 5@@@B@GFY: ZBu :5rr:5B@J MBM: iB@@k:@@@
,NB@E k@@B@B@B@qEZMMBM@MBB@Br @B@B@OY77:, :MSUjuukB@Br iBvUr. .8@B
i5::r YB@ .B@B@BZ: 0B@B8 @BO .:i:77uU5uFSkFkFXXq
B@B@@@GU. ,@B@B@BM: B@B@B@B7
.:7kq ;@B, , @B. i@M .B@, N@@
.BO :,. .:.. LB@@@B@B@B@B@@ :B@, EB@O, B@i U@@
,q@BX 1@B ,q@B0: ,B@B@B@B@B@B@1 @B@B@B@B@B@B@ kri. M@@ @B:
u@B@J @B@B@B@B@@@Bi J@@@B@B@B@B@B irrvi:u@BjLJ7@B@7YYLB@Bj::rir @Bj i@B
EBO @@: :1 iiii:i::,:B@: uB@.::i:i:iii
@B@qquvrLu1127rrUU5Uvrrv5q@B@. .,iiiii::B@L .,:iiiii:E@@
YLLvv7iB@Bi7YLYL7r@@ErLLL7r::iYU @@i Y@@ B@k . .
... @B, B@B@B@B@B@BF @B@B@B@B@@@B
@@B@B@B@B@@@B@B@B@B@B@B@B@B@B@B@. B@i uB@ r7.
,B@MMMBMBMBMBMBMMG@B@ 7v r@M LB8 E@O PBM .
vB@B@B@@@B@Bi J@B@B@B@B@@@7 .@B P@8 @BX.::i:i:
B@2,:::i:i. . Z@M ; ;@B i@@@ ,ULYLJLL77@@i uB@ivLYLJLJu:
,B@B@B@B@B@B@B@B@B@B@ BOEOB@B@B@B@q BZNO@B@B@B@B@@
,:i7JB@B@B@B@@u B@: :B@Bv @Bi J@B 2J uB@
:u: @@r @BL 7@X: 8BZ B@B@B@B@B@,i. kBBi@B@L B@i j@@
uYjvJ2kSk1jM@@u2kFS1uLuJUi iu@B@O B@i .iNB@Bj B@u . Z@M :@B@Mi :
rEXqXXXPS5U@Bi Y@Bj1XXqkXXN07 B@Bq088OOGk@B@SE8OZZNq5@B@ i7:, @@,
::i2r @B7 MB@ ,8B@B@B kB@ Y@@B@B@BBOGB@i uB@EMB@B@B@B@j @Bi 7@B
G@8 ukBB@@@B@P B@ .75BB@@@B@: B@: O@B 7u@B@BO, v@@v B@G @Bi
J@B B@Y uB@ 7:,.i@BS ,B@B1: .@B N@@BL @B.
5ri:r@B@ k@BL. ,@B@q:5@B B@r 1@@ @B7 F@B
@B@B@Or .i.,,:1@B8 r,:::u@B@
@B@B@B1 .q@B@B: @Br L@B 5B@ kB@B@@@5. r@@@@B@Z;
,ijN B@L . B@5 .:...,:,:,.
,,:....... ... .
:@B@B@@@B@B@@@i @B1 j@B@. .@B .B@B@B@@@B@B@B@B@B G@B@B@B@B@B@B
.B@B@B@@@B@B@v 7;L7ri. @@@B@B@@ B@B@B@@@B@B@@ NLrr:0B@ B@2 YB@@N
UBB ... . .@B@Bi B@ @Br B@BBB@8 B@ JBE
:B@
:@B BBk .O: E@B@B@B@B@B@P .M@BS ..,:,:,.7@@
,.:,:::.,B@i @B :BS BB B@ @B :L77rr:E@@ir7vvvr:B@B:rv7ri:::rJ
:7ij@Biir:@BM :@B@i v@B@@@B@B@@@ UB@B@B@B@B@BL B@ i@5 M@
S@v UB@B@@M B@ 8B@B@B@B@B@B@B@B@B@@@B@B@@@B@B@@L JBM @@i 5B@ @B.
@@ @B ;@F BB @B O@L .@B @B 7B@ i@B @@,
@B L@B ,B@..,:,,.. :@B..,,:,:. . B@ i@5 M@ .B@ NB. B@
@@
;@B ,, B@ @@B. U@B 0BE @B@B@B@B@B@B@B@B@B@ LBEOB@@@B@B@B
UO0G@B@B@B@B@Bi @B rBS MB. :@@ X@, @B @B
,;7B@@B@B@B@B @B5 MB@q @B7 B@ Y@B :@5. B@
OOv @@ B@ i@5 M@. jB5 kB. B@ B@ 7B@B@B@B@@1r: ;@B.Z@@O iB@@r
B@j vB@ ,1@B@B; :@B i0B@B@ @B @B ,BF MB. @B
2@5i7@B @B
:: 7B@ B@B@u 7@B@B Y@@ j , r@@
i :0 ,B@ B@LLG@F M@ @@ 0@@B@MZ B@ L@B v@B@@@: :@B: B@B@B1.
jB@ :LLkBB@B@B 7@B :7L0@B@@@B :@@ @@MO@BO BB2B@B@7 Y@ @@ 7B@
.7B@B@B7 :B@u qB@ .@B@ .@B@: 7@B O@@B7, BBO B@BMi SB@
B@ : B@.:i: B@ u::.,B@B LB@Gi .B@B2.:B@i uB@B7 rL::,:@B@ :.
,P@@: :, .:uB@r @B. .:. U@@ B@B@BBS 5B@BM: MB
v@@@@@Mv @@B@B@Bv B@@@B@Bu M@ .@B@B@X
*/
#include <bits/stdc++.h>
using namespace std;
typedef int ALL_OF_YOU_ARE_HANZHONGBALLS;
typedef long long ll;
typedef unsigned long long ull;
typedef vector /*苟利国家生死以*/<int> vi;
typedef pair<int, int> /*岂因祸福避趋之*/ ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ii, ii> iiii;
#define F first
#define S second
#define IN inline
#define RE register
#define random(x) (rand() % x)
#define N 205
#define C 20
#define mod 1000000007
#define INF 0x3f3f3f3f
char s[N][N];
int n, m, dp[C][N][N][N];
int main() {
int l, r, mid;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
for (int j = 1; j <= m; ++j) {
for (int i = n; i; --i) {
if (s[i][j] == s[i + 1][j]) {
dp[0][i][j][j] = dp[0][i + 1][j][j];
} else {
dp[0][i][j][j] = i;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int jl = 1; jl <= m; ++jl) {
for (int jr = jl + 1; jr <= m; ++jr) {
if (s[i][jr] != s[i][jr - 1])
break;
dp[0][i][jl][jr] = min(dp[0][i][jr][jr], dp[0][i][jl][jr - 1]);
}
}
}
for (int jl = 1; jl <= m; ++jl) {
for (int jr = jl; jr <= m; ++jr) {
dp[0][n + 1][jl][jr] = n;
}
}
/*
for(int i=1;i<=n;++i){
for(int jl=1;jl<=m;++jl){
for(int jr=jl;jr<=m;++jr){
printf("(%d,%d,%d):%d ",i,jl,jr,dp[0][i][jl][jr]);
}puts("");
}puts("");
}
*/
if (dp[0][1][1][m] == n) {
puts("0");
return 0;
}
for (int c = 1; c < C; ++c) {
for (int i = n; i; --i) {
for (int j = 0; j < m; ++j) {
for (int jl = 1, jr = 1 + j; jr <= m; ++jl, ++jr) {
dp[c][i][jl][jr] =
max(dp[c - 1][i][jl][jr],
min(n, dp[c - 1][dp[c - 1][i][jl][jr] + 1][jl][jr]));
l = jl;
r = jr - 1;
while (l + 1 < r) {
mid = l + r >> 1;
if (dp[c - 1][i][jl][mid] > dp[c - 1][i][mid + 1][jr]) {
l = mid;
} else {
r = mid;
}
}
dp[c][i][jl][jr] =
max(dp[c][i][jl][jr],
max(min(dp[c - 1][i][jl][l], dp[c - 1][i][l + 1][jr]),
min(dp[c - 1][i][jl][l + 1], dp[c - 1][i][l + 2][jr])));
// printf("(%d,%d,%d,%d):%d %d ",c,i,jl,jr,l,dp[c][i][jl][jr]);
} // puts("");
} // puts("");
} // puts("");
if (dp[c][1][1][m] == n) {
printf("%d\n", c);
return 0;
}
}
assert(0);
return 0;
} | /*
* UM.
* J@B@1 iO@1
* Y@@@B@BB. 7B@B@B@
* :@B@i,B@B@O ,Z@B@B@B@Br
* @B@q i@B@BS 7@B@@@O5vMB@q
* 8@@B LB@B@i FB@@@BNjYjLE@B@
* ,B@B: 0@@@Z P@B@BM1JJ125JPB@B
* B@BB :@B@B XB@B@Z2LuU52F2u2@B@.
* :@B@ @@@B: v@B@B8uJj51F1525uUB@B7
* @B@O 0@@B. ..::ir7vvYUuU777r::.
B@B@OULU2F2F151F11Y@B@S
* B@B, 8B@B
:ruXMB@B@B@B@B@B@B@B@B@B@@@B@B@B@B@B@B@5Jj1211F1F1F2FUJO@BB
* U@B@
@B@B@B@B@B@@@B@B@B@MMqPS5JuYL7rq@B@OBB@B@B8Yu211F1515251515YGB@@
* @B@u v@@@@MSur:.
LB@MvvjJuU5YU252F1F1F25251F2uX@@@
* @@@. N@BML2U2UUU12F15252525251515Jk@@B
* r@B@ YB@Bju52121252515252F15251F2u5@B@
* PB@B @@@PYUF151F25151F152F2F1F15jF@@B
* @@BS N@@@UJ2F25252F251525151F1F1u5@B@
* @@@7 B@B@5Yj12F152F1F1F25252515jFB@B
* B@Bi M@B@O2Luu52525212F151121UY1@B@7
* O@B@: v@B@BMSuYJJuuUu2u2uujjYJJXB@B@M
* 7B@B@, 1B@@@B@GPF1uujuu21PNMB@B@B@B@@
* qB@B2 i8B@B@B@B@B@@@@@B@B@B@q: @@@B
* MB@B: 7SBB@B@B@B@B@Zu: @B@B
* ZB@B. ,v. @B@L
* LB@B, Y7 @B@Bu 7@B@
* :B@B@@B2: @@B7 @B@Z r@B@B@BP:
B@BE
* BB@@@B@B@B@BE r@B@B 7@B@B@B@Ou: iB@B
* :uM@@B@@2. :7::::ivk@B@B@0 :5B@B@B@B@B@B@G. @B@i
* BB@@@B@@ :@B@B@@@B@B@@1 .i5M@B@B@@@5 M@@2
* B@B ,@B1 L0EZZG0F7: .:, uB@MrP@M7
* 2@B@ ,O@B@B@B@B
* @B@1 :@B@@@r
:@@@@B@BL:,,
* B@Bi :2ZS; :@B@B@B@r
L@B@B@BU
* @B@. @@@B@B@ vB@B@B@B5
@B@i
* B@B 7B@B@B@BM OB@B@B@
,B@B
* @B@ @B@B@@@i rL7.
B@BM
* B@B7.: NB@@M. .@B@.
* .;JEB@@@B@B@B@B@. . @B@u
*@@@B@B@B@B@@@B@18U :B@B@B@BU, *7@BOui. ,@@B SP@B@B@B@B@Or
* @@@U B@BJ.YO@B@B@i
* r@B@ :B@Bk .k@B@
* B@B@ LB@@k 2i
* B@BM .7jXEGqF7: OB@@L
* .B@BM .B@B@B@B@B@B@. :@B@B:
* .B@B@ @@MYr::ivG@B .M@B@G
* B@@@S ,MB@B@,
* v@@@BF .1B@B@Br
* 2@@B@BL ,FB@@@B8,
* r@B@B@BF, :YBB@B@B@B
* L@B@B@B@P7, .ivXB@B@B@B@B@M@B@
* ,1B@B@B@B@@@BOP2L7i:,.
..,:i7LSNB@@B@B@@@B@B@B@Z5v;.LB@@
* @B@OEB@B@@@B@B@B@B@B@B@B@B@@@B@B@B@B@B@@@B@B@B@B@BM0SJ7i::::i:,u@B@
* B@Bu
::i;7vu2XNGOMB@B@BMB@B@B@B@B@B@@@B1UFuj77ii:::::::iir;r;i.YB@B
* @B@L.:i:i:i::::::::::..Y@B@BMYi:i;SB@B@N:.::i:iirir;r;rii::::ivO@B@
* B@@X::,::::iirir;riri:E@B@1
,@B@Br:;;r;rii:i::::i7JEB@@@@@B
* @@@B@BBq5v7ii:::::::.2@@@i ..,..
@B@@,,:::::irv2XMB@B@B@B@2@B@:
* .B@BBB@@@B@B@B@BMNP5u7@B@1 .,,:,, :.
@B@P50MB@B@B@B@B@@@BS: @@B1
* E@B@ ijGB@B@B@B@B@B@B@Bi .,:,,..@@B@7
B@B@B@B@B@B@BM57. kB@B
* .@B@: .,ivu5Nq@B@u ..,.. SB@B@@@B@PL7i,
,@B@
* @@@8 i@B@: . :B@B@@ B@@2
* i@@@@ 0@B@u B@@B. vB@B
* ,@B@G L@B@BOv:.:iFB@B@M @B@Bi
* vNi S@@B@B@B@B@BM: MB@N
* 758BMqJ,
*
* . YO. vq :G Z:
* SqOMBB@B@Br @@r rBE @B B@@@@@B@ONX8k
i::::.OB1.:::.u@O.::::i @B@B@U:@@B@@BPEBu
* B@@NB@k. 5@i uB@E. BM 1U2uUJvirB@@Z
r@@B@B@@@B@B@B@B@B@@@B@Bi LB@B@1 BX :@k uLLLvr@BJ:
* iB iBi 7@ .@M8@BGMZZ @@F ,B Pi v@
Bq @i v@ B@
* vuL7r8@S7vJL7N@Z7LLri;72. F7@Bvvv@@ @BX @@@B@B@@@@@B@@@B@B@B
7@ @F Bi @q @B@Bu @B
* N@B@G@@@8@BBOMB@G@BMNXG@, B@ @@ .Bk .:u; i@:
Zv 7@ Bk @,;@ ,BY @B B@
* r@ @G 5. ,@v BZ :::,.r@E .::i, @B B@
.@BL 7@ @F B:i@. .@ @M @B
* 7B: ,vO, @@ iB@: @B 7@:MB@B@B@@@B@B@BM @@. B:
2@q 7@ BS @i 0@ B. @O B@
* ,r2EBB@B@B@Bi G@ @BB B@ @B @S : r@
.. 7B @F @7 B7 @ @B @B
* E@B@UOBr @B@Bi L@0PB .BZ
.@B@B@B@B@B@B@B@B@B@B@B@, r@ BF @i @G B@B@B B@
* 7@, kB@U ;r @@@. .@Z GBuL@iBBi vB@B@q
BP:5@7 @u,. @B
* LBi YB@BrB@ @@ @B:L@Br BM .M@B rB
rB@J v@. Pi @XZ8r . B@
* . G@i B@BM. ,B@, @B iB@B N, 7r..q@k ,LB@B8 J@,
i@B@B1r Br @@
* MB@B@B ,i B@B@B, B@: @B@B@F .@BB: P@i
:OBZ .@U B@B@B:
* .ll rB.
:
.:: ,, .:
:, :. :LuqL 5B@ :v 77L21F5F5F5F1F5S15Uv7, :@B 0@U
.B@ L@P B@B@@@B@B@B@@B L@B B@B@, @BB2XSPSPkPXPkPXPF2B@B
.@B@B@B@B@@@B@B@B@B@@@B@B@B@B@B@ :@@@@BBMOB@BGM@B@BME@@@EMB@B@B@r ,Yi: @B2 iB@
2@@@7 B@, 8Bq vriii:.:0@@:ii::,:::B@B::iiii77
,E1uJuJJ7GB@7LUk2ULvB@B7LjJjjSq: B@7 @B i7 @B@B@B@B@B@B@B@B@B@B@k
@B .BZ u@. : ,@N 7B2
0EqEqX2@B@1N0Z0ZSqB@qX0ZNPUYLSZ8 B@ NBP :@B
1@BMX0uj2EEZN15, 8@B@B@@@GGB@7 5@B@BOM@B@B@B.
@B@B@B@@@B@B@B@B@B@B@B@B@B@B@B@B @B@B@B@B@B@B@B@B@B@B@q @B@B@B@B@@@u
S@B2qOOMOMM@BMB@L @@7 B@.
@Bv @@v . B@: k@v :i;.,...q5::B@k @Bi
8@@B@B@B@B@v BB@B@B@B@@@B. B@L .,7 0B@ SB@S
:5jj7vi::iiiii:..,:iii::;77LY25 B@ @B u@20B@B@B@B@N @@: B@ .:
B@ ::
.:v28P@B@@@B@B@, ,@@ u@B@. YB@B@ME0OB@B@@@B@BMB@B@BBOBB@B@. L@@ OBS B@:
JB@ @B. v@BLuXP0qXvL: 1@B7ukXE00SYvL
@@@B@B@B@Z. B@kLB@B: 7Ei @@; @B: B@ @B
.@O B@ LO1i , @B0 ;BX7. ,..P@B
@Bu 1B@B5 :: :@B B@@@B@B@@@B@B@ 7@@ U@u
B@i,::.PB@ @B .7OBGu Z@v rNBOFi 7B8 B@5 7B@B@B@ B@B i@B@7
@BN.::i:i:i:ii 17 @B @B@B@B@MMY B@ u@OBUMBi :@BNBYv@F
@B0 u@B@B@L kB@; @@; 0@B.J@@O: B@i ,:ii7@B@B@@@u
SZ i@B LB@@@B@5Y, B@, 5@@@B@GFY: ZBu :5rr:5B@J MBM: iB@@k:@@@
,NB@E k@@B@B@B@qEZMMBM@MBB@Br @B@B@OY77:, :MSUjuukB@Br iBvUr. .8@B
i5::r YB@ .B@B@BZ: 0B@B8 @BO .:i:77uU5uFSkFkFXXq
B@B@@@GU. ,@B@B@BM: B@B@B@B7
.:7kq ;@B, , @B. i@M .B@, N@@
.BO :,. .:.. LB@@@B@B@B@B@@ :B@, EB@O, B@i U@@
,q@BX 1@B ,q@B0: ,B@B@B@B@B@B@1 @B@B@B@B@B@B@ kri. M@@ @B:
u@B@J @B@B@B@B@@@Bi J@@@B@B@B@B@B irrvi:u@BjLJ7@B@7YYLB@Bj::rir @Bj i@B
EBO @@: :1 iiii:i::,:B@: uB@.::i:i:iii
@B@qquvrLu1127rrUU5Uvrrv5q@B@. .,iiiii::B@L .,:iiiii:E@@
YLLvv7iB@Bi7YLYL7r@@ErLLL7r::iYU @@i Y@@ B@k . .
... @B, B@B@B@B@B@BF @B@B@B@B@@@B
@@B@B@B@B@@@B@B@B@B@B@B@B@B@B@B@. B@i uB@ r7.
,B@MMMBMBMBMBMBMMG@B@ 7v r@M LB8 E@O PBM .
vB@B@B@@@B@Bi J@B@B@B@B@@@7 .@B P@8 @BX.::i:i:
B@2,:::i:i. . Z@M ; ;@B i@@@ ,ULYLJLL77@@i uB@ivLYLJLJu:
,B@B@B@B@B@B@B@B@B@B@ BOEOB@B@B@B@q BZNO@B@B@B@B@@
,:i7JB@B@B@B@@u B@: :B@Bv @Bi J@B 2J uB@
:u: @@r @BL 7@X: 8BZ B@B@B@B@B@,i. kBBi@B@L B@i j@@
uYjvJ2kSk1jM@@u2kFS1uLuJUi iu@B@O B@i .iNB@Bj B@u . Z@M :@B@Mi :
rEXqXXXPS5U@Bi Y@Bj1XXqkXXN07 B@Bq088OOGk@B@SE8OZZNq5@B@ i7:, @@,
::i2r @B7 MB@ ,8B@B@B kB@ Y@@B@B@BBOGB@i uB@EMB@B@B@B@j @Bi 7@B
G@8 ukBB@@@B@P B@ .75BB@@@B@: B@: O@B 7u@B@BO, v@@v B@G @Bi
J@B B@Y uB@ 7:,.i@BS ,B@B1: .@B N@@BL @B.
5ri:r@B@ k@BL. ,@B@q:5@B B@r 1@@ @B7 F@B
@B@B@Or .i.,,:1@B8 r,:::u@B@
@B@B@B1 .q@B@B: @Br L@B 5B@ kB@B@@@5. r@@@@B@Z;
,ijN B@L . B@5 .:...,:,:,.
,,:....... ... .
:@B@B@@@B@B@@@i @B1 j@B@. .@B .B@B@B@@@B@B@B@B@B G@B@B@B@B@B@B
.B@B@B@@@B@B@v 7;L7ri. @@@B@B@@ B@B@B@@@B@B@@ NLrr:0B@ B@2 YB@@N
UBB ... . .@B@Bi B@ @Br B@BBB@8 B@ JBE
:B@
:@B BBk .O: E@B@B@B@B@B@P .M@BS ..,:,:,.7@@
,.:,:::.,B@i @B :BS BB B@ @B :L77rr:E@@ir7vvvr:B@B:rv7ri:::rJ
:7ij@Biir:@BM :@B@i v@B@@@B@B@@@ UB@B@B@B@B@BL B@ i@5 M@
S@v UB@B@@M B@ 8B@B@B@B@B@B@B@B@B@@@B@B@@@B@B@@L JBM @@i 5B@ @B.
@@ @B ;@F BB @B O@L .@B @B 7B@ i@B @@,
@B L@B ,B@..,:,,.. :@B..,,:,:. . B@ i@5 M@ .B@ NB. B@
@@
;@B ,, B@ @@B. U@B 0BE @B@B@B@B@B@B@B@B@B@ LBEOB@@@B@B@B
UO0G@B@B@B@B@Bi @B rBS MB. :@@ X@, @B @B
,;7B@@B@B@B@B @B5 MB@q @B7 B@ Y@B :@5. B@
OOv @@ B@ i@5 M@. jB5 kB. B@ B@ 7B@B@B@B@@1r: ;@B.Z@@O iB@@r
B@j vB@ ,1@B@B; :@B i0B@B@ @B @B ,BF MB. @B
2@5i7@B @B
:: 7B@ B@B@u 7@B@B Y@@ j , r@@
i :0 ,B@ B@LLG@F M@ @@ 0@@B@MZ B@ L@B v@B@@@: :@B: B@B@B1.
jB@ :LLkBB@B@B 7@B :7L0@B@@@B :@@ @@MO@BO BB2B@B@7 Y@ @@ 7B@
.7B@B@B7 :B@u qB@ .@B@ .@B@: 7@B O@@B7, BBO B@BMi SB@
B@ : B@.:i: B@ u::.,B@B LB@Gi .B@B2.:B@i uB@B7 rL::,:@B@ :.
,P@@: :, .:uB@r @B. .:. U@@ B@B@BBS 5B@BM: MB
v@@@@@Mv @@B@B@Bv B@@@B@Bu M@ .@B@B@X
*/
#include <bits/stdc++.h>
using namespace std;
typedef int ALL_OF_YOU_ARE_HANZHONGBALLS;
typedef long long ll;
typedef unsigned long long ull;
typedef vector /*苟利国家生死以*/<int> vi;
typedef pair<int, int> /*岂因祸福避趋之*/ ii;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ii, ii> iiii;
#define F first
#define S second
#define IN inline
#define RE register
#define random(x) (rand() % x)
#define N 190
#define C 17
#define mod 1000000007
#define INF 0x3f3f3f3f
char s[N][N];
int n, m, dp[C][N][N][N];
int main() {
int l, r, mid;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
scanf("%s", s[i] + 1);
}
for (int j = 1; j <= m; ++j) {
for (int i = n; i; --i) {
if (s[i][j] == s[i + 1][j]) {
dp[0][i][j][j] = dp[0][i + 1][j][j];
} else {
dp[0][i][j][j] = i;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int jl = 1; jl <= m; ++jl) {
for (int jr = jl + 1; jr <= m; ++jr) {
if (s[i][jr] != s[i][jr - 1])
break;
dp[0][i][jl][jr] = min(dp[0][i][jr][jr], dp[0][i][jl][jr - 1]);
}
}
}
for (int jl = 1; jl <= m; ++jl) {
for (int jr = jl; jr <= m; ++jr) {
dp[0][n + 1][jl][jr] = n;
}
}
/*
for(int i=1;i<=n;++i){
for(int jl=1;jl<=m;++jl){
for(int jr=jl;jr<=m;++jr){
printf("(%d,%d,%d):%d ",i,jl,jr,dp[0][i][jl][jr]);
}puts("");
}puts("");
}
*/
if (dp[0][1][1][m] == n) {
puts("0");
return 0;
}
for (int c = 1; c < C; ++c) {
for (int i = n; i; --i) {
for (int j = 0; j < m; ++j) {
for (int jl = 1, jr = 1 + j; jr <= m; ++jl, ++jr) {
dp[c][i][jl][jr] =
max(dp[c - 1][i][jl][jr],
min(n, dp[c - 1][dp[c - 1][i][jl][jr] + 1][jl][jr]));
l = jl;
r = jr - 1;
while (l + 1 < r) {
mid = l + r >> 1;
if (dp[c - 1][i][jl][mid] > dp[c - 1][i][mid + 1][jr]) {
l = mid;
} else {
r = mid;
}
}
dp[c][i][jl][jr] =
max(dp[c][i][jl][jr],
max(min(dp[c - 1][i][jl][l], dp[c - 1][i][l + 1][jr]),
min(dp[c - 1][i][jl][l + 1], dp[c - 1][i][l + 2][jr])));
// printf("(%d,%d,%d,%d):%d %d ",c,i,jl,jr,l,dp[c][i][jl][jr]);
} // puts("");
} // puts("");
} // puts("");
if (dp[c][1][1][m] == n) {
printf("%d\n", c);
return 0;
}
}
assert(0);
return 0;
} | replace | 205 | 207 | 205 | 207 | MLE | |
p03056 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 188;
int dp[N][N][N][20];
int sum[N][N];
char c[N][N];
int n, m;
inline int cal(int x, int y, int l, int r) {
return sum[r][y] + sum[l - 1][x - 1] - sum[l - 1][y] - sum[r][x - 1];
}
inline bool no_cost(int x, int y, int l, int r) {
if (cal(x, y, l, r) == 0 || cal(x, y, l, r) == (y - x + 1) * (r - l + 1))
return true;
return false;
}
int dfs(int x, int l, int r, int k) {
if (dp[x][l][r][k] != -1)
return dp[x][l][r][k];
if (l > r || x <= 0 || x > m)
return x;
int nxt = dfs(x, l, r, k - 1);
if (nxt != m && nxt >= x)
dp[x][l][r][k] = dfs(nxt + 1, l, r, k - 1);
else
dp[x][l][r][k] = nxt;
int L = 0, R = r - l;
while (L <= R) {
int mid = (L + R) >> 1;
int Le = dfs(x, l, l + mid, k - 1);
int Ri = dfs(x, l + mid + 1, r, k - 1);
dp[x][l][r][k] = max(dp[x][l][r][k], min(Le, Ri));
if (Le <= Ri && Le != -1)
R = mid - 1;
else
L = mid + 1;
}
return dp[x][l][r][k];
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> c[i][j];
sum[i][j] =
sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (c[i][j] == '.');
}
}
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
int last = 1, k = 1;
while (k <= m) {
while (k <= m && no_cost(last, k, i, j))
k++;
if (last == k) {
dp[last][i][j][0] = 0;
k = ++last;
}
for (; last < k; last++)
dp[last][i][j][0] = k - 1;
}
}
}
for (int i = 0; i <= 18; i++) {
if (dfs(1, 1, n, i) == m) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 187;
int dp[N][N][N][18];
int sum[N][N];
char c[N][N];
int n, m;
inline int cal(int x, int y, int l, int r) {
return sum[r][y] + sum[l - 1][x - 1] - sum[l - 1][y] - sum[r][x - 1];
}
inline bool no_cost(int x, int y, int l, int r) {
if (cal(x, y, l, r) == 0 || cal(x, y, l, r) == (y - x + 1) * (r - l + 1))
return true;
return false;
}
int dfs(int x, int l, int r, int k) {
if (dp[x][l][r][k] != -1)
return dp[x][l][r][k];
if (l > r || x <= 0 || x > m)
return x;
int nxt = dfs(x, l, r, k - 1);
if (nxt != m && nxt >= x)
dp[x][l][r][k] = dfs(nxt + 1, l, r, k - 1);
else
dp[x][l][r][k] = nxt;
int L = 0, R = r - l;
while (L <= R) {
int mid = (L + R) >> 1;
int Le = dfs(x, l, l + mid, k - 1);
int Ri = dfs(x, l + mid + 1, r, k - 1);
dp[x][l][r][k] = max(dp[x][l][r][k], min(Le, Ri));
if (Le <= Ri && Le != -1)
R = mid - 1;
else
L = mid + 1;
}
return dp[x][l][r][k];
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> c[i][j];
sum[i][j] =
sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (c[i][j] == '.');
}
}
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
int last = 1, k = 1;
while (k <= m) {
while (k <= m && no_cost(last, k, i, j))
k++;
if (last == k) {
dp[last][i][j][0] = 0;
k = ++last;
}
for (; last < k; last++)
dp[last][i][j][0] = k - 1;
}
}
}
for (int i = 0; i <= 18; i++) {
if (dfs(1, 1, n, i) == m) {
cout << i << endl;
return 0;
}
}
return 0;
} | replace | 2 | 4 | 2 | 4 | MLE | |
p03056 | C++ | Runtime Error | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
#include <cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
string s[185];
const int C = 16;
int dp[2][185 + 1][185 + 1][185 + 1];
int h, w;
// accum2D range2D range2Dloop {{{
#include <type_traits>
using loop2d_int = long long;
template <class T> void accum2D(T &val, int h, int w) {
for (int i = 1; i < h; i++)
for (int j = 0; j < w; j++)
val[i][j] += val[i - 1][j];
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
val[i][j] += val[i][j - 1];
}
template <class T,
class V = typename std::remove_reference<decltype(T()[0][0])>::type>
V range2D(T &val, int y1, int x1, int y2, int x2, int h, int w) {
if (y2 >= h)
y2 = h - 1;
if (x2 >= w)
x2 = w - 1;
if (y1 > y2 || x1 > x2)
return static_cast<V>(0);
V res(val[y2][x2]);
if (y1 - 1 >= 0)
res -= val[y1 - 1][x2];
if (x1 - 1 >= 0)
res -= val[y2][x1 - 1];
if (y1 - 1 >= 0 && x1 - 1 >= 0)
res += val[y1 - 1][x1 - 1];
return res;
}
template <class T,
class V = typename std::remove_reference<decltype(T()[0][0])>::type>
auto range2Dloop(T &val, loop2d_int ty1, loop2d_int tx1, loop2d_int y2,
loop2d_int x2, int h, int w) {
if (ty1 > y2 || tx1 > x2)
return static_cast<V>(0);
loop2d_int y1 = ty1 % h;
if (y1 < 0)
y1 += h;
loop2d_int x1 = tx1 % w;
if (x1 < 0)
x1 += w;
y2 += y1 - ty1;
x2 += x1 - tx1;
loop2d_int gy = y2 / h;
loop2d_int gx = x2 / w;
y2 %= h;
x2 %= w;
V res(0);
if (gy == 0 && gx == 0) {
res += range2D<T>(val, y1, x1, y2, x2, h, w);
} else if (gy == 0) {
res += range2D<T>(val, y1, x1, y2, w - 1, h, w);
res += range2D<T>(val, y1, 0, y2, x2, h, w);
res += range2D<T>(val, y1, 0, y2, w - 1, h, w) * (gx - 1);
} else if (gx == 0) {
res += range2D<T>(val, y1, x1, h - 1, x2, h, w);
res += range2D<T>(val, 0, x1, y2, x2, h, w);
res += range2D<T>(val, 0, x1, h - 1, x2, h, w) * (gy - 1);
} else {
res += range2D<T>(val, y1, x1, h - 1, w - 1, h, w); // UL
res += range2D<T>(val, 0, x1, y2, w - 1, h, w); // DL
res += range2D<T>(val, y1, 0, h - 1, x2, h, w); // UR
res += range2D<T>(val, 0, 0, y2, x2, h, w); // DR
res += range2D<T>(val, y1, 0, h - 1, w - 1, h, w) * (gx - 1); // U
res += range2D<T>(val, 0, 0, y2, w - 1, h, w) * (gx - 1); // D
res += range2D<T>(val, 0, x1, h - 1, w - 1, h, w) * (gy - 1); // L
res += range2D<T>(val, 0, x1, h - 1, x2, h, w) * (gy - 1); // R
res += range2D<T>(val, 0, 0, h - 1, w - 1, h, w) * (gy - 1) * (gx - 1); // C
}
return res;
}
// }}}
template <class T, class U> inline void smax(T &a, U b) { a = a > b ? a : b; }
template <class T, class U> inline void smin(T &a, U b) { a = a < b ? a : b; }
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> h >> w;
vector<vector<int>> f(h, vector<int>(w, 0));
for (int i = 0; i < h; i++) {
cin >> s[i];
for (int j = 0; j < w; j++)
if (s[i][j] == '.')
f[i][j] = 1;
}
accum2D(f, h, w);
auto isMonotone = [&](int r1, int c1, int r2, int c2) {
int x = range2D(f, r1, c1, r2, c2, h, w);
return x == (r2 - r1 + 1) * (c2 - c1 + 1) || x == 0;
};
// i = 0 : 累積和を使っていい感じに求める
for (int rr = 0; rr < h; rr++)
for (int r1 = 0; r1 + rr < h; r1++) {
int r2 = r1 + rr;
int c1 = 0, c2 = 0;
for (; c2 < w;) {
while (c2 < w && isMonotone(r1, c1, r2, c2))
c2++;
if (c1 == c2) {
dp[0][r1][c1][r2] = c2 - 1;
c1++, c2++;
} else {
for (; c1 < c2; c1++) {
dp[0][r1][c1][r2] = c2 - 1;
}
}
}
}
for (int cc = 0; cc < w; cc++)
for (int c1 = 0; c1 + cc < w; c1++) {
int c2 = c1 + cc;
int r1 = 0, r2 = 0;
for (; r2 < h;) {
while (r2 < h && isMonotone(r1, c1, r2, c2))
r2++;
if (r1 == r2) {
dp[1][r1][c1][c2] = r2 - 1;
r1++, r2++;
} else {
for (; r1 < r2; r1++) {
dp[1][r1][c1][c2] = r2 - 1;
}
}
}
}
int i = 0;
while (dp[0][0][0][h - 1] < w - 1) {
assert(i < C - 1);
i++;
// for(int r1 = 0; r1 < h; r1++) for(int c1 = 0; c1 < w; c1++) {
// for(int r2 = r1; r2 < h; r2++) dp[0][r1][c1][r2][i] =
// dp[0][r1][c1][r2][i-1], dump(i, r1, c1, r2, dp[0][r1][c1][r2][i-1]);
// for(int c2 = c1; c2 < w; c2++) dp[1][r1][c1][c2][i] =
// dp[1][r1][c1][c2][i-1], dump(i, r1, c1, c2, dp[1][r1][c1][c2][i-1]);
// }
for (int r1 = 0; r1 < h; r1++)
for (int c1 = 0; c1 < w; c1++) {
// 伸ばしたい方向と垂直に切る場合
for (int r2 = r1; r2 < h; r2++) {
// int &d = dp[0][r1][c1][r2][i];
// int c2 = dp[0][r1][c1][r2][i-1] + 1;
// if(c2 == w) d = w - 1;
// else smax(d, dp[0][r1][c2][r2][i-1]);
// 次元を一個減らしても矛盾は生じない
int &d = dp[0][r1][c1][r2];
int c2 = d + 1;
if (c2 == w)
d = w - 1;
else
smax(d, dp[0][r1][c2][r2]);
}
for (int c2 = c1; c2 < w; c2++) {
int &d = dp[1][r1][c1][c2];
int r2 = d + 1;
if (r2 == h)
d = h - 1;
else
smax(d, dp[1][r2][c1][c2]);
}
// 伸ばしたい方向と水平に切る場合
{
int c2 = w - 1, r2 = r1;
for (; c2 >= c1; c2--) {
for (; r2 < h && r2 <= dp[1][r1][c1][c2]; r2++) {
smax(dp[0][r1][c1][r2], c2);
}
}
}
{
int c2 = c1, r2 = h - 1;
for (; r2 >= r1; r2--) {
for (; c2 < w && c2 <= dp[0][r1][c1][r2]; c2++) {
smax(dp[1][r1][c1][c2], r2);
}
}
}
}
}
cout << i << endl;
return 0;
}
| // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
#include <cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
string s[185];
const int C = 16;
int dp[2][185 + 1][185 + 1][185 + 1];
int h, w;
// accum2D range2D range2Dloop {{{
#include <type_traits>
using loop2d_int = long long;
template <class T> void accum2D(T &val, int h, int w) {
for (int i = 1; i < h; i++)
for (int j = 0; j < w; j++)
val[i][j] += val[i - 1][j];
for (int i = 0; i < h; i++)
for (int j = 1; j < w; j++)
val[i][j] += val[i][j - 1];
}
template <class T,
class V = typename std::remove_reference<decltype(T()[0][0])>::type>
V range2D(T &val, int y1, int x1, int y2, int x2, int h, int w) {
if (y2 >= h)
y2 = h - 1;
if (x2 >= w)
x2 = w - 1;
if (y1 > y2 || x1 > x2)
return static_cast<V>(0);
V res(val[y2][x2]);
if (y1 - 1 >= 0)
res -= val[y1 - 1][x2];
if (x1 - 1 >= 0)
res -= val[y2][x1 - 1];
if (y1 - 1 >= 0 && x1 - 1 >= 0)
res += val[y1 - 1][x1 - 1];
return res;
}
template <class T,
class V = typename std::remove_reference<decltype(T()[0][0])>::type>
auto range2Dloop(T &val, loop2d_int ty1, loop2d_int tx1, loop2d_int y2,
loop2d_int x2, int h, int w) {
if (ty1 > y2 || tx1 > x2)
return static_cast<V>(0);
loop2d_int y1 = ty1 % h;
if (y1 < 0)
y1 += h;
loop2d_int x1 = tx1 % w;
if (x1 < 0)
x1 += w;
y2 += y1 - ty1;
x2 += x1 - tx1;
loop2d_int gy = y2 / h;
loop2d_int gx = x2 / w;
y2 %= h;
x2 %= w;
V res(0);
if (gy == 0 && gx == 0) {
res += range2D<T>(val, y1, x1, y2, x2, h, w);
} else if (gy == 0) {
res += range2D<T>(val, y1, x1, y2, w - 1, h, w);
res += range2D<T>(val, y1, 0, y2, x2, h, w);
res += range2D<T>(val, y1, 0, y2, w - 1, h, w) * (gx - 1);
} else if (gx == 0) {
res += range2D<T>(val, y1, x1, h - 1, x2, h, w);
res += range2D<T>(val, 0, x1, y2, x2, h, w);
res += range2D<T>(val, 0, x1, h - 1, x2, h, w) * (gy - 1);
} else {
res += range2D<T>(val, y1, x1, h - 1, w - 1, h, w); // UL
res += range2D<T>(val, 0, x1, y2, w - 1, h, w); // DL
res += range2D<T>(val, y1, 0, h - 1, x2, h, w); // UR
res += range2D<T>(val, 0, 0, y2, x2, h, w); // DR
res += range2D<T>(val, y1, 0, h - 1, w - 1, h, w) * (gx - 1); // U
res += range2D<T>(val, 0, 0, y2, w - 1, h, w) * (gx - 1); // D
res += range2D<T>(val, 0, x1, h - 1, w - 1, h, w) * (gy - 1); // L
res += range2D<T>(val, 0, x1, h - 1, x2, h, w) * (gy - 1); // R
res += range2D<T>(val, 0, 0, h - 1, w - 1, h, w) * (gy - 1) * (gx - 1); // C
}
return res;
}
// }}}
template <class T, class U> inline void smax(T &a, U b) { a = a > b ? a : b; }
template <class T, class U> inline void smin(T &a, U b) { a = a < b ? a : b; }
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> h >> w;
vector<vector<int>> f(h, vector<int>(w, 0));
for (int i = 0; i < h; i++) {
cin >> s[i];
for (int j = 0; j < w; j++)
if (s[i][j] == '.')
f[i][j] = 1;
}
accum2D(f, h, w);
auto isMonotone = [&](int r1, int c1, int r2, int c2) {
int x = range2D(f, r1, c1, r2, c2, h, w);
return x == (r2 - r1 + 1) * (c2 - c1 + 1) || x == 0;
};
// i = 0 : 累積和を使っていい感じに求める
for (int rr = 0; rr < h; rr++)
for (int r1 = 0; r1 + rr < h; r1++) {
int r2 = r1 + rr;
int c1 = 0, c2 = 0;
for (; c2 < w;) {
while (c2 < w && isMonotone(r1, c1, r2, c2))
c2++;
if (c1 == c2) {
dp[0][r1][c1][r2] = c2 - 1;
c1++, c2++;
} else {
for (; c1 < c2; c1++) {
dp[0][r1][c1][r2] = c2 - 1;
}
}
}
}
for (int cc = 0; cc < w; cc++)
for (int c1 = 0; c1 + cc < w; c1++) {
int c2 = c1 + cc;
int r1 = 0, r2 = 0;
for (; r2 < h;) {
while (r2 < h && isMonotone(r1, c1, r2, c2))
r2++;
if (r1 == r2) {
dp[1][r1][c1][c2] = r2 - 1;
r1++, r2++;
} else {
for (; r1 < r2; r1++) {
dp[1][r1][c1][c2] = r2 - 1;
}
}
}
}
int i = 0;
while (dp[0][0][0][h - 1] < w - 1) {
assert(i < C);
i++;
// for(int r1 = 0; r1 < h; r1++) for(int c1 = 0; c1 < w; c1++) {
// for(int r2 = r1; r2 < h; r2++) dp[0][r1][c1][r2][i] =
// dp[0][r1][c1][r2][i-1], dump(i, r1, c1, r2, dp[0][r1][c1][r2][i-1]);
// for(int c2 = c1; c2 < w; c2++) dp[1][r1][c1][c2][i] =
// dp[1][r1][c1][c2][i-1], dump(i, r1, c1, c2, dp[1][r1][c1][c2][i-1]);
// }
for (int r1 = 0; r1 < h; r1++)
for (int c1 = 0; c1 < w; c1++) {
// 伸ばしたい方向と垂直に切る場合
for (int r2 = r1; r2 < h; r2++) {
// int &d = dp[0][r1][c1][r2][i];
// int c2 = dp[0][r1][c1][r2][i-1] + 1;
// if(c2 == w) d = w - 1;
// else smax(d, dp[0][r1][c2][r2][i-1]);
// 次元を一個減らしても矛盾は生じない
int &d = dp[0][r1][c1][r2];
int c2 = d + 1;
if (c2 == w)
d = w - 1;
else
smax(d, dp[0][r1][c2][r2]);
}
for (int c2 = c1; c2 < w; c2++) {
int &d = dp[1][r1][c1][c2];
int r2 = d + 1;
if (r2 == h)
d = h - 1;
else
smax(d, dp[1][r2][c1][c2]);
}
// 伸ばしたい方向と水平に切る場合
{
int c2 = w - 1, r2 = r1;
for (; c2 >= c1; c2--) {
for (; r2 < h && r2 <= dp[1][r1][c1][c2]; r2++) {
smax(dp[0][r1][c1][r2], c2);
}
}
}
{
int c2 = c1, r2 = h - 1;
for (; r2 >= r1; r2--) {
for (; c2 < w && c2 <= dp[0][r1][c1][r2]; c2++) {
smax(dp[1][r1][c1][c2], r2);
}
}
}
}
}
cout << i << endl;
return 0;
}
| replace | 166 | 167 | 166 | 167 | 0 | |
p03056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define mid ((l + r) >> 1)
const int N = 190;
char str[N][N];
int n, m, tmp, sum[N][N], dp[N][N][N][18];
bool check(int lx, int rx, int ly, int ry) {
int res =
sum[rx][ry] - sum[lx - 1][ry] - sum[rx][ly - 1] + sum[lx - 1][ly - 1];
if (res == 0 || res == (rx - lx + 1) * (ry - ly + 1))
return true;
return false;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%s", str[i] + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] +
(bool)(str[i][j] == '.');
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m + 1; ++L)
for (int k = 0; k < 18; ++k)
dp[x][L][L - 1][k] = 1 << 30;
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L; R <= m; ++R) {
int l = x, r = n, ans = l - 1;
while (l <= r)
check(x, mid, L, R) ? ans = mid, l = mid + 1 : r = mid - 1;
dp[x][L][R][0] = ans;
}
for (tmp = 1; dp[1][1][m][tmp - 1] < n; ++tmp) {
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L; R <= m; ++R)
dp[x][L][R][tmp] = dp[dp[x][L][R][tmp - 1] + 1][L][R][tmp - 1];
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L; R <= m; ++R) {
int res = L;
while (
res < R &&
min(dp[x][L][res][tmp - 1], dp[x][res + 1][R][tmp - 1]) <=
min(dp[x][L][res + 1][tmp - 1], dp[x][res + 2][R][tmp - 1]))
++res;
dp[x][L][R][tmp] =
max(dp[x][L][R][tmp],
min(dp[x][L][res][tmp - 1], dp[x][res + 1][R][tmp - 1]));
}
}
printf("%d\n", tmp - 1);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define mid ((l + r) >> 1)
const int N = 190;
char str[N][N];
int n, m, tmp, sum[N][N], dp[N][N][N][18];
bool check(int lx, int rx, int ly, int ry) {
int res =
sum[rx][ry] - sum[lx - 1][ry] - sum[rx][ly - 1] + sum[lx - 1][ly - 1];
if (res == 0 || res == (rx - lx + 1) * (ry - ly + 1))
return true;
return false;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%s", str[i] + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] +
(bool)(str[i][j] == '.');
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m + 1; ++L)
for (int k = 0; k < 18; ++k)
dp[x][L][L - 1][k] = 1 << 30;
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L; R <= m; ++R) {
int l = x, r = n, ans = l - 1;
while (l <= r)
check(x, mid, L, R) ? ans = mid, l = mid + 1 : r = mid - 1;
dp[x][L][R][0] = ans;
}
for (tmp = 1; dp[1][1][m][tmp - 1] < n; ++tmp) {
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L; R <= m; ++R)
dp[x][L][R][tmp] = dp[dp[x][L][R][tmp - 1] + 1][L][R][tmp - 1];
for (int x = 1; x <= n; ++x)
for (int L = 1; L <= m; ++L)
for (int R = L, res = L; R <= m; ++R) {
while (
res < R &&
min(dp[x][L][res][tmp - 1], dp[x][res + 1][R][tmp - 1]) <=
min(dp[x][L][res + 1][tmp - 1], dp[x][res + 2][R][tmp - 1]))
++res;
dp[x][L][R][tmp] =
max(dp[x][L][R][tmp],
min(dp[x][L][res][tmp - 1], dp[x][res + 1][R][tmp - 1]));
}
}
printf("%d\n", tmp - 1);
return 0;
} | replace | 47 | 49 | 47 | 48 | TLE | |
p03056 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef unsigned char uc;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
const int INF = 1000000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
// uc dp[400000010];
/*int ind(int i,int j,int k,int l){
return ((372-i)*(i-1)/2+j-i)*93*185+((372-k)*(k-1)/2+l-k);
}*/
int main() {
int h, w;
char c[200][200];
scanf("%d%d", &h, &w);
rep1(i, h) {
scanf("\n");
rep1(j, w) scanf("%c", &c[i][j]);
}
/*rep1(i,h)for(int j = i ; j <= h ; j ++){
rep1(k,w)for(int l = k ; l <= w ; l ++){
dp[ind(i,j,k,l)] = 0;
}
}*/
static unsigned char dp1[200][200][200][20];
static unsigned char dp2[200][200][200][20];
int dp_memo[200][200];
rrep1(x, h) rrep1(y, w) {
for (int i = x; i <= h; i++) {
for (int j = y; j <= w; j++) {
dp_memo[i][j] = 100;
}
}
for (int i = x; i <= h; i++) {
for (int j = y; j <= w; j++) {
if ((j == y || dp_memo[i][j - 1] == 0) &&
(i == x || dp_memo[i - 1][j] == 0) && c[x][y] == c[i][j]) {
dp_memo[i][j] = 0;
}
if (dp_memo[i][j] != 100) {
if (j == w || dp_memo[i][j + 1] > dp_memo[i][j]) {
int s = dp_memo[i][j];
int t = dp1[x][j + 1][i][dp_memo[i][j]];
while (t == 0 && s < 19) {
s++;
t = dp1[x][j + 1][i][s];
}
if (t != 0) {
while (dp_memo[i][t] > s + 1) {
dp_memo[i][t] = s + 1;
t--;
}
}
}
if (i == h || dp_memo[i + 1][j] > dp_memo[i][j]) {
int s = dp_memo[i][j];
int t = dp2[i + 1][y][j][dp_memo[i][j]];
while (t == 0 && s < 19) {
s++;
t = dp2[i + 1][y][j][s];
}
if (t != 0) {
while (dp_memo[t][j] > s + 1) {
dp_memo[t][j] = s + 1;
t--;
}
}
}
}
}
}
for (int i = x; i <= h; i++) {
rep(k, 20) dp1[x][y][i][k] = 0;
}
for (int j = y; j <= w; j++) {
rep(k, 20) dp2[x][y][j][k] = 0;
}
for (int i = x; i <= h; i++) {
for (int j = w; j >= y; j--) {
if (dp_memo[i][j] == 100)
continue;
if (dp1[x][y][i][dp_memo[i][j]] == 0)
dp1[x][y][i][dp_memo[i][j]] = j;
}
rep(k, 19) dp1[x][y][i][k + 1] =
max(dp1[x][y][i][k], dp1[x][y][i][k + 1]);
}
for (int j = y; j <= w; j++) {
for (int i = h; i >= x; i--) {
if (dp_memo[i][j] == 100)
continue;
if (dp2[x][y][j][dp_memo[i][j]] == 0)
dp2[x][y][j][dp_memo[i][j]] = i;
}
rep(k, 19) dp2[x][y][j][k + 1] =
max(dp2[x][y][j][k], dp2[x][y][j][k + 1]);
}
}
/*rep(k,19){
cout << dp1[h][w][h][k] << endl;
}*/
rep(k, 19) {
// cout << dp1[1][1][h][k] << endl;
if (dp1[1][1][h][k] == w) {
cout << k << endl;
return 0;
}
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef unsigned char uc;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i, x) for (int i = 0; i < x; i++)
#define rep1(i, x) for (int i = 1; i <= x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rrep1(i, x) for (int i = x; i > 0; i--)
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
#define mp1(a, b, c) P1(a, P(b, c))
const int INF = 1000000000;
const int dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir_8[8][2] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1},
{-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
// uc dp[400000010];
/*int ind(int i,int j,int k,int l){
return ((372-i)*(i-1)/2+j-i)*93*185+((372-k)*(k-1)/2+l-k);
}*/
int main() {
int h, w;
char c[200][200];
scanf("%d%d", &h, &w);
rep1(i, h) {
scanf("\n");
rep1(j, w) scanf("%c", &c[i][j]);
}
/*rep1(i,h)for(int j = i ; j <= h ; j ++){
rep1(k,w)for(int l = k ; l <= w ; l ++){
dp[ind(i,j,k,l)] = 0;
}
}*/
static unsigned char dp1[200][200][200][20];
static unsigned char dp2[200][200][200][20];
int dp_memo[200][200];
rrep1(x, h) rrep1(y, w) {
for (int i = x; i <= h; i++) {
for (int j = y; j <= w; j++) {
dp_memo[i][j] = 100;
}
}
for (int i = x; i <= h; i++) {
for (int j = y; j <= w; j++) {
if ((j == y || dp_memo[i][j - 1] == 0) &&
(i == x || dp_memo[i - 1][j] == 0) && c[x][y] == c[i][j]) {
dp_memo[i][j] = 0;
}
}
}
for (int i = x; i <= h; i++) {
for (int j = y; j <= w; j++) {
/*if((j == y || dp_memo[i][j-1] == 0) && (i == x || dp_memo[i-1][j] ==
0) && c[x][y] == c[i][j]){ dp_memo[i][j] = 0;
}*/
if (dp_memo[i][j] != 100) {
if (j == w || dp_memo[i][j + 1] > dp_memo[i][j]) {
int s = dp_memo[i][j];
int t = dp1[x][j + 1][i][dp_memo[i][j]];
while (t == 0 && s < 19) {
s++;
t = dp1[x][j + 1][i][s];
}
if (t != 0) {
while (dp_memo[i][t] > s + 1) {
dp_memo[i][t] = s + 1;
t--;
}
}
}
if (i == h || dp_memo[i + 1][j] > dp_memo[i][j]) {
int s = dp_memo[i][j];
int t = dp2[i + 1][y][j][dp_memo[i][j]];
while (t == 0 && s < 19) {
s++;
t = dp2[i + 1][y][j][s];
}
if (t != 0) {
while (dp_memo[t][j] > s + 1) {
dp_memo[t][j] = s + 1;
t--;
}
}
}
}
}
}
for (int i = x; i <= h; i++) {
rep(k, 20) dp1[x][y][i][k] = 0;
}
for (int j = y; j <= w; j++) {
rep(k, 20) dp2[x][y][j][k] = 0;
}
for (int i = x; i <= h; i++) {
for (int j = w; j >= y; j--) {
if (dp_memo[i][j] == 100)
continue;
if (dp1[x][y][i][dp_memo[i][j]] == 0)
dp1[x][y][i][dp_memo[i][j]] = j;
}
rep(k, 19) dp1[x][y][i][k + 1] =
max(dp1[x][y][i][k], dp1[x][y][i][k + 1]);
}
for (int j = y; j <= w; j++) {
for (int i = h; i >= x; i--) {
if (dp_memo[i][j] == 100)
continue;
if (dp2[x][y][j][dp_memo[i][j]] == 0)
dp2[x][y][j][dp_memo[i][j]] = i;
}
rep(k, 19) dp2[x][y][j][k + 1] =
max(dp2[x][y][j][k], dp2[x][y][j][k + 1]);
}
}
/*rep(k,19){
cout << dp1[h][w][h][k] << endl;
}*/
rep(k, 19) {
// cout << dp1[1][1][h][k] << endl;
if (dp1[1][1][h][k] == w) {
cout << k << endl;
return 0;
}
}
}
| insert | 76 | 76 | 76 | 83 | TLE | |
p03056 | C++ | Memory Limit Exceeded | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
template <typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define files(FILENAME) \
read(FILENAME); \
write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
const string FILENAME = "input";
const int MAXN = 190;
int h, w;
string s[MAXN];
int d[MAXN][MAXN];
int kek[MAXN][MAXN], kek1[MAXN][MAXN];
int getsum(const int &i, const int &j, const int &i1, const int &j1) {
return d[i1][j1] - d[i1][j - 1] - d[i - 1][j1] + d[i - 1][j - 1];
}
bool check(const int &i, const int &j, const int &i1, const int &j1) {
int s = getsum(i, j, i1, j1);
return s == 0 || s == (j1 - j + 1) * (i1 - i + 1);
}
short dp[2][22][MAXN][MAXN][MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// read(FILENAME);
cin >> h >> w;
for (int i = 0; i < h; i++) {
cin >> s[i];
for (int j = 0; j < w; j++) {
d[i + 1][j + 1] = s[i][j] == '#';
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
d[i][j] += d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1];
}
}
for (int ans = 0; ans < 20; ans++) {
for (int k = 1; k <= h; k++) {
for (int i = 1; i <= w; i++) {
int uk = i;
for (int j = i; j <= w; j++) {
if (ans == 0) {
for (int g = k; g <= h; g++) {
if (check(k, i, g, j)) {
chkmax(dp[1][ans][i][j][k], g);
}
}
}
}
}
}
for (int k = 1; k <= w; k++) {
for (int i = 1; i <= h; i++) {
int uk = i;
for (int j = i; j <= h; j++) {
if (ans == 0) {
for (int g = k; g <= w; g++) {
if (check(i, k, j, g)) {
chkmax(dp[0][ans][i][j][k], g);
}
}
}
}
}
}
for (int i = 1; i <= h; i++) {
for (int j = h - 1; j >= i; j--) {
for (int k = 1; k <= w; k++) {
chkmax(dp[0][ans][i][j][k], dp[0][ans][i][j + 1][k]);
}
}
}
for (int i = 1; i <= w; i++) {
for (int j = w - 1; j >= i; j--) {
for (int k = 1; k <= h; k++) {
chkmax(dp[1][ans][i][j][k], dp[1][ans][i][j + 1][k]);
}
}
}
for (int i = 1; i <= h; i++) {
for (int j = i; j <= h; j++) {
for (int k = 1; k <= w; k++) {
if (dp[0][ans][i][j][k] == 0) {
continue;
}
chkmax(dp[0][ans + 1][i][j][k], dp[0][ans][i][j][k]);
chkmax(dp[0][ans + 1][i][j][k],
dp[0][ans][i][j][dp[0][ans][i][j][k] + 1]);
int x = dp[0][ans][i][j][dp[0][ans][i][j][k] + 1];
// k, x, i, j
chkmax(dp[1][ans + 1][k][x][i], j);
}
}
}
for (int i = 1; i <= w; i++) {
for (int j = i; j <= w; j++) {
for (int k = 1; k <= h; k++) {
if (dp[1][ans][i][j][k] == 0) {
continue;
}
chkmax(dp[1][ans + 1][i][j][k], dp[1][ans][i][j][k]);
chkmax(dp[1][ans + 1][i][j][k],
dp[1][ans][i][j][dp[1][ans][i][j][k] + 1]);
int x = dp[1][ans][i][j][dp[1][ans][i][j][k] + 1];
// k, x, i, j
chkmax(dp[0][ans + 1][k][x][i], j);
}
}
}
}
for (int ans = 0; ans < 20; ans++) {
if (dp[0][ans][1][h][1] >= w || dp[1][ans][1][w][1] >= h) {
cout << ans << '\n';
break;
}
}
return 0;
} | /*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
template <typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
#define files(FILENAME) \
read(FILENAME); \
write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
const string FILENAME = "input";
const int MAXN = 190;
int h, w;
string s[MAXN];
int d[MAXN][MAXN];
int kek[MAXN][MAXN], kek1[MAXN][MAXN];
int getsum(const int &i, const int &j, const int &i1, const int &j1) {
return d[i1][j1] - d[i1][j - 1] - d[i - 1][j1] + d[i - 1][j - 1];
}
bool check(const int &i, const int &j, const int &i1, const int &j1) {
int s = getsum(i, j, i1, j1);
return s == 0 || s == (j1 - j + 1) * (i1 - i + 1);
}
unsigned char dp[2][22][MAXN][MAXN][MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// read(FILENAME);
cin >> h >> w;
for (int i = 0; i < h; i++) {
cin >> s[i];
for (int j = 0; j < w; j++) {
d[i + 1][j + 1] = s[i][j] == '#';
}
}
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
d[i][j] += d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1];
}
}
for (int ans = 0; ans < 20; ans++) {
for (int k = 1; k <= h; k++) {
for (int i = 1; i <= w; i++) {
int uk = i;
for (int j = i; j <= w; j++) {
if (ans == 0) {
for (int g = k; g <= h; g++) {
if (check(k, i, g, j)) {
chkmax(dp[1][ans][i][j][k], g);
}
}
}
}
}
}
for (int k = 1; k <= w; k++) {
for (int i = 1; i <= h; i++) {
int uk = i;
for (int j = i; j <= h; j++) {
if (ans == 0) {
for (int g = k; g <= w; g++) {
if (check(i, k, j, g)) {
chkmax(dp[0][ans][i][j][k], g);
}
}
}
}
}
}
for (int i = 1; i <= h; i++) {
for (int j = h - 1; j >= i; j--) {
for (int k = 1; k <= w; k++) {
chkmax(dp[0][ans][i][j][k], dp[0][ans][i][j + 1][k]);
}
}
}
for (int i = 1; i <= w; i++) {
for (int j = w - 1; j >= i; j--) {
for (int k = 1; k <= h; k++) {
chkmax(dp[1][ans][i][j][k], dp[1][ans][i][j + 1][k]);
}
}
}
for (int i = 1; i <= h; i++) {
for (int j = i; j <= h; j++) {
for (int k = 1; k <= w; k++) {
if (dp[0][ans][i][j][k] == 0) {
continue;
}
chkmax(dp[0][ans + 1][i][j][k], dp[0][ans][i][j][k]);
chkmax(dp[0][ans + 1][i][j][k],
dp[0][ans][i][j][dp[0][ans][i][j][k] + 1]);
int x = dp[0][ans][i][j][dp[0][ans][i][j][k] + 1];
// k, x, i, j
chkmax(dp[1][ans + 1][k][x][i], j);
}
}
}
for (int i = 1; i <= w; i++) {
for (int j = i; j <= w; j++) {
for (int k = 1; k <= h; k++) {
if (dp[1][ans][i][j][k] == 0) {
continue;
}
chkmax(dp[1][ans + 1][i][j][k], dp[1][ans][i][j][k]);
chkmax(dp[1][ans + 1][i][j][k],
dp[1][ans][i][j][dp[1][ans][i][j][k] + 1]);
int x = dp[1][ans][i][j][dp[1][ans][i][j][k] + 1];
// k, x, i, j
chkmax(dp[0][ans + 1][k][x][i], j);
}
}
}
}
for (int ans = 0; ans < 20; ans++) {
if (dp[0][ans][1][h][1] >= w || dp[1][ans][1][w][1] >= h) {
cout << ans << '\n';
break;
}
}
return 0;
} | replace | 86 | 87 | 86 | 87 | MLE | |
p03056 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
short hori[10][187][187][187]; // c1, c2, r1
short vert[10][187][187][187]; // r1, r2, c1
char dat[200][200];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", dat[i]);
}
for (int r2 = 0; r2 < n; r2++) {
char last = '-';
int pos = m - 1;
for (int c = m - 1; c >= 0; c--) {
if (dat[r2][c] != last) {
last = dat[r2][c];
pos = c;
}
vert[0][r2][r2][c] = pos;
}
for (int r1 = r2 - 1; r1 >= 0; r1--) {
for (int c = 0; c < m; c++) {
if (dat[r1][c] == dat[r2][c])
vert[0][r1][r2][c] = min(vert[0][r1][r2 - 1][c], vert[0][r2][r2][c]);
else
vert[0][r1][r2][c] = -1;
}
}
}
for (int c2 = 0; c2 < m; c2++) {
char last = '-';
int pos = n - 1;
for (int r = n - 1; r >= 0; r--) {
if (dat[r][c2] != last) {
last = dat[r][c2];
pos = r;
}
hori[0][c2][c2][r] = pos;
}
for (int c1 = c2 - 1; c1 >= 0; c1--) {
for (int r = 0; r < n; r++) {
if (dat[r][c1] == dat[r][c2])
hori[0][c1][c2][r] = min(hori[0][c1][c2 - 1][r], hori[0][c2][c2][r]);
else
hori[0][c1][c2][r] = -1;
}
}
}
for (int ans = 0;; ans++) {
if (vert[ans][0][n - 1][0] >= m - 1) {
printf("%d\n", ans);
break;
}
memcpy(vert[ans + 1], vert[ans], sizeof(vert[ans]));
memcpy(hori[ans + 1], hori[ans], sizeof(hori[ans]));
for (int r1 = 0; r1 < n; r1++) {
for (int r2 = r1; r2 < n; r2++) {
for (int c = 0; c < m; c++) {
short reach = vert[ans][r1][r2][c];
if (reach >= c) {
reach = vert[ans][r1][r2][reach + 1];
vert[ans + 1][r1][r2][c] = max(vert[ans + 1][r1][r2][c], reach);
}
int low = max(c, (int)vert[ans + 1][r1][r2][c] + 1), high = m - 1;
while (low <= high) {
int mid = (low + high) >> 1;
int reach = hori[ans][c][mid][r1];
if (reach >= r1 && reach + 1 < n) {
reach = hori[ans][c][mid][reach + 1];
}
if (reach >= r2) {
vert[ans + 1][r1][r2][c] = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
}
}
}
for (int c1 = 0; c1 < m; c1++) {
for (int c2 = c1; c2 < m; c2++) {
for (int r = 0; r < n; r++) {
short reach = hori[ans][c1][c2][r];
if (reach >= r) {
reach = hori[ans][c1][c2][reach + 1];
hori[ans + 1][c1][c2][r] = max(hori[ans + 1][c1][c2][r], reach);
}
int low = max(r, (int)hori[ans + 1][c1][c2][r] + 1), high = n - 1;
while (low <= high) {
int mid = (low + high) >> 1;
int reach = vert[ans][r][mid][c1];
if (reach >= c1 && reach + 1 < m) {
reach = vert[ans][r][mid][reach + 1];
}
if (reach >= c2) {
hori[ans + 1][c1][c2][r] = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
}
}
}
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
short hori[20][187][187][187]; // c1, c2, r1
short vert[20][187][187][187]; // r1, r2, c1
char dat[200][200];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%s", dat[i]);
}
for (int r2 = 0; r2 < n; r2++) {
char last = '-';
int pos = m - 1;
for (int c = m - 1; c >= 0; c--) {
if (dat[r2][c] != last) {
last = dat[r2][c];
pos = c;
}
vert[0][r2][r2][c] = pos;
}
for (int r1 = r2 - 1; r1 >= 0; r1--) {
for (int c = 0; c < m; c++) {
if (dat[r1][c] == dat[r2][c])
vert[0][r1][r2][c] = min(vert[0][r1][r2 - 1][c], vert[0][r2][r2][c]);
else
vert[0][r1][r2][c] = -1;
}
}
}
for (int c2 = 0; c2 < m; c2++) {
char last = '-';
int pos = n - 1;
for (int r = n - 1; r >= 0; r--) {
if (dat[r][c2] != last) {
last = dat[r][c2];
pos = r;
}
hori[0][c2][c2][r] = pos;
}
for (int c1 = c2 - 1; c1 >= 0; c1--) {
for (int r = 0; r < n; r++) {
if (dat[r][c1] == dat[r][c2])
hori[0][c1][c2][r] = min(hori[0][c1][c2 - 1][r], hori[0][c2][c2][r]);
else
hori[0][c1][c2][r] = -1;
}
}
}
for (int ans = 0;; ans++) {
if (vert[ans][0][n - 1][0] >= m - 1) {
printf("%d\n", ans);
break;
}
memcpy(vert[ans + 1], vert[ans], sizeof(vert[ans]));
memcpy(hori[ans + 1], hori[ans], sizeof(hori[ans]));
for (int r1 = 0; r1 < n; r1++) {
for (int r2 = r1; r2 < n; r2++) {
for (int c = 0; c < m; c++) {
short reach = vert[ans][r1][r2][c];
if (reach >= c) {
reach = vert[ans][r1][r2][reach + 1];
vert[ans + 1][r1][r2][c] = max(vert[ans + 1][r1][r2][c], reach);
}
int low = max(c, (int)vert[ans + 1][r1][r2][c] + 1), high = m - 1;
while (low <= high) {
int mid = (low + high) >> 1;
int reach = hori[ans][c][mid][r1];
if (reach >= r1 && reach + 1 < n) {
reach = hori[ans][c][mid][reach + 1];
}
if (reach >= r2) {
vert[ans + 1][r1][r2][c] = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
}
}
}
for (int c1 = 0; c1 < m; c1++) {
for (int c2 = c1; c2 < m; c2++) {
for (int r = 0; r < n; r++) {
short reach = hori[ans][c1][c2][r];
if (reach >= r) {
reach = hori[ans][c1][c2][reach + 1];
hori[ans + 1][c1][c2][r] = max(hori[ans + 1][c1][c2][r], reach);
}
int low = max(r, (int)hori[ans + 1][c1][c2][r] + 1), high = n - 1;
while (low <= high) {
int mid = (low + high) >> 1;
int reach = vert[ans][r][mid][c1];
if (reach >= c1 && reach + 1 < m) {
reach = vert[ans][r][mid][reach + 1];
}
if (reach >= c2) {
hori[ans + 1][c1][c2][r] = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
}
}
}
}
return 0;
}
| replace | 23 | 25 | 23 | 25 | -11 | |
p03057 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
typedef pair<double, double> pd;
typedef pair<double, ll> pdl;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
string s;
cin >> s;
if (s[0] == 'B') {
for (int i = 0; i < m; i++) {
if (s[i] == 'B') {
s[i] = 'R';
} else {
s[i] = 'B';
}
}
}
ll l = 0;
while (l < m && s[l] == 'R') {
l++;
}
if (l == m) {
assert(false);
}
if (n & 1) {
cout << (l == m ? 1 : 0) << endl;
return 0;
}
ll mi = E;
if (l & 1) {
mi = l;
} else {
mi = l + 1;
}
for (ll i = l; i < m; i++) {
if (s[i] == 'R') {
ll w = i;
while (i < m && s[i] == 'R') {
i++;
}
if (i != m) {
ll L = i - w;
if (L & 1) {
mi = min(mi, L);
}
}
}
}
vector<ll> dp(n, 0);
vector<ll> sum(n, 0);
dp[0] = sum[0] = 1;
for (int i = 2; i < n; i += 2) {
ll r = sum[i - 2];
ll l = (i - mi - 3 >= 0 ? sum[i - mi - 3] : 0LL);
dp[i] = r - l;
dp[i] %= MOD;
sum[i] = sum[i - 2] + dp[i];
sum[i] %= MOD;
// cout<<dp[i]<<" "<<sum[i]<<endl;
}
ll ans = 0;
for (ll i = 2; i <= mi + 1 && n - i >= 0; i++) {
ans += dp[n - i] * i % MOD;
ans %= MOD;
}
if (l == m) {
ans++;
}
ans %= MOD;
if (ans < 0) {
ans += MOD;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
typedef pair<double, double> pd;
typedef pair<double, ll> pdl;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
string s;
cin >> s;
if (s[0] == 'B') {
for (int i = 0; i < m; i++) {
if (s[i] == 'B') {
s[i] = 'R';
} else {
s[i] = 'B';
}
}
}
ll l = 0;
while (l < m && s[l] == 'R') {
l++;
}
if (l == m) {
ll ans = 1;
vector<ll> dp(n, 0);
vector<ll> sum(n, 0);
dp[0] = sum[0] = 1;
for (int i = 2; i < n; i++) {
dp[i] = sum[i - 2];
sum[i] = dp[i] + sum[i - 1];
sum[i] %= MOD;
}
for (ll i = 2; i <= n; i++) {
ans += sum[n - i] * i % MOD;
}
ans %= MOD;
cout << ans << endl;
return 0;
}
if (n & 1) {
cout << (l == m ? 1 : 0) << endl;
return 0;
}
ll mi = E;
if (l & 1) {
mi = l;
} else {
mi = l + 1;
}
for (ll i = l; i < m; i++) {
if (s[i] == 'R') {
ll w = i;
while (i < m && s[i] == 'R') {
i++;
}
if (i != m) {
ll L = i - w;
if (L & 1) {
mi = min(mi, L);
}
}
}
}
vector<ll> dp(n, 0);
vector<ll> sum(n, 0);
dp[0] = sum[0] = 1;
for (int i = 2; i < n; i += 2) {
ll r = sum[i - 2];
ll l = (i - mi - 3 >= 0 ? sum[i - mi - 3] : 0LL);
dp[i] = r - l;
dp[i] %= MOD;
sum[i] = sum[i - 2] + dp[i];
sum[i] %= MOD;
// cout<<dp[i]<<" "<<sum[i]<<endl;
}
ll ans = 0;
for (ll i = 2; i <= mi + 1 && n - i >= 0; i++) {
ans += dp[n - i] * i % MOD;
ans %= MOD;
}
if (l == m) {
ans++;
}
ans %= MOD;
if (ans < 0) {
ans += MOD;
}
cout << ans << endl;
return 0;
}
| replace | 56 | 57 | 56 | 71 | 0 | |
p03057 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[200005], s[200005], f[200005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= n) {
if (st[i] != st[i - 1]) {
if (st[i] != st[1]) {
if (lst == 1 || ((i - lst) & 1)) {
mi = min(mi, i - lst);
}
} else {
lst = i;
}
}
i++;
}
if (mi < 0x3f3f3f3f) {
if (n & 1) {
puts("0");
return 0;
}
mi = mi / 2 + 1;
n /= 2;
l = 1;
/* s[1]=1;s[mi+1]+=mod-1;
rep(i,n){
tmp=(tmp+s[i])%mod;
dp[i]=tmp;
s[min(n,i+1)]=(s[min(n,i+1)]+dp[i])%mod;
s[min(n,i+mi)+1]=(s[min(n,i+mi)+1]+mod-dp[i])%mod;
}
cout<<dp[n]<<endl;*/
} else {
l = 2;
}
for (i = l; i <= n; i++) {
dp[i] = (s[i - l] + (i > mi ? -s[i - mi - 1] : (3ll - l) * i)) % mod;
s[i] = (s[i - 1] + dp[i]) % mod;
}
cout << (dp[n] + l - 1 + mod) % mod << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
const int mod = 1e9 + 7;
int n, m, i, lst, dp[200005], s[200005], f[200005][2], tmp, mi = 0x3f3f3f3f, l;
string st;
int main() {
cin >> n >> m;
cin >> st;
st = " " + st;
i = 1;
lst = 1;
while (i <= m) {
if (st[i] != st[i - 1]) {
if (st[i] != st[1]) {
if (lst == 1 || ((i - lst) & 1)) {
mi = min(mi, i - lst);
}
} else {
lst = i;
}
}
i++;
}
if (mi < 0x3f3f3f3f) {
if (n & 1) {
puts("0");
return 0;
}
mi = mi / 2 + 1;
n /= 2;
l = 1;
/* s[1]=1;s[mi+1]+=mod-1;
rep(i,n){
tmp=(tmp+s[i])%mod;
dp[i]=tmp;
s[min(n,i+1)]=(s[min(n,i+1)]+dp[i])%mod;
s[min(n,i+mi)+1]=(s[min(n,i+mi)+1]+mod-dp[i])%mod;
}
cout<<dp[n]<<endl;*/
} else {
l = 2;
}
for (i = l; i <= n; i++) {
dp[i] = (s[i - l] + (i > mi ? -s[i - mi - 1] : (3ll - l) * i)) % mod;
s[i] = (s[i - 1] + dp[i]) % mod;
}
cout << (dp[n] + l - 1 + mod) % mod << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03057 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define X 1000000007
using namespace std;
int n, m, t, a[N + 5], f[N + 5], g[N + 5];
char s[N + 5];
int w[N + 5][2];
I void Work() {
#define DP() \
for (RI i = 2; i <= n; ++i) \
w[i][0] = w[i - 1][1], w[i][1] = (w[i - 1][0] + w[i - 1][1]) % X;
w[1][1] = 1;
DP();
RI t = (w[n][0] + w[n][1]) % X;
w[1][0] = 1, w[1][1] = 0;
DP();
printf("%d\n", (t + w[n][1]) % X);
}
int main() {
RI i;
for (scanf("%d%d%s", &n, &m, s + 1), i = 1; i <= m; ++i)
s[i] ^ s[i - 1] && ++t, ++a[t];
if (t & 1 && --t, !t)
return Work(), 0;
if (n & 1)
return puts("0");
RI p = a[1] + (a[1] & 1 ^ 1);
for (i = 3; i <= t; i += 2)
a[i] & 1 && (p = min(p, a[i]));
for (f[0] = g[0] = 1, i = 2; i <= n; ++i)
f[i] = (g[i - 2] + (i - p - 3 >= 0 ? X - g[i - p - 3] : 0)) % X,
g[i] = (g[i - 2] + f[i]) % X;
RI res = 0;
for (i = 2; i <= p + 1 && i <= n; ++i)
res = (1LL * i * f[n - i] + res) % X;
return printf("%d\n", res), 0;
} | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define X 1000000007
using namespace std;
int n, m, t, a[N + 5], f[N + 5], g[N + 5];
char s[N + 5];
int w[N + 5][2];
I void Work() {
#define DP() \
for (RI i = 2; i <= n; ++i) \
w[i][0] = w[i - 1][1], w[i][1] = (w[i - 1][0] + w[i - 1][1]) % X;
w[1][1] = 1;
DP();
RI t = (w[n][0] + w[n][1]) % X;
w[1][0] = 1, w[1][1] = 0;
DP();
printf("%d\n", (t + w[n][1]) % X);
}
int main() {
RI i;
for (scanf("%d%d%s", &n, &m, s + 1), i = 1; i <= m; ++i)
s[i] ^ s[i - 1] && ++t, ++a[t];
if (t & 1 && --t, !t)
return Work(), 0;
if (n & 1)
return puts("0"), 0;
RI p = a[1] + (a[1] & 1 ^ 1);
for (i = 3; i <= t; i += 2)
a[i] & 1 && (p = min(p, a[i]));
for (f[0] = g[0] = 1, i = 2; i <= n; ++i)
f[i] = (g[i - 2] + (i - p - 3 >= 0 ? X - g[i - p - 3] : 0)) % X,
g[i] = (g[i - 2] + f[i]) % X;
RI res = 0;
for (i = 2; i <= p + 1 && i <= n; ++i)
res = (1LL * i * f[n - i] + res) % X;
return printf("%d\n", res), 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03057 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
template <long long MOD> struct ModInt {
using ll = long long;
ll val;
void setval(ll v) { val = v % MOD; };
ModInt() : val(0) {}
ModInt(ll v) { setval(v); };
ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt operator+=(const ModInt &x) { return *this = *this + x; }
ModInt operator-=(const ModInt &x) { return *this = *this - x; }
ModInt operator*=(const ModInt &x) { return *this = *this * x; }
ModInt operator/=(const ModInt &x) { return *this = *this / x; }
friend ostream &operator<<(ostream &os, const ModInt &x) {
os << x.val;
return os;
}
friend istream &operator>>(istream &is, ModInt &x) {
is >> x.val;
x.val = (x.val % MOD + MOD) % MOD;
return is;
}
ModInt pow(ll n) const {
ModInt a = 1;
if (n == 0)
return a;
int i0 = 64 - __builtin_clzll(n);
for (int i = i0 - 1; i >= 0; i--) {
a = a * a;
if ((n >> i) & 1)
a *= (*this);
}
return a;
}
ModInt inv() const { return this->pow(MOD - 2); }
};
using mint = ModInt<mod>;
mint pow(mint x, long long n) { return x.pow(n); }
// using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;
struct Combination {
vector<mint> fact, invfact;
Combination(int N) {
fact = vector<mint>({mint(1)});
invfact = vector<mint>({mint(1)});
fact_initialize(N);
}
void fact_initialize(int N) {
int i0 = fact.size();
if (i0 >= N + 1)
return;
fact.resize(N + 1);
invfact.resize(N + 1);
for (int i = i0; i <= N; i++)
fact[i] = fact[i - 1] * i;
invfact[N] = (mint)1 / fact[N];
for (int i = N - 1; i >= i0; i--)
invfact[i] = invfact[i + 1] * (i + 1);
}
mint nCr(int n, int r) {
if (n < 0 || r < 0 || r > n)
return mint(0);
if (fact.size() < n + 1)
fact_initialize(n);
return fact[n] * invfact[r] * invfact[n - r];
}
mint nPr(int n, int r) {
if (n < 0 || r < 0 || r > n)
return mint(0);
if (fact.size() < n + 1)
fact_initialize(n);
return fact[n] * invfact[n - r];
}
};
struct SegmentTree {
using T = mint;
int N;
vector<T> dat;
T id = 0;
T F(T &a, T &b) { return a + b; }
SegmentTree(int n) {
N = 1;
while (n > N)
N = N << 1;
dat = vector<T>(2 * N - 1, id);
}
SegmentTree(int n, vector<T> &v) {
N = 1;
while (n > N)
N = N << 1;
dat = vector<T>(2 * N - 1, id);
for (int i = 0; i < n; i++)
dat[i + N - 1] = v[i];
for (int i = N - 2; i >= 0; i--)
dat[i] = F(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, T a) {
k += N - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = F(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
void reset() { fill(dat.begin(), dat.end(), id); }
T get(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return id;
if (a <= l && r <= b)
return dat[k];
else {
T vl = get(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = get(a, b, k * 2 + 2, (l + r) / 2, r);
return F(vl, vr);
}
}
T get(int a, int b) { return get(a, b, 0, 0, N); }
T val(int k) { return dat[k + N - 1]; }
};
signed main() {
int N, M;
cin >> N >> M;
string S;
cin >> S;
if (S[0] == 'B') {
REP(i, N) {
if (S[i] == 'B')
S[i] = 'R';
else
S[i] = 'B';
}
}
int f = -1, s = INF, t = 0;
REP(i, M) {
if (S[i] == 'R')
t++;
else {
if (f == -1)
f = t;
else if (t % 2)
Min(s, t);
t = 0;
}
}
mint ans = 0;
if (f == -1) {
mmat dp(N, mvec(2, 0));
dp[0][0] = 1;
REP(i, N - 1) {
dp[i + 1][0] += dp[i][0] + dp[i][1];
dp[i + 1][1] += dp[i][0];
}
ans = dp[N - 1][0] + dp[N - 1][1] + dp[N - 2][0];
} else if (N % 2 == 0) {
int d;
if (f % 2)
d = min(f, s);
else
d = min(f + 1, s);
// debug(d);
N /= 2;
d /= 2;
mvec dp(N, 0);
dp[0] = 1;
SegmentTree ST(N, dp);
FOR(i, 1, N) {
dp[i] = ST.get(i - d - 1, i);
ST.update(i, dp[i]);
}
REP(i, d + 1) if (N - 1 - i >= 0) ans += dp[N - 1 - i] * 2 * (i + 1);
// vdebug(dp);
}
Out(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
template <long long MOD> struct ModInt {
using ll = long long;
ll val;
void setval(ll v) { val = v % MOD; };
ModInt() : val(0) {}
ModInt(ll v) { setval(v); };
ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt operator+=(const ModInt &x) { return *this = *this + x; }
ModInt operator-=(const ModInt &x) { return *this = *this - x; }
ModInt operator*=(const ModInt &x) { return *this = *this * x; }
ModInt operator/=(const ModInt &x) { return *this = *this / x; }
friend ostream &operator<<(ostream &os, const ModInt &x) {
os << x.val;
return os;
}
friend istream &operator>>(istream &is, ModInt &x) {
is >> x.val;
x.val = (x.val % MOD + MOD) % MOD;
return is;
}
ModInt pow(ll n) const {
ModInt a = 1;
if (n == 0)
return a;
int i0 = 64 - __builtin_clzll(n);
for (int i = i0 - 1; i >= 0; i--) {
a = a * a;
if ((n >> i) & 1)
a *= (*this);
}
return a;
}
ModInt inv() const { return this->pow(MOD - 2); }
};
using mint = ModInt<mod>;
mint pow(mint x, long long n) { return x.pow(n); }
// using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;
struct Combination {
vector<mint> fact, invfact;
Combination(int N) {
fact = vector<mint>({mint(1)});
invfact = vector<mint>({mint(1)});
fact_initialize(N);
}
void fact_initialize(int N) {
int i0 = fact.size();
if (i0 >= N + 1)
return;
fact.resize(N + 1);
invfact.resize(N + 1);
for (int i = i0; i <= N; i++)
fact[i] = fact[i - 1] * i;
invfact[N] = (mint)1 / fact[N];
for (int i = N - 1; i >= i0; i--)
invfact[i] = invfact[i + 1] * (i + 1);
}
mint nCr(int n, int r) {
if (n < 0 || r < 0 || r > n)
return mint(0);
if (fact.size() < n + 1)
fact_initialize(n);
return fact[n] * invfact[r] * invfact[n - r];
}
mint nPr(int n, int r) {
if (n < 0 || r < 0 || r > n)
return mint(0);
if (fact.size() < n + 1)
fact_initialize(n);
return fact[n] * invfact[n - r];
}
};
struct SegmentTree {
using T = mint;
int N;
vector<T> dat;
T id = 0;
T F(T &a, T &b) { return a + b; }
SegmentTree(int n) {
N = 1;
while (n > N)
N = N << 1;
dat = vector<T>(2 * N - 1, id);
}
SegmentTree(int n, vector<T> &v) {
N = 1;
while (n > N)
N = N << 1;
dat = vector<T>(2 * N - 1, id);
for (int i = 0; i < n; i++)
dat[i + N - 1] = v[i];
for (int i = N - 2; i >= 0; i--)
dat[i] = F(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, T a) {
k += N - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = F(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
void reset() { fill(dat.begin(), dat.end(), id); }
T get(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return id;
if (a <= l && r <= b)
return dat[k];
else {
T vl = get(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = get(a, b, k * 2 + 2, (l + r) / 2, r);
return F(vl, vr);
}
}
T get(int a, int b) { return get(a, b, 0, 0, N); }
T val(int k) { return dat[k + N - 1]; }
};
signed main() {
int N, M;
cin >> N >> M;
string S;
cin >> S;
if (S[0] == 'B') {
REP(i, M) {
if (S[i] == 'B')
S[i] = 'R';
else
S[i] = 'B';
}
}
int f = -1, s = INF, t = 0;
REP(i, M) {
if (S[i] == 'R')
t++;
else {
if (f == -1)
f = t;
else if (t % 2)
Min(s, t);
t = 0;
}
}
mint ans = 0;
if (f == -1) {
mmat dp(N, mvec(2, 0));
dp[0][0] = 1;
REP(i, N - 1) {
dp[i + 1][0] += dp[i][0] + dp[i][1];
dp[i + 1][1] += dp[i][0];
}
ans = dp[N - 1][0] + dp[N - 1][1] + dp[N - 2][0];
} else if (N % 2 == 0) {
int d;
if (f % 2)
d = min(f, s);
else
d = min(f + 1, s);
// debug(d);
N /= 2;
d /= 2;
mvec dp(N, 0);
dp[0] = 1;
SegmentTree ST(N, dp);
FOR(i, 1, N) {
dp[i] = ST.get(i - d - 1, i);
ST.update(i, dp[i]);
}
REP(i, d + 1) if (N - 1 - i >= 0) ans += dp[N - 1 - i] * 2 * (i + 1);
// vdebug(dp);
}
Out(ans);
return 0;
}
| replace | 231 | 232 | 231 | 232 | 0 | |
p03057 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> struct SegmentTree {
private:
int n;
T E;
vector<T> node;
inline void updatef(T &x, T &y) {
x = y;
// x += y;
// x = max(x,y);
// x = min(x,y);
}
inline T queryf(T &x, T &y) {
// return x*y;
return (x + y) % mod;
// return max(x,y);
// return min(x,y);
}
public:
SegmentTree(int sz, T E_) : E(E_) {
n = 1;
while (n < sz)
n <<= 1;
node.resize(2 * n - 1, E);
}
SegmentTree(vector<T> &A, T E_) : E(E_) {
int sz = A.size();
n = 1;
while (n < sz)
n <<= 1;
node.resize(2 * n - 1, E);
rep(i, sz) node[i + n - 1] = A[i];
for (int i = n - 2; i >= 0; --i) {
node[i] = queryf(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, T x) {
k += n - 1;
updatef(node[k], x);
while (k > 0) {
k = (k - 1) / 2;
node[k] = queryf(node[2 * k + 1], node[2 * k + 2]);
}
}
//[a,b)での和を返す
T get(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return E;
if (a <= l && r <= b)
return node[k];
T xl = get(a, b, 2 * k + 1, l, (l + r) / 2);
T xr = get(a, b, 2 * k + 2, (l + r) / 2, r);
return queryf(xl, xr);
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n = 101010) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k] % mod;
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
ll powmod(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
int len = 0;
while (len < m && s[len] == s[0])
++len;
if (len == m) {
vector<ll> ans(n + 5);
ans[0] = 2, ans[1] = 1;
rep(i, n - 1) ans[i + 2] = (ans[i + 1] + ans[i]) % mod;
cout << ans[n] << endl;
return 0;
}
if (n % 2) {
cout << 0 << endl;
return 0;
}
if (len % 2 == 0)
++len;
int cnt = 0;
rep(i, n) {
if (s[i] != s[0]) {
if (cnt % 2)
len = min(len, cnt);
cnt = 0;
} else
++cnt;
}
n /= 2;
len = (len + 1) / 2;
SegmentTree<ll> sg(n + 5, 0);
sg.update(0, 1);
rep(i, n + 1) {
ll ret = sg.get(max(0, i + 1 - len), i + 1);
sg.update(i + 1, ret);
}
ll ans = 0;
rep(i, min(n, len)) { ans += sg.get(max(0, n - len), n - i); }
cout << 2 * ans % mod << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
template <typename T> struct SegmentTree {
private:
int n;
T E;
vector<T> node;
inline void updatef(T &x, T &y) {
x = y;
// x += y;
// x = max(x,y);
// x = min(x,y);
}
inline T queryf(T &x, T &y) {
// return x*y;
return (x + y) % mod;
// return max(x,y);
// return min(x,y);
}
public:
SegmentTree(int sz, T E_) : E(E_) {
n = 1;
while (n < sz)
n <<= 1;
node.resize(2 * n - 1, E);
}
SegmentTree(vector<T> &A, T E_) : E(E_) {
int sz = A.size();
n = 1;
while (n < sz)
n <<= 1;
node.resize(2 * n - 1, E);
rep(i, sz) node[i + n - 1] = A[i];
for (int i = n - 2; i >= 0; --i) {
node[i] = queryf(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int k, T x) {
k += n - 1;
updatef(node[k], x);
while (k > 0) {
k = (k - 1) / 2;
node[k] = queryf(node[2 * k + 1], node[2 * k + 2]);
}
}
//[a,b)での和を返す
T get(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (r <= a || b <= l)
return E;
if (a <= l && r <= b)
return node[k];
T xl = get(a, b, 2 * k + 1, l, (l + r) / 2);
T xr = get(a, b, 2 * k + 2, (l + r) / 2, r);
return queryf(xl, xr);
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n = 101010) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k] % mod;
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
ll powmod(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
int len = 0;
while (len < m && s[len] == s[0])
++len;
if (len == m) {
vector<ll> ans(n + 5);
ans[0] = 2, ans[1] = 1;
rep(i, n - 1) ans[i + 2] = (ans[i + 1] + ans[i]) % mod;
cout << ans[n] << endl;
return 0;
}
if (n % 2) {
cout << 0 << endl;
return 0;
}
if (len % 2 == 0)
++len;
int cnt = 0;
rep(i, m) {
if (s[i] != s[0]) {
if (cnt % 2)
len = min(len, cnt);
cnt = 0;
} else
++cnt;
}
n /= 2;
len = (len + 1) / 2;
SegmentTree<ll> sg(n + 5, 0);
sg.update(0, 1);
rep(i, n + 1) {
ll ret = sg.get(max(0, i + 1 - len), i + 1);
sg.update(i + 1, ret);
}
ll ans = 0;
rep(i, min(n, len)) { ans += sg.get(max(0, n - len), n - i); }
cout << 2 * ans % mod << endl;
return 0;
} | replace | 142 | 143 | 142 | 143 | 0 | |
p03057 | C++ | Runtime Error | // #include <algorithm>
// #include <iostream>
// #include <string>
// using namespace std;
// #define MAX_N 200000
// #define MAX_M 200000
// #define MOD 1000000007
// #define INF 1 << 29
// int N, M;
// string S;
// long long dp[MAX_N + 2], rdp[MAX_N + 2];
// int all_color_is_same()
// {
// long long rr = 1, bb = 1, rb = 0, br = 0;
// for ( int i = 1; i < N; i++ )
// {
// long long nrr = ( rr + rb ) % MOD;
// long long nbb = br;
// long long nrb = rr;
// long long nbr = ( bb + br ) % MOD;
// rr = nrr;
// bb = nbb;
// rb = nrb;
// br = nbr;
// }
// return ( rr + rb + br ) % MOD;
// }
// /**
// * S
// の先頭の文字の最小連続回数を求める。ただし連続回数が偶数のものは無視する。
// */
// int min_freq()
// {
// int l = 0;
// while ( l < M && S[0] == S[l] ) l++;
// int ans = ( l & 1 ) ? l : l + 1;
// l = 0;
// for ( int i = 0; i < M; i++ )
// {
// if ( S[0] == S[i] )
// l++;
// else if ( l & 1 )
// {
// ans = min( ans, l );
// l = 0;
// }
// }
// return l ? min( ans, l ) : ans;
// }
// int solve()
// {
// // 一色
// if ( S.find( "R" ) == string::npos || S.find( "B" ) == string::npos )
// return all_color_is_same();
// // N が奇数
// if ( N & 1 ) return 0;
// int L = min_freq();
// L = ( L + 1 ) >> 1;
// N >>= 1;
// dp[0] = rdp[0] = 1;
// for ( int i = 1; i <= N + 1; i++ )
// {
// dp[i] = rdp[i - 1];
// if ( i - L - 1 >= 0 ) dp[i] = ( dp[i] - rdp[i - L - 1] ) % MOD;
// if ( dp[i] < 0 ) dp[i] += MOD;
// rdp[i] = ( rdp[i - 1] + dp[i] ) % MOD;
// }
// long long res = 0;
// for ( int i = 1; i <= L; i++ )
// if ( N >= i ) res = ( res + dp[N - i] * 2 * i ) % MOD;
// return res % MOD;
// }
// int main( int argc, char **argv )
// {
// cin >> N >> M;
// cin >> S;
// int ans = solve();
// cout << ans << endl;
// return 0;
// }
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
Int all(Int n) { // no bb
Int rr = 1, bb = 1, rb = 0, br = 0;
for (int i = 1; i < n; i++) {
Int nrr = (rr + rb) % MOD;
Int nbb = br;
Int nrb = rr;
Int nbr = (bb + br) % MOD;
rr = nrr;
bb = nbb;
rb = nrb;
br = nbr;
}
return (rr + rb + br) % MOD;
}
Int tmp[216000];
Int rdp[216000];
Int dp[216000];
void calc(Int n, Int limit) {
dp[0] = 1;
rdp[0] = 1;
for (int i = 1; i <= n + 1; i++) {
dp[i] =
(rdp[i - 1] - ((i - limit - 1) >= 0 ? rdp[i - limit - 1] : 0)) % MOD;
if (dp[i] < 0)
dp[i] += MOD;
rdp[i] = (rdp[i - 1] + dp[i]) % MOD;
}
}
Int solve(Int n, Int limit) {
if (n % 2 == 1)
return 0;
if (limit % 2 != 1)
exit(1);
limit = (limit + 1) / 2;
n /= 2;
Int res = 0;
calc(n + 10, limit);
for (Int i = 1; i <= limit; i++) {
if (n - i >= 0)
res = (res + dp[n - i] * 2 * i) % MOD;
}
if (res < 0)
exit(1);
return res % MOD;
}
int main() {
Int n, m;
string S;
cin >> n >> m;
cin >> S;
// bool allsame = true;
// for ( int i = 0; i < m; i++ ) allsame &= ( str[i] == str[0] );
// if ( allsame )
// {
// cout << all( n ) << endl;
// return 0;
// }
if (S.find("R") == string::npos || S.find("B") == string::npos)
return all(n);
Int l = 0;
while (S[0] == S[l])
l++;
if (l % 2 == 0)
l++;
Int limit = l;
l = 0;
for (int i = 0; i < m; i++) {
if (S[i] == S[0])
l++;
else {
if (l % 2 == 1)
limit = min(limit, l);
l = 0;
}
}
cout << solve(n, limit) << endl;
return 0;
}
| // #include <algorithm>
// #include <iostream>
// #include <string>
// using namespace std;
// #define MAX_N 200000
// #define MAX_M 200000
// #define MOD 1000000007
// #define INF 1 << 29
// int N, M;
// string S;
// long long dp[MAX_N + 2], rdp[MAX_N + 2];
// int all_color_is_same()
// {
// long long rr = 1, bb = 1, rb = 0, br = 0;
// for ( int i = 1; i < N; i++ )
// {
// long long nrr = ( rr + rb ) % MOD;
// long long nbb = br;
// long long nrb = rr;
// long long nbr = ( bb + br ) % MOD;
// rr = nrr;
// bb = nbb;
// rb = nrb;
// br = nbr;
// }
// return ( rr + rb + br ) % MOD;
// }
// /**
// * S
// の先頭の文字の最小連続回数を求める。ただし連続回数が偶数のものは無視する。
// */
// int min_freq()
// {
// int l = 0;
// while ( l < M && S[0] == S[l] ) l++;
// int ans = ( l & 1 ) ? l : l + 1;
// l = 0;
// for ( int i = 0; i < M; i++ )
// {
// if ( S[0] == S[i] )
// l++;
// else if ( l & 1 )
// {
// ans = min( ans, l );
// l = 0;
// }
// }
// return l ? min( ans, l ) : ans;
// }
// int solve()
// {
// // 一色
// if ( S.find( "R" ) == string::npos || S.find( "B" ) == string::npos )
// return all_color_is_same();
// // N が奇数
// if ( N & 1 ) return 0;
// int L = min_freq();
// L = ( L + 1 ) >> 1;
// N >>= 1;
// dp[0] = rdp[0] = 1;
// for ( int i = 1; i <= N + 1; i++ )
// {
// dp[i] = rdp[i - 1];
// if ( i - L - 1 >= 0 ) dp[i] = ( dp[i] - rdp[i - L - 1] ) % MOD;
// if ( dp[i] < 0 ) dp[i] += MOD;
// rdp[i] = ( rdp[i - 1] + dp[i] ) % MOD;
// }
// long long res = 0;
// for ( int i = 1; i <= L; i++ )
// if ( N >= i ) res = ( res + dp[N - i] * 2 * i ) % MOD;
// return res % MOD;
// }
// int main( int argc, char **argv )
// {
// cin >> N >> M;
// cin >> S;
// int ans = solve();
// cout << ans << endl;
// return 0;
// }
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
Int all(Int n) { // no bb
Int rr = 1, bb = 1, rb = 0, br = 0;
for (int i = 1; i < n; i++) {
Int nrr = (rr + rb) % MOD;
Int nbb = br;
Int nrb = rr;
Int nbr = (bb + br) % MOD;
rr = nrr;
bb = nbb;
rb = nrb;
br = nbr;
}
return (rr + rb + br) % MOD;
}
Int tmp[216000];
Int rdp[216000];
Int dp[216000];
void calc(Int n, Int limit) {
dp[0] = 1;
rdp[0] = 1;
for (int i = 1; i <= n + 1; i++) {
dp[i] =
(rdp[i - 1] - ((i - limit - 1) >= 0 ? rdp[i - limit - 1] : 0)) % MOD;
if (dp[i] < 0)
dp[i] += MOD;
rdp[i] = (rdp[i - 1] + dp[i]) % MOD;
}
}
Int solve(Int n, Int limit) {
if (n % 2 == 1)
return 0;
if (limit % 2 != 1)
exit(1);
limit = (limit + 1) / 2;
n /= 2;
Int res = 0;
calc(n + 10, limit);
for (Int i = 1; i <= limit; i++) {
if (n - i >= 0)
res = (res + dp[n - i] * 2 * i) % MOD;
}
if (res < 0)
exit(1);
return res % MOD;
}
int main() {
Int n, m;
string S;
cin >> n >> m;
cin >> S;
// bool allsame = true;
// for ( int i = 0; i < m; i++ ) allsame &= ( str[i] == str[0] );
// if ( allsame )
// {
// cout << all( n ) << endl;
// return 0;
// }
if (S.find("R") == string::npos || S.find("B") == string::npos) {
cout << all(n) << endl;
return 0;
}
Int l = 0;
while (S[0] == S[l])
l++;
if (l % 2 == 0)
l++;
Int limit = l;
l = 0;
for (int i = 0; i < m; i++) {
if (S[i] == S[0])
l++;
else {
if (l % 2 == 1)
limit = min(limit, l);
l = 0;
}
}
cout << solve(n, limit) << endl;
return 0;
}
| replace | 177 | 179 | 177 | 181 | 0 | |
p03057 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> inline bool chkmax(T &x, T y) {
return (y > x) ? (x = y, 1) : 0;
}
inline int read() {
int x;
char c;
int f = 1;
while ((c = getchar()) != '-' && (c > '9' || c < '0'))
;
if (c == '-')
f = -1, c = getchar();
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ '0');
return x * f;
}
inline ll readll() {
ll x;
char c;
int f = 1;
while ((c = getchar()) != '-' && (c > '9' || c < '0'))
;
if (c == '-')
f = -1, c = getchar();
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 1ll) + (x << 3ll) + (c ^ '0');
return x * f;
}
const int maxn = 2e5 + 10, inf = 0x3f3f3f3f, mod = 1e9 + 7;
char s[maxn];
inline int ksm(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = (ll)res * x % mod;
y >>= 1;
x = (ll)x * x % mod;
}
return res;
}
int dp[maxn], sum[maxn];
int main() {
int n = read(), m = read();
scanf("%s", s + 1);
int Min = inf;
for (int i = 1, j; i <= m; i++)
if (s[i] == s[1]) {
j = i;
while (j < m && s[j + 1] == s[1])
++j;
if (j == m)
continue;
if ((j - i + 1) % 2 == 1)
chkmin(Min, j - i + 1);
else if (i == 1)
chkmin(Min, j - i + 2);
i = j;
}
int flag = 1;
REP(i, 2, m) flag &= (s[i] == s[1]);
dp[1] = sum[1] = 1;
REP(i, 2, n + 1) {
if (flag) {
dp[i] = sum[i - 2];
sum[i] = (sum[i - 1] + dp[i]) % mod;
} else {
dp[i] = (sum[i - 2] - sum[max(i - Min - 3, 0)] + mod) % mod;
sum[i] = (sum[i - 2] + dp[i]) % mod;
}
}
int ans = (dp[n + 1] * 2 + flag) % mod;
REP(i, 1, n - 2)
if (((n - i) % 2 == 1 && n - i <= Min) || flag) ans =
(ans + (ll)dp[i] * (n - i - 1)) % mod;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> inline bool chkmax(T &x, T y) {
return (y > x) ? (x = y, 1) : 0;
}
inline int read() {
int x;
char c;
int f = 1;
while ((c = getchar()) != '-' && (c > '9' || c < '0'))
;
if (c == '-')
f = -1, c = getchar();
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ '0');
return x * f;
}
inline ll readll() {
ll x;
char c;
int f = 1;
while ((c = getchar()) != '-' && (c > '9' || c < '0'))
;
if (c == '-')
f = -1, c = getchar();
x = c ^ '0';
while ((c = getchar()) >= '0' && c <= '9')
x = (x << 1ll) + (x << 3ll) + (c ^ '0');
return x * f;
}
const int maxn = 2e5 + 10, inf = 0x3f3f3f3f, mod = 1e9 + 7;
char s[maxn];
inline int ksm(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = (ll)res * x % mod;
y >>= 1;
x = (ll)x * x % mod;
}
return res;
}
int dp[maxn], sum[maxn];
int main() {
int n = read(), m = read();
scanf("%s", s + 1);
int Min = inf;
for (int i = 1, j; i <= m; i++)
if (s[i] == s[1]) {
j = i;
while (j < m && s[j + 1] == s[1])
++j;
if (j != m) {
if ((j - i + 1) % 2 == 1)
chkmin(Min, j - i + 1);
else if (i == 1)
chkmin(Min, j - i + 2);
}
i = j;
}
int flag = 1;
REP(i, 2, m) flag &= (s[i] == s[1]);
dp[1] = sum[1] = 1;
REP(i, 2, n + 1) {
if (flag) {
dp[i] = sum[i - 2];
sum[i] = (sum[i - 1] + dp[i]) % mod;
} else {
dp[i] = (sum[i - 2] - sum[max(i - Min - 3, 0)] + mod) % mod;
sum[i] = (sum[i - 2] + dp[i]) % mod;
}
}
int ans = (dp[n + 1] * 2 + flag) % mod;
REP(i, 1, n - 2)
if (((n - i) % 2 == 1 && n - i <= Min) || flag) ans =
(ans + (ll)dp[i] * (n - i - 1)) % mod;
printf("%d\n", ans);
return 0;
}
| replace | 59 | 65 | 59 | 65 | TLE | |
p03057 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
char s[Q];
int n, m;
const int MOD = 1e9 + 7;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int sub(int a, int b) {
a -= b;
return a < 0 ? a + MOD : a;
}
inline int mul(int a, int b) { return 1LL * a * b % MOD; }
int dp[Q];
void DP(int n, int lim) {
dp[0] = 1;
int sm = 1;
for (int i = 1; i <= n; i++) {
if (i > lim)
sm = sub(sm, dp[i - lim - 1]);
dp[i] = sm;
sm = add(sm, dp[i]);
}
}
void s1() {
exit(-1);
dp[0] = 1;
int sm = 0;
for (int i = 1; i <= n; i++) {
if (i >= 2)
sm = add(sm, dp[i - 2]);
dp[i] = sm;
}
int als = 1;
for (int i = 2; i <= n; i++) {
als = add(als, mul(i, dp[n - i]));
}
printf("%d\n", als);
}
void s2(int fir) {
if (n & 1) {
puts("0");
return;
}
int mus = fir + (fir % 2 == 0);
for (int len = 0, i = fir + 2; i <= m; i++) {
if (s[i] == s[1])
++len;
else {
if (len & 1)
mus = min(mus, len);
len = 0;
}
}
n /= 2, mus = (mus + 1) / 2;
// printf("%d %d WCNM\n",n,mus);
DP(n, mus);
// for(int i=0;i<=n;i++)
// printf("%d ????\n",dp[i]);
int als = 0;
for (int i = 1; i <= n && i <= mus; i++) {
als = add(als, mul(2 * i, dp[n - i]));
}
printf("%d", als);
}
int main() {
scanf("%d%d%s", &n, &m, s + 1);
for (int i = 2; i <= m; i++)
if (s[i] != s[1]) {
s2(i - 1);
return 0;
}
s1();
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
char s[Q];
int n, m;
const int MOD = 1e9 + 7;
inline int add(int a, int b) {
a += b;
return a >= MOD ? a - MOD : a;
}
inline int sub(int a, int b) {
a -= b;
return a < 0 ? a + MOD : a;
}
inline int mul(int a, int b) { return 1LL * a * b % MOD; }
int dp[Q];
void DP(int n, int lim) {
dp[0] = 1;
int sm = 1;
for (int i = 1; i <= n; i++) {
if (i > lim)
sm = sub(sm, dp[i - lim - 1]);
dp[i] = sm;
sm = add(sm, dp[i]);
}
}
void s1() {
dp[0] = 1;
int sm = 0;
for (int i = 1; i <= n; i++) {
if (i >= 2)
sm = add(sm, dp[i - 2]);
dp[i] = sm;
}
int als = 1;
for (int i = 2; i <= n; i++) {
als = add(als, mul(i, dp[n - i]));
}
printf("%d\n", als);
}
void s2(int fir) {
if (n & 1) {
puts("0");
return;
}
int mus = fir + (fir % 2 == 0);
for (int len = 0, i = fir + 2; i <= m; i++) {
if (s[i] == s[1])
++len;
else {
if (len & 1)
mus = min(mus, len);
len = 0;
}
}
n /= 2, mus = (mus + 1) / 2;
// printf("%d %d WCNM\n",n,mus);
DP(n, mus);
// for(int i=0;i<=n;i++)
// printf("%d ????\n",dp[i]);
int als = 0;
for (int i = 1; i <= n && i <= mus; i++) {
als = add(als, mul(2 * i, dp[n - i]));
}
printf("%d", als);
}
int main() {
scanf("%d%d%s", &n, &m, s + 1);
for (int i = 2; i <= m; i++)
if (s[i] != s[1]) {
s2(i - 1);
return 0;
}
s1();
return 0;
} | delete | 29 | 30 | 29 | 29 | 0 | |
p03058 | C++ | Time Limit Exceeded | #ifndef LOCAL
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long int int64;
const int N = 2005;
const int BLOCK = 64;
const int BLM = BLOCK - 1;
const int SZ = N / BLOCK + 1;
int nei[N];
int nsz;
struct BS {
unsigned long long a[SZ];
BS() : a() {}
void doXor(int pos) { a[pos / BLOCK] ^= (1ULL << (pos & BLM)); }
unsigned long long get(int pos) { return (a[pos / BLOCK] >> (pos & BLM)); }
void operator|=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] |= A.a[i];
}
void operator&=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] &= A.a[i];
}
void operator*=(const BS &A) // & not
{
for (int i = 0; i < SZ; i++)
a[i] &= ~A.a[i];
}
void operator^=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] ^= A.a[i];
}
void copyFrom(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] = A.a[i];
}
void getNei() const {
for (int i = 0; i < SZ; i++) {
if (a[i] == 0)
continue;
for (int j = 0; j < BLOCK; j++)
if ((a[i] >> j) & 1ULL)
nei[nsz++] = i * BLOCK + j;
}
}
void clear() { memset(a, 0, sizeof a); }
};
vector<int> t[N];
BS g[N];
BS good[N * N / 2];
int pairId(int x, int y) {
if (x == y)
throw;
if (x < y)
swap(x, y);
return x * (x + 1) / 2 + y;
}
BS cur;
BS subTree[N];
void dfsSubtree(int v, int par) {
subTree[v].clear();
subTree[v].doXor(v);
for (int to : t[v]) {
if (to == par)
continue;
dfsSubtree(to, v);
subTree[v] ^= subTree[to];
}
}
void dfsCalc(int v, int par, int root) {
if (v != root)
good[pairId(v, root)].copyFrom(cur);
for (int to : t[v]) {
if (to == par)
continue;
if (v != root) {
cur ^= subTree[v];
cur.doXor(v);
cur ^= subTree[to];
}
dfsCalc(to, v, root);
if (v != root)
cur.copyFrom(good[pairId(v, root)]);
}
}
int main(int, char **) {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n - 1; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
t[a].push_back(b);
t[b].push_back(a);
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
g[a].doXor(b);
g[b].doXor(a);
}
for (int i = 0; i < n; i++) {
cur.clear();
dfsSubtree(i, i);
cur.copyFrom(subTree[i]);
dfsCalc(i, i, i);
}
vector<pair<int, int>> qu;
for (int i = 0; i < n; i++) {
nsz = 0;
g[i].getNei();
for (int j = 0; j < nsz; j++)
qu.emplace_back(i, nei[j]);
}
for (int it = 0; it < (int)qu.size(); it++) {
int a = qu[it].first, b = qu[it].second;
if (g[b].get(a) == 0) {
g[b].doXor(a);
qu.emplace_back(b, a);
}
cur.copyFrom(good[pairId(a, b)]);
cur &= g[b];
cur *= g[a];
nsz = 0;
cur.getNei();
for (int i = 0; i < nsz; i++) {
int v = nei[i];
if (v == a)
continue;
g[a].doXor(v);
g[v].doXor(a);
qu.emplace_back(a, v);
qu.emplace_back(v, a);
}
}
printf("%d\n", (int)qu.size() / 2);
return 0;
}
| #ifndef LOCAL
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long int int64;
const int N = 2005;
const int BLOCK = 64;
const int BLM = BLOCK - 1;
const int SZ = N / BLOCK + 1;
int nei[N];
int nsz;
struct BS {
unsigned long long a[SZ];
BS() : a() {}
void doXor(int pos) { a[pos / BLOCK] ^= (1ULL << (pos & BLM)); }
unsigned long long get(int pos) { return (a[pos / BLOCK] >> (pos & BLM)); }
void operator|=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] |= A.a[i];
}
void operator&=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] &= A.a[i];
}
void operator*=(const BS &A) // & not
{
for (int i = 0; i < SZ; i++)
a[i] &= ~A.a[i];
}
void operator^=(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] ^= A.a[i];
}
void copyFrom(const BS &A) {
for (int i = 0; i < SZ; i++)
a[i] = A.a[i];
}
void getNei() const {
for (int i = 0; i < SZ; i++) {
if (a[i] == 0)
continue;
for (int h = 0; h < 8; h++) {
if (((a[i] >> (h * 8)) & 255) == 0)
continue;
for (int j = 8 * h; j < 8 * h + 8; j++)
if ((a[i] >> j) & 1ULL)
nei[nsz++] = i * BLOCK + j;
}
}
}
void clear() { memset(a, 0, sizeof a); }
};
vector<int> t[N];
BS g[N];
BS good[N * N / 2];
int pairId(int x, int y) {
if (x == y)
throw;
if (x < y)
swap(x, y);
return x * (x + 1) / 2 + y;
}
BS cur;
BS subTree[N];
void dfsSubtree(int v, int par) {
subTree[v].clear();
subTree[v].doXor(v);
for (int to : t[v]) {
if (to == par)
continue;
dfsSubtree(to, v);
subTree[v] ^= subTree[to];
}
}
void dfsCalc(int v, int par, int root) {
if (v != root)
good[pairId(v, root)].copyFrom(cur);
for (int to : t[v]) {
if (to == par)
continue;
if (v != root) {
cur ^= subTree[v];
cur.doXor(v);
cur ^= subTree[to];
}
dfsCalc(to, v, root);
if (v != root)
cur.copyFrom(good[pairId(v, root)]);
}
}
int main(int, char **) {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n - 1; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
t[a].push_back(b);
t[b].push_back(a);
}
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
g[a].doXor(b);
g[b].doXor(a);
}
for (int i = 0; i < n; i++) {
cur.clear();
dfsSubtree(i, i);
cur.copyFrom(subTree[i]);
dfsCalc(i, i, i);
}
vector<pair<int, int>> qu;
for (int i = 0; i < n; i++) {
nsz = 0;
g[i].getNei();
for (int j = 0; j < nsz; j++)
qu.emplace_back(i, nei[j]);
}
for (int it = 0; it < (int)qu.size(); it++) {
int a = qu[it].first, b = qu[it].second;
if (g[b].get(a) == 0) {
g[b].doXor(a);
qu.emplace_back(b, a);
}
cur.copyFrom(good[pairId(a, b)]);
cur &= g[b];
cur *= g[a];
nsz = 0;
cur.getNei();
for (int i = 0; i < nsz; i++) {
int v = nei[i];
if (v == a)
continue;
g[a].doXor(v);
g[v].doXor(a);
qu.emplace_back(a, v);
qu.emplace_back(v, a);
}
}
printf("%d\n", (int)qu.size() / 2);
return 0;
}
| replace | 71 | 74 | 71 | 78 | TLE | |
p03058 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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;
}
template <typename T> class segtree {
private:
int n, sz;
vector<pair<T, int>> node;
public:
void resize(vector<T> &v) {
sz = (int)v.size();
n = 1;
while (n < sz) {
n *= 2;
}
node.resize(2 * n);
for (int i = 0; i < sz; i++) {
node[i + n] = make_pair(v[i], i);
}
for (int i = n - 1; i >= 1; i--) {
node[i] = min(node[2 * i], node[2 * i + 1]);
}
}
void update(int k, T a) {
node[k += n] = make_pair(a, k);
while (k >>= 1) {
node[k] = min(node[2 * k], node[2 * k + 1]);
}
}
pair<T, int> query(int a, int b) {
pair<T, int> res1 = make_pair(numeric_limits<T>::max(), -1);
pair<T, int> res2 = make_pair(numeric_limits<T>::max(), -1);
a += n, b += n;
while (a != b) {
if (a % 2)
res1 = min(res1, node[a++]);
if (b % 2)
res2 = min(res2, node[--b]);
a >>= 1, b >>= 1;
}
return min(res1, res2);
}
};
class LCA {
public:
int V;
vector<vector<int>> G;
vector<int> ord;
int depth[2001];
int id[2001];
int lca[2001][2001];
segtree<int> st;
LCA(){};
LCA(int node_size) : V(node_size), G(V) {
for (int i = 0; i < V; i++) {
id[i] = -1;
depth[i] = 0;
}
}
void add_edge(int from, int to) {
G[from].push_back(to), G[to].push_back(from);
}
void dfs(int u, int p, int k) {
id[u] = (int)ord.size();
ord.push_back(u);
depth[u] = k;
for (int v : G[u]) {
if (v != p) {
dfs(v, u, k + 1);
ord.push_back(u);
}
}
}
void build() {
ord.reserve(2 * V - 2);
for (int i = 0; i < V; i++) {
if (id[i] < 0) {
dfs(i, -1, 0);
}
}
vector<int> stvec(2 * V - 2);
for (int i = 0; i < 2 * V - 2; i++) {
stvec[i] = depth[ord[i]];
}
st.resize(stvec);
}
void Solve() {
for (int i = 0; i < V; i++) {
for (int j = i; j < V; j++) {
lca[i][j] =
ord[st.query(min(id[i], id[j]), max(id[i], id[j]) + 1).second];
}
}
}
int solve(int u, int v) {
if (u > v)
swap(u, v);
return lca[u][v];
}
int dist(int u, int v) {
if (u > v)
swap(u, v);
int lcaa = lca[u][v];
return depth[u] + depth[v] - 2 * depth[lcaa];
}
};
int n, m;
vector<vector<int>> g;
pair<int, int> p[2001];
vector<vector<int>> h;
LCA lca;
void edgeinit(int id) {
if (p[id].first == -1)
return;
if (p[id].first == p[id].second) {
p[id] = MP(-1, -1);
return;
}
if (id == m)
return;
for (int i = 0; i < m; i++) {
if (i == id)
continue;
if (p[i].first == -1)
continue;
if (p[i].first == p[id].first && p[i].second == p[id].second) {
p[i] = MP(-1, -1);
continue;
}
if (p[i].first == p[i].second) {
p[i] = MP(-1, -1);
}
if (p[i].first == p[id].first) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].second, p[id].second);
if (a - b == c) {
p[i] = MP(p[i].second, p[id].second);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].second, p[id].second);
edgeinit(id);
}
} else if (p[i].first == p[id].second) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].second, p[id].first);
if (a - b == c) {
p[i] = MP(p[i].second, p[id].first);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].second, p[id].first);
edgeinit(id);
}
} else if (p[i].second == p[id].first) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].first, p[id].second);
if (a - b == c) {
p[i] = MP(p[i].first, p[id].second);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].first, p[id].second);
edgeinit(id);
}
} else if (p[i].second == p[id].second) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].first, p[id].first);
if (a - b == c) {
p[i] = MP(p[i].first, p[id].first);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].first, p[id].first);
edgeinit(id);
}
}
}
}
int calc(int id) {
queue<pair<int, int>> q;
q.push(MP(id, id));
int s = 0;
while (!q.empty()) {
auto x = q.front();
q.pop();
int dd = x.first;
int pp = x.second;
for (auto y : h[dd]) {
if (lca.dist(pp, y) == lca.dist(pp, dd) + lca.dist(dd, y)) {
s++;
q.push(MP(y, dd));
}
}
}
return s;
}
int main() {
cin >> n >> m;
lca = LCA(n);
g.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
lca.add_edge(a, b);
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, m) {
int c, d;
cin >> c >> d;
c--;
d--;
p[i] = (MP(c, d));
}
lca.build();
lca.Solve();
rep(i, m) { edgeinit(i); }
h.resize(n);
rep(i, m) {
if (p[i].first == -1)
continue;
h[p[i].first].push_back(p[i].second);
h[p[i].second].push_back(p[i].first);
}
int res = 0;
rep(i, n) {
res += calc(i);
// cerr << i << " " << res << endl;
}
cout << res / 2 << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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;
}
template <typename T> class segtree {
private:
int n, sz;
vector<pair<T, int>> node;
public:
void resize(vector<T> &v) {
sz = (int)v.size();
n = 1;
while (n < sz) {
n *= 2;
}
node.resize(2 * n);
for (int i = 0; i < sz; i++) {
node[i + n] = make_pair(v[i], i);
}
for (int i = n - 1; i >= 1; i--) {
node[i] = min(node[2 * i], node[2 * i + 1]);
}
}
void update(int k, T a) {
node[k += n] = make_pair(a, k);
while (k >>= 1) {
node[k] = min(node[2 * k], node[2 * k + 1]);
}
}
pair<T, int> query(int a, int b) {
pair<T, int> res1 = make_pair(numeric_limits<T>::max(), -1);
pair<T, int> res2 = make_pair(numeric_limits<T>::max(), -1);
a += n, b += n;
while (a != b) {
if (a % 2)
res1 = min(res1, node[a++]);
if (b % 2)
res2 = min(res2, node[--b]);
a >>= 1, b >>= 1;
}
return min(res1, res2);
}
};
class LCA {
public:
int V;
vector<vector<int>> G;
vector<int> ord;
int depth[2001];
int id[2001];
int lca[2001][2001];
segtree<int> st;
LCA(){};
LCA(int node_size) : V(node_size), G(V) {
for (int i = 0; i < V; i++) {
id[i] = -1;
depth[i] = 0;
}
}
void add_edge(int from, int to) {
G[from].push_back(to), G[to].push_back(from);
}
void dfs(int u, int p, int k) {
id[u] = (int)ord.size();
ord.push_back(u);
depth[u] = k;
for (int v : G[u]) {
if (v != p) {
dfs(v, u, k + 1);
ord.push_back(u);
}
}
}
void build() {
ord.reserve(2 * V - 2);
for (int i = 0; i < V; i++) {
if (id[i] < 0) {
dfs(i, -1, 0);
}
}
vector<int> stvec(2 * V - 2);
for (int i = 0; i < 2 * V - 2; i++) {
stvec[i] = depth[ord[i]];
}
st.resize(stvec);
}
void Solve() {
for (int i = 0; i < V; i++) {
for (int j = i; j < V; j++) {
lca[i][j] =
ord[st.query(min(id[i], id[j]), max(id[i], id[j]) + 1).second];
}
}
}
int solve(int u, int v) {
if (u > v)
swap(u, v);
return lca[u][v];
}
int dist(int u, int v) {
if (u > v)
swap(u, v);
int lcaa = lca[u][v];
return depth[u] + depth[v] - 2 * depth[lcaa];
}
};
int n, m;
vector<vector<int>> g;
pair<int, int> p[2001];
vector<vector<int>> h;
LCA lca;
void edgeinit(int id) {
if (p[id].first == -1)
return;
if (p[id].first == p[id].second) {
p[id] = MP(-1, -1);
return;
}
if (id == m)
return;
for (int i = 0; i < m; i++) {
if (i == id)
continue;
if (p[i].first == -1)
continue;
if (p[i].first == p[id].first && p[i].second == p[id].second) {
p[i] = MP(-1, -1);
continue;
}
if (p[i].first == p[i].second) {
p[i] = MP(-1, -1);
}
if (p[i].first == p[id].first) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].second, p[id].second);
if (a - b == c) {
p[i] = MP(p[i].second, p[id].second);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].second, p[id].second);
edgeinit(id);
}
} else if (p[i].first == p[id].second) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].second, p[id].first);
if (a - b == c) {
p[i] = MP(p[i].second, p[id].first);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].second, p[id].first);
edgeinit(id);
}
} else if (p[i].second == p[id].first) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].first, p[id].second);
if (a - b == c) {
p[i] = MP(p[i].first, p[id].second);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].first, p[id].second);
edgeinit(id);
}
} else if (p[i].second == p[id].second) {
int a = lca.dist(p[i].first, p[i].second);
int b = lca.dist(p[id].first, p[id].second);
int c = lca.dist(p[i].first, p[id].first);
if (a - b == c) {
p[i] = MP(p[i].first, p[id].first);
edgeinit(i);
} else if (b - a == c) {
p[id] = MP(p[i].first, p[id].first);
edgeinit(id);
}
}
}
}
int calc(int id) {
queue<pair<int, int>> q;
q.push(MP(id, id));
int s = 0;
while (!q.empty()) {
auto x = q.front();
q.pop();
int dd = x.first;
int pp = x.second;
for (auto y : h[dd]) {
if (lca.dist(pp, y) == lca.dist(pp, dd) + lca.dist(dd, y)) {
s++;
q.push(MP(y, dd));
}
}
}
return s;
}
int main() {
cin >> n >> m;
lca = LCA(n);
g.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
lca.add_edge(a, b);
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, m) {
int c, d;
cin >> c >> d;
c--;
d--;
p[i] = (MP(c, d));
}
lca.build();
lca.Solve();
rep(i, m) { edgeinit(m - 1 - i); }
h.resize(n);
rep(i, m) {
if (p[i].first == -1)
continue;
h[p[i].first].push_back(p[i].second);
h[p[i].second].push_back(p[i].first);
}
int res = 0;
rep(i, n) {
res += calc(i);
// cerr << i << " " << res << endl;
}
cout << res / 2 << endl;
return 0;
} | replace | 274 | 275 | 274 | 275 | TLE | |
p03058 | C++ | Time Limit Exceeded | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.o:--...```..---+/`
`/y+o/---....---:+o.
`...````-os+/:---:/+o/--.`
`-/+++++/:. `...` :h+d+oooo+/+-` ...
`/++//:::://++-`....` -.`//````````:` `..`
`o+/::------://o/` `-` -. -` `..`
`---.-o/:./o/::-..``..-ЗАПУСКАЕМ .. .. -` `... ``..``
`....o+:-++/:--.```..-://s. `-` .- -` `-o:
.-//::::/:-`
`:s+/:--....-::/+s-` .- `- -` -///:--------:/:`
./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ
`+:--........--:/`
.:ooo+++++osso-` `.:-...`/` ./::-------:/:` -`
:+--..``````.--:+:...-+:-`
`.-/+++++/+-.-` -. ``:so:/:--.......--:+`
`-```````o+/+--..`````..--:o/-..:s+:.
```````:``.. `-` -`
`+:--..`````..--/+-.../.`````..-o:--.......---/o. `
`: `:- -. .o:--..`` ``..--:o` `-`
`:o+:--------:+o-`
`-`-... .. .o/--...```..--:+/` `-`
`oy/so/////++o/.`
-/` `-` `- ``+s/o/:---...---:++. `-`
.-../d://///:-.`
`.---..``-..- .-/..`````-oo+/:::::/+o+- `-``-` `-.
````
`:++++/+++++- ..``.-/:` /y-:/++o++/:.`..` ./. `-
-++/::::::://+/..:-``:` .. `-.` ```.``` `..` `..`-` `-
`` -o//:--....-::/++` -.-` `-`.-` `..`..` `-.-
-----ss+:++/:--.```..-://s. /. `:: `-:. ./`
`````/:..+o/::-..``.--:/+s. ..-` `-``-` ..` `-` `-`-`
`-s+/::-----::/+oo---``-` .. .:- ``` .-` .-.- `-`
`:oo+//::://+os/..:`..-/:` :y.-:::::::.`.-` ./-` `-`
`./+oooooooo+/.`- .-:...`.. .//:-------://` `- `..` `:.
``.-::::-.``-/` `-` `- `oo:+:--.......--:/` `-
`.:--h.``..```
-.-`.- .- `+:--..`````..--//` `-
/s-//::::::::.
-` `/- .. .o:--..`` ``..--:o.```.-
`//:--------://`
-` .-`.-`
-.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`
..`-. `-. ``:os:o/:---...---:++. `-
``///+:-..``````.--:+-````-.`
`.:///////.-` .:-..` -``-+o+/:::::/+o/. `-
`:+:-..`````..--:o/:--/ys+-
`-++///////+o/. ``....`-. :` `.:++++++/:.` .- -o/---......---/o.
`.`
`++//:-----::/+o:..` .-` : ``````` .- `+so+:--------:++-`
`````:-``:o/::-..`..--:/+o` -. `- .- `../../+o+////+o+:.`
-----syo/o+/:--.```..-://s. .-` `- .- `...
``-:////:-``
.` `/s//:--....-::/+s. -. `-` .- `..`
.+o+/:::--:://+s/-..` .::+y ``` .- `..`
./oo++////+oso-` `.... :y-+:::::::/` ...
`.:+oooooo/-` `....-. .//:-------:/:-.`
``...`` /+:+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.+/--...```..--:+/`
`-o/:---...---:++.
`-+o+/:---:/+o/.
`.:+oooo+/-.`
``````
*/
#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <limits>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define umap unordered_map
#define uset unordered_set
#define elif else if
#define len(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n)-1); i >= 0; i--)
#define apply(v, act) \
for (auto &x : v) { \
act; \
}
#define log(args...) \
{ \
string s = #args; \
deque<string> deq; \
string buf = ""; \
int bal = 0; \
for (char c : s) { \
if (c == '(' || c == '[' || c == '{') { \
bal++; \
} else if (c == ')' || c == ']' || c == '}') { \
bal--; \
} else { \
if (bal == 0) { \
if (c == ',') { \
deq.pb(buf); \
buf = ""; \
} else { \
if (c != ' ') { \
buf += c; \
} \
} \
} \
} \
} \
if (!buf.empty()) { \
deq.pb(buf); \
} \
smart_io::precall_print(); \
smart_io::_print(deq, args); \
}
inline int min(const int &x, const int &y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x;
}
inline int max(const int &x, const int &y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y;
}
inline long long min(const long long &x, const long long &y) {
return (((y - x) >> (64 - 1)) & (x ^ y)) ^ x;
}
inline long long max(const long long &x, const long long &y) {
return (((y - x) >> (64 - 1)) & (x ^ y)) ^ y;
}
#define print \
smart_io::precall_print(); \
cout,
#define scan cin,
#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void *operator new(size_t _x) {
_ptr += _x;
assert(_ptr < MAXMEM);
return _memory + _ptr - _x;
}
void operator delete(void *) noexcept {}
#endif
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
scanf("%c", &x);
if (x == '\n') {
fast_scan(x);
}
}
void fast_scan(string &x) {
scanf("%s", string_in_buffer);
x = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
fast_scan(p.first);
fast_scan(p.second);
}
template <class T> void fast_scan(vector<T> &v) {
for (auto &x : v)
fast_scan(x);
}
void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const char &x) { printf("%c", x); };
void fast_print(__int128 x) {
if (x == 0) {
fast_print('0');
return;
}
if (x < 0) {
fast_print('-');
x = -x;
}
__int128 p = 1;
while (x / (p * 10))
p *= 10;
while (p) {
__int128 symb = x / p;
fast_print((int)symb);
x -= p * symb;
p /= 10;
}
};
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const string &x) { printf("%s", x.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
fast_print(p.first);
fast_print(' ');
fast_print(p.second);
}
template <class T> void fast_print(const vector<T> &v) {
if (v.empty())
return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print(' ');
fast_print(v[i]);
}
}
template <class T> void fast_print(const vector<vector<T>> &v) {
if (v.empty())
return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print('\n');
fast_print(v[i]);
}
}
template <class T> void fast_print(const T &v) {
for (const auto &x : v) {
fast_print(x);
fast_print(' ');
}
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
fast_print(print_start);
print_start = "\n";
first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
if (!first_print) {
fast_print("\n");
} else {
first_print = false;
}
fast_print(names.front());
fast_print(" = ");
fast_print(elem);
names.pop_front();
_print(names, args...);
}
} // namespace smart_io
template <class T> ostream &operator,(ostream &os, const T &object) {
if (!smart_io::first_print) {
fast_print(smart_io::sep);
} else {
smart_io::first_print = false;
}
fast_print(object);
return os;
}
template <class T> istream &operator,(istream &is, T &object) {
fast_scan(object);
return is;
}
namespace random {
using namespace std::chrono;
mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch())
.count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
}; // namespace random
namespace typedefs {
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long double ld;
} // namespace typedefs
namespace numbers_operation {
template <class T> T floor_mod(T a, T b) {
if (a >= 0 && b >= 0)
return a % b;
if (a <= 0 && b <= 0)
return a % b;
return abs(b) - (abs(a) % abs(b));
}
} // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
using namespace random;
const int N = 2000;
int n, m;
// vector<vector<int>> t, g;
vector<vector<int>> t;
bitset<N> g[2000];
bitset<N> in_path[2000][2000];
bitset<N> in_tree[2000];
void calc_in_tree(int v, int _p) {
in_tree[v] = 0;
in_tree[v][v] = 1;
for (int sub : t[v]) {
if (sub == _p)
continue;
calc_in_tree(sub, v);
in_tree[v] = (in_tree[v] | in_tree[sub]);
}
}
void dfs(int v, int _p, int base) {
for (int sub : t[v]) {
if (sub == _p)
continue;
in_path[base][sub] = (in_path[base][v] ^ in_tree[v] ^ in_tree[sub]);
in_path[base][sub][v] = 1;
dfs(sub, v, base);
}
}
// void add_edge(int a, int b) {
// if (g[a][b] == 1) return;
// g[a][b] = g[b][a] = 1;
// bitset<N> alt = (((g[a] & (~g[b])) | (g[b] & (~g[a]))) & in_path[a][b]);
// for (int i = alt._Find_first(); i < N; i = alt._Find_next(i)) {
// // for (int i = 0; i < N; i++) {
// if (!alt[i]) continue;
// if (a == i || b == i) continue;
// add_edge(b, i);
// add_edge(a, i);
// }
// }
void print_bitset(bitset<N> bt) {
string s = "";
for (int i = 0; i < 10; i++) {
s += (bt[i] ? '1' : '0');
}
print s;
}
signed main(signed argc, char *argv[]) {
scan n, m;
t.resize(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
scan a, b;
a--;
b--;
t[a].pb(b);
t[b].pb(a);
}
for (int i = 0; i < n; i++) {
in_path[i][i] = (~in_path[i][i]);
calc_in_tree(i, -1);
for (int sub : t[i]) {
in_path[i][sub] = in_path[i][i];
dfs(sub, i, i);
}
}
for (int i = 0; i < m; i++) {
int a, b;
scan a, b;
a--;
b--;
if (g[a][b])
continue;
g[a][b] = g[b][a] = 1;
vector<pii> deq;
deq.emplace_back(a, b);
while (!deq.empty()) {
tie(a, b) = deq.back();
deq.pop_back();
bitset<N> alt = (((g[a] ^ g[b])) & in_path[a][b]);
// for (int i = alt._Find_first(); i < N; i = alt._Find_next(i)) {
for (int i = 0; i < N; i++) {
if (!alt[i])
continue;
if (a == i || b == i)
continue;
if (!(g[b][i]))
deq.emplace_back(b, i);
if (!(g[a][i]))
deq.emplace_back(a, i);
g[b][i] = g[i][b] = g[a][i] = g[i][a] = 1;
}
}
}
int edges = 0;
for (int i = 0; i < n; i++) {
edges += g[i].count();
}
print edges / 2;
}
| /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.o:--...```..---+/`
`/y+o/---....---:+o.
`...````-os+/:---:/+o/--.`
`-/+++++/:. `...` :h+d+oooo+/+-` ...
`/++//:::://++-`....` -.`//````````:` `..`
`o+/::------://o/` `-` -. -` `..`
`---.-o/:./o/::-..``..-ЗАПУСКАЕМ .. .. -` `... ``..``
`....o+:-++/:--.```..-://s. `-` .- -` `-o:
.-//::::/:-`
`:s+/:--....-::/+s-` .- `- -` -///:--------:/:`
./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ
`+:--........--:/`
.:ooo+++++osso-` `.:-...`/` ./::-------:/:` -`
:+--..``````.--:+:...-+:-`
`.-/+++++/+-.-` -. ``:so:/:--.......--:+`
`-```````o+/+--..`````..--:o/-..:s+:.
```````:``.. `-` -`
`+:--..`````..--/+-.../.`````..-o:--.......---/o. `
`: `:- -. .o:--..`` ``..--:o` `-`
`:o+:--------:+o-`
`-`-... .. .o/--...```..--:+/` `-`
`oy/so/////++o/.`
-/` `-` `- ``+s/o/:---...---:++. `-`
.-../d://///:-.`
`.---..``-..- .-/..`````-oo+/:::::/+o+- `-``-` `-.
````
`:++++/+++++- ..``.-/:` /y-:/++o++/:.`..` ./. `-
-++/::::::://+/..:-``:` .. `-.` ```.``` `..` `..`-` `-
`` -o//:--....-::/++` -.-` `-`.-` `..`..` `-.-
-----ss+:++/:--.```..-://s. /. `:: `-:. ./`
`````/:..+o/::-..``.--:/+s. ..-` `-``-` ..` `-` `-`-`
`-s+/::-----::/+oo---``-` .. .:- ``` .-` .-.- `-`
`:oo+//::://+os/..:`..-/:` :y.-:::::::.`.-` ./-` `-`
`./+oooooooo+/.`- .-:...`.. .//:-------://` `- `..` `:.
``.-::::-.``-/` `-` `- `oo:+:--.......--:/` `-
`.:--h.``..```
-.-`.- .- `+:--..`````..--//` `-
/s-//::::::::.
-` `/- .. .o:--..`` ``..--:o.```.-
`//:--------://`
-` .-`.-`
-.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`
..`-. `-. ``:os:o/:---...---:++. `-
``///+:-..``````.--:+-````-.`
`.:///////.-` .:-..` -``-+o+/:::::/+o/. `-
`:+:-..`````..--:o/:--/ys+-
`-++///////+o/. ``....`-. :` `.:++++++/:.` .- -o/---......---/o.
`.`
`++//:-----::/+o:..` .-` : ``````` .- `+so+:--------:++-`
`````:-``:o/::-..`..--:/+o` -. `- .- `../../+o+////+o+:.`
-----syo/o+/:--.```..-://s. .-` `- .- `...
``-:////:-``
.` `/s//:--....-::/+s. -. `-` .- `..`
.+o+/:::--:://+s/-..` .::+y ``` .- `..`
./oo++////+oso-` `.... :y-+:::::::/` ...
`.:+oooooo/-` `....-. .//:-------:/:-.`
``...`` /+:+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.+/--...```..--:+/`
`-o/:---...---:++.
`-+o+/:---:/+o/.
`.:+oooo+/-.`
``````
*/
#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <limits>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define umap unordered_map
#define uset unordered_set
#define elif else if
#define len(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n)-1); i >= 0; i--)
#define apply(v, act) \
for (auto &x : v) { \
act; \
}
#define log(args...) \
{ \
string s = #args; \
deque<string> deq; \
string buf = ""; \
int bal = 0; \
for (char c : s) { \
if (c == '(' || c == '[' || c == '{') { \
bal++; \
} else if (c == ')' || c == ']' || c == '}') { \
bal--; \
} else { \
if (bal == 0) { \
if (c == ',') { \
deq.pb(buf); \
buf = ""; \
} else { \
if (c != ' ') { \
buf += c; \
} \
} \
} \
} \
} \
if (!buf.empty()) { \
deq.pb(buf); \
} \
smart_io::precall_print(); \
smart_io::_print(deq, args); \
}
inline int min(const int &x, const int &y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x;
}
inline int max(const int &x, const int &y) {
return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y;
}
inline long long min(const long long &x, const long long &y) {
return (((y - x) >> (64 - 1)) & (x ^ y)) ^ x;
}
inline long long max(const long long &x, const long long &y) {
return (((y - x) >> (64 - 1)) & (x ^ y)) ^ y;
}
#define print \
smart_io::precall_print(); \
cout,
#define scan cin,
#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void *operator new(size_t _x) {
_ptr += _x;
assert(_ptr < MAXMEM);
return _memory + _ptr - _x;
}
void operator delete(void *) noexcept {}
#endif
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
scanf("%c", &x);
if (x == '\n') {
fast_scan(x);
}
}
void fast_scan(string &x) {
scanf("%s", string_in_buffer);
x = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
fast_scan(p.first);
fast_scan(p.second);
}
template <class T> void fast_scan(vector<T> &v) {
for (auto &x : v)
fast_scan(x);
}
void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const char &x) { printf("%c", x); };
void fast_print(__int128 x) {
if (x == 0) {
fast_print('0');
return;
}
if (x < 0) {
fast_print('-');
x = -x;
}
__int128 p = 1;
while (x / (p * 10))
p *= 10;
while (p) {
__int128 symb = x / p;
fast_print((int)symb);
x -= p * symb;
p /= 10;
}
};
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const string &x) { printf("%s", x.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
fast_print(p.first);
fast_print(' ');
fast_print(p.second);
}
template <class T> void fast_print(const vector<T> &v) {
if (v.empty())
return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print(' ');
fast_print(v[i]);
}
}
template <class T> void fast_print(const vector<vector<T>> &v) {
if (v.empty())
return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print('\n');
fast_print(v[i]);
}
}
template <class T> void fast_print(const T &v) {
for (const auto &x : v) {
fast_print(x);
fast_print(' ');
}
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
fast_print(print_start);
print_start = "\n";
first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
if (!first_print) {
fast_print("\n");
} else {
first_print = false;
}
fast_print(names.front());
fast_print(" = ");
fast_print(elem);
names.pop_front();
_print(names, args...);
}
} // namespace smart_io
template <class T> ostream &operator,(ostream &os, const T &object) {
if (!smart_io::first_print) {
fast_print(smart_io::sep);
} else {
smart_io::first_print = false;
}
fast_print(object);
return os;
}
template <class T> istream &operator,(istream &is, T &object) {
fast_scan(object);
return is;
}
namespace random {
using namespace std::chrono;
mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch())
.count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
}; // namespace random
namespace typedefs {
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long double ld;
} // namespace typedefs
namespace numbers_operation {
template <class T> T floor_mod(T a, T b) {
if (a >= 0 && b >= 0)
return a % b;
if (a <= 0 && b <= 0)
return a % b;
return abs(b) - (abs(a) % abs(b));
}
} // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
using namespace random;
const int N = 2000;
int n, m;
// vector<vector<int>> t, g;
vector<vector<int>> t;
bitset<N> g[2000];
bitset<N> in_path[2000][2000];
bitset<N> in_tree[2000];
void calc_in_tree(int v, int _p) {
in_tree[v] = 0;
in_tree[v][v] = 1;
for (int sub : t[v]) {
if (sub == _p)
continue;
calc_in_tree(sub, v);
in_tree[v] = (in_tree[v] | in_tree[sub]);
}
}
void dfs(int v, int _p, int base) {
for (int sub : t[v]) {
if (sub == _p)
continue;
in_path[base][sub] = (in_path[base][v] ^ in_tree[v] ^ in_tree[sub]);
in_path[base][sub][v] = 1;
dfs(sub, v, base);
}
}
// void add_edge(int a, int b) {
// if (g[a][b] == 1) return;
// g[a][b] = g[b][a] = 1;
// bitset<N> alt = (((g[a] & (~g[b])) | (g[b] & (~g[a]))) & in_path[a][b]);
// for (int i = alt._Find_first(); i < N; i = alt._Find_next(i)) {
// // for (int i = 0; i < N; i++) {
// if (!alt[i]) continue;
// if (a == i || b == i) continue;
// add_edge(b, i);
// add_edge(a, i);
// }
// }
void print_bitset(bitset<N> bt) {
string s = "";
for (int i = 0; i < 10; i++) {
s += (bt[i] ? '1' : '0');
}
print s;
}
signed main(signed argc, char *argv[]) {
scan n, m;
t.resize(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
scan a, b;
a--;
b--;
t[a].pb(b);
t[b].pb(a);
}
for (int i = 0; i < n; i++) {
in_path[i][i] = (~in_path[i][i]);
calc_in_tree(i, -1);
for (int sub : t[i]) {
in_path[i][sub] = in_path[i][i];
dfs(sub, i, i);
}
}
for (int i = 0; i < m; i++) {
int a, b;
scan a, b;
a--;
b--;
if (g[a][b])
continue;
g[a][b] = g[b][a] = 1;
vector<pii> deq;
deq.emplace_back(a, b);
while (!deq.empty()) {
tie(a, b) = deq.back();
deq.pop_back();
bitset<N> alt = (((g[a] ^ g[b])) & in_path[a][b]);
for (int i = alt._Find_first(); i < N; i = alt._Find_next(i)) {
// for (int i = 0; i < N; i++) {
if (!alt[i])
continue;
if (a == i || b == i)
continue;
if (!(g[b][i]))
deq.emplace_back(b, i);
if (!(g[a][i]))
deq.emplace_back(a, i);
g[b][i] = g[i][b] = g[a][i] = g[i][a] = 1;
}
}
}
int edges = 0;
for (int i = 0; i < n; i++) {
edges += g[i].count();
}
print edges / 2;
}
| replace | 438 | 440 | 438 | 440 | TLE | |
p03058 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 2005;
struct edge {
int to, nxt;
} e[N << 1];
int n, m, head[N], tot;
void link(int x, int y) {
e[++tot] = (edge){y, head[x]}, head[x] = tot;
e[++tot] = (edge){x, head[y]}, head[y] = tot;
}
typedef std::bitset<N> bitset;
int f[N], next[N][N], lca[N][N];
bitset path[N], sub[N];
void dfs(int x) {
path[x].set(x), sub[x].set(x);
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != f[x]) {
path[e[i].to] = path[x], f[e[i].to] = x, dfs(e[i].to);
for (int j = sub[e[i].to]._Find_first(); j < N;
j = sub[e[i].to]._Find_next(j)) {
next[i][j] = e[i].to;
for (int k = sub[x]._Find_first(); k < N; k = sub[x]._Find_next(k))
lca[j][k] = lca[k][j] = x;
}
sub[x] |= sub[e[i].to];
}
}
bitset near[N], U;
std::queue<std::pair<int, int>> q;
int edge_num = 0;
void _link(int x, int y) {
near[x].set(y), near[y].set(x), q.emplace(x, y), ++edge_num;
}
inline bitset get_path(int x, int y) {
bitset ret = path[x] ^ path[y];
ret.set(lca[x][y]);
return ret;
}
inline bitset subtree(int x, int y) {
if (sub[x].test(y))
std::swap(x, y);
if (sub[y].test(x))
return sub[x] | U ^ sub[next[y][x]];
else
return sub[x] | sub[y];
}
inline bitset get(int x, int y) { return subtree(x, y) | get_path(x, y); }
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n >> m;
for (int i = 1; i <= n; ++i)
U.set(i), near[i].set(i);
for (int i = 1, x, y; i < n; ++i)
std::cin >> x >> y, link(x, y);
dfs(1);
for (int i = 0, x, y; i < m; ++i)
std::cin >> x >> y, _link(x, y);
while (q.size()) {
auto tmp = q.front();
q.pop();
bitset t =
(near[tmp.first] ^ near[tmp.second]) & get(tmp.first, tmp.second);
for (int x = t._Find_first(); x < N; x = t._Find_next(x)) {
int v = near[tmp.first].test(x) ? tmp.second : tmp.first;
_link(x, v);
}
}
std::cout << edge_num << '\n';
return 0;
} | #include <bits/stdc++.h>
const int N = 2005;
struct edge {
int to, nxt;
} e[N << 1];
int n, m, head[N], tot;
void link(int x, int y) {
e[++tot] = (edge){y, head[x]}, head[x] = tot;
e[++tot] = (edge){x, head[y]}, head[y] = tot;
}
typedef std::bitset<N> bitset;
int f[N], next[N][N], lca[N][N];
bitset path[N], sub[N];
void dfs(int x) {
path[x].set(x), sub[x].set(x);
for (int i = head[x]; i; i = e[i].nxt)
if (e[i].to != f[x]) {
path[e[i].to] = path[x], f[e[i].to] = x, dfs(e[i].to);
for (int j = sub[e[i].to]._Find_first(); j < N;
j = sub[e[i].to]._Find_next(j)) {
next[x][j] = e[i].to;
for (int k = sub[x]._Find_first(); k < N; k = sub[x]._Find_next(k))
lca[j][k] = lca[k][j] = x;
}
sub[x] |= sub[e[i].to];
}
}
bitset near[N], U;
std::queue<std::pair<int, int>> q;
int edge_num = 0;
void _link(int x, int y) {
near[x].set(y), near[y].set(x), q.emplace(x, y), ++edge_num;
}
inline bitset get_path(int x, int y) {
bitset ret = path[x] ^ path[y];
ret.set(lca[x][y]);
return ret;
}
inline bitset subtree(int x, int y) {
if (sub[x].test(y))
std::swap(x, y);
if (sub[y].test(x))
return sub[x] | U ^ sub[next[y][x]];
else
return sub[x] | sub[y];
}
inline bitset get(int x, int y) { return subtree(x, y) | get_path(x, y); }
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n >> m;
for (int i = 1; i <= n; ++i)
U.set(i), near[i].set(i);
for (int i = 1, x, y; i < n; ++i)
std::cin >> x >> y, link(x, y);
dfs(1);
for (int i = 0, x, y; i < m; ++i)
std::cin >> x >> y, _link(x, y);
while (q.size()) {
auto tmp = q.front();
q.pop();
bitset t =
(near[tmp.first] ^ near[tmp.second]) & get(tmp.first, tmp.second);
for (int x = t._Find_first(); x < N; x = t._Find_next(x)) {
int v = near[tmp.first].test(x) ? tmp.second : tmp.first;
_link(x, v);
}
}
std::cout << edge_num << '\n';
return 0;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p03058 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
// getchar
#define gc() \
(iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), \
(iS == iT ? EOF : *iS++)) \
: *iS++)
// print the remaining part
inline void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
// putchar
inline void putc(char x) {
*oS++ = x;
if (oS == oT)
flush();
}
// input a signed integer
template <class I> inline void gi(I &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())
if (c == '-')
f = -1;
for (x = 0; c <= '9' && c >= '0'; c = gc())
x = (x << 1) + (x << 3) + (c & 15);
x *= f;
}
// print a signed integer
template <class I> inline void print(I x) {
if (!x)
putc('0');
if (x < 0)
putc('-'), x = -x;
while (x)
qu[++qr] = x % 10 + '0', x /= 10;
while (qr)
putc(qu[qr--]);
}
// no need to call flush at the end manually!
struct Flusher_ {
~Flusher_() { flush(); }
} io_flusher_;
} // namespace io
using io ::gi;
using io ::print;
using io ::putc;
const int N = 2e3 + 5;
#define bit bitset<N>
struct node {
int tot, head[N], nxt[N << 1], adj[N << 1], top[N], sz[N], f[N], dep[N],
son[N];
bit p[N], q[N];
inline void addedge(ri x, ri y) {
nxt[++tot] = head[x];
adj[head[x] = tot] = y;
}
inline void dfs(ri x) {
sz[x] = 1;
p[x][x] = q[x][x] = 1;
for (ri y, i = head[x]; i; i = nxt[i])
if ((y = adj[i]) != f[x])
p[y] = p[x], f[y] = x, dep[y] = dep[x] + 1, dfs(y), q[x] |= q[y],
sz[x] += sz[y], son[x] = sz[y] > sz[son[x]] ? y : son[x];
}
inline void dfs2(ri x, ri tp) {
top[x] = tp;
if (son[x])
dfs2(son[x], tp);
for (ri y, i = head[x]; i; i = nxt[i])
if ((y = adj[i]) != f[x] && y != son[x])
dfs2(y, y);
}
inline int lca(ri x, ri y) {
while (top[x] ^ top[y])
if (dep[top[x]] > dep[top[y]])
x = f[top[x]];
else
y = f[top[y]];
return dep[x] < dep[y] ? x : y;
}
inline int sec(ri x, ri y) { // lca(x,y) = x
while (top[x] ^ top[y]) {
if (f[top[y]] == x)
return top[y];
y = f[top[y]];
}
return son[x];
}
inline bit S(ri a, ri b) {
ri x = lca(a, b);
bit ans = p[a] ^ p[b];
ans[x] = 1;
if (x != b)
ans |= q[b];
else
ans |= ~q[sec(b, a)];
if (x != a)
ans |= q[a];
else
ans |= ~q[sec(a, b)];
return ans;
}
} t;
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
pii qu[N * N];
bit nG[N];
int main() {
ri n, m, i, x, y, l, r;
l = 1;
r = 0;
gi(n);
gi(m);
for (i = 1; i ^ n; ++i)
gi(x), gi(y), t.addedge(x, y), t.addedge(y, x);
t.dfs(1);
t.dfs2(1, 1);
while (m--)
gi(x), gi(y), nG[x][y] = nG[y][x] = 1, qu[++r] = mp(x, y);
while (l <= r) {
x = qu[l].fi;
y = qu[l].se;
++l;
bit now = (nG[x] ^ nG[y]) & t.S(x, y);
now[x] = now[y] = 0;
for (i = 1; i <= n; ++i)
if (now[i])
if (!nG[x][i])
nG[x][i] = nG[i][x] = 1, qu[++r] = mp(x, i);
else
nG[y][i] = nG[i][y] = 1, qu[++r] = mp(y, i);
}
printf("%d\n", r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
qu[55];
int f, qr;
// getchar
#define gc() \
(iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin), \
(iS == iT ? EOF : *iS++)) \
: *iS++)
// print the remaining part
inline void flush() {
fwrite(obuf, 1, oS - obuf, stdout);
oS = obuf;
}
// putchar
inline void putc(char x) {
*oS++ = x;
if (oS == oT)
flush();
}
// input a signed integer
template <class I> inline void gi(I &x) {
for (f = 1, c = gc(); c < '0' || c > '9'; c = gc())
if (c == '-')
f = -1;
for (x = 0; c <= '9' && c >= '0'; c = gc())
x = (x << 1) + (x << 3) + (c & 15);
x *= f;
}
// print a signed integer
template <class I> inline void print(I x) {
if (!x)
putc('0');
if (x < 0)
putc('-'), x = -x;
while (x)
qu[++qr] = x % 10 + '0', x /= 10;
while (qr)
putc(qu[qr--]);
}
// no need to call flush at the end manually!
struct Flusher_ {
~Flusher_() { flush(); }
} io_flusher_;
} // namespace io
using io ::gi;
using io ::print;
using io ::putc;
const int N = 2e3 + 5;
#define bit bitset<N>
struct node {
int tot, head[N], nxt[N << 1], adj[N << 1], top[N], sz[N], f[N], dep[N],
son[N];
bit p[N], q[N];
inline void addedge(ri x, ri y) {
nxt[++tot] = head[x];
adj[head[x] = tot] = y;
}
inline void dfs(ri x) {
sz[x] = 1;
p[x][x] = q[x][x] = 1;
for (ri y, i = head[x]; i; i = nxt[i])
if ((y = adj[i]) != f[x])
p[y] = p[x], f[y] = x, dep[y] = dep[x] + 1, dfs(y), q[x] |= q[y],
sz[x] += sz[y], son[x] = sz[y] > sz[son[x]] ? y : son[x];
}
inline void dfs2(ri x, ri tp) {
top[x] = tp;
if (son[x])
dfs2(son[x], tp);
for (ri y, i = head[x]; i; i = nxt[i])
if ((y = adj[i]) != f[x] && y != son[x])
dfs2(y, y);
}
inline int lca(ri x, ri y) {
while (top[x] ^ top[y])
if (dep[top[x]] > dep[top[y]])
x = f[top[x]];
else
y = f[top[y]];
return dep[x] < dep[y] ? x : y;
}
inline int sec(ri x, ri y) { // lca(x,y) = x
while (top[x] ^ top[y]) {
if (f[top[y]] == x)
return top[y];
y = f[top[y]];
}
return son[x];
}
inline bit S(ri a, ri b) {
ri x = lca(a, b);
bit ans = p[a] ^ p[b];
ans[x] = 1;
if (x != b)
ans |= q[b];
else
ans |= ~q[sec(b, a)];
if (x != a)
ans |= q[a];
else
ans |= ~q[sec(a, b)];
return ans;
}
} t;
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
pii qu[N * N];
bit nG[N];
int main() {
ri n, m, i, x, y, l, r;
l = 1;
r = 0;
gi(n);
gi(m);
for (i = 1; i ^ n; ++i)
gi(x), gi(y), t.addedge(x, y), t.addedge(y, x);
t.dfs(1);
t.dfs2(1, 1);
while (m--)
gi(x), gi(y), nG[x][y] = nG[y][x] = 1, qu[++r] = mp(x, y);
while (l <= r) {
x = qu[l].fi;
y = qu[l].se;
++l;
bit now = (nG[x] ^ nG[y]) & t.S(x, y);
now[x] = now[y] = 0;
for (i = now._Find_first(); i != now.size(); i = now._Find_next(i))
if (!nG[x][i])
nG[x][i] = nG[i][x] = 1, qu[++r] = mp(x, i);
else
nG[y][i] = nG[i][y] = 1, qu[++r] = mp(y, i);
}
printf("%d\n", r);
return 0;
} | replace | 133 | 139 | 133 | 138 | TLE | |
p03058 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO {
template <class I> void read(I &x) {
x = 0;
char ch = getchar();
bool f = false;
for (; !isdigit(ch); ch = getchar())
f |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + ch - '0';
return;
}
int read_int() {
int x;
return read(x), x;
}
ll read_ll() {
ll x;
return read(x), x;
}
template <class I> void chmax(I &x, I y) { x = x > y ? x : y; }
template <class I> void chmin(I &x, I y) { x = x < y ? x : y; }
#define ri read_int()
#define rl read_ll()
} // namespace IO
using IO::chmax;
using IO::chmin;
using IO::read_int;
using IO::read_ll;
//}}}
//{{{Mod
namespace Mod {
// const int mod = 1e9 + 7;
// const int mod = 1004535809;
const int mod = 998244353;
inline void MOD(int &x) { x -= x >= mod ? mod : 0; }
inline void add(int &x, int y) { x = x + y >= mod ? x + y - mod : x + y; }
inline int Add(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
inline void mul(int &x, int y) { x = 1ll * x * y % mod; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
} // namespace Mod
//}}}
#define N 2003
int n, m, top;
int st[N], fa[N][12], dep[N], lca[N][N];
std::queue<pi> Q;
std::vector<int> e[N];
std::bitset<N> p[N], s[N], g[N], all;
void dfs(int u, int f) {
st[++top] = u;
fa[u][0] = f;
dep[u] = dep[f] + 1;
for (int i = 1; i <= 11; ++i)
fa[u][i] = fa[fa[u][i - 1]][i - 1];
for (int i = 1; i <= top; ++i)
s[st[i]].set(u), p[u].set(st[i]);
for (auto v : e[u])
if (v != f)
dfs(v, u);
--top;
return;
}
int get_lca(int x, int y) {
if (dep[x] < dep[y])
std::swap(x, y);
for (int i = 11; ~i; --i)
if (dep[fa[x][i]] >= dep[y])
x = fa[x][i];
if (x == y)
return x;
for (int i = 11; ~i; --i)
if (fa[x][i] != fa[y][i])
x = fa[x][i], y = fa[y][i];
return fa[x][0];
}
int jump(int u, int k) {
for (int i = 11; ~i; --i)
if (k & (1 << i))
u = fa[u][i];
return u;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("puzzle.in", "r", stdin);
freopen("puzzle.out", "w", stdout);
freopen("puzzle.log", "w", stderr);
#endif
n = ri, m = ri;
for (int i = 2; i <= n; ++i) {
int u = ri, v = ri;
e[u].pb(v), e[v].pb(u);
}
dfs(1, 0);
for (int i = 1; i <= n; ++i)
all.set(i);
for (int i = 1; i <= n; ++i)
for (int j = i + 1; j <= n; ++j)
lca[i][j] = lca[j][i] = get_lca(i, j);
for (int i = 1; i <= m; ++i) {
int u = ri, v = ri;
g[u].set(v);
g[v].set(u);
Q.push(mkp(u, v));
}
while (!Q.empty()) {
pi tmp = Q.front();
Q.pop();
int u = tmp.fi, v = tmp.se;
if (dep[u] > dep[v])
std::swap(u, v);
std::bitset<N> x = g[u] ^ g[v], y = (p[u] ^ p[v]) | s[v];
if (lca[u][v] == u)
y |= all ^ s[jump(v, dep[v] - dep[u] - 1)];
else
y |= s[u];
y.set(lca[u][v]);
x &= y;
for (int p = x._Find_first(); p <= n; p = x._Find_next(p)) {
if (p == u || p == v)
continue;
if (g[u].test(p)) {
g[v].set(p);
g[p].set(v);
++m;
Q.push(mkp(v, p));
} else {
g[u].set(p);
g[p].set(u);
++m;
Q.push(mkp(u, p));
}
}
}
printf("%d\n", m);
return 0;
} | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO {
template <class I> void read(I &x) {
x = 0;
char ch = getchar();
bool f = false;
for (; !isdigit(ch); ch = getchar())
f |= (ch == '-');
for (; isdigit(ch); ch = getchar())
x = (x << 3) + (x << 1) + ch - '0';
return;
}
int read_int() {
int x;
return read(x), x;
}
ll read_ll() {
ll x;
return read(x), x;
}
template <class I> void chmax(I &x, I y) { x = x > y ? x : y; }
template <class I> void chmin(I &x, I y) { x = x < y ? x : y; }
#define ri read_int()
#define rl read_ll()
} // namespace IO
using IO::chmax;
using IO::chmin;
using IO::read_int;
using IO::read_ll;
//}}}
//{{{Mod
namespace Mod {
// const int mod = 1e9 + 7;
// const int mod = 1004535809;
const int mod = 998244353;
inline void MOD(int &x) { x -= x >= mod ? mod : 0; }
inline void add(int &x, int y) { x = x + y >= mod ? x + y - mod : x + y; }
inline int Add(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
inline void mul(int &x, int y) { x = 1ll * x * y % mod; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
} // namespace Mod
//}}}
#define N 2003
int n, m, top;
int st[N], fa[N][12], dep[N], lca[N][N];
std::queue<pi> Q;
std::vector<int> e[N];
std::bitset<N> p[N], s[N], g[N], all;
void dfs(int u, int f) {
st[++top] = u;
fa[u][0] = f;
dep[u] = dep[f] + 1;
for (int i = 1; i <= 11; ++i)
fa[u][i] = fa[fa[u][i - 1]][i - 1];
for (int i = 1; i <= top; ++i)
s[st[i]].set(u), p[u].set(st[i]);
for (auto v : e[u])
if (v != f)
dfs(v, u);
--top;
return;
}
int get_lca(int x, int y) {
if (dep[x] < dep[y])
std::swap(x, y);
for (int i = 11; ~i; --i)
if (dep[fa[x][i]] >= dep[y])
x = fa[x][i];
if (x == y)
return x;
for (int i = 11; ~i; --i)
if (fa[x][i] != fa[y][i])
x = fa[x][i], y = fa[y][i];
return fa[x][0];
}
int jump(int u, int k) {
for (int i = 11; ~i; --i)
if (k & (1 << i))
u = fa[u][i];
return u;
}
int main() {
n = ri, m = ri;
for (int i = 2; i <= n; ++i) {
int u = ri, v = ri;
e[u].pb(v), e[v].pb(u);
}
dfs(1, 0);
for (int i = 1; i <= n; ++i)
all.set(i);
for (int i = 1; i <= n; ++i)
for (int j = i + 1; j <= n; ++j)
lca[i][j] = lca[j][i] = get_lca(i, j);
for (int i = 1; i <= m; ++i) {
int u = ri, v = ri;
g[u].set(v);
g[v].set(u);
Q.push(mkp(u, v));
}
while (!Q.empty()) {
pi tmp = Q.front();
Q.pop();
int u = tmp.fi, v = tmp.se;
if (dep[u] > dep[v])
std::swap(u, v);
std::bitset<N> x = g[u] ^ g[v], y = (p[u] ^ p[v]) | s[v];
if (lca[u][v] == u)
y |= all ^ s[jump(v, dep[v] - dep[u] - 1)];
else
y |= s[u];
y.set(lca[u][v]);
x &= y;
for (int p = x._Find_first(); p <= n; p = x._Find_next(p)) {
if (p == u || p == v)
continue;
if (g[u].test(p)) {
g[v].set(p);
g[p].set(v);
++m;
Q.push(mkp(v, p));
} else {
g[u].set(p);
g[p].set(u);
++m;
Q.push(mkp(u, p));
}
}
}
printf("%d\n", m);
return 0;
}
| delete | 101 | 106 | 101 | 101 | TLE | |
p03059 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a, b, t;
cin >> a >> b >> t;
cout << (t / a) * b;
} | delete | 6 | 10 | 6 | 6 | 0 | |
p03059 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define ld long double
#define MAX 100007
#define pb push_back
#define MOD 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll a, b, t;
cin >> a >> b >> t;
cout << b * (t / a);
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define ld long double
#define MAX 100007
#define pb push_back
#define MOD 1000000007
using namespace std;
int main() {
ll a, b, t;
cin >> a >> b >> t;
cout << b * (t / a);
return 0;
} | delete | 10 | 17 | 10 | 10 | 0 | |
p03059 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = 0;
for (int i = a; i <= t; ++a) {
ans += b;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = 0;
for (int i = a; i <= t; i += a) {
ans += b;
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define vc vector
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = 0, time = 0;
while (time < t) {
ans += b;
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repa(i, a, n) for (int i = (a); i < (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepa(i, a, n) for (int i = n - 1; i >= (a); i--)
#define all(a) (a).begin(), (a).end()
#define MOD 1000000007
#define cmax(a, b) a = max(a, b)
#define cmin(a, b) a = min(a, b)
#define vc vector
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
int main() {
int a, b, t;
cin >> a >> b >> t;
int ans = t / a;
ans *= b;
cout << ans << "\n";
return 0;
}
| replace | 28 | 33 | 28 | 30 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, a, b) for (int i = (a); i <= (b); i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define sz(x) (sizeof(x) / sizeof(*x))
#define F first
#define S second
int main() {
// ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
double a, b, t, sum = 0;
cin >> a >> b >> t;
while (a <= t + 0.5) {
sum += b;
}
cout << sum << endl;
// system("pause");
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP1(i, a, b) for (int i = (a); i <= (b); i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define sz(x) (sizeof(x) / sizeof(*x))
#define F first
#define S second
int main() {
// ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
double a, b, t, sum = 0;
cin >> a >> b >> t;
cout << int((t + 0.5) / a) * b << endl;
// system("pause");
return 0;
} | replace | 16 | 20 | 16 | 18 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int d = 0;
for (int i = a; i <= c; i * a) {
d++;
}
cout << d;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (c / a) * b;
return 0;
} | replace | 6 | 12 | 6 | 7 | TLE | |
p03059 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * T / A << endl;
return 1;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
cout << B * (T / A) << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | 1 | |
p03059 | C++ | Time Limit Exceeded | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1LL); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
class Kruskal {
private:
UnionFind *uf;
vector<edge> e;
public:
vector<edge> mst;
Kruskal(int N) { uf = new UnionFind(N); }
void add(int x, int y, ll z);
void run();
};
//----UnionFind-------------------------------
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
// 大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
//----Kruskal-------------------------------
void Kruskal::add(int x, int y, ll z) {
// x < y
if (x > y)
swap(x, y);
e.push_back({z, {x, y}});
}
void Kruskal::run() {
sort(e.begin(), e.end());
e.erase(unique(e.begin(), e.end()), e.end());
for (auto x : e) {
if (uf->same(x.second.first, x.second.second)) {
continue;
} else {
mst.push_back(x);
uf->unite(x.second.first, x.second.second);
}
}
}
signed main() {
int a, b, t;
int ans = 0;
for (int i = a; i < t + 1; i += a) {
ans += b;
}
cout << ans << endl;
} | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
ll inv[MAX_N], fac[MAX_N];
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
inline ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1LL;
}
return c;
}
inline void _nCr() {
fac[0] = 1;
for (int i = 1LL; i < MAX_N; i++) {
fac[i] = fac[i - 1] * i % mod;
}
for (int i = 0; i < MAX_N; i++) {
inv[i] = POW(fac[i], mod - 2);
}
}
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod) * inv[n - r] % mod; }
inline void PRI(ll n) {
bool a[n + 1];
for (int i = 0; i < n + 1; i++) {
a[i] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
typedef pair<int, pair<int, int>> edge;
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1LL); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
class Kruskal {
private:
UnionFind *uf;
vector<edge> e;
public:
vector<edge> mst;
Kruskal(int N) { uf = new UnionFind(N); }
void add(int x, int y, ll z);
void run();
};
//----UnionFind-------------------------------
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
// 大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
//----Kruskal-------------------------------
void Kruskal::add(int x, int y, ll z) {
// x < y
if (x > y)
swap(x, y);
e.push_back({z, {x, y}});
}
void Kruskal::run() {
sort(e.begin(), e.end());
e.erase(unique(e.begin(), e.end()), e.end());
for (auto x : e) {
if (uf->same(x.second.first, x.second.second)) {
continue;
} else {
mst.push_back(x);
uf->unite(x.second.first, x.second.second);
}
}
}
signed main() {
int a, b, t;
cin >> a >> b >> t;
int ans = 0;
for (int i = a; i < t + 1; i += a) {
ans += b;
}
cout << ans << endl;
} | insert | 167 | 167 | 167 | 168 | TLE | |
p03059 | C++ | Runtime Error | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ss second
#define mod 998244353
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL << 61)
#define ull unsigned long long
#define debug1(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'
using namespace std;
// int dx[]={1,0,-1, 0};int dy[]={0,1,0, -1}; //4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
if (a.ff == b.ff) {
return (b.ss < a.ss);
}
return (a.ff < b.ff);
}
int n, m;
int col[100005];
vi g[100005];
int ans[100005];
map<pair<int, int>, int> map1;
int32_t main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
/********************* From here ***********************/
double a, b, t;
cin >> a >> b >> t;
int ans = 0;
int time = a;
while (time < t + 0.5) {
// cout << time << " " << ans;
ans += b;
time += a;
}
cout << ans;
}
| #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define ff first
#define pii pair<int, int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ss second
#define mod 998244353
#define pb push_back
#define mp make_pair
#define int long long
#define all(a) a.begin(), a.end()
#define inf (1LL << 61)
#define ull unsigned long long
#define debug1(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'
using namespace std;
// int dx[]={1,0,-1, 0};int dy[]={0,1,0, -1}; //4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1};int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
bool compare(const pair<int, int> &a, const pair<int, int> &b) {
if (a.ff == b.ff) {
return (b.ss < a.ss);
}
return (a.ff < b.ff);
}
int n, m;
int col[100005];
vi g[100005];
int ans[100005];
map<pair<int, int>, int> map1;
int32_t main() {
// IOS;
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
/********************* From here ***********************/
double a, b, t;
cin >> a >> b >> t;
int ans = 0;
int time = a;
while (time < t + 0.5) {
// cout << time << " " << ans;
ans += b;
time += a;
}
cout << ans;
}
| replace | 42 | 47 | 42 | 47 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, t, x;
cin >> a >> b >> t;
t = t + 0.5;
a = t / a;
x = a * b;
cout << x << endl;
while (1) {
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, t, x;
cin >> a >> b >> t;
t = t + 0.5;
a = t / a;
x = a * b;
cout << x << endl;
} | delete | 11 | 14 | 11 | 11 | TLE | |
p03059 | C++ | Time Limit Exceeded | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int a, b, t;
int sum = 0;
for (int i = a; i <= t; i += a) {
sum += b;
}
cout << sum;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int a, b, t;
cin >> a >> b >> t;
int sum = 0;
for (int i = a; i <= t; i += a) {
sum += b;
}
cout << sum;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
} | insert | 36 | 36 | 36 | 37 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int a, b, t, j;
while (scanf("%d %d %d", &a, &b, &t)) {
j = 1;
int c = 0;
if (a <= t) {
for (int i = a; i <= t; i = i + a) {
c = c + b;
}
printf("%d\n", c);
}
if (a > t)
printf("0");
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, t, sum = 0;
scanf("%d%d%d", &a, &b, &t);
int num;
num = t / a;
sum = sum + num * b;
printf("%d\n", sum);
return 0;
} | replace | 2 | 15 | 2 | 8 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int t = A, ans = 0;
while (t < T + 0.5) {
ans += A;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B, T;
cin >> A >> B >> T;
int t = A, ans = 0;
while (t < T + 0.5) {
ans += B;
t += A;
}
cout << ans << endl;
return 0;
}
| replace | 8 | 9 | 8 | 10 | TLE | |
p03059 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int i = 1;
int z = 0;
while (a * i <= c) {
z += b;
}
cout << z << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int i = 1;
int z = 0;
while (a * i <= c) {
z += b;
i++;
}
cout << z << endl;
}
| insert | 9 | 9 | 9 | 10 | TLE | |
p03059 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 1000
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
#endif
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | #include <bits/stdc++.h>
using namespace std;
#define N 1000
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define all(cont) cont.begin(), cont.end()
#define sortcmp(n, cmpfunc) sort(all(n), cmpfunc)
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0)
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
ll powm(ll a, ll b);
ll divm(ll a, ll b);
ll multm(ll a, ll b);
ll subm(ll a, ll b);
ll addm(ll a, ll b);
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
// #endif
int a, b, t;
cin >> a >> b >> t;
cout << t / a * b << endl;
return 0;
}
// template function
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll powm(ll a, ll b) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2)
x = (x * y) % mod;
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
ll multm(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll divm(ll a, ll b) { return (a * powm(b, mod - 2)); }
ll subm(ll a, ll b) {
a -= b;
if (a < 0)
a += mod;
return a;
}
ll addm(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
return a;
} | replace | 24 | 28 | 24 | 28 | 0 | |
p03059 | C++ | Time Limit Exceeded | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s.order_of_key(x); // gives order of x in the set
#define For(i, x, n) for (long long i = x; i < n; i++)
#define rFor(i, x, n) for (long long i = x; i >= n; i--)
#define itFor(it, st) for (auto it = st.begin(); it != st.end(); it++)
#define MOD 1000000007
#define PI 3.141592653589793
#define INF 999999999999999999
#define N 1000005
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sp " "
#define cont continue
#define brk break
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
using namespace std;
void setprime(ll n = 15000002);
ll choose(ll n, ll k);
void showArray(ll a[], ll n);
ll gcd(ll a, ll b);
ld len(ld x1, ld y1, ld x2, ld y2);
ld gcd_ld(ld x, ld y);
ll power(ll x, ll n);
ll power1(ll x, ll n);
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed;
cout << setprecision(3);
srand(time(NULL));
ll a, b, t;
ll cnt = 0;
for (ll i = a; i <= t; i += a)
cnt += b;
cout << cnt;
// cout<<"\nTime used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
return 0;
}
// s1.substr(1,3) - return 3 characters starting from position 1 as substring of
// string sz1. eg sz1="shreynumh" sz1.substr(2,5)="reyan" num = atoi(s.c_str());
// //convert string s to integer num n.erase(i,std::string::npos); //erase i th
// position in string n , decreasing string size s.find(b)!= std::string::npos -
// finds string b in string a - true if found cout<<"Time used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
void setprime(ll isprime[], ll n, ll cc = 0) {
isprime[1] = 1;
map<ll, ll> hm;
ll i;
for (i = 2; i * i <= 15000002; i++)
if (isprime[i] == 0) {
for (ll j = 2 * i; j <= 15000001; j += i)
if (isprime[j] == 0)
isprime[j] = i;
isprime[i] = i;
hm[i] = cc;
cc++;
}
for (; i < 15000002; i++)
if (isprime[i] == 0)
isprime[i] = i, hm[i] = cc, cc++;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
void showArray(ll a[], ll n) {
For(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ld len(ld x1, ld y1, ld x2, ld y2) {
return sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
}
ld gcd_ld(ld x, ld y) {
ld eps = 0.0001;
while (fabs(x) > eps && fabs(y) > eps) {
if (x > y)
x -= floor(x / y) * y;
else
y -= floor(y / x) * x;
}
return x + y;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return (power((x * x) % MOD, n / 2)) % MOD;
else // n is bal
return (x * power((x * x) % MOD, (n - 1) / 2)) % MOD;
}
ll power1(ll x, ll n) {
ll num = 1;
For(i, 0, n) { num = (num * x) % MOD; }
return num;
} | #include <assert.h>
#include <bits/stdc++.h>
#include <time.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// s.order_of_key(x); // gives order of x in the set
#define For(i, x, n) for (long long i = x; i < n; i++)
#define rFor(i, x, n) for (long long i = x; i >= n; i--)
#define itFor(it, st) for (auto it = st.begin(); it != st.end(); it++)
#define MOD 1000000007
#define PI 3.141592653589793
#define INF 999999999999999999
#define N 1000005
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sp " "
#define cont continue
#define brk break
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
using namespace std;
void setprime(ll n = 15000002);
ll choose(ll n, ll k);
void showArray(ll a[], ll n);
ll gcd(ll a, ll b);
ld len(ld x1, ld y1, ld x2, ld y2);
ld gcd_ld(ld x, ld y);
ll power(ll x, ll n);
ll power1(ll x, ll n);
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed;
cout << setprecision(3);
srand(time(NULL));
ll a, b, t;
cin >> a >> b >> t;
ll cnt = 0;
for (ll i = a; i <= t; i += a)
cnt += b;
cout << cnt;
// cout<<"\nTime used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
return 0;
}
// s1.substr(1,3) - return 3 characters starting from position 1 as substring of
// string sz1. eg sz1="shreynumh" sz1.substr(2,5)="reyan" num = atoi(s.c_str());
// //convert string s to integer num n.erase(i,std::string::npos); //erase i th
// position in string n , decreasing string size s.find(b)!= std::string::npos -
// finds string b in string a - true if found cout<<"Time used =
// "<<static_cast<double>(clock())/(CLOCKS_PER_SEC)<<"s"<<endl; // - for
// checking time used for a test case
void setprime(ll isprime[], ll n, ll cc = 0) {
isprime[1] = 1;
map<ll, ll> hm;
ll i;
for (i = 2; i * i <= 15000002; i++)
if (isprime[i] == 0) {
for (ll j = 2 * i; j <= 15000001; j += i)
if (isprime[j] == 0)
isprime[j] = i;
isprime[i] = i;
hm[i] = cc;
cc++;
}
for (; i < 15000002; i++)
if (isprime[i] == 0)
isprime[i] = i, hm[i] = cc, cc++;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
void showArray(ll a[], ll n) {
For(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ld len(ld x1, ld y1, ld x2, ld y2) {
return sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
}
ld gcd_ld(ld x, ld y) {
ld eps = 0.0001;
while (fabs(x) > eps && fabs(y) > eps) {
if (x > y)
x -= floor(x / y) * y;
else
y -= floor(y / x) * x;
}
return x + y;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return (power((x * x) % MOD, n / 2)) % MOD;
else // n is bal
return (x * power((x * x) % MOD, (n - 1) / 2)) % MOD;
}
ll power1(ll x, ll n) {
ll num = 1;
For(i, 0, n) { num = (num * x) % MOD; }
return num;
} | insert | 68 | 68 | 68 | 69 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.