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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, m, sum = 0;
bool vis[200005];
vector<int> fr[200005];
void dfs(int a) {
if (vis[a])
return;
vis[a] = true;
sum++;
for (int i = 0; i < fr[a].size(); ++i)
if (!vis[fr[a][i]])
dfs(fr[a][i]);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
if (find(fr[x].begin(), fr[x].end(), y) == fr[x].end())
fr[x].push_back(y);
if (find(fr[y].begin(), fr[y].end(), x) == fr[y].end())
fr[y].push_back(x);
}
for (int i = 0; i < 200005; ++i)
vis[i] = false;
int ans = -1;
for (int i = 1; i <= n; ++i)
if (!vis[i]) {
dfs(i);
ans = max(ans, sum);
sum = 0;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m, sum = 0;
bool vis[200005];
vector<int> fr[200005];
void dfs(int a) {
vis[a] = true;
sum++;
for (int i = 0; i < fr[a].size(); ++i)
if (!vis[fr[a][i]])
dfs(fr[a][i]);
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
if (find(fr[x].begin(), fr[x].end(), y) == fr[x].end())
fr[x].push_back(y);
if (find(fr[y].begin(), fr[y].end(), x) == fr[y].end())
fr[y].push_back(x);
}
for (int i = 0; i < 200005; ++i)
vis[i] = false;
int ans = -1;
for (int i = 1; i <= n; ++i)
if (!vis[i]) {
dfs(i);
ans = max(ans, sum);
sum = 0;
}
cout << ans;
return 0;
}
| delete | 6 | 8 | 6 | 6 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX_SIZE 200005
int parent[MAX_SIZE];
int Find(int x) {
if (parent[x] == -1) {
return x;
}
return parent[x] = Find(parent[x]);
}
int Union(int x, int y) {
int px = Find(x), py = Find(y);
if (px != py) {
parent[py] = px;
}
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
memset(parent, -1, sizeof(parent));
for (int i = 0; i < m; ++i) {
int x, y;
scanf("%d%d", &x, &y);
Union(x, y);
}
unordered_map<int, int> group;
for (int i = 1; i <= n; ++i) {
group[Find(i)]++;
}
int ans = 0;
for (const auto &p : group) {
if (p.second > ans) {
ans = p.second;
}
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MAX_SIZE 200005
int parent[MAX_SIZE];
int Find(int x) {
if (parent[x] == -1) {
return x;
}
return parent[x] = Find(parent[x]);
}
void Union(int x, int y) {
int px = Find(x), py = Find(y);
if (px != py) {
parent[py] = px;
}
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
memset(parent, -1, sizeof(parent));
for (int i = 0; i < m; ++i) {
int x, y;
scanf("%d%d", &x, &y);
Union(x, y);
}
unordered_map<int, int> group;
for (int i = 1; i <= n; ++i) {
group[Find(i)]++;
}
int ans = 0;
for (const auto &p : group) {
if (p.second > ans) {
ans = p.second;
}
}
printf("%d\n", ans);
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<long long ll>
#define pb push_back
#define f(i, x, n) for (i = x; i < n; i++)
ll visited[1000];
vector<ll> a[1000];
ll c = 0;
void dfs(ll k) {
if (visited[k] != 1) {
visited[k] = 1;
c = c + 1;
for (ll i = 0; i < (ll)a[k].size(); i++) {
if (visited[a[k][i]] != 1)
dfs(a[k][i]);
}
}
}
void solve() {
ll n, m;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
a[x].pb(y);
a[y].pb(x);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
c = 0;
if (visited[i] == 0) {
dfs(i);
ans = max(ans, c);
}
// cout << c <<" ";
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
while (t--)
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<long long ll>
#define pb push_back
#define f(i, x, n) for (i = x; i < n; i++)
ll visited[1000000];
vector<ll> a[1000000];
ll c = 0;
void dfs(ll k) {
if (visited[k] != 1) {
visited[k] = 1;
c = c + 1;
for (ll i = 0; i < (ll)a[k].size(); i++) {
if (visited[a[k][i]] != 1)
dfs(a[k][i]);
}
}
}
void solve() {
ll n, m;
cin >> n >> m;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
a[x].pb(y);
a[y].pb(x);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
c = 0;
if (visited[i] == 0) {
dfs(i);
ans = max(ans, c);
}
// cout << c <<" ";
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
while (t--)
solve();
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr int MAX = 1e5 + 5;
std::vector<int> to[MAX];
bool used[MAX];
int dfs(int v) {
int res = 1;
for (int x : to[v]) {
if (!used[x]) {
used[x] = 1;
res += dfs(x);
}
}
return res;
}
int main() {
int n, m;
std::cin >> n >> m;
rep(i, m) {
int a, b;
std::cin >> a >> b;
to[a].push_back(b);
to[b].push_back(a);
}
int ans = 0;
rep(i, n) {
if (!used[i]) {
used[i] = 1;
ans = std::max(ans, dfs(i));
}
}
std::cout << ans << std::endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long int;
using P = std::pair<int, int>;
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define rag(con) std::begin(con), std::end(con)
constexpr int MAX = 2 * 1e5 + 5;
std::vector<int> to[MAX];
bool used[MAX];
int dfs(int v) {
int res = 1;
for (int x : to[v]) {
if (!used[x]) {
used[x] = 1;
res += dfs(x);
}
}
return res;
}
int main() {
int n, m;
std::cin >> n >> m;
rep(i, m) {
int a, b;
std::cin >> a >> b;
to[a].push_back(b);
to[b].push_back(a);
}
int ans = 0;
rep(i, n) {
if (!used[i]) {
used[i] = 1;
ans = std::max(ans, dfs(i));
}
}
std::cout << ans << std::endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define f(i, a, b) for (int i = a; i < b; i++)
#define f1(i, a, b) for (int i = a; i <= b; i++)
#define int long long
using namespace std;
#define mod 1000000007
vector<int> adj[200001];
int visited[200001];
int dfs(int s) {
visited[s] = 1;
int count = 1;
for (int i = 0; i < adj[s].size(); i++) {
if (visited[adj[s][i]] == 0) {
count += dfs(adj[s][i]);
}
}
return count;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, a, b;
cin >> n >> m;
while (m--) {
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
vector<int> arr;
int r, sum1 = 0, ans = 0;
memset(visited, 0, sizeof(visited));
for (int i = 1; i <= n; i++) {
if (visited[i] == 0) {
r = dfs(i);
if (r != 1) {
arr.pb(r);
}
}
}
sort(arr.rbegin(), arr.rend());
cout << arr[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define f(i, a, b) for (int i = a; i < b; i++)
#define f1(i, a, b) for (int i = a; i <= b; i++)
#define int long long
using namespace std;
#define mod 1000000007
vector<int> adj[200001];
int visited[200001];
int dfs(int s) {
visited[s] = 1;
int count = 1;
for (int i = 0; i < adj[s].size(); i++) {
if (visited[adj[s][i]] == 0) {
count += dfs(adj[s][i]);
}
}
return count;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, a, b;
cin >> n >> m;
while (m--) {
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
vector<int> arr;
int r, sum1 = 0, ans = 0;
memset(visited, 0, sizeof(visited));
for (int i = 1; i <= n; i++) {
if (visited[i] == 0) {
r = dfs(i);
if (r != 1) {
arr.pb(r);
}
}
}
if (arr.size() != 0) {
sort(arr.rbegin(), arr.rend());
cout << arr[0] << endl;
} else {
cout << 1 << endl;
}
return 0;
}
| replace | 44 | 46 | 44 | 50 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
vector<int> adj[100001];
bool v[100001];
ll power(ll x, ll y, ll z) {
if (y == 0)
return 1;
else {
ll p = power(x, y / 2, z);
if (y % 2 == 0)
return (p * p) % z;
else
return (x * ((p * p) % z)) % z;
}
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll po(ll x) {
ll c = 0;
while (x > 0) {
x = x & (x - 1);
c++;
}
return c;
}
int dfs(int x) {
int c = 1;
v[x] = 1;
for (auto it = adj[x].begin(); it != adj[x].end(); it++) {
if (!v[*it]) {
c = c + dfs(*it);
}
}
return c;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll n, m;
int k = 0;
cin >> n >> m;
ll a[m], b[m];
map<pair<ll, ll>, ll> mp;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
if (mp[{a[i], b[i]}] == 0 && mp[{b[i], a[i]}] == 0) {
ll x = min(a[i], b[i]), y = max(a[i], b[i]);
adj[x].push_back(y);
adj[y].push_back(x);
mp[{x, y}] = 1;
mp[{y, x}] = 1;
}
}
for (int i = 1; i <= n; i++) {
if (v[i] == false)
k = max(k, dfs(i));
}
cout << k;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
vector<int> adj[200001];
bool v[200001];
ll power(ll x, ll y, ll z) {
if (y == 0)
return 1;
else {
ll p = power(x, y / 2, z);
if (y % 2 == 0)
return (p * p) % z;
else
return (x * ((p * p) % z)) % z;
}
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll po(ll x) {
ll c = 0;
while (x > 0) {
x = x & (x - 1);
c++;
}
return c;
}
int dfs(int x) {
int c = 1;
v[x] = 1;
for (auto it = adj[x].begin(); it != adj[x].end(); it++) {
if (!v[*it]) {
c = c + dfs(*it);
}
}
return c;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
ll n, m;
int k = 0;
cin >> n >> m;
ll a[m], b[m];
map<pair<ll, ll>, ll> mp;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
if (mp[{a[i], b[i]}] == 0 && mp[{b[i], a[i]}] == 0) {
ll x = min(a[i], b[i]), y = max(a[i], b[i]);
adj[x].push_back(y);
adj[y].push_back(x);
mp[{x, y}] = 1;
mp[{y, x}] = 1;
}
}
for (int i = 1; i <= n; i++) {
if (v[i] == false)
k = max(k, dfs(i));
}
cout << k;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p02573 | C++ | Runtime Error | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
long long par[100007], mx = 1, sz[100007];
void mk(long long n) {
long long i;
for (i = 0; i <= n; i++) {
par[i] = i;
sz[i] = 1;
}
}
long long fin(long long a) {
if (par[a] == a) {
return a;
}
return par[a] = fin(par[a]);
}
void uni(long long a, long long b) {
a = fin(a);
b = fin(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
par[b] = a;
sz[a] += sz[b];
mx = max(mx, sz[a]);
}
mx = max(mx, sz[a]);
mx = max(mx, sz[b]);
}
int main() {
long long n, m, i, x, y;
cin >> n >> m;
mk(n + 1);
for (i = 0; i < m; i++) {
cin >> x >> y;
uni(x, y);
}
cout << mx;
return 0;
}
| /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <iostream>
using namespace std;
long long par[200007], mx = 1, sz[200007];
void mk(long long n) {
long long i;
for (i = 0; i <= n; i++) {
par[i] = i;
sz[i] = 1;
}
}
long long fin(long long a) {
if (par[a] == a) {
return a;
}
return par[a] = fin(par[a]);
}
void uni(long long a, long long b) {
a = fin(a);
b = fin(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
par[b] = a;
sz[a] += sz[b];
mx = max(mx, sz[a]);
}
mx = max(mx, sz[a]);
mx = max(mx, sz[b]);
}
int main() {
long long n, m, i, x, y;
cin >> n >> m;
mk(n + 1);
for (i = 0; i < m; i++) {
cin >> x >> y;
uni(x, y);
}
cout << mx;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int f[N], sum[N];
int get(int x) {
if (f[x] != x) {
f[x] = get(f[x]);
sum[x] = sum[f[x]];
}
return f[x];
}
int main() {
int n, m, a, b;
cin >> n >> m;
for (int i = 1; i <= n; i++)
f[i] = i, sum[i] = 1;
for (int i = 0; i < m; i++) {
cin >> a >> b;
int f1 = get(a), f2 = get(b);
if (f1 != f2) {
f[f1] = f2;
sum[f2] += sum[f1];
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, sum[i]);
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int f[N], sum[N];
int get(int x) {
if (f[x] != x) {
f[x] = get(f[x]);
sum[x] = sum[f[x]];
}
return f[x];
}
int main() {
int n, m, a, b;
cin >> n >> m;
for (int i = 1; i <= n; i++)
f[i] = i, sum[i] = 1;
for (int i = 0; i < m; i++) {
cin >> a >> b;
int f1 = get(a), f2 = get(b);
if (f1 != f2) {
f[f1] = f2;
sum[f2] += sum[f1];
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, sum[i]);
}
cout << ans;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02573 | C++ | Time Limit Exceeded | using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
typedef set<int> si;
typedef set<ll> sl;
typedef map<int, int> mii;
#define mp make_pair
#define sz(x) (int)x.size()
#define len(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
// #define pf push_front
// #define pb push_back
#define eb emplace_back
#define ep emplace
#define lb lower_bound
#define ub upper_bound
#define vfor(i, a, b) for (int i = (a); i < (b); ++i)
#define f0r(i, a) vfor(i, 0, a)
#define rof(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define r0f(i, a) rof(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define def(fname, rtype, args, ...) \
function<rtype args> fname = [__VA_ARGS__] args
#define boost() cin.tie(0), cin.sync_with_stdio(0)
template <class T>
void binstf(T &found, T a, T b, function<bool(T)> test, bool TF = true) {
T i = a, j = b;
bool da = test(a), db = test(b);
if ((da != TF) or (db == TF)) {
cerr << "---[BS: TF = " << TF << "]---" << endl;
cerr << a << "->" << da << endl;
cerr << b << "->" << db << endl;
}
while (j - i > 1) {
T m = (i + j) / 2;
if (test(m) == TF)
i = m;
else
j = m;
}
found = i;
if (not TF)
found++;
}
#define binsft(a, b, c, d) binstf(a, b, c, d, false);
template <class T> T dpow(T a, T power) {
T result = 1;
while (power) {
if (power % 2)
result *= a;
power /= 2, a = a * a;
}
return result;
}
const ld PI = acos((ld)-1);
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> bool reorder(T &a, T &b) {
return (a > b) ? swap(a, b), 1 : 0;
}
// INPUT
template <class A> void re(complex<A> &c);
template <class A, class B> void re(pair<A, B> &p);
template <class A> void re(vector<A> &v);
template <class A, size_t SZ> void re(array<A, SZ> &a);
#define ore(type, x) \
type x; \
re(x);
#define ire(x) ore(int, x);
#define vire(x) ore(vi, x);
#define lre(x) ore(ll, x);
template <class T> void re(T &x) { cin >> x; }
void re(db &d) {
str t;
re(t);
d = stod(t);
}
void re(ld &d) {
str t;
re(t);
d = stold(t);
}
template <class H, class... T> void re(H &h, T &...t) {
re(h);
re(t...);
}
template <class A> void re(complex<A> &c) {
A a, b;
re(a, b);
c = {a, b};
}
template <class A, class B> void re(pair<A, B> &p) { re(p.first, p.second); }
template <class A> void re(vector<A> &x) { trav(a, x) re(a); }
template <class A, size_t SZ> void re(array<A, SZ> &x) { trav(a, x) re(a); }
template <class T> T gcd(T a, T b) {
a = a < 0 ? -a : a;
b = b < 0 ? -b : b;
if (a * b == 0)
return max(a, b);
else
return gcd(min(a, b), max(a, b) % min(a, b));
}
const int MODE107 = 1000000007;
template <class T> T modop(T a, T mode = MODE107) {
a = a % mode;
if (a < 0)
a += mode;
return a;
}
template <class T> T inv(T a, T mode = MODE107) {
T coefa = 1, coefb = 0;
T aa = a, bb = mode;
while (aa != 1) {
if (aa > bb)
swap(coefa, coefb), swap(aa, bb);
T cc = bb / aa;
bb -= cc * aa, coefb -= cc * coefa;
swap(coefa, coefb), swap(aa, bb);
}
return coefa;
}
const int uplrDX[] = {-1, 1, 0, 0};
const int uplrDY[] = {0, 0, -1, 1};
#define ts to_string
str ts(char c) { return str(1, c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char *s) { return (str)s; }
str ts(str s) { return s; }
template <class A> str ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
str ts(vector<bool> v) {
str res = "{";
f0r(i, sz(v)) res += char('0' + v[i]);
res += "}";
return res;
}
template <size_t SZ> str ts(bitset<SZ> b) {
str res = "";
f0r(i, SZ) res += char('0' + b[i]);
return res;
}
template <class A, class B> str ts(pair<A, B> p);
template <class T> str ts(T v) { // containers with begin(), end()
bool fst = 1;
str res = "{";
for (const auto &x : v) {
if (!fst)
res += ", ";
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
template <class A, class B> str ts(pair<A, B> p) {
return "(" + ts(p.first) + ", " + ts(p.second) + ")";
}
// OUTPUT
template <class A> void pr(A x) { cout << ts(x); }
template <class H, class... T> void pr(const H &h, const T &...t) {
pr(h);
pr(t...);
}
void ps() { pr("\n"); } // print w/ spaces
template <class H, class... T> void ps(const H &h, const T &...t) {
pr(h);
if (sizeof...(t))
pr(" ");
ps(t...);
}
// DEBUG
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) \
cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", \
DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
// REINITIALIZE ARRAYS BETWEEN TCs
/**
* Description: Use in place of \texttt{complex<T>}.
* Source: http://codeforces.com/blog/entry/22175, KACTL
* Verification: various
*/
typedef int T;
int sgn(T a) { return (a > 0) - (a < 0); }
T sq(T a) { return a * a; }
// using namespace Point;
typedef unsigned long long ull;
class trie {
public:
map<char, trie> l;
void add(string t) {
if (t.length() > 0) {
l[t[0]].add(t.substr(1));
}
}
bool contains(string t) {
if (not l.count(t[0]))
return false;
return l[t[0]].contains(t.substr(1));
}
};
template <class T> class rq {
/* range query
*/
vector<vector<T>> content;
function<T(T, T)> op;
public:
rq(vector<T> &orig, function<T(T, T)> operation) {
op = operation;
int size = 1;
content.emplace_back(orig);
while (size < orig.size()) {
size *= 2;
content.emplace_back(0);
auto &todo = content.back(), &from = content[content.size() - 2];
f0r(i, sz(from) - size / 2) {
todo.eb(op(from[i],
from[i + size / 2])); //[i ~ i+s[ = [i, i+s/2[ + [i+s/2,i+s[
}
}
}
T query(int i, int j) { //[i,j[
if (j <= i or j > content[0].size() or i < 0 or i >= content[0].size()) {
cerr << "i=" << i << endl;
cerr << "j=" << j << endl;
throw "bad i j";
}
tie(i, j) = mp(min(i, j), max(i, j));
int size = 1, pow = 0;
while (size * 2 < j - i) {
size *= 2, pow++;
}
assert(pow < content.size());
auto &c = content[pow];
assert(i < c.size() and i >= 0);
assert(j - size < c.size() and j - size >= 0);
T dbg = op(content[pow][i], content[pow][j - size]);
return dbg;
}
};
template <class T> class maxflow {
public:
typedef T unit;
int src, drn; // source and drain node id
vector<vi> adj, radj;
map<pi, unit> lims;
map<pi, unit> rlims; // will contain solution after solve()
void genradj() {
radj.resize(sz(adj));
f0r(from, sz(adj)) {
trav(to, adj[from]) { radj[to].emplace_back(from); }
}
}
unit solve() {
while (true) {
map<int, pair<pi, unit>> backtrack;
bool found = false;
set<int> seen; // bfs from src
queue<pair<int, unit>> todo;
todo.emplace(src, -1);
while (not todo.empty()) {
int from = todo.front().first;
unit bottleneck = todo.front().second;
todo.pop();
if (from == drn) {
found = true;
break;
}
trav(to, adj[from]) {
pi edge = mp(from, to);
unit bn = min(bottleneck, lims[edge]);
if (bn and not seen.count(to)) {
seen.emplace(to);
todo.emplace(to, bn);
backtrack[to] = mp(edge, bn);
}
}
trav(to, radj[from]) {
pi edge = mp(to, from);
unit bn = min(bottleneck, rlims[edge]);
if (bn and not seen.count(to)) {
seen.emplace(to);
todo.emplace(to, bn);
backtrack[to] = mp(edge, bn);
}
}
}
if (not found)
break;
else {
list<pi> edges;
int to = drn;
unit flow = backtrack[to].second;
while (to != src) {
pi edge = backtrack[to].first;
int from = edge.first + edge.second - to;
edges.emplace_front(edge);
to = from;
}
int from = src;
trav(e, edges) {
if (e.first == from)
rlims[e] += flow, lims[e] -= flow;
else
rlims[e] -= flow, lims[e] += flow;
from = e.first + e.second - from;
}
}
}
unit res = 0;
trav(to, adj[src]) res += rlims[mp(src, to)];
return res;
}
};
template <class T> class SuffArr {
public:
vector<vi> pow2ranks;
int loop;
int n;
SuffArr() {}
SuffArr(vector<T> &in, int loop_) { reset(in, loop_); }
SuffArr(string &in, int loop_) {
vector<T> cached;
trav(c, in) cached.emplace_back(c);
reset(cached, loop_);
}
void reset(string &in, int loop_) {
vector<T> cached;
trav(c, in) cached.emplace_back(c);
reset(cached, loop_);
}
void reset(vector<T> &in, int loop_) { // N chars in charspace K
loop = loop_, n = in.size();
pow2ranks.clear();
{
vector<pair<T, int>> initial;
map<T, queue<int>> shelf;
f0r(i, n) shelf[in[i]].emplace(i); // logK per write, NlogK
for (pair<const T, queue<int>> &kv : shelf) {
auto &block = kv.second;
while (not block.empty())
initial.emplace_back(kv.first, block.front()), block.pop();
}
int uid = 0, val = initial[0].first;
pow2ranks.emplace_back(), pow2ranks.back().resize(n);
trav(e, initial) { // N
if (val < e.first)
uid++;
pow2ranks[0][e.second] = uid, val = e.first;
}
}
int pow = 0, sz = 1;
vector<queue<pair<pi, int>>> shelf(n); //(rank1,rank2),index
while (sz < n) { // logN loops
int newpow = pow + 1, newsz = sz * 2;
pow2ranks.emplace_back(), pow2ranks.back().resize(n);
auto &oldrank = pow2ranks[pow], &newrank = pow2ranks[newpow];
vector<pair<pi, int>> tobesorted;
f0r(i, n) { // N
int j = sanitize(i + sz);
tobesorted.emplace_back(mp(mp(oldrank[i], oldrank[j]), i));
}
trav(e, tobesorted) shelf[e.first.second].emplace(e); // N
tobesorted.clear();
trav(block, shelf) while (not block.empty()) {
auto e = block.front();
block.pop();
tobesorted.emplace_back(e);
}
trav(e, tobesorted) shelf[e.first.first].emplace(e); // N
tobesorted.clear();
trav(block, shelf) while (not block.empty()) {
auto e = block.front();
block.pop();
tobesorted.emplace_back(e);
}
int uid = 0;
pi val = tobesorted[0].first;
trav(e, tobesorted) {
if (val < e.first)
uid++;
newrank[e.second] = uid, val = e.first;
}
pow = newpow, sz = newsz;
}
}
inline int sanitize(int i) {
int excess = max(i - n + 1, 0);
i -= ((excess % loop > 0) + (excess / loop)) * loop;
return i;
}
inline pair<int, int> query(int i, int len = -1) { // log len time
i = sanitize(i);
if (len == -1) {
return mp(pow2ranks.back()[i], pow2ranks.back()[i]);
}
if (len == 0) {
return mp(0, 0);
} else {
int sz = 1, pow = 0;
while ((sz << 1) < len)
sz = sz << 1, pow++; // log len time
int j = sanitize(i + len - sz);
return mp(pow2ranks[pow][i], pow2ranks[pow][j]);
}
}
};
auto __tic__ = chrono::high_resolution_clock::now();
void tic() { __tic__ = chrono::high_resolution_clock::now(); }
int toc() {
int elapsed = chrono::duration_cast<chrono::microseconds>(
chrono::high_resolution_clock::now() - __tic__)
.count();
return elapsed;
}
void precalc() {
// start here
}
// helper fuctions here
void solve(int ti) {
// start here
int n, m;
re(n, m);
vpi facts(m);
re(facts);
trav(f, facts) f.first--, f.second--;
vi repr(n);
f0r(i, n) repr[i] = i;
vi weight(n, 1);
trav(fact, facts) {
int f, s;
tie(f, s) = fact;
while (repr[f] != f)
f = repr[f];
while (repr[s] != s)
s = repr[s];
if (weight[f] > weight[s])
swap(f, s);
repr[f] = repr[s], weight[s] += weight[f];
}
map<int, int> rep2count;
f0r(i, n) {
int type = i;
while (repr[type] != type)
type = repr[type];
rep2count[type]++;
}
int best = 0;
trav(kv, rep2count) ckmax(best, kv.second);
ps(best);
}
int main() {
precalc();
bool online = true;
#ifdef OFFLINE
online = false;
if (online)
boost();
string testinputs[] = {
R"(
10 4
3 1
4 1
5 9
2 6
)",
// R"(3 2
// 1 1 0
// 1 2
// 1 3
//
//)",
}; // TODO
trav(testinput, testinputs) {
istringstream iss(testinput);
cout << "---local mode---" << endl;
cin.rdbuf(iss.rdbuf());
#endif
// setIO("A");
int T = 1;
{
// re(T);23
}
vfor(i, 1, T + 1) {
// cout << "Case #" << i << ": ";//Google Code jam
solve(i);
}
#ifdef OFFLINE
}
#endif
} | using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
typedef set<int> si;
typedef set<ll> sl;
typedef map<int, int> mii;
#define mp make_pair
#define sz(x) (int)x.size()
#define len(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
// #define pf push_front
// #define pb push_back
#define eb emplace_back
#define ep emplace
#define lb lower_bound
#define ub upper_bound
#define vfor(i, a, b) for (int i = (a); i < (b); ++i)
#define f0r(i, a) vfor(i, 0, a)
#define rof(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define r0f(i, a) rof(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define def(fname, rtype, args, ...) \
function<rtype args> fname = [__VA_ARGS__] args
#define boost() cin.tie(0), cin.sync_with_stdio(0)
template <class T>
void binstf(T &found, T a, T b, function<bool(T)> test, bool TF = true) {
T i = a, j = b;
bool da = test(a), db = test(b);
if ((da != TF) or (db == TF)) {
cerr << "---[BS: TF = " << TF << "]---" << endl;
cerr << a << "->" << da << endl;
cerr << b << "->" << db << endl;
}
while (j - i > 1) {
T m = (i + j) / 2;
if (test(m) == TF)
i = m;
else
j = m;
}
found = i;
if (not TF)
found++;
}
#define binsft(a, b, c, d) binstf(a, b, c, d, false);
template <class T> T dpow(T a, T power) {
T result = 1;
while (power) {
if (power % 2)
result *= a;
power /= 2, a = a * a;
}
return result;
}
const ld PI = acos((ld)-1);
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> bool reorder(T &a, T &b) {
return (a > b) ? swap(a, b), 1 : 0;
}
// INPUT
template <class A> void re(complex<A> &c);
template <class A, class B> void re(pair<A, B> &p);
template <class A> void re(vector<A> &v);
template <class A, size_t SZ> void re(array<A, SZ> &a);
#define ore(type, x) \
type x; \
re(x);
#define ire(x) ore(int, x);
#define vire(x) ore(vi, x);
#define lre(x) ore(ll, x);
template <class T> void re(T &x) { cin >> x; }
void re(db &d) {
str t;
re(t);
d = stod(t);
}
void re(ld &d) {
str t;
re(t);
d = stold(t);
}
template <class H, class... T> void re(H &h, T &...t) {
re(h);
re(t...);
}
template <class A> void re(complex<A> &c) {
A a, b;
re(a, b);
c = {a, b};
}
template <class A, class B> void re(pair<A, B> &p) { re(p.first, p.second); }
template <class A> void re(vector<A> &x) { trav(a, x) re(a); }
template <class A, size_t SZ> void re(array<A, SZ> &x) { trav(a, x) re(a); }
template <class T> T gcd(T a, T b) {
a = a < 0 ? -a : a;
b = b < 0 ? -b : b;
if (a * b == 0)
return max(a, b);
else
return gcd(min(a, b), max(a, b) % min(a, b));
}
const int MODE107 = 1000000007;
template <class T> T modop(T a, T mode = MODE107) {
a = a % mode;
if (a < 0)
a += mode;
return a;
}
template <class T> T inv(T a, T mode = MODE107) {
T coefa = 1, coefb = 0;
T aa = a, bb = mode;
while (aa != 1) {
if (aa > bb)
swap(coefa, coefb), swap(aa, bb);
T cc = bb / aa;
bb -= cc * aa, coefb -= cc * coefa;
swap(coefa, coefb), swap(aa, bb);
}
return coefa;
}
const int uplrDX[] = {-1, 1, 0, 0};
const int uplrDY[] = {0, 0, -1, 1};
#define ts to_string
str ts(char c) { return str(1, c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char *s) { return (str)s; }
str ts(str s) { return s; }
template <class A> str ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
str ts(vector<bool> v) {
str res = "{";
f0r(i, sz(v)) res += char('0' + v[i]);
res += "}";
return res;
}
template <size_t SZ> str ts(bitset<SZ> b) {
str res = "";
f0r(i, SZ) res += char('0' + b[i]);
return res;
}
template <class A, class B> str ts(pair<A, B> p);
template <class T> str ts(T v) { // containers with begin(), end()
bool fst = 1;
str res = "{";
for (const auto &x : v) {
if (!fst)
res += ", ";
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
template <class A, class B> str ts(pair<A, B> p) {
return "(" + ts(p.first) + ", " + ts(p.second) + ")";
}
// OUTPUT
template <class A> void pr(A x) { cout << ts(x); }
template <class H, class... T> void pr(const H &h, const T &...t) {
pr(h);
pr(t...);
}
void ps() { pr("\n"); } // print w/ spaces
template <class H, class... T> void ps(const H &h, const T &...t) {
pr(h);
if (sizeof...(t))
pr(" ");
ps(t...);
}
// DEBUG
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t))
cerr << ", ";
DBG(t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) \
cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", \
DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
// REINITIALIZE ARRAYS BETWEEN TCs
/**
* Description: Use in place of \texttt{complex<T>}.
* Source: http://codeforces.com/blog/entry/22175, KACTL
* Verification: various
*/
typedef int T;
int sgn(T a) { return (a > 0) - (a < 0); }
T sq(T a) { return a * a; }
// using namespace Point;
typedef unsigned long long ull;
class trie {
public:
map<char, trie> l;
void add(string t) {
if (t.length() > 0) {
l[t[0]].add(t.substr(1));
}
}
bool contains(string t) {
if (not l.count(t[0]))
return false;
return l[t[0]].contains(t.substr(1));
}
};
template <class T> class rq {
/* range query
*/
vector<vector<T>> content;
function<T(T, T)> op;
public:
rq(vector<T> &orig, function<T(T, T)> operation) {
op = operation;
int size = 1;
content.emplace_back(orig);
while (size < orig.size()) {
size *= 2;
content.emplace_back(0);
auto &todo = content.back(), &from = content[content.size() - 2];
f0r(i, sz(from) - size / 2) {
todo.eb(op(from[i],
from[i + size / 2])); //[i ~ i+s[ = [i, i+s/2[ + [i+s/2,i+s[
}
}
}
T query(int i, int j) { //[i,j[
if (j <= i or j > content[0].size() or i < 0 or i >= content[0].size()) {
cerr << "i=" << i << endl;
cerr << "j=" << j << endl;
throw "bad i j";
}
tie(i, j) = mp(min(i, j), max(i, j));
int size = 1, pow = 0;
while (size * 2 < j - i) {
size *= 2, pow++;
}
assert(pow < content.size());
auto &c = content[pow];
assert(i < c.size() and i >= 0);
assert(j - size < c.size() and j - size >= 0);
T dbg = op(content[pow][i], content[pow][j - size]);
return dbg;
}
};
template <class T> class maxflow {
public:
typedef T unit;
int src, drn; // source and drain node id
vector<vi> adj, radj;
map<pi, unit> lims;
map<pi, unit> rlims; // will contain solution after solve()
void genradj() {
radj.resize(sz(adj));
f0r(from, sz(adj)) {
trav(to, adj[from]) { radj[to].emplace_back(from); }
}
}
unit solve() {
while (true) {
map<int, pair<pi, unit>> backtrack;
bool found = false;
set<int> seen; // bfs from src
queue<pair<int, unit>> todo;
todo.emplace(src, -1);
while (not todo.empty()) {
int from = todo.front().first;
unit bottleneck = todo.front().second;
todo.pop();
if (from == drn) {
found = true;
break;
}
trav(to, adj[from]) {
pi edge = mp(from, to);
unit bn = min(bottleneck, lims[edge]);
if (bn and not seen.count(to)) {
seen.emplace(to);
todo.emplace(to, bn);
backtrack[to] = mp(edge, bn);
}
}
trav(to, radj[from]) {
pi edge = mp(to, from);
unit bn = min(bottleneck, rlims[edge]);
if (bn and not seen.count(to)) {
seen.emplace(to);
todo.emplace(to, bn);
backtrack[to] = mp(edge, bn);
}
}
}
if (not found)
break;
else {
list<pi> edges;
int to = drn;
unit flow = backtrack[to].second;
while (to != src) {
pi edge = backtrack[to].first;
int from = edge.first + edge.second - to;
edges.emplace_front(edge);
to = from;
}
int from = src;
trav(e, edges) {
if (e.first == from)
rlims[e] += flow, lims[e] -= flow;
else
rlims[e] -= flow, lims[e] += flow;
from = e.first + e.second - from;
}
}
}
unit res = 0;
trav(to, adj[src]) res += rlims[mp(src, to)];
return res;
}
};
template <class T> class SuffArr {
public:
vector<vi> pow2ranks;
int loop;
int n;
SuffArr() {}
SuffArr(vector<T> &in, int loop_) { reset(in, loop_); }
SuffArr(string &in, int loop_) {
vector<T> cached;
trav(c, in) cached.emplace_back(c);
reset(cached, loop_);
}
void reset(string &in, int loop_) {
vector<T> cached;
trav(c, in) cached.emplace_back(c);
reset(cached, loop_);
}
void reset(vector<T> &in, int loop_) { // N chars in charspace K
loop = loop_, n = in.size();
pow2ranks.clear();
{
vector<pair<T, int>> initial;
map<T, queue<int>> shelf;
f0r(i, n) shelf[in[i]].emplace(i); // logK per write, NlogK
for (pair<const T, queue<int>> &kv : shelf) {
auto &block = kv.second;
while (not block.empty())
initial.emplace_back(kv.first, block.front()), block.pop();
}
int uid = 0, val = initial[0].first;
pow2ranks.emplace_back(), pow2ranks.back().resize(n);
trav(e, initial) { // N
if (val < e.first)
uid++;
pow2ranks[0][e.second] = uid, val = e.first;
}
}
int pow = 0, sz = 1;
vector<queue<pair<pi, int>>> shelf(n); //(rank1,rank2),index
while (sz < n) { // logN loops
int newpow = pow + 1, newsz = sz * 2;
pow2ranks.emplace_back(), pow2ranks.back().resize(n);
auto &oldrank = pow2ranks[pow], &newrank = pow2ranks[newpow];
vector<pair<pi, int>> tobesorted;
f0r(i, n) { // N
int j = sanitize(i + sz);
tobesorted.emplace_back(mp(mp(oldrank[i], oldrank[j]), i));
}
trav(e, tobesorted) shelf[e.first.second].emplace(e); // N
tobesorted.clear();
trav(block, shelf) while (not block.empty()) {
auto e = block.front();
block.pop();
tobesorted.emplace_back(e);
}
trav(e, tobesorted) shelf[e.first.first].emplace(e); // N
tobesorted.clear();
trav(block, shelf) while (not block.empty()) {
auto e = block.front();
block.pop();
tobesorted.emplace_back(e);
}
int uid = 0;
pi val = tobesorted[0].first;
trav(e, tobesorted) {
if (val < e.first)
uid++;
newrank[e.second] = uid, val = e.first;
}
pow = newpow, sz = newsz;
}
}
inline int sanitize(int i) {
int excess = max(i - n + 1, 0);
i -= ((excess % loop > 0) + (excess / loop)) * loop;
return i;
}
inline pair<int, int> query(int i, int len = -1) { // log len time
i = sanitize(i);
if (len == -1) {
return mp(pow2ranks.back()[i], pow2ranks.back()[i]);
}
if (len == 0) {
return mp(0, 0);
} else {
int sz = 1, pow = 0;
while ((sz << 1) < len)
sz = sz << 1, pow++; // log len time
int j = sanitize(i + len - sz);
return mp(pow2ranks[pow][i], pow2ranks[pow][j]);
}
}
};
auto __tic__ = chrono::high_resolution_clock::now();
void tic() { __tic__ = chrono::high_resolution_clock::now(); }
int toc() {
int elapsed = chrono::duration_cast<chrono::microseconds>(
chrono::high_resolution_clock::now() - __tic__)
.count();
return elapsed;
}
void precalc() {
// start here
}
// helper fuctions here
void solve(int ti) {
// start here
int n, m;
re(n, m);
vpi facts(m);
re(facts);
trav(f, facts) f.first--, f.second--;
vi repr(n);
f0r(i, n) repr[i] = i;
vi weight(n, 1);
trav(fact, facts) {
int f, s;
tie(f, s) = fact;
while (repr[f] != f)
f = repr[f];
while (repr[s] != s)
s = repr[s];
if (f == s)
continue;
if (weight[f] > weight[s])
swap(f, s);
repr[f] = repr[s], weight[s] += weight[f];
}
map<int, int> rep2count;
f0r(i, n) {
int type = i;
while (repr[type] != type)
type = repr[type];
rep2count[type]++;
}
int best = 0;
trav(kv, rep2count) ckmax(best, kv.second);
ps(best);
}
int main() {
precalc();
bool online = true;
#ifdef OFFLINE
online = false;
if (online)
boost();
string testinputs[] = {
R"(
10 4
3 1
4 1
5 9
2 6
)",
// R"(3 2
// 1 1 0
// 1 2
// 1 3
//
//)",
}; // TODO
trav(testinput, testinputs) {
istringstream iss(testinput);
cout << "---local mode---" << endl;
cin.rdbuf(iss.rdbuf());
#endif
// setIO("A");
int T = 1;
{
// re(T);23
}
vfor(i, 1, T + 1) {
// cout << "Case #" << i << ": ";//Google Code jam
solve(i);
}
#ifdef OFFLINE
}
#endif
} | insert | 548 | 548 | 548 | 550 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> g[100100];
bool ind[100107];
long long n, m, mx, ans;
void dfs(long long i) {
ind[i] = 1;
mx++;
for (long long v : g[i]) {
if (ind[v] == 0)
dfs(v);
}
}
int main() {
cin >> n >> m;
long long x, y;
for (long long i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (long long i = 1; i <= n; i++) {
if (ind[i] == 0) {
mx = 0;
dfs(i);
ans = max(mx, ans);
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> g[200100];
bool ind[200107];
long long n, m, mx, ans;
void dfs(long long i) {
ind[i] = 1;
mx++;
for (long long v : g[i]) {
if (ind[v] == 0)
dfs(v);
}
}
int main() {
cin >> n >> m;
long long x, y;
for (long long i = 0; i < m; i++) {
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
for (long long i = 1; i <= n; i++) {
if (ind[i] == 0) {
mx = 0;
dfs(i);
ans = max(mx, ans);
}
}
cout << ans;
} | replace | 2 | 4 | 2 | 4 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\n"
#define int long long
#define printclock \
cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 1000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int a[N], si[N];
void initialize(int n) {
for (int i = 0; i < n; ++i) {
a[i] = i;
si[i] = 1;
}
}
int root(int i) {
while (a[i] != i)
i = a[i];
return i;
}
bool find(int A, int B) { return (root(A) == root(B)); }
void weighted_union(int A, int B) {
int root_A = root(A);
int root_B = root(B);
if (si[root_A] < si[root_B]) {
a[root_A] = a[root_B];
si[root_B] += si[root_A];
} else {
a[root_B] = a[root_A];
si[root_A] += si[root_B];
}
}
signed main() {
fastio();
// cout<<fixed<<setprecision(20);
// CHECK for LONG LONG and LONG DOUBLE
//*comment for all except cc/cf
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif //*/
int n, m;
cin >> n >> m;
initialize(n);
set<pii> s;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
x--;
y--;
s.insert({max(x, y), min(x, y)});
}
for (auto x : s) {
if (!find(x.ff, x.ss))
weighted_union(x.ff, x.ss);
}
int ans = 1;
for (int i = 0; i < n; ++i) {
ans = max(ans, si[root(i)]);
}
cout << ans;
printclock;
return 0;
} | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// using namespace __gnu_pbds;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define fill(a, val) memset(a, val, sizeof(a))
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl "\n"
#define int long long
#define printclock \
cerr << "Time : " << 1000 * (ld)clock() / (ld)CLOCKS_PER_SEC << "ms\n";
const ll MOD = 1000 * 1000 * 1000 + 7;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
const ll MOD2 = 998244353;
const ll N = 2000 * 100 + 10;
const ll N2 = 70;
const ld PI = 3.141592653589793;
// template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>;
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p = LLONG_MAX) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int a[N], si[N];
void initialize(int n) {
for (int i = 0; i < n; ++i) {
a[i] = i;
si[i] = 1;
}
}
int root(int i) {
while (a[i] != i)
i = a[i];
return i;
}
bool find(int A, int B) { return (root(A) == root(B)); }
void weighted_union(int A, int B) {
int root_A = root(A);
int root_B = root(B);
if (si[root_A] < si[root_B]) {
a[root_A] = a[root_B];
si[root_B] += si[root_A];
} else {
a[root_B] = a[root_A];
si[root_A] += si[root_B];
}
}
signed main() {
fastio();
// cout<<fixed<<setprecision(20);
// CHECK for LONG LONG and LONG DOUBLE
//*comment for all except cc/cf
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif //*/
int n, m;
cin >> n >> m;
initialize(n);
set<pii> s;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
x--;
y--;
s.insert({max(x, y), min(x, y)});
}
for (auto x : s) {
if (!find(x.ff, x.ss))
weighted_union(x.ff, x.ss);
}
int ans = 1;
for (int i = 0; i < n; ++i) {
ans = max(ans, si[root(i)]);
}
cout << ans;
printclock;
return 0;
} | replace | 30 | 31 | 30 | 31 | -11 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const int maxn = 1e5 + 5;
int n;
vector<int> adj[maxn];
int vis[maxn];
int dfs(int node) {
vis[node] = 1;
int res = 1;
for (int nei : adj[node]) {
if (vis[nei])
continue;
res += dfs(nei);
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u - 1].push_back(v - 1);
adj[v - 1].push_back(u - 1);
}
for (int i = 0; i < n; i++)
vis[i] = 0;
int res = 0;
for (int i = 0; i < n; i++) {
if (!vis[i])
res = max(res, dfs(i));
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const int maxn = 2e5 + 5;
int n;
vector<int> adj[maxn];
int vis[maxn];
int dfs(int node) {
vis[node] = 1;
int res = 1;
for (int nei : adj[node]) {
if (vis[nei])
continue;
res += dfs(nei);
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u - 1].push_back(v - 1);
adj[v - 1].push_back(u - 1);
}
for (int i = 0; i < n; i++)
vis[i] = 0;
int res = 0;
for (int i = 0; i < n; i++) {
if (!vis[i])
res = max(res, dfs(i));
}
cout << res << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02573 | C++ | Time Limit Exceeded | // atcoder
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dfs(vector<vector<ll>> adj, ll root, ll &count, vector<bool> &vis) {
vis[root] = true;
count++;
for (int i = 0; i < adj[root].size(); i++) {
if (vis[adj[root][i]] == false)
dfs(adj, adj[root][i], count, vis);
}
return count;
}
int main() {
ll n, m, u, v, ans = INT_MIN, count;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<bool> vis(n + 1, false);
while (m > 0) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
m--;
}
for (ll i = 1; i < n + 1; i++) {
count = 0;
if (vis[i] == false) {
ans = max(ans, dfs(adj, i, count, vis));
}
}
cout << ans;
return 0;
} | // atcoder
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dfs(vector<vector<ll>> &adj, ll root, ll &count, vector<bool> &vis) {
vis[root] = true;
count++;
for (int i = 0; i < adj[root].size(); i++) {
if (vis[adj[root][i]] == false)
dfs(adj, adj[root][i], count, vis);
}
return count;
}
int main() {
ll n, m, u, v, ans = INT_MIN, count;
cin >> n >> m;
vector<vector<ll>> adj(n + 1);
vector<bool> vis(n + 1, false);
while (m > 0) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
m--;
}
for (ll i = 1; i < n + 1; i++) {
count = 0;
if (vis[i] == false) {
ans = max(ans, dfs(adj, i, count, vis));
}
}
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
void dfs(vector<ll> s, ll mi, ll mx, ll N, vector<vector<ll>> &arr) {
if (s.size() == (size_t)N) {
// cout << s.c_str() << endl;
arr.push_back(s);
} else {
for (ll c = s.size() > 0 ? 0 : mi; c <= mx; c++) {
s.push_back(c);
dfs(s, mi, mx, N, arr);
s.pop_back();
}
}
return;
}
int bfs(int sx, int sy, int gx, int gy, int h, int w,
vector<vector<char>> map) {
queue<pair<int, int>> s;
vector<vector<ll>> ans;
for (int i = 0; i < h; i++) {
vector<ll> aa(w);
ans.push_back(aa);
}
s.push(make_pair(sx, sy));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
map[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 0 || tmp.first + i >= h) {
continue;
}
if (tmp.second + j < 0 || tmp.second + j >= w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (map[tmp.first + i][tmp.second + j] == '#') {
continue;
}
map[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
return ans[gy][gx];
}
ll modfactorial(ll a) {
if (a == 1)
return 1;
return (a % MOD) * (modfactorial(a - 1) % MOD);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
struct UnionFind {
// 自身が親であれば、その集合に属する頂点数に-1を掛けたもの
// そうでなければ親のid
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
/* dijkstra(G,s,dis)
入力：グラフ G, 開始点 s, 距離を格納する dis
計算量：O(|E|log|V|)
副作用：dis が書き換えられる
*/
void dijkstra(const Graph &G, int s, vector<ll> &dis, vector<ll> &prev) {
int N = G.size();
dis.resize(N, INF);
prev.resize(N, -1); // 初期化
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (dis[v] < p.first) {
continue;
}
for (auto &e : G[v]) {
if (dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
prev[e.to] = v; // 頂点 v を通って e.to にたどり着いた
pq.emplace(dis[e.to], e.to);
}
}
}
}
vector<ll> get_path(const vector<ll> &prev, ll t) {
vector<ll> path;
for (ll cur = t; cur != -1; cur = prev[cur]) {
path.push_back(cur);
}
reverse(path.begin(), path.end()); // 逆順なのでひっくり返す
return path;
}
vector<string> split(string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ll n, m;
cin >> n >> m;
UnionFind U(n);
rep(i, m) {
ll a, b;
cin >> a >> b;
U.unite(a, b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, U.size(i));
}
cout << ans << endl;
return 0;
}
// cout << std::fixed << std::setprecision(15)
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
bool is_prime(ll x) {
for (ll i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long m) {
long long ans = 1;
while (n) {
if (n & 1) {
ans = (ans * a) % m;
}
a = (a * a) % m;
n >>= 1;
}
return ans;
}
long long combi(long long n, long long a) {
long long ans = 1, ans1 = 1;
for (long long i = n - a + 1; i <= n; i++) {
ans *= i % MOD;
ans %= MOD;
}
for (long long i = 2; i <= a; i++)
ans1 = (ans1 * i) % MOD;
ans1 = modpow(ans1, MOD - 2, MOD);
return ((ans % MOD) * ans1) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
void dfs(vector<ll> s, ll mi, ll mx, ll N, vector<vector<ll>> &arr) {
if (s.size() == (size_t)N) {
// cout << s.c_str() << endl;
arr.push_back(s);
} else {
for (ll c = s.size() > 0 ? 0 : mi; c <= mx; c++) {
s.push_back(c);
dfs(s, mi, mx, N, arr);
s.pop_back();
}
}
return;
}
int bfs(int sx, int sy, int gx, int gy, int h, int w,
vector<vector<char>> map) {
queue<pair<int, int>> s;
vector<vector<ll>> ans;
for (int i = 0; i < h; i++) {
vector<ll> aa(w);
ans.push_back(aa);
}
s.push(make_pair(sx, sy));
while (s.size() > 0) {
pair<int, int> tmp = s.front();
s.pop();
map[tmp.first][tmp.second] = '#';
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (tmp.first + i < 0 || tmp.first + i >= h) {
continue;
}
if (tmp.second + j < 0 || tmp.second + j >= w) {
continue;
}
if (i != 0 && j != 0) {
continue;
}
if (i == 0 && j == 0) {
continue;
}
if (map[tmp.first + i][tmp.second + j] == '#') {
continue;
}
map[tmp.first + i][tmp.second + j] = '#';
if (ans[tmp.first + i][tmp.second + j] == 0) {
ans[tmp.first + i][tmp.second + j] = ans[tmp.first][tmp.second] + 1;
} else {
ans[tmp.first + i][tmp.second + j] =
min(ans[tmp.first + i][tmp.second + j],
ans[tmp.first][tmp.second] + 1);
}
s.push(make_pair(tmp.first + i, tmp.second + j));
}
}
}
return ans[gy][gx];
}
ll modfactorial(ll a) {
if (a == 1)
return 1;
return (a % MOD) * (modfactorial(a - 1) % MOD);
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
struct UnionFind {
// 自身が親であれば、その集合に属する頂点数に-1を掛けたもの
// そうでなければ親のid
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
/* dijkstra(G,s,dis)
入力：グラフ G, 開始点 s, 距離を格納する dis
計算量：O(|E|log|V|)
副作用：dis が書き換えられる
*/
void dijkstra(const Graph &G, int s, vector<ll> &dis, vector<ll> &prev) {
int N = G.size();
dis.resize(N, INF);
prev.resize(N, -1); // 初期化
priority_queue<P, vector<P>, greater<P>> pq;
dis[s] = 0;
pq.emplace(dis[s], s);
while (!pq.empty()) {
P p = pq.top();
pq.pop();
int v = p.second;
if (dis[v] < p.first) {
continue;
}
for (auto &e : G[v]) {
if (dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
prev[e.to] = v; // 頂点 v を通って e.to にたどり着いた
pq.emplace(dis[e.to], e.to);
}
}
}
}
vector<ll> get_path(const vector<ll> &prev, ll t) {
vector<ll> path;
for (ll cur = t; cur != -1; cur = prev[cur]) {
path.push_back(cur);
}
reverse(path.begin(), path.end()); // 逆順なのでひっくり返す
return path;
}
vector<string> split(string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
return elems;
}
vector<ll> divisor(ll n) {
vector<ll> ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
int main() {
ll n, m;
cin >> n >> m;
UnionFind U(n + 1);
rep(i, m) {
ll a, b;
cin >> a >> b;
U.unite(a, b);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = max(ans, U.size(i));
}
cout << ans << endl;
return 0;
}
// cout << std::fixed << std::setprecision(15)
| replace | 266 | 267 | 266 | 267 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 1e15
vector<ll> ad[400009];
map<pair<ll, ll>, ll> mp;
bool vis[400009];
ll A;
ll dfs(ll a) {
vis[a] = true;
A++;
ll i, b, l = ad[a].size();
for (i = 0; i < l; i++) {
b = ad[a][i];
if (!vis[b]) {
dfs(b);
}
}
}
int main() {
ll a, b, c, d, e, i, j, k, l, n, m, x, y, t, p;
cin >> n >> m;
for (i = 0; i <= n; i++) {
vis[i] = false;
}
for (i = 1; i <= m; i++) {
cin >> a >> b;
if (mp[make_pair(a, b)] == 0) {
mp[make_pair(a, b)] = 1;
mp[make_pair(b, a)] = 1;
} else {
continue;
}
ad[a].push_back(b);
ad[b].push_back(a);
}
ll ans = 0;
for (i = 1; i <= n; i++) {
if (!vis[i]) {
A = 0;
dfs(i);
ans = max(ans, A);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 1e15
vector<ll> ad[400009];
map<pair<ll, ll>, ll> mp;
bool vis[400009];
ll A;
void dfs(ll a) {
vis[a] = true;
A++;
ll i, b, l = ad[a].size();
for (i = 0; i < l; i++) {
b = ad[a][i];
if (!vis[b]) {
dfs(b);
}
}
}
int main() {
ll a, b, c, d, e, i, j, k, l, n, m, x, y, t, p;
cin >> n >> m;
for (i = 0; i <= n; i++) {
vis[i] = false;
}
for (i = 1; i <= m; i++) {
cin >> a >> b;
if (mp[make_pair(a, b)] == 0) {
mp[make_pair(a, b)] = 1;
mp[make_pair(b, a)] = 1;
} else {
continue;
}
ad[a].push_back(b);
ad[b].push_back(a);
}
ll ans = 0;
for (i = 1; i <= n; i++) {
if (!vis[i]) {
A = 0;
dfs(i);
ans = max(ans, A);
}
}
cout << ans << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2 * 1000 * 100 + 11;
int parent[MAX];
int n, m;
void make_set(int node) { parent[node] = node; }
int find_set(int node) {
if (node == parent[node]) {
return node;
}
return find_set(parent[node]);
}
void union_sets(int firstNode, int secondNode) {
int parentOfFirstNode = find_set(firstNode);
int parentOfSecondNode = find_set(secondNode);
if (parentOfFirstNode != parentOfSecondNode) {
parent[parentOfSecondNode] = parentOfFirstNode;
}
}
map<int, int> mp;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
make_set(i);
}
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
union_sets(x, y);
}
for (int i = 1; i <= n; i++) {
mp[find_set(i)]++;
}
int res = 0;
for (auto it : mp) {
res = max(res, it.second);
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 2 * 1000 * 100 + 11;
int parent[MAX];
int n, m;
void make_set(int node) { parent[node] = node; }
int find_set(int node) {
if (node == parent[node]) {
return node;
}
return parent[node] = find_set(parent[node]);
}
void union_sets(int firstNode, int secondNode) {
int parentOfFirstNode = find_set(firstNode);
int parentOfSecondNode = find_set(secondNode);
if (parentOfFirstNode != parentOfSecondNode) {
parent[parentOfSecondNode] = parentOfFirstNode;
}
}
map<int, int> mp;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
make_set(i);
}
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
union_sets(x, y);
}
for (int i = 1; i <= n; i++) {
mp[find_set(i)]++;
}
int res = 0;
for (auto it : mp) {
res = max(res, it.second);
}
cout << res;
return 0;
}
| replace | 15 | 16 | 15 | 16 | TLE | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const int N = 1e5 + 7;
int used[N];
vector<int> g[N];
void dfs(int cur, int &c) {
c++;
used[cur] = 1;
for (auto t : g[cur]) {
if (!used[t]) {
dfs(t, c);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
g[v].push_back(u);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!used[i]) {
int c = 0;
dfs(i, c);
ans = max(ans, c);
}
}
cout << ans << '\n';
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const int N = 2e5 + 7;
int used[N];
vector<int> g[N];
void dfs(int cur, int &c) {
c++;
used[cur] = 1;
for (auto t : g[cur]) {
if (!used[t]) {
dfs(t, c);
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
g[u].push_back(v);
g[v].push_back(u);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!used[i]) {
int c = 0;
dfs(i, c);
ans = max(ans, c);
}
}
cout << ans << '\n';
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
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;
}
struct UnionFind {
vector<int> par;
// 要素nで初期化
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
// xが属する集合の根を返す
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
// xとyが同じ集合に属しているかを判定
bool issame(int x, int y) { return root(x) == root(y); }
// xが属する集合とyが属する集合をマージ
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // 計算量が減るよ
par[x] += par[y];
par[y] = x;
return true;
}
// xが属する集合のサイズ
int size(int x) { return -par[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind uf(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
uf.merge(a, b);
}
int ans = -1;
for (int i = 1; i <= n; i++) {
ans = max(ans, uf.size(i));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
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;
}
struct UnionFind {
vector<int> par;
// 要素nで初期化
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
// xが属する集合の根を返す
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
// xとyが同じ集合に属しているかを判定
bool issame(int x, int y) { return root(x) == root(y); }
// xが属する集合とyが属する集合をマージ
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // 計算量が減るよ
par[x] += par[y];
par[y] = x;
return true;
}
// xが属する集合のサイズ
int size(int x) { return -par[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind uf(n + 1);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
uf.merge(a, b);
}
int ans = -1;
for (int i = 1; i <= n; i++) {
ans = max(ans, uf.size(i));
}
cout << ans << endl;
return 0;
} | replace | 66 | 67 | 66 | 67 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fst \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endk cout << "\n";
typedef long long int ll;
typedef long int l;
#define l(i, a, b) for (i = a; i < b; i++)
#define lo(i, a, b) for (i = a; i >= b; i--)
#define s(v) sort(v.begin(), v.end());
#define pb push_back;
#define vll vector<ll>
#define vint vector<int>
#define test() \
ll t; \
cin >> t; \
while (t--) { \
solve(); \
};
#define test1() \
int t = 1; \
while (t--) { \
solve(); \
};
bool isPrime(ll x) {
ll i, n;
n = sqrt(x);
if (x == 1)
return false;
if (x == 2 || x == 3)
return true;
for (i = 2; i <= n; i++) {
if (!(x % i))
return false;
}
return true;
}
ll power(ll x, ll y) {
ll ans = 1;
while (y > 0) {
if (y & 1)
ans = ans * x;
x = x * x;
y = y >> 1;
}
return ans;
}
vll adj[100001];
vll visited(100001, 0);
ll sum = 0;
void dfs(ll n) {
visited[n]++;
sum++;
ll i, j;
j = adj[n].size();
for (i = 0; i < j; i++) {
// cout<<adj[n][i]<<"s "<<n;
// endk
if (!visited[adj[n][i]]) {
dfs(adj[n][i]);
}
}
}
int solve() {
ll n, m, i, ans = 0, j, k;
cin >> n >> m;
map<pair<ll, ll>, ll> cnt;
for (i = 0; i < m; i++) {
cin >> j >> k;
if (!cnt[{j, k}]) {
cnt[{j, k}]++;
adj[j].push_back(k);
adj[k].push_back(j);
}
}
ans = -1;
for (i = 1; i <= n; i++) {
if (!visited[i]) {
sum = 0;
dfs(i);
ans = max(ans, sum);
}
}
cout << ans;
return 0;
}
int main() {
fst;
test1();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fst \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endk cout << "\n";
typedef long long int ll;
typedef long int l;
#define l(i, a, b) for (i = a; i < b; i++)
#define lo(i, a, b) for (i = a; i >= b; i--)
#define s(v) sort(v.begin(), v.end());
#define pb push_back;
#define vll vector<ll>
#define vint vector<int>
#define test() \
ll t; \
cin >> t; \
while (t--) { \
solve(); \
};
#define test1() \
int t = 1; \
while (t--) { \
solve(); \
};
bool isPrime(ll x) {
ll i, n;
n = sqrt(x);
if (x == 1)
return false;
if (x == 2 || x == 3)
return true;
for (i = 2; i <= n; i++) {
if (!(x % i))
return false;
}
return true;
}
ll power(ll x, ll y) {
ll ans = 1;
while (y > 0) {
if (y & 1)
ans = ans * x;
x = x * x;
y = y >> 1;
}
return ans;
}
vector<vll> adj(200001);
map<ll, ll> visited;
ll sum = 0;
void dfs(ll n) {
visited[n]++;
sum++;
ll i, j;
j = adj[n].size();
for (i = 0; i < j; i++) {
// cout<<adj[n][i]<<"s "<<n;
// endk
if (!visited[adj[n][i]]) {
dfs(adj[n][i]);
}
}
}
int solve() {
ll n, m, i, ans = 0, j, k;
cin >> n >> m;
map<pair<ll, ll>, ll> cnt;
for (i = 0; i < m; i++) {
cin >> j >> k;
if (!cnt[{j, k}]) {
cnt[{j, k}]++;
adj[j].push_back(k);
adj[k].push_back(j);
}
}
ans = -1;
for (i = 1; i <= n; i++) {
if (!visited[i]) {
sum = 0;
dfs(i);
ans = max(ans, sum);
}
}
cout << ans;
return 0;
}
int main() {
fst;
test1();
return 0;
}
| replace | 49 | 51 | 49 | 51 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cerr << v[i] << " "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
ll x, c;
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
struct UnionFind {
ll N;
llvec p;
llvec cnt;
UnionFind(ll n) {
N = n;
p = llvec(N);
cnt = llvec(N, 0);
rep(i, N) {
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b) {
P at = root(a);
P bt = root(b);
if (at.second != bt.second) {
if (at.first > bt.first) {
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second] += cnt[at.second];
p[a] = bt.second;
}
}
P root(ll a) {
ll atmp = a;
ll c = 0;
while (atmp != p[atmp]) {
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b) {
P at = root(a);
P bt = root(b);
return at.second == bt.second;
}
};
struct dijkstra {
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n) {
N = n;
// d = llvec(N, 1e18);
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost) { e[from].push_back({to, cost}); }
void run(ll start) {
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start] = 0;
while (!que.empty()) {
P q = que.top();
que.pop();
ll dc = q.first;
ll x = q.second;
if (dc > d[x]) {
continue;
} else {
for (auto ip : e[x]) {
if (d[ip.x] <= d[x] + ip.c) {
continue;
} else {
d[ip.x] = d[x] + ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll N;
cin >> N;
UnionFind uf(N);
ll M;
cin >> M;
rep(i, M) {
ll a, b;
cin >> a >> b;
a--;
b--;
uf.con(a, b);
}
ll ans = 0;
rep(i, N) {
auto root = uf.root(i);
ans = max(ans, uf.cnt[root.se]);
}
cout << ans;
return 0;
}
| #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cerr << v[i] << " "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
ll x, c;
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
struct UnionFind {
ll N;
llvec p;
llvec cnt;
UnionFind(ll n) {
N = n;
p = llvec(N);
cnt = llvec(N, 0);
rep(i, N) {
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b) {
P at = root(a);
P bt = root(b);
if (at.second != bt.second) {
if (at.first > bt.first) {
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second] += cnt[at.second];
p[a] = bt.second;
}
}
P root(ll a) {
ll atmp = a;
ll c = 0;
while (atmp != p[atmp]) {
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b) {
P at = root(a);
P bt = root(b);
return at.second == bt.second;
}
};
struct dijkstra {
ll N;
llvec d;
vector<vector<edge>> e;
dijkstra(ll n) {
N = n;
// d = llvec(N, 1e18);
e = vector<vector<edge>>(N);
}
void add_edge(ll from, ll to, ll cost) { e[from].push_back({to, cost}); }
void run(ll start) {
priority_queue<P, vector<P>, greater<P>> que;
que.push({0, start});
d = llvec(N, 1e18);
d[start] = 0;
while (!que.empty()) {
P q = que.top();
que.pop();
ll dc = q.first;
ll x = q.second;
if (dc > d[x]) {
continue;
} else {
for (auto ip : e[x]) {
if (d[ip.x] <= d[x] + ip.c) {
continue;
} else {
d[ip.x] = d[x] + ip.c;
que.push({d[ip.x], ip.x});
}
}
}
}
}
};
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll N;
cin >> N;
UnionFind uf(N);
ll M;
cin >> M;
rep(i, M) {
ll a, b;
cin >> a >> b;
a--;
b--;
uf.con(a, b);
}
ll ans = 0;
rep(i, N) {
// auto root = uf.root(i);
ans = max(ans, uf.cnt[i]);
}
cout << ans;
return 0;
}
| replace | 188 | 190 | 188 | 190 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
using namespace std;
struct UF {
vector<int> data;
UF(int n) { data.assign(n, -1); }
void merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
}
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UF data(n);
int ans = 0;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
data.merge(a, b);
}
rep(i, n) chmax(ans, data.size(i));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
using ull = unsigned long long;
using namespace std;
struct UF {
vector<int> data;
UF(int n) { data.assign(n, -1); }
void merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UF data(n);
int ans = 0;
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
data.merge(a, b);
}
rep(i, n) chmax(ans, data.size(i));
cout << ans << endl;
return 0;
}
| insert | 37 | 37 | 37 | 38 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
int visited[maxn];
set<int> g[maxn];
int dfs(int u) {
int cur = 1;
visited[u] = true;
for (auto x : g[u]) {
if (!visited[x]) {
cur += dfs(x);
}
}
return cur;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
g[a].insert(b);
g[b].insert(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!visited[i])
ans = max(ans, dfs(i));
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;
int visited[maxn];
set<int> g[maxn];
int dfs(int u) {
int cur = 1;
visited[u] = true;
for (auto x : g[u]) {
if (!visited[x]) {
cur += dfs(x);
}
}
return cur;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
g[a].insert(b);
g[b].insert(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!visited[i])
ans = max(ans, dfs(i));
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN = 1e5, INF = 999999999;
const int modr = 1e9 + 7;
int n, m, a[mxN];
/* 1. If you can't keep solution in mind, then visualize it on a paper.
* 2. Try to identify the type of problem - DP, Greedy, Graph, Constructive,
* Prefix/Suffix, Difference Array, BIT/Segment Tree, etc.
* 3. Look at the problems from different perspectives - reverse the problem,
* add instead of delete (maybe?)
* 4. Divide difficult solutions into cases and/or sequences.
* 5. Use math rules to solve Nested Summation.
* 6. Optimisation problems are generally solved with DP, greedy, binary search
* or brute-force.
* ------------------------------------------------------------------
*/
bool vis[mxN];
vector<int> adj[mxN];
int t;
void dfs(int s) {
vis[s] = true;
t++;
for (auto child : adj[s]) {
if (!vis[child]) {
dfs(child);
}
}
}
void solve() {
cin >> n >> m;
int x, y;
for (int i = 0; i <= n; i++) {
adj[i].clear();
vis[i] = false;
}
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int maxm = -1;
for (int i = 0; i <= n; i++) {
if (!vis[i]) {
t = 0;
dfs(i);
maxm = max(maxm, t);
}
}
cout << maxm;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN = 2e5 + 5, INF = 999999999;
const int modr = 1e9 + 7;
int n, m, a[mxN];
/* 1. If you can't keep solution in mind, then visualize it on a paper.
* 2. Try to identify the type of problem - DP, Greedy, Graph, Constructive,
* Prefix/Suffix, Difference Array, BIT/Segment Tree, etc.
* 3. Look at the problems from different perspectives - reverse the problem,
* add instead of delete (maybe?)
* 4. Divide difficult solutions into cases and/or sequences.
* 5. Use math rules to solve Nested Summation.
* 6. Optimisation problems are generally solved with DP, greedy, binary search
* or brute-force.
* ------------------------------------------------------------------
*/
bool vis[mxN];
vector<int> adj[mxN];
int t;
void dfs(int s) {
vis[s] = true;
t++;
for (auto child : adj[s]) {
if (!vis[child]) {
dfs(child);
}
}
}
void solve() {
cin >> n >> m;
int x, y;
for (int i = 0; i <= n; i++) {
adj[i].clear();
vis[i] = false;
}
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int maxm = -1;
for (int i = 0; i <= n; i++) {
if (!vis[i]) {
t = 0;
dfs(i);
maxm = max(maxm, t);
}
}
cout << maxm;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
#include <cstring>
int n, m;
struct unionfind {
int parent;
int node;
int edge;
};
unionfind g[100001];
void init() {
for (int i = 0; i <= n; i++) {
g[i].parent = i;
g[i].node = 1;
g[i].edge = 0;
}
}
int find(int x) {
if (x == g[x].parent) {
return x;
}
int res = find(g[x].parent);
g[x].node = g[res].node;
g[x].edge = g[res].edge;
g[x].parent = res;
return res;
}
void merge(int x, int y) {
if (x > y) {
x ^= y;
y ^= x;
x ^= y;
}
g[x].node += g[y].node;
g[x].edge += g[y].edge + 1;
g[y].parent = x;
}
int main() {
int a, b, ans = 0;
cin >> n >> m;
init();
for (int i = 0; i < m; i++) {
cin >> a >> b;
a = find(a);
b = find(b);
if (a != b) {
merge(a, b);
}
}
for (int i = 1; i <= n; i++) {
if (g[i].parent == i) {
ans = max(ans, g[i].node);
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
#include <cstring>
int n, m;
struct unionfind {
int parent;
int node;
int edge;
};
unionfind g[300001];
void init() {
for (int i = 0; i <= n; i++) {
g[i].parent = i;
g[i].node = 1;
g[i].edge = 0;
}
}
int find(int x) {
if (x == g[x].parent) {
return x;
}
int res = find(g[x].parent);
g[x].node = g[res].node;
g[x].edge = g[res].edge;
g[x].parent = res;
return res;
}
void merge(int x, int y) {
if (x > y) {
x ^= y;
y ^= x;
x ^= y;
}
g[x].node += g[y].node;
g[x].edge += g[y].edge + 1;
g[y].parent = x;
}
int main() {
int a, b, ans = 0;
cin >> n >> m;
init();
for (int i = 0; i < m; i++) {
cin >> a >> b;
a = find(a);
b = find(b);
if (a != b) {
merge(a, b);
}
}
for (int i = 1; i <= n; i++) {
if (g[i].parent == i) {
ans = max(ans, g[i].node);
}
}
cout << ans << endl;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
struct UnionFind {
vector<int> Parent;
vector<int> Size;
UnionFind(int N) : Parent(N), Size(N, 1) {
for (int i = 0; i < N; i++)
Parent[i] = i;
}
int root(int A) {
if (Parent[A] == A)
return A;
return Parent[A] = root(Parent[A]);
}
bool merge(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (Size[A] < Size[B])
swap(A, B);
Size[A] += Size[B];
Parent[B] = A;
return true;
}
bool issame(int A, int B) { //
return root(A) == root(B);
}
int findsize(int A) { return Size[root(A)]; }
};
signed main() {
int n, m;
cin >> n >> m;
UnionFind Tree(n);
vector<int> a(n), b(n);
rep(i, m) {
cin >> a[i] >> b[i];
a[i]--;
b[i]--;
Tree.merge(a[i], b[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int s = Tree.findsize(i);
ans = max(ans, s);
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
struct UnionFind {
vector<int> Parent;
vector<int> Size;
UnionFind(int N) : Parent(N), Size(N, 1) {
for (int i = 0; i < N; i++)
Parent[i] = i;
}
int root(int A) {
if (Parent[A] == A)
return A;
return Parent[A] = root(Parent[A]);
}
bool merge(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (Size[A] < Size[B])
swap(A, B);
Size[A] += Size[B];
Parent[B] = A;
return true;
}
bool issame(int A, int B) { //
return root(A) == root(B);
}
int findsize(int A) { return Size[root(A)]; }
};
signed main() {
int n, m;
cin >> n >> m;
UnionFind Tree(n);
vector<int> a(m), b(m);
rep(i, m) {
cin >> a[i] >> b[i];
a[i]--;
b[i]--;
Tree.merge(a[i], b[i]);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int s = Tree.findsize(i);
ans = max(ans, s);
}
cout << ans << '\n';
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEBUG(x) cout<<#x<<":"<<x<<"\n"
#define DEBUGS(v) cout << #v << ":";for(auto x:v){cout<<x<<" ";}cout<<"\n"
#endif
#ifndef __DEBUG__
#define CH_P(a)
#define DEBUG(x)
#define DEBUGS(v)
#endif
/* clang-format on */
struct edge {
ll from;
ll to;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, m;
cin >> n >> m;
vector<ll> a(m), b(m);
vector<vector<ll>> e(n, vector<ll>(0));
if (m == 0) {
cout << 1 << endl;
return 0;
}
REP(i, m) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
e[a[i]].push_back(b[i]);
e[b[i]].push_back(a[i]);
}
vector<bool> f(n, false);
vector<set<ll>> group(1);
vector<vector<ll>> g(1, vector<ll>(0));
REP(i, n) {
queue<ll> q;
if (f[i] || e[i].empty())
continue;
q.push(i);
group[group.size() - 1].insert(i);
g[g.size() - 1].push_back(i);
while (!q.empty()) {
for (auto next : e[q.front()]) {
if (!f[next]) {
q.push(next);
group[group.size() - 1].insert(next);
g[g.size() - 1].push_back(next);
f[next] = true;
}
}
q.pop();
}
group.push_back({});
g.push_back({});
}
ll ans = 0;
REP(i, m) { ans = max(ans, (ll)group[i].size()); }
REP(i, g.size()) { DEBUGS(g[i]); }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEBUG(x) cout<<#x<<":"<<x<<"\n"
#define DEBUGS(v) cout << #v << ":";for(auto x:v){cout<<x<<" ";}cout<<"\n"
#endif
#ifndef __DEBUG__
#define CH_P(a)
#define DEBUG(x)
#define DEBUGS(v)
#endif
/* clang-format on */
struct edge {
ll from;
ll to;
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, m;
cin >> n >> m;
vector<ll> a(m), b(m);
vector<vector<ll>> e(n, vector<ll>(0));
if (m == 0) {
cout << 1 << endl;
return 0;
}
REP(i, m) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
e[a[i]].push_back(b[i]);
e[b[i]].push_back(a[i]);
}
vector<bool> f(n, false);
vector<set<ll>> group(1);
vector<vector<ll>> g(1, vector<ll>(0));
REP(i, n) {
queue<ll> q;
if (f[i] || e[i].empty())
continue;
q.push(i);
group[group.size() - 1].insert(i);
g[g.size() - 1].push_back(i);
while (!q.empty()) {
for (auto next : e[q.front()]) {
if (!f[next]) {
q.push(next);
group[group.size() - 1].insert(next);
g[g.size() - 1].push_back(next);
f[next] = true;
}
}
q.pop();
}
group.push_back({});
g.push_back({});
}
ll ans = 0;
REP(i, group.size()) { ans = max(ans, (ll)group[i].size()); }
// REP(i, g.size()) { DEBUGS(g[i]); }
cout << ans << endl;
return 0;
}
| replace | 70 | 72 | 70 | 72 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int getParent(vector<int> &parent, int x) {
if (parent[x] < 0)
return x;
return parent[x] = getParent(parent, parent[x]);
}
void uniteParent(vector<int> &parent, int a, int b) {
a = getParent(parent, a);
b = getParent(parent, b);
if (a == b)
return;
if (a > b)
swap(a, b);
// 항상 a < b
parent[a] += parent[b];
parent[b] = a;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> parent(n + 1, -1);
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
uniteParent(parent, a, b);
}
int cnt = 0;
for (int i = 1; i < n + 1; i++) {
cnt = max(cnt, -parent[parent[i]]);
}
cout << cnt;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int getParent(vector<int> &parent, int x) {
if (parent[x] < 0)
return x;
return parent[x] = getParent(parent, parent[x]);
}
void uniteParent(vector<int> &parent, int a, int b) {
a = getParent(parent, a);
b = getParent(parent, b);
if (a == b)
return;
if (a > b)
swap(a, b);
// 항상 a < b
parent[a] += parent[b];
parent[b] = a;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> parent(n + 1, -1);
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
uniteParent(parent, a, b);
}
int cnt = 0;
for (int i = 1; i < n + 1; i++) {
cnt = max(cnt, -parent[i]);
}
cout << cnt;
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define dbg(x) cout << #x << ": " << x << endl
#define clr(x, v) memset(x, v, sizeof(x))
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int parent[MAXN], sz[MAXN];
void make_set() {
iota(parent, parent + MAXN, 0);
fill(sz, sz + MAXN, 1);
}
int find_set(int v) {
if (v == parent[v])
return v;
else
return parent[v] = find_set(parent[v]);
}
bool union_set(int a, int b) {
a = find_set(a), b = find_set(b);
if (sz[a] < sz[b])
swap(a, b);
if (a != b)
parent[b] = a, sz[a] += sz[b];
}
void cp() {
int n, m;
cin >> n >> m;
make_set();
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
union_set(u, v);
}
int mx = 1;
for (int i = 0; i < n; i++)
if (i == find_set(i))
mx = max(mx, sz[i]);
cout << mx;
}
int main() {
FASTIO;
int t;
t = 1;
// cin >> t;
while (t--) {
cp();
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pi pair<int, int>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define dbg(x) cout << #x << ": " << x << endl
#define clr(x, v) memset(x, v, sizeof(x))
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const double eps = 1e-9;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
const int MAXN = 2e5 + 5;
int parent[MAXN], sz[MAXN];
void make_set() {
iota(parent, parent + MAXN, 0);
fill(sz, sz + MAXN, 1);
}
int find_set(int v) {
if (v == parent[v])
return v;
else
return parent[v] = find_set(parent[v]);
}
bool union_set(int a, int b) {
a = find_set(a), b = find_set(b);
if (sz[a] < sz[b])
swap(a, b);
if (a != b)
parent[b] = a, sz[a] += sz[b];
return a != b;
}
void cp() {
int n, m;
cin >> n >> m;
make_set();
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
union_set(u, v);
}
int mx = 1;
for (int i = 0; i < n; i++)
if (i == find_set(i))
mx = max(mx, sz[i]);
cout << mx;
}
int main() {
FASTIO;
int t;
t = 1;
// cin >> t;
while (t--) {
cp();
}
return 0;
} | insert | 45 | 45 | 45 | 46 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> g[1000000];
bool vis[100000];
int cnt;
void dfs(int node) {
if (vis[node] == 1)
return;
vis[node] = 1;
cnt++;
for (auto c : g[node])
dfs(c);
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
cnt = 0;
dfs(i);
mx = max(cnt, mx);
}
}
cout << mx << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> g[1000079];
bool vis[1000009];
int cnt;
void dfs(int node) {
if (vis[node] == 1)
return;
vis[node] = 1;
cnt++;
for (auto c : g[node])
dfs(c);
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
cnt = 0;
dfs(i);
mx = max(cnt, mx);
}
}
cout << mx << endl;
} | replace | 2 | 4 | 2 | 4 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define deb(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define deb(x...)
#endif
#define ll long long
#define int long long
#define pb push_back
#define ff first
#define sec second
#define eb emplace_back
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define all(x) x.begin(), x.end()
#define sz(v) ((int)(v.size()))
#define mem(a, val) memset(&a, val, sizeof(a))
#define mid(s, e) ((s) + ((e) - (s)) / 2)
#define endl '\n'
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define fo(i, a, b) for (ll i = (int)(a); i <= (int)(b); ++i)
#define fr(i, b) for (ll i = (int)0; i < (int)(b); ++i)
#define rf(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
#define read(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i];
#define show(a, n) \
for (int i = 0; i < n; ++i) \
cout << a[i] << ' '; \
cout << endl;
template <typename... T> void rd(T &...args) { ((cin >> args), ...); }
template <typename... T> void pp(T... args) {
((cout << args << " "), ...);
cout << "\n";
}
const int MOD = 1e9 + 7;
const int INF = 1e18;
void add(ll &x, ll y) {
x += y;
if (x >= MOD)
x -= MOD;
if (x < 0)
x += MOD;
}
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
const int N = 2e5 + 10;
vi parent(N);
void make_set(int v) { parent[v] = v; }
int find_set(int v) {
if (v == parent[v])
return v;
return find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b)
parent[b] = a;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
make_set(i);
for (int i = 0; i < m; i++) {
int a, b;
rd(a, b);
a--;
b--;
union_sets(a, b);
}
vi freq(N, 0);
int mx = 0;
for (int i = 0; i < n; i++) {
int x = find_set(i);
freq[x]++;
mx = max(freq[x], mx);
}
pp(mx);
}
int32_t main() {
speedio;
cout << fixed << setprecision(12);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
int T = 1; // cin>>T;
while (T--) {
solve();
}
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_set>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
#define speedio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define deb(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define deb(x...)
#endif
#define ll long long
#define int long long
#define pb push_back
#define ff first
#define sec second
#define eb emplace_back
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define all(x) x.begin(), x.end()
#define sz(v) ((int)(v.size()))
#define mem(a, val) memset(&a, val, sizeof(a))
#define mid(s, e) ((s) + ((e) - (s)) / 2)
#define endl '\n'
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
#define fo(i, a, b) for (ll i = (int)(a); i <= (int)(b); ++i)
#define fr(i, b) for (ll i = (int)0; i < (int)(b); ++i)
#define rf(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
#define read(a, n) \
for (int i = 0; i < n; ++i) \
cin >> a[i];
#define show(a, n) \
for (int i = 0; i < n; ++i) \
cout << a[i] << ' '; \
cout << endl;
template <typename... T> void rd(T &...args) { ((cin >> args), ...); }
template <typename... T> void pp(T... args) {
((cout << args << " "), ...);
cout << "\n";
}
const int MOD = 1e9 + 7;
const int INF = 1e18;
void add(ll &x, ll y) {
x += y;
if (x >= MOD)
x -= MOD;
if (x < 0)
x += MOD;
}
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
const int N = 2e5 + 10;
vi parent(N);
void make_set(int v) { parent[v] = v; }
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b)
parent[b] = a;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
make_set(i);
for (int i = 0; i < m; i++) {
int a, b;
rd(a, b);
a--;
b--;
union_sets(a, b);
}
vi freq(N, 0);
int mx = 0;
for (int i = 0; i < n; i++) {
int x = find_set(i);
freq[x]++;
mx = max(freq[x], mx);
}
pp(mx);
}
int32_t main() {
speedio;
cout << fixed << setprecision(12);
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
int T = 1; // cin>>T;
while (T--) {
solve();
}
return 0;
}
| replace | 137 | 138 | 137 | 138 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long //
#define rp(i, a, b) for (ll i = a; i < b; i++)
#define r(i, n) for (ll i = 0; i < n; i++)
#define rt return
#define db double
#define ldb long double
#define vd void
#define p(x) cout << (x) << endl;
#define psc(x) cout << setprecision(50) << (x) << endl;
#define precise(x) cout << setprecision(50) << x << endl;
#define ce continue;
#define bl bool
#define r0 rt 0;
#define r1 rt 1;
#define elif else if
#define bk break;
#define A p("A")
#define B p("B")
#define C p("C")
#define D p("D")
#define E p("E")
#define F p("F")
#define S(a) sort(a.begin(), a.end());
#define R(a) reverse(a.begin(), a.end());
#define cl cout << endl;
#define pb(x) push_back(x);
#define str string
using namespace std;
void Cond(int g) {
if (g)
p("YES") else p("NO") rt;
}
void cond(int g) {
if (g)
p("Yes") else p("No") rt;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
rt b;
gcd(b, a % b);
}
str su = "0123456789";
str m1 = "abcdefghijklmnopqrstuvwxyz";
str m2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, ll> m5;
typedef pair<ll, ll> P;
const ll INF = (ll)1e18 + 10;
ll t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, g = 0,
ans = 0;
ll n = 0, m = 0, mx = -INF, mn = INF, ct = 0, cnt = 0;
ll sum = 0, mask = 0;
ll k;
set<P> pst;
set<ll> st;
ll powmod(ll a, ll b, ll x) { //(a^b)modx
if (!b)
r1 if (!(b % 2)) { // B
ll t = powmod(a, b / 2, x);
rt t *t % x;
}
rt((a)*powmod(a, b - 1, x)) % x;
}
void di() {
m5['a'] = 0;
m5['b'] = 1;
m5['c'] = 2;
m5['d'] = 3;
m5['e'] = 4;
m5['f'] = 5;
m5['g'] = 6;
m5['h'] = 7;
m5['i'] = 8;
m5['j'] = 9;
m5['k'] = 10;
m5['l'] = 11;
m5['m'] = 12;
m5['n'] = 13;
m5['o'] = 14;
m5['p'] = 15;
m5['q'] = 16;
m5['r'] = 17;
m5['s'] = 18;
m5['t'] = 19;
m5['u'] = 20;
m5['v'] = 21;
m5['w'] = 22;
m5['x'] = 23;
m5['y'] = 24;
m5['z'] = 25;
}
map<ll, ll> mp;
typedef std::vector<ll> vl;
typedef pair<ll, ll> P;
typedef pair<ll, P> P2;
typedef struct edge2 {
P tos;
ll cost;
} EDGE2;
typedef struct edge1 {
ll to, cost;
} EDGE;
bl used[(ll)1e6];
const ll M = (ll)1e9 + 7;
ll fac[1000007], finv[1000007], inv[1000007];
void initcmb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000007; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
ll cmb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
db pi =
3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196;
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;
}
const ll MAX = (ll)1e5 * 3;
vl rui(MAX);
vl ru1(MAX);
vl ru2(MAX);
vector<vector<EDGE>> G(1e6);
// int -2,147,483,648 ～ 2,147,483,647
// alt f3
vector<vector<ll>> a(1e6);
vl color(1e5, -1);
vd dfs(ll vtx) {
color[vtx] = k;
used[vtx] = true;
r(i, a[vtx].size()) {
if (used[a[vtx][i]] == false) {
dfs(a[vtx][i]);
}
}
rt;
}
int main() { // swap(ary１,ary２)
// a.erase(a.begin()+5),a.insert(a.begin()+3,tmp)
// ios_base::sync_with_stdio(0); cin.tie(0);
// long long 型でREになる時はint型で書き直す
clock_t start = clock(); // timecalc
k = 1;
cin >> n >> m;
set<P> pst;
r(i, m) {
cin >> t1 >> t2;
mn = min(t1, t2);
mx = (t1, t2);
pst.insert({t1, t2});
st.insert(t1);
st.insert(t2);
}
for (P i : pst) {
t1 = i.first;
t2 = i.second;
a[t1].pb(t2);
a[t2].pb(t1);
}
rp(i, 1, n + 1) {
if (used[i] == false) {
dfs(i);
}
k++;
}
// p("COLORS")
// rp(i, 1, n + 1) {
// p(color[i])
// }
// // p("END ")
k--; // sup val .
rp(i, 1, n + 1) { mp[color[i]]++; }
mx = -INF;
rp(i, 1, k + 1) {
// cout << i << " th cols num " << mp[i] << endl;
chmax(mx, mp[i]);
}
p(mx)
clock_t end = clock(); //
const double time =
static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0; // timecalc
// printfz("time %lf[ms]\n", time);//
return 0;
} // main
| #include <bits/stdc++.h>
#define ll long long //
#define rp(i, a, b) for (ll i = a; i < b; i++)
#define r(i, n) for (ll i = 0; i < n; i++)
#define rt return
#define db double
#define ldb long double
#define vd void
#define p(x) cout << (x) << endl;
#define psc(x) cout << setprecision(50) << (x) << endl;
#define precise(x) cout << setprecision(50) << x << endl;
#define ce continue;
#define bl bool
#define r0 rt 0;
#define r1 rt 1;
#define elif else if
#define bk break;
#define A p("A")
#define B p("B")
#define C p("C")
#define D p("D")
#define E p("E")
#define F p("F")
#define S(a) sort(a.begin(), a.end());
#define R(a) reverse(a.begin(), a.end());
#define cl cout << endl;
#define pb(x) push_back(x);
#define str string
using namespace std;
void Cond(int g) {
if (g)
p("YES") else p("NO") rt;
}
void cond(int g) {
if (g)
p("Yes") else p("No") rt;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
rt b;
gcd(b, a % b);
}
str su = "0123456789";
str m1 = "abcdefghijklmnopqrstuvwxyz";
str m2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
map<char, ll> m5;
typedef pair<ll, ll> P;
const ll INF = (ll)1e18 + 10;
ll t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, g = 0,
ans = 0;
ll n = 0, m = 0, mx = -INF, mn = INF, ct = 0, cnt = 0;
ll sum = 0, mask = 0;
ll k;
set<P> pst;
set<ll> st;
ll powmod(ll a, ll b, ll x) { //(a^b)modx
if (!b)
r1 if (!(b % 2)) { // B
ll t = powmod(a, b / 2, x);
rt t *t % x;
}
rt((a)*powmod(a, b - 1, x)) % x;
}
void di() {
m5['a'] = 0;
m5['b'] = 1;
m5['c'] = 2;
m5['d'] = 3;
m5['e'] = 4;
m5['f'] = 5;
m5['g'] = 6;
m5['h'] = 7;
m5['i'] = 8;
m5['j'] = 9;
m5['k'] = 10;
m5['l'] = 11;
m5['m'] = 12;
m5['n'] = 13;
m5['o'] = 14;
m5['p'] = 15;
m5['q'] = 16;
m5['r'] = 17;
m5['s'] = 18;
m5['t'] = 19;
m5['u'] = 20;
m5['v'] = 21;
m5['w'] = 22;
m5['x'] = 23;
m5['y'] = 24;
m5['z'] = 25;
}
map<ll, ll> mp;
typedef std::vector<ll> vl;
typedef pair<ll, ll> P;
typedef pair<ll, P> P2;
typedef struct edge2 {
P tos;
ll cost;
} EDGE2;
typedef struct edge1 {
ll to, cost;
} EDGE;
bl used[(ll)1e6];
const ll M = (ll)1e9 + 7;
ll fac[1000007], finv[1000007], inv[1000007];
void initcmb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000007; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
ll cmb(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
db pi =
3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664709384460955058223172535940812848111745028410270193852110555964462294895493038196;
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;
}
const ll MAX = (ll)1e5 * 3;
vl rui(MAX);
vl ru1(MAX);
vl ru2(MAX);
vector<vector<EDGE>> G(1e6);
// int -2,147,483,648 ～ 2,147,483,647
// alt f3
vector<vector<ll>> a(1e5 * 3);
vl color(1e5 * 3, -1);
vd dfs(ll vtx) {
color[vtx] = k;
used[vtx] = true;
r(i, a[vtx].size()) {
if (used[a[vtx][i]] == false) {
dfs(a[vtx][i]);
}
}
rt;
}
int main() { // swap(ary１,ary２)
// a.erase(a.begin()+5),a.insert(a.begin()+3,tmp)
// ios_base::sync_with_stdio(0); cin.tie(0);
// long long 型でREになる時はint型で書き直す
clock_t start = clock(); // timecalc
k = 1;
cin >> n >> m;
set<P> pst;
r(i, m) {
cin >> t1 >> t2;
mn = min(t1, t2);
mx = (t1, t2);
pst.insert({t1, t2});
st.insert(t1);
st.insert(t2);
}
for (P i : pst) {
t1 = i.first;
t2 = i.second;
a[t1].pb(t2);
a[t2].pb(t1);
}
rp(i, 1, n + 1) {
if (used[i] == false) {
dfs(i);
}
k++;
}
// p("COLORS")
// rp(i, 1, n + 1) {
// p(color[i])
// }
// // p("END ")
k--; // sup val .
rp(i, 1, n + 1) { mp[color[i]]++; }
mx = -INF;
rp(i, 1, k + 1) {
// cout << i << " th cols num " << mp[i] << endl;
chmax(mx, mp[i]);
}
p(mx)
clock_t end = clock(); //
const double time =
static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0; // timecalc
// printfz("time %lf[ms]\n", time);//
return 0;
} // main
| replace | 152 | 155 | 152 | 155 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout << #x << " :: " << x << "\n";
#define debug2(x, y) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\n";
#define P pair<int, int>
#define dvec vector<vector<ll>>
// printf("%.10f\n")
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e+18;
int iINF = 1e9;
struct UnionFind {
vector<int> par, rank, sz;
UnionFind(int n) : par(n), rank(n, 0), sz(n, 1) {
for (int i = 0; i < n; ++i)
par[i] = i;
}
void init(int n) {
par.resize(n);
rank.resize(n);
sz.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, sz[i] = 1;
}
int root(int n) {
if (par[n] == n)
return n;
else {
return par[n] = root(par[n]);
}
}
bool is_same(int a, int b) { return root(a) == root(b); }
int size(int n) { return sz[root(n)]; }
bool merge(int a, int b) {
int rt_a = root(a);
int rt_b = root(b);
if (rt_a == rt_b)
return false;
if (rank[rt_a] < rank[rt_b])
swap(rt_a, rt_b);
if (rank[rt_a] == rank[rt_b])
++rank[rt_a];
par[rt_b] = rt_a;
sz[rt_a] += sz[rt_b];
return true;
}
};
int main() {
int N, M;
cin >> N >> M;
UnionFind uf(N);
rep(i, 0, M) {
int a, b;
cin >> a >> b;
--a, --b;
uf.merge(a, b);
}
int ans = 0;
rep(i, 0, M) chmax(ans, uf.size(i));
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, f, n) for (int i = (f); (i) < (n); i++)
#define repe(i, f, n) for (int i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
#define MOD (ll)1000000007
#define PI 3.14159265359
#define debug(x) cout << #x << " :: " << x << "\n";
#define debug2(x, y) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\n";
#define debug3(x, y, z) \
cout << #x << " :: " << x << "\t" << #y << " :: " << y << "\t" << #z \
<< " :: " << z << "\n";
#define P pair<int, int>
#define dvec vector<vector<ll>>
// printf("%.10f\n")
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll INF = 1e+18;
int iINF = 1e9;
struct UnionFind {
vector<int> par, rank, sz;
UnionFind(int n) : par(n), rank(n, 0), sz(n, 1) {
for (int i = 0; i < n; ++i)
par[i] = i;
}
void init(int n) {
par.resize(n);
rank.resize(n);
sz.resize(n);
for (int i = 0; i < n; ++i)
par[i] = i, rank[i] = 0, sz[i] = 1;
}
int root(int n) {
if (par[n] == n)
return n;
else {
return par[n] = root(par[n]);
}
}
bool is_same(int a, int b) { return root(a) == root(b); }
int size(int n) { return sz[root(n)]; }
bool merge(int a, int b) {
int rt_a = root(a);
int rt_b = root(b);
if (rt_a == rt_b)
return false;
if (rank[rt_a] < rank[rt_b])
swap(rt_a, rt_b);
if (rank[rt_a] == rank[rt_b])
++rank[rt_a];
par[rt_b] = rt_a;
sz[rt_a] += sz[rt_b];
return true;
}
};
int main() {
int N, M;
cin >> N >> M;
UnionFind uf(N);
rep(i, 0, M) {
int a, b;
cin >> a >> b;
--a, --b;
uf.merge(a, b);
}
int ans = 0;
rep(i, 0, N) chmax(ans, uf.size(i));
cout << ans << endl;
}
| replace | 89 | 90 | 89 | 90 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int, int>
#define endl "\n"
#define MAXN 100005
using namespace std;
int n, m, a, b, vis[MAXN], cnt;
vector<int> adj[MAXN];
set<pi> s;
void dfs(int s) {
vis[s] = 1;
cnt++;
for (int i = 0; i < adj[s].size(); i++) {
if (!vis[adj[s][i]]) {
dfs(adj[s][i]);
}
}
}
void solve() {
cin >> n >> m;
while (m--) {
cin >> a >> b;
if (a > b)
swap(a, b);
s.insert(mp(a, b));
}
for (auto &it : s) {
int l = it.ff, r = it.ss;
// cout << l << " " << r << endl;
adj[l].pb(r);
adj[r].pb(l);
}
int maxx = INT_MIN;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
cnt = 0;
dfs(i);
maxx = max(maxx, cnt);
}
}
cout << maxx << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int, int>
#define endl "\n"
#define MAXN 200005
using namespace std;
int n, m, a, b, vis[MAXN], cnt;
vector<int> adj[MAXN];
set<pi> s;
void dfs(int s) {
vis[s] = 1;
cnt++;
for (int i = 0; i < adj[s].size(); i++) {
if (!vis[adj[s][i]]) {
dfs(adj[s][i]);
}
}
}
void solve() {
cin >> n >> m;
while (m--) {
cin >> a >> b;
if (a > b)
swap(a, b);
s.insert(mp(a, b));
}
for (auto &it : s) {
int l = it.ff, r = it.ss;
// cout << l << " " << r << endl;
adj[l].pb(r);
adj[r].pb(l);
}
int maxx = INT_MIN;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
cnt = 0;
dfs(i);
maxx = max(maxx, cnt);
}
}
cout << maxx << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
struct unionfind {
vector<long long> d;
unionfind(long long n) : d(n, -1) {}
long long root(long long x) {
if (d[x] < 0) {
return x;
} else {
return d[x] = root(d[x]);
}
}
bool unite(long long x, long long y) {
x = root(x);
y = root(y);
if (x == y) {
return false;
}
if (d[x] > d[y]) {
swap(x, y);
}
d[x] += d[y];
d[y] = x;
return true;
}
bool same(long long x, long long y) { return root(x) == root(y); }
long long size(long long x) { return -d[root(x)]; }
};
int main(void) {
int n, m;
cin >> n >> m;
unionfind u(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (!u.same(a, b)) {
u.unite(a, b);
}
}
ll ans = 0;
if (m == 0) {
cout << 1 << endl;
} else {
for (int i = 0; i < n; i++) {
ans = max(u.size(i), ans);
}
cout << ans << endl;
}
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll INF = (1ll << 60);
struct unionfind {
vector<long long> d;
unionfind(long long n) : d(n, -1) {}
long long root(long long x) {
if (d[x] < 0) {
return x;
} else {
return d[x] = root(d[x]);
}
}
bool unite(long long x, long long y) {
x = root(x);
y = root(y);
if (x == y) {
return false;
}
if (d[x] > d[y]) {
swap(x, y);
}
d[x] += d[y];
d[y] = x;
return true;
}
bool same(long long x, long long y) { return root(x) == root(y); }
long long size(long long x) { return -d[root(x)]; }
};
int main(void) {
int n, m;
cin >> n >> m;
unionfind u(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
if (!u.same(a, b)) {
u.unite(a, b);
}
}
ll ans = 0;
if (m == 0) {
cout << 1 << endl;
} else {
for (int i = 0; i < n; i++) {
ans = max(u.size(i), ans);
}
cout << ans << endl;
}
}
| insert | 68 | 68 | 68 | 70 | -11 | |
p02573 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
int n, m, p[200005], ans = 1;
int pa(int x) {
if (p[x] < 0)
return x;
return pa(p[x]);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
memset(p, -1, sizeof(p));
for (int i = 0, a, b; i < m; i++) {
cin >> a >> b;
int x = pa(a), y = pa(b);
if (x != y) {
p[x] += p[y];
p[y] = x;
ans = max(ans, -p[x]);
}
}
cout << ans << "\n";
}
| #include <cstring>
#include <iostream>
using namespace std;
int n, m, p[200005], ans = 1;
int pa(int x) {
if (p[x] < 0)
return x;
return p[x] = pa(p[x]);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
memset(p, -1, sizeof(p));
for (int i = 0, a, b; i < m; i++) {
cin >> a >> b;
int x = pa(a), y = pa(b);
if (x != y) {
p[x] += p[y];
p[y] = x;
ans = max(ans, -p[x]);
}
}
cout << ans << "\n";
}
| replace | 9 | 10 | 9 | 10 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
// pbds
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using orderedSet =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/// use less_equal in pbds template to work as
/// multiset...................................................
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
// BFS+DFS
#define boundary(i, j) (i >= 0 && i < n && j >= 0 && j < m)
int X[] = {-1, 1, 0, 0};
int Y[] = {0, 0, 1, -1};
vector<int> adj[200005];
int cnt;
vector<int> vis(200005, 0);
int dfs(int node) {
if (!vis[node]) {
++cnt;
vis[node] = 1;
for (int son : adj[node])
dfs(son);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
cnt = 0;
if (!vis[i]) {
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
// pbds
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using orderedSet =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/// use less_equal in pbds template to work as
/// multiset...................................................
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
// BFS+DFS
#define boundary(i, j) (i >= 0 && i < n && j >= 0 && j < m)
int X[] = {-1, 1, 0, 0};
int Y[] = {0, 0, 1, -1};
vector<int> adj[200005];
int cnt;
vector<int> vis(200005, 0);
void dfs(int node) {
if (!vis[node]) {
++cnt;
vis[node] = 1;
for (int son : adj[node])
dfs(son);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
cnt = 0;
if (!vis[i]) {
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans << endl;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02573 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
/****************************************************************************/
// メモ - UnionFindとは -
//
// UnionFindは、グループを管理するときに便利なグラフのひとつ。
// グループをは、グループの代表（以降、「親」という）を決め、
// 「〇〇が属するグループ」と管理する。
// この時、グラフ（木）の形になる。
//
// このclassでは0からnのノードを持つUnionFind木を作成する。
// 内部構造を知らなくても、ノードの数さえ知っていれば一連の操作が可能
//
// このclassの操作関数は、
// UniTree
// UniTree型の変数を作る関数（コンストラクター）
//
// int FindSet(int x)
// ノードxの親を求める関数
//
// bool Same(int x, int y)
// ノードxとノードyが同じにグループに
// 所属しているかを返す関数
//
// void Unite(int x, int y)
// ノードxとノードyを同じグループに
// 所属させる関数
//
// 以上4つである。必要であれば適宜追加してね。
/****************************************************************************/
class UniTree {
public:
// par[i] : ノードiの親
// hight[i] : ノードiの高さ
vector<int> par, hight;
// [引数]
// int size : UnionFind木の大きさ
//
// [機能]
// UnionFind木の初期化（親と高さの初期化）
UniTree() {}
UniTree(int size) {
par = vector<int>(size + 1, 0);
hight = vector<int>(size + 1, 0);
for (int i = 0; i <= size; i++) {
par[i] = i;
}
}
// [引数]
// int x : 親を求めたいノードの番号
//
// [機能]
// ノードxの親を求めながら、再帰的に経路圧縮を行う
int FindSet(int x) {
if (par[x] != x) {
par[x] = FindSet(par[x]);
}
return (par[x]);
}
// [引数]
// int x : ノードx
// int y : ノードy
//
// [機能]
// ノードxとノードyが同じグループならtrue、
// そうでなければfalseを返す
bool Same(int x, int y) {
int X, Y;
X = FindSet(x);
Y = FindSet(y);
if (X == Y) {
return (true);
} else {
return (false);
}
}
// [引数]
// int x : ノードx
// int y : ノードy
//
// [機能]
// ノードxとノードyが同じグループに属するようにする
void Link(int x, int y) {
int X, Y;
X = FindSet(x);
Y = FindSet(y);
if (hight[X] > hight[Y]) {
par[Y] = X;
} else if (hight[Y] > hight[X]) {
par[X] = Y;
} else {
par[X] = Y;
hight[Y] = X;
}
return;
}
/****************************************************************************/
// メモ - UnionFindのメソッド （操作関数群） -
//
// UnionFind(int size)
// UnionFind型の変数を作る関数（コンストラクター）。
// 作る時は、
//
// 『UniTree 変数名 = UniTree 大きさ;』
// で作れる。
//
// 詳しい構造はよく知らない。螺旋本を丸パクリした。
// どうやらclassでコンストラクター（ユーザー定義型の変数を作るメソッド）は、
// class名と同じ名前でないといけないらしい。
//
// 初期化について
// hight(高さ)をすべて0にしたのは、すべてのノードの下にノードがないから。
// par（親）を自分自身にしたのは、すべてのノードが『自分自身が親のグループ』、
// つまり自分しかそのグループに所属していないから。
// ---------------------------------------------------------------------------
//
// int FindSet(int x)
// ノードxの親を求める関数。
// これ以降のコンストラクターではない関数を呼び出すときは、
//
// 『変数名.FindSet(ノードの番号）』
// で呼び出せる。
//
// 「ノードxの親はノードy」→「ノードyの親はノードz」→「ノードzの親はノードz」
// したがって、「ノードxの親はノードz」となる。
// ノードxの親を求めると同時に、ノードxの親の更新を使っている
// いつも『自分の親』の親が自分自身とは限らない。
//
// 経路圧縮について
// 経路圧縮は、グループの構造は壊れず、次に親を求める時に高速になるので
// 積極的にしよう。（グラフの形は死んでしまう）
// ---------------------------------------------------------------------------
//
// bool Same(int x, int y)
// ノードxとノードyが同じグループに属しているなら"true"、
// そうでなければ"false"を返す。
// ノードxの親とノードyの親が同じなら、同じグループに属していると言える
//
// ちなみに、ノードxの親をX、ノードyの親をYとしてるけど、
// C/C++ では変数名に大文字を使わないほうがいい。
// ---------------------------------------------------------------------------
//
// void Unite(int x, int y)
// ノードxとノードyを同じグループに所属させる。
// 「『ノードxの親』の親をノードyの親にする」もしくは、
// 「『ノードyの親』の親をノードxの親にする」
// という言い方のほうが正しいかもしれない。
//
// 効率化のため、ノードx,yのうち、そこまでの高さが高いほうが親となる
// 高さが同じだった時も高さの更新している
//
/****************************************************************************/
};
signed main() {
int n, q, com, a, b, ans[100005] = {};
int ans1 = 0, find[100005];
cin >> n >> q;
UniTree tree = UniTree(n);
for (int i = 0; i < q; i++) {
cin >> a >> b;
tree.Link(a, b);
}
for (int i = 0; i < n; i++) {
find[i] = tree.FindSet(i + 1);
}
for (int i = 0; i < n; i++) {
ans[find[i]]++;
if (ans1 < ans[find[i]]) {
ans1 = ans[find[i]];
}
}
cout << ans1 << endl;
return (0);
} | #include <iostream>
#include <vector>
using namespace std;
/****************************************************************************/
// メモ - UnionFindとは -
//
// UnionFindは、グループを管理するときに便利なグラフのひとつ。
// グループをは、グループの代表（以降、「親」という）を決め、
// 「〇〇が属するグループ」と管理する。
// この時、グラフ（木）の形になる。
//
// このclassでは0からnのノードを持つUnionFind木を作成する。
// 内部構造を知らなくても、ノードの数さえ知っていれば一連の操作が可能
//
// このclassの操作関数は、
// UniTree
// UniTree型の変数を作る関数（コンストラクター）
//
// int FindSet(int x)
// ノードxの親を求める関数
//
// bool Same(int x, int y)
// ノードxとノードyが同じにグループに
// 所属しているかを返す関数
//
// void Unite(int x, int y)
// ノードxとノードyを同じグループに
// 所属させる関数
//
// 以上4つである。必要であれば適宜追加してね。
/****************************************************************************/
class UniTree {
public:
// par[i] : ノードiの親
// hight[i] : ノードiの高さ
vector<int> par, hight;
// [引数]
// int size : UnionFind木の大きさ
//
// [機能]
// UnionFind木の初期化（親と高さの初期化）
UniTree() {}
UniTree(int size) {
par = vector<int>(size + 1, 0);
hight = vector<int>(size + 1, 0);
for (int i = 0; i <= size; i++) {
par[i] = i;
}
}
// [引数]
// int x : 親を求めたいノードの番号
//
// [機能]
// ノードxの親を求めながら、再帰的に経路圧縮を行う
int FindSet(int x) {
if (par[x] != x) {
par[x] = FindSet(par[x]);
}
return (par[x]);
}
// [引数]
// int x : ノードx
// int y : ノードy
//
// [機能]
// ノードxとノードyが同じグループならtrue、
// そうでなければfalseを返す
bool Same(int x, int y) {
int X, Y;
X = FindSet(x);
Y = FindSet(y);
if (X == Y) {
return (true);
} else {
return (false);
}
}
// [引数]
// int x : ノードx
// int y : ノードy
//
// [機能]
// ノードxとノードyが同じグループに属するようにする
void Link(int x, int y) {
int X, Y;
X = FindSet(x);
Y = FindSet(y);
if (hight[X] > hight[Y]) {
par[Y] = X;
} else if (hight[Y] > hight[X]) {
par[X] = Y;
} else {
par[X] = Y;
hight[Y] = X;
}
return;
}
/****************************************************************************/
// メモ - UnionFindのメソッド （操作関数群） -
//
// UnionFind(int size)
// UnionFind型の変数を作る関数（コンストラクター）。
// 作る時は、
//
// 『UniTree 変数名 = UniTree 大きさ;』
// で作れる。
//
// 詳しい構造はよく知らない。螺旋本を丸パクリした。
// どうやらclassでコンストラクター（ユーザー定義型の変数を作るメソッド）は、
// class名と同じ名前でないといけないらしい。
//
// 初期化について
// hight(高さ)をすべて0にしたのは、すべてのノードの下にノードがないから。
// par（親）を自分自身にしたのは、すべてのノードが『自分自身が親のグループ』、
// つまり自分しかそのグループに所属していないから。
// ---------------------------------------------------------------------------
//
// int FindSet(int x)
// ノードxの親を求める関数。
// これ以降のコンストラクターではない関数を呼び出すときは、
//
// 『変数名.FindSet(ノードの番号）』
// で呼び出せる。
//
// 「ノードxの親はノードy」→「ノードyの親はノードz」→「ノードzの親はノードz」
// したがって、「ノードxの親はノードz」となる。
// ノードxの親を求めると同時に、ノードxの親の更新を使っている
// いつも『自分の親』の親が自分自身とは限らない。
//
// 経路圧縮について
// 経路圧縮は、グループの構造は壊れず、次に親を求める時に高速になるので
// 積極的にしよう。（グラフの形は死んでしまう）
// ---------------------------------------------------------------------------
//
// bool Same(int x, int y)
// ノードxとノードyが同じグループに属しているなら"true"、
// そうでなければ"false"を返す。
// ノードxの親とノードyの親が同じなら、同じグループに属していると言える
//
// ちなみに、ノードxの親をX、ノードyの親をYとしてるけど、
// C/C++ では変数名に大文字を使わないほうがいい。
// ---------------------------------------------------------------------------
//
// void Unite(int x, int y)
// ノードxとノードyを同じグループに所属させる。
// 「『ノードxの親』の親をノードyの親にする」もしくは、
// 「『ノードyの親』の親をノードxの親にする」
// という言い方のほうが正しいかもしれない。
//
// 効率化のため、ノードx,yのうち、そこまでの高さが高いほうが親となる
// 高さが同じだった時も高さの更新している
//
/****************************************************************************/
};
signed main() {
int n, q, com, a, b, ans[200005] = {};
int ans1 = 0, find[200005];
cin >> n >> q;
UniTree tree = UniTree(n);
for (int i = 0; i < q; i++) {
cin >> a >> b;
tree.Link(a, b);
}
for (int i = 0; i < n; i++) {
find[i] = tree.FindSet(i + 1);
}
for (int i = 0; i < n; i++) {
ans[find[i]]++;
if (ans1 < ans[find[i]]) {
ans1 = ans[find[i]];
}
}
cout << ans1 << endl;
return (0);
} | replace | 169 | 171 | 169 | 171 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, z, x, y, fa[N];
inline int find(int x) {
while (x != fa[x])
x = fa[x] = fa[fa[x]];
return x;
}
int num[N];
int ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
fa[i] = i;
while (m--) {
cin >> x >> y;
int a = find(x), b = find(y);
fa[a] = b;
}
for (int i = 1; i <= n; i++)
num[find(i)]++;
for (int i = 1; i <= n; i++)
ans = max(ans, num[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m, z, x, y, fa[N];
inline int find(int x) {
while (x != fa[x])
x = fa[x] = fa[fa[x]];
return x;
}
int num[N];
int ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i)
fa[i] = i;
while (m--) {
cin >> x >> y;
int a = find(x), b = find(y);
fa[a] = b;
}
for (int i = 1; i <= n; i++)
num[find(i)]++;
for (int i = 1; i <= n; i++)
ans = max(ans, num[i]);
cout << ans << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02573 | C++ | Runtime Error | // gauravsinghh
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using bigint = int64_t;
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define lob lower_bound
#define upb upper_bound
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ins insert
#define mp make_pair
#define w(t) \
cin >> t; \
while (t--)
#define bitcount __builtin_popcount
#define endl "\n"
#define sz(s) (int)s.size()
#define mem(n, m) memset(n, m, sizeof(n))
#define deb(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ren(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define fo(i, a, b) for (ll i = a; i <= b; i++)
#define ffo(i, a, b) for (ll i = a; i >= b; i--)
#define ffi(i, a, b, c) for (ll i = a; i <= b; i += c)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
const int mod = 1000000007;
void io_set() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<ll> g[100005];
bool vis[100005];
ll c = 1;
void dfs(ll s) {
vis[s] = true;
for (auto it : g[s]) {
if (!vis[it])
c++, dfs(it);
}
}
void solve() {
ll n, m, u, v, ans = 0;
cin >> n >> m;
rep(i, m) {
cin >> u >> v;
g[u].pb(v), g[v].pb(u);
}
fo(i, 1, n) {
if (!vis[i])
c = 1, dfs(i), ans = max(ans, c);
}
cout << ans << endl;
}
int main() {
IOS;
// io_set();
ll tt = 1;
// cin >> tt;
while (tt--) {
solve();
}
return 0;
} | // gauravsinghh
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using bigint = int64_t;
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define lob lower_bound
#define upb upper_bound
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ins insert
#define mp make_pair
#define w(t) \
cin >> t; \
while (t--)
#define bitcount __builtin_popcount
#define endl "\n"
#define sz(s) (int)s.size()
#define mem(n, m) memset(n, m, sizeof(n))
#define deb(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define ren(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define fo(i, a, b) for (ll i = a; i <= b; i++)
#define ffo(i, a, b) for (ll i = a; i >= b; i--)
#define ffi(i, a, b, c) for (ll i = a; i <= b; i += c)
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
const int mod = 1000000007;
void io_set() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<ll> g[200005];
bool vis[200005];
ll c = 1;
void dfs(ll s) {
vis[s] = true;
for (auto it : g[s]) {
if (!vis[it])
c++, dfs(it);
}
}
void solve() {
ll n, m, u, v, ans = 0;
cin >> n >> m;
rep(i, m) {
cin >> u >> v;
g[u].pb(v), g[v].pb(u);
}
fo(i, 1, n) {
if (!vis[i])
c = 1, dfs(i), ans = max(ans, c);
}
cout << ans << endl;
}
int main() {
IOS;
// io_set();
ll tt = 1;
// cin >> tt;
while (tt--) {
solve();
}
return 0;
} | replace | 46 | 48 | 46 | 48 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 100005
const ll INF = 1000000001;
const ll MOD = 1000000007;
vector<vector<ll>> g(N);
// vector< pair<ll, pair< ll, ll > > > g(N);
ll vis[N] = {0}, par[N] = {0}, child[N] = {0}, cnt = 0;
map<pair<ll, ll>, ll> ump;
void dfs(ll v) {
vis[v] = 1;
cnt++;
for (auto u : g[v])
if (!vis[u])
dfs(u);
}
void solve() {
ll n, m;
cin >> n >> m;
f(1, n) g[i].clear();
f(0, m - 1) {
ll x, y;
cin >> x >> y;
if (ump[{x, y}] != 0)
continue;
g[x].pb(y);
g[y].pb(x);
ump[{x, y}] += 1;
ump[{y, x}] += 1;
}
ll ans = 0;
f(1, n) {
if (!vis[i]) {
cnt = 0;
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
// ll t;cin >> t;for(ll index=1; index<=t; index++){
// cout << "Case #" << index << ": " ;
solve();
//}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000001;
const ll MOD = 1000000007;
vector<vector<ll>> g(N);
// vector< pair<ll, pair< ll, ll > > > g(N);
ll vis[N] = {0}, par[N] = {0}, child[N] = {0}, cnt = 0;
map<pair<ll, ll>, ll> ump;
void dfs(ll v) {
vis[v] = 1;
cnt++;
for (auto u : g[v])
if (!vis[u])
dfs(u);
}
void solve() {
ll n, m;
cin >> n >> m;
f(1, n) g[i].clear();
f(0, m - 1) {
ll x, y;
cin >> x >> y;
if (ump[{x, y}] != 0)
continue;
g[x].pb(y);
g[y].pb(x);
ump[{x, y}] += 1;
ump[{y, x}] += 1;
}
ll ans = 0;
f(1, n) {
if (!vis[i]) {
cnt = 0;
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
// ll t;cin >> t;for(ll index=1; index<=t; index++){
// cout << "Case #" << index << ": " ;
solve();
//}
return 0;
}
| replace | 8 | 9 | 8 | 9 | -11 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
const ll mod = 1e9 + 7;
const int N = 1e5 + 205;
vector<int> v[N];
bool vis[N];
int sz;
int ans;
void dfs(int x) {
vis[x] = true;
sz++;
ans = max(ans, sz);
for (int y : v[x]) {
if (!vis[y])
dfs(y);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
ans = 1;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
sz = 0;
dfs(i);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
const ll mod = 1e9 + 7;
const int N = 2e5 + 205;
vector<int> v[N];
bool vis[N];
int sz;
int ans;
void dfs(int x) {
vis[x] = true;
sz++;
ans = max(ans, sz);
for (int y : v[x]) {
if (!vis[y])
dfs(y);
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
ans = 1;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
sz = 0;
dfs(i);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ul unsigned long long int
#define vi vector<int>
#define vl vector<int64_t>
#define all(x) x.begin(), x.end()
#define pb push_back
#define fo(x, a, b) for (int x = a; x < b; x++)
#define rfo(x, a, b) for (int x = a; x >= b; x--)
#define fi first
#define sec second
#define mp make_pair
int sgn(int x) { return x > 0 ? 1 : (x < 0 ? -1 : 0); }
typedef pair<int, int> pairs;
double pi = 3.14159265358979323846;
ll mod = 1000000007;
ll n, m, k = 0;
vi adj[100001];
bool vis[100001] = {false};
void dfs(int x) {
vis[x] = true;
k++;
for (auto ip = adj[x].begin(); ip != adj[x].end(); ip++) {
if (!vis[*ip]) {
dfs(*ip);
}
}
}
void solve() {
cin >> n >> m;
ll ans = 0;
fo(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
}
fo(i, 0, n + 1) {
if (!vis[i]) {
int temp = 0;
k = 0;
dfs(i);
}
ans = max(ans, k);
}
cout << ans;
cout << "\n";
return;
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t;
// cin>>t;
// while(t--)
{ solve(); }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ul unsigned long long int
#define vi vector<int>
#define vl vector<int64_t>
#define all(x) x.begin(), x.end()
#define pb push_back
#define fo(x, a, b) for (int x = a; x < b; x++)
#define rfo(x, a, b) for (int x = a; x >= b; x--)
#define fi first
#define sec second
#define mp make_pair
int sgn(int x) { return x > 0 ? 1 : (x < 0 ? -1 : 0); }
typedef pair<int, int> pairs;
double pi = 3.14159265358979323846;
ll mod = 1000000007;
ll n, m, k = 0;
vi adj[200001];
bool vis[200001] = {false};
void dfs(int x) {
vis[x] = true;
k++;
for (auto ip = adj[x].begin(); ip != adj[x].end(); ip++) {
if (!vis[*ip]) {
dfs(*ip);
}
}
}
void solve() {
cin >> n >> m;
ll ans = 0;
fo(i, 0, m) {
int x, y;
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
}
fo(i, 0, n + 1) {
if (!vis[i]) {
int temp = 0;
k = 0;
dfs(i);
}
ans = max(ans, k);
}
cout << ans;
cout << "\n";
return;
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t;
// cin>>t;
// while(t--)
{ solve(); }
return 0;
} | replace | 18 | 20 | 18 | 20 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define po pop_back
#define fi first
#define se second
#define mxn 100005
#define ll long long int
#define ldb long double
#define fr(i, a, b, k) for (int i = a; i < b; i += k)
#define frr(i, a, b, k) for (int i = a; i > b; i -= k)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define deg(x) cout << endl << #x << " = " << (x) << endl;
#define casep(x) cout << "Case #" << (x) << ": ";
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef pair<int, int> pp;
typedef vector<int> vi;
typedef vector<pp> vpp;
typedef vector<vi> vvi;
const ll inf = LLONG_MAX;
ll power_mod(int a, int n, int mod) {
ll p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
ll power(ll a, ll n) {
if (n == 0) {
return 1;
}
ll p = power(a, n / 2);
p = (p * p);
if (n % 2 == 1) {
p = (p * a);
}
return p;
}
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * b / __gcd(a, b); }
vector<vi> adj;
bool vis[mxn];
ll dfs(ll x) {
vis[x] = 1;
ll n = 1;
for (auto u : adj[x]) {
if (vis[u])
continue;
vis[u] = 1;
n += dfs(u);
}
return n;
}
void run(ll test) {
ll n, m;
cin >> n >> m;
adj = vector<vi>(n);
memset(vis, 0, n + 1);
fr(i, 0, m, 1) {
ll x, y;
cin >> x >> y;
x--;
y--;
if (find(adj[x].begin(), adj[x].end(), y) == adj[x].end()) {
adj[x].pb(y);
adj[y].pb(x);
}
}
ll ans = 0;
fr(i, 0, n, 1) {
if (!vis[i]) {
ll nodes = dfs(i);
ans = max(nodes, ans);
}
}
cout << ans;
}
int main() {
fast;
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
run(i);
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define po pop_back
#define fi first
#define se second
#define mxn 200005
#define ll long long int
#define ldb long double
#define fr(i, a, b, k) for (int i = a; i < b; i += k)
#define frr(i, a, b, k) for (int i = a; i > b; i -= k)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define deg(x) cout << endl << #x << " = " << (x) << endl;
#define casep(x) cout << "Case #" << (x) << ": ";
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef pair<int, int> pp;
typedef vector<int> vi;
typedef vector<pp> vpp;
typedef vector<vi> vvi;
const ll inf = LLONG_MAX;
ll power_mod(int a, int n, int mod) {
ll p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
ll power(ll a, ll n) {
if (n == 0) {
return 1;
}
ll p = power(a, n / 2);
p = (p * p);
if (n % 2 == 1) {
p = (p * a);
}
return p;
}
int gcd(int a, int b) { return __gcd(a, b); }
int lcm(int a, int b) { return a * b / __gcd(a, b); }
vector<vi> adj;
bool vis[mxn];
ll dfs(ll x) {
vis[x] = 1;
ll n = 1;
for (auto u : adj[x]) {
if (vis[u])
continue;
vis[u] = 1;
n += dfs(u);
}
return n;
}
void run(ll test) {
ll n, m;
cin >> n >> m;
adj = vector<vi>(n);
memset(vis, 0, n + 1);
fr(i, 0, m, 1) {
ll x, y;
cin >> x >> y;
x--;
y--;
if (find(adj[x].begin(), adj[x].end(), y) == adj[x].end()) {
adj[x].pb(y);
adj[y].pb(x);
}
}
ll ans = 0;
fr(i, 0, n, 1) {
if (!vis[i]) {
ll nodes = dfs(i);
ans = max(nodes, ans);
}
}
cout << ans;
}
int main() {
fast;
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
run(i);
cout << endl;
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * INFinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
ll INF = 1000000007;
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % INF) % INF;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res % md;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime INF
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
ll digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
void solv() {
cin >> n >> m;
uini(n);
rep(i, m) {
ll a, b;
cin >> a >> b;
if (same(a, b))
continue;
unit(a, b);
}
int r = 0;
rep(i, n + 1) { r = max(r, lank[i]); }
cout << r << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * INFinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
ll INF = 1000000007;
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % INF) % INF;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res % md;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime INF
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[200010];
int lank[200010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
ll digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
void solv() {
cin >> n >> m;
uini(n);
rep(i, m) {
ll a, b;
cin >> a >> b;
if (same(a, b))
continue;
unit(a, b);
}
int r = 0;
rep(i, n + 1) { r = max(r, lank[i]); }
cout << r << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| replace | 209 | 211 | 209 | 211 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxx = 100005;
set<int> graph[maxx];
void dfs(int curr, int &cnt, int *visited, vector<int> &duringdfs) {
visited[curr] = 1;
++cnt;
duringdfs.push_back(curr);
for (auto &child : graph[curr]) {
if (visited[child] == 0) {
dfs(child, cnt, visited, duringdfs);
}
}
}
void MaximumVisit(int n) {
int visited[maxx];
memset(visited, 0, sizeof visited);
int ans[maxx];
memset(ans, 0, sizeof ans);
vector<int> duringdfs;
for (int i = 1; i <= n; ++i) {
duringdfs.clear();
int cnt = 0;
if (visited[i] == 0) {
cnt = 0;
dfs(i, cnt, visited, duringdfs);
}
for (auto &x : duringdfs) {
ans[x] = cnt;
}
}
int mx = 0;
for (int i = 1; i <= n; ++i) {
mx = max(ans[i], mx);
}
cout << mx << endl;
return;
}
int main() {
int N, K;
cin >> N >> K;
int m = K;
while (m--) {
int u, v;
cin >> u >> v;
graph[u].insert(v);
graph[v].insert(u);
}
MaximumVisit(N);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxx = 200010;
set<int> graph[maxx];
void dfs(int curr, int &cnt, int *visited, vector<int> &duringdfs) {
visited[curr] = 1;
++cnt;
duringdfs.push_back(curr);
for (auto &child : graph[curr]) {
if (visited[child] == 0) {
dfs(child, cnt, visited, duringdfs);
}
}
}
void MaximumVisit(int n) {
int visited[maxx];
memset(visited, 0, sizeof visited);
int ans[maxx];
memset(ans, 0, sizeof ans);
vector<int> duringdfs;
for (int i = 1; i <= n; ++i) {
duringdfs.clear();
int cnt = 0;
if (visited[i] == 0) {
cnt = 0;
dfs(i, cnt, visited, duringdfs);
}
for (auto &x : duringdfs) {
ans[x] = cnt;
}
}
int mx = 0;
for (int i = 1; i <= n; ++i) {
mx = max(ans[i], mx);
}
cout << mx << endl;
return;
}
int main() {
int N, K;
cin >> N >> K;
int m = K;
while (m--) {
int u, v;
cin >> u >> v;
graph[u].insert(v);
graph[v].insert(u);
}
MaximumVisit(N);
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int fin = 0, ans = 0;
bool vis[200050];
vector<int> v[200050];
int dfs(int x) {
if (vis[x])
return 0;
vis[x] = true;
ans++;
for (auto it : v[x])
if (!vis[it])
dfs(it);
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
ans = 0;
dfs(i);
}
fin = max(fin, ans);
}
cout << fin;
} | #include <bits/stdc++.h>
using namespace std;
int fin = 0, ans = 0;
bool vis[200050];
vector<int> v[200050];
int dfs(int x) {
if (vis[x])
return 0;
vis[x] = true;
ans++;
for (auto it : v[x])
if (!vis[it])
dfs(it);
return 0;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
ans = 0;
dfs(i);
}
fin = max(fin, ans);
}
cout << fin;
} | insert | 13 | 13 | 13 | 14 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
const int INF = 1001001001;
const int mod = 1e9 + 7;
struct Unionfind {
vector<int> d;
Unionfind(int n) : d(n, -1) {}
int root(int x) {
if (d[x] < 0) {
return x;
}
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return false;
}
if (d[x] > d[y]) {
swap(x, y);
}
d[x] += d[y];
d[y] = x;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
};
int main() {
int N, M;
cin >> N >> M;
Unionfind uf(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
uf.unite(a, b);
}
int MAX = 0;
for (int i = 0; i < N; i++) {
chmax(MAX, uf.size(i));
}
cout << MAX << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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;
}
const int INF = 1001001001;
const int mod = 1e9 + 7;
struct Unionfind {
vector<int> d;
Unionfind(int n) : d(n, -1) {}
int root(int x) {
if (d[x] < 0) {
return x;
}
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return false;
}
if (d[x] > d[y]) {
swap(x, y);
}
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return -d[root(x)]; }
};
int main() {
int N, M;
cin >> N >> M;
Unionfind uf(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
uf.unite(a, b);
}
int MAX = 0;
for (int i = 0; i < N; i++) {
chmax(MAX, uf.size(i));
}
cout << MAX << endl;
return 0;
} | insert | 41 | 41 | 41 | 42 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> par;
UnionFind(int N) { par = vector<int>(N, -1); }
int root(int x) {
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return false;
if (par[rx] > par[ry])
swap(rx, ry);
par[rx] += par[ry];
par[ry] = rx;
return true;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
int N, M;
cin >> N >> M;
UnionFind tree(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
tree.unite(a, b);
}
int output = 0;
for (int i = 0; i < N; i++) {
if (tree.size(i + 1) > output) {
output = tree.size(i + 1);
}
}
cout << output << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> par;
UnionFind(int N) { par = vector<int>(N, -1); }
int root(int x) {
if (par[x] < 0)
return x;
return par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return false;
if (par[rx] > par[ry])
swap(rx, ry);
par[rx] += par[ry];
par[ry] = rx;
return true;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
int N, M;
cin >> N >> M;
UnionFind tree(N + 1);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
tree.unite(a, b);
}
int output = 0;
for (int i = 0; i < N; i++) {
if (tree.size(i + 1) > output) {
output = tree.size(i + 1);
}
}
cout << output << endl;
return 0;
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair<int, int>
const int N = 1e5;
int cnt[N];
vector<int> adj[N];
int n, m;
bool visited[N];
void dfs(int u) {
if (visited[u])
return;
visited[u] = 1;
int cur = 1;
for (auto x : adj[u]) {
if (!visited[x]) {
dfs(x);
cur += cnt[x];
}
}
cnt[u] = cur;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
adj[y].push_back(x);
adj[x].push_back(y);
}
int ans = -1e9;
for (int i = 1; i <= n; i++) {
dfs(i);
ans = max(ans, cnt[i]);
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair<int, int>
const int N = 7e5 + 5;
int cnt[N];
vector<int> adj[N];
int n, m;
bool visited[N];
void dfs(int u) {
if (visited[u])
return;
visited[u] = 1;
int cur = 1;
for (auto x : adj[u]) {
if (!visited[x]) {
dfs(x);
cur += cnt[x];
}
}
cnt[u] = cur;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
adj[y].push_back(x);
adj[x].push_back(y);
}
int ans = -1e9;
for (int i = 1; i <= n; i++) {
dfs(i);
ans = max(ans, cnt[i]);
}
cout << ans;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02573 | C++ | Runtime Error | using namespace std;
#include <bits/stdc++.h>
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define debug(x) cout << #x << " = " << x << endl
vector<int> adj[100001];
bool visited[100001];
int val;
void dfs(int p) {
visited[p] = true;
val++;
for (auto it = adj[p].begin(); it < adj[p].end(); it++) {
if (!visited[*it]) {
dfs(*it);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i = 0; i < n; i++) {
unique(adj[i].begin(), adj[i].end());
}
// now run the dfs
int ans = 0;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
dfs(i);
ans = max(ans, val);
val = 0;
}
}
cout << ans << endl;
}
int main() {
FASTIO
long long int t = 1;
while (t--)
solve();
return 0;
}
| using namespace std;
#include <bits/stdc++.h>
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define debug(x) cout << #x << " = " << x << endl
vector<int> adj[200001];
bool visited[200001];
int val;
void dfs(int p) {
visited[p] = true;
val++;
for (auto it = adj[p].begin(); it < adj[p].end(); it++) {
if (!visited[*it]) {
dfs(*it);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for (int i = 0; i < n; i++) {
unique(adj[i].begin(), adj[i].end());
}
// now run the dfs
int ans = 0;
for (int i = 0; i < n; i++) {
if (!visited[i]) {
dfs(i);
ans = max(ans, val);
val = 0;
}
}
cout << ans << endl;
}
int main() {
FASTIO
long long int t = 1;
while (t--)
solve();
return 0;
}
| replace | 8 | 10 | 8 | 10 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define inf 1e15
#define N 300005
string s;
ll n, m, x, y, d, k;
ll a[N];
ll parent[N];
ll siz[N];
int find(int g) {
if (parent[g] != g) {
parent[g] = find(parent[g]);
}
return g;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
parent[i] = i;
siz[i] = 1;
}
for (int i = 0; i < m; i++) {
int x, y;
;
cin >> x >> y;
x--;
y--;
x = find(x);
y = find(y);
if (x == y)
continue;
parent[x] = y;
siz[y] += siz[x];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, siz[find(i)]);
}
cout << ans << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define inf 1e15
#define N 300005
string s;
ll n, m, x, y, d, k;
ll a[N];
ll parent[N];
ll siz[N];
int find(int g) {
if (parent[g] != g) {
parent[g] = find(parent[g]);
}
return parent[g];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
cin >> n >> m;
for (int i = 0; i < n; i++) {
parent[i] = i;
siz[i] = 1;
}
for (int i = 0; i < m; i++) {
int x, y;
;
cin >> x >> y;
x--;
y--;
x = find(x);
y = find(y);
if (x == y)
continue;
parent[x] = y;
siz[y] += siz[x];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, siz[find(i)]);
}
cout << ans << "\n";
}
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define mod 1000000007LL
using namespace std;
bool visited[1000000] = {0};
ll ans;
ll c;
void dfs(vector<vector<ll>> ans, ll n, ll pos) {
if (visited[pos])
return;
visited[pos] = 1;
c++;
for (auto i = ans[pos].begin(); i != ans[pos].end(); i++) {
if (ans[pos].size() == 0)
return;
if (visited[*i])
continue;
dfs(ans, n, *i);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
if (m == 0) {
cout << 1;
return 0;
}
vector<vector<ll>> adj(n + 1);
ll a, b;
while (m--) {
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
dfs(adj, n, i);
ans = max(ans, c);
c = 0;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define mod 1000000007LL
using namespace std;
bool visited[1000000] = {0};
ll ans;
ll c;
void dfs(vector<vector<ll>> &ans, ll n, ll pos) {
if (visited[pos])
return;
visited[pos] = 1;
c++;
for (auto i = ans[pos].begin(); i != ans[pos].end(); i++) {
if (ans[pos].size() == 0)
return;
if (visited[*i])
continue;
dfs(ans, n, *i);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
if (m == 0) {
cout << 1;
return 0;
}
vector<vector<ll>> adj(n + 1);
ll a, b;
while (m--) {
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
dfs(adj, n, i);
ans = max(ans, c);
c = 0;
}
cout << ans;
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
const int M = 2e5 + 10;
int sz[M], fa[M], n, m;
int find(int x) { return fa[x] == x ? x : find(fa[x]); }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
sz[i] = 1, fa[i] = i;
for (int i = 0, x, y; i < m; i++) {
scanf("%d%d", &x, &y);
x = find(x), y = find(y);
if (x != y)
fa[y] = x, sz[x] += sz[y];
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, sz[i]);
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
const int M = 2e5 + 10;
int sz[M], fa[M], n, m;
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
sz[i] = 1, fa[i] = i;
for (int i = 0, x, y; i < m; i++) {
scanf("%d%d", &x, &y);
x = find(x), y = find(y);
if (x != y)
fa[y] = x, sz[x] += sz[y];
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans = max(ans, sz[i]);
printf("%d\n", ans);
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define endl '\n'
void max_self(int &a, int b) { a = max(a, b); }
// void min_self(int &a, int b){a = min(a, b);}
const int nax = 1e5 + 5;
vector<int> G[nax], vis(nax);
int cnt;
void dfs(int node) {
vis[node] = 1;
cnt++;
for (int i : G[node]) {
if (!vis[i]) {
dfs(i);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
cnt = 0;
dfs(i);
max_self(ans, cnt);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1; // cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define endl '\n'
void max_self(int &a, int b) { a = max(a, b); }
// void min_self(int &a, int b){a = min(a, b);}
const int nax = 2e5 + 5;
vector<int> G[nax], vis(nax);
int cnt;
void dfs(int node) {
vis[node] = 1;
cnt++;
for (int i : G[node]) {
if (!vis[i]) {
dfs(i);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
G[b].push_back(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
cnt = 0;
dfs(i);
max_self(ans, cnt);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1; // cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define req(i, a, b) for (ll i = (a); i >= (b); --i)
#define name "a"
#define pb push_back
#define sz size()
#define ff first
#define ss second
#define xd '\n'
#define dc " "
#define Truong_Thanh_Minh \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> ii;
const ll maxn = 1e5 + 7, oo = 1e18, base = 311, mod = 1e9 + 7;
const double PI = 3.141592654;
ll t, n, m, x, y, ok[maxn], ngroup, cnt[maxn], group[maxn], res;
vector<ll> a[maxn];
void dfs(int i) {
ok[i] = 1;
group[i] = ngroup;
++cnt[ngroup];
for (int j : a[i])
if (!ok[j])
dfs(j);
}
int main() {
Truong_Thanh_Minh
// freopen(name".inp","r",stdin);
// freopen(name".out","w",stdout);
cin >>
n >> m;
rep(i, 1, m) {
cin >> x >> y;
a[x].pb(y);
a[y].pb(x);
}
rep(i, 1, n) {
if (!ok[i]) {
++ngroup;
dfs(i);
}
}
rep(i, 1, ngroup) res = max(res, cnt[i]);
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define req(i, a, b) for (ll i = (a); i >= (b); --i)
#define name "a"
#define pb push_back
#define sz size()
#define ff first
#define ss second
#define xd '\n'
#define dc " "
#define Truong_Thanh_Minh \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<ll, ll> ii;
const ll maxn = 2e5 + 7, oo = 1e18, base = 311, mod = 1e9 + 7;
const double PI = 3.141592654;
ll t, n, m, x, y, ok[maxn], ngroup, cnt[maxn], group[maxn], res;
vector<ll> a[maxn];
void dfs(int i) {
ok[i] = 1;
group[i] = ngroup;
++cnt[ngroup];
for (int j : a[i])
if (!ok[j])
dfs(j);
}
int main() {
Truong_Thanh_Minh
// freopen(name".inp","r",stdin);
// freopen(name".out","w",stdout);
cin >>
n >> m;
rep(i, 1, m) {
cin >> x >> y;
a[x].pb(y);
a[y].pb(x);
}
rep(i, 1, n) {
if (!ok[i]) {
++ngroup;
dfs(i);
}
}
rep(i, 1, ngroup) res = max(res, cnt[i]);
cout << res;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
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;
}
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
if (x == y)
return false;
if (x > y)
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main(void) {
int N, M;
cin >> N >> M;
UnionFind uf(N);
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
uf.unite(a, b);
}
int res = 0;
rep(i, N) { chmax(res, uf.size(i)); }
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
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;
}
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (x > y)
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main(void) {
int N, M;
cin >> N >> M;
UnionFind uf(N);
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
uf.unite(a, b);
}
int res = 0;
rep(i, N) { chmax(res, uf.size(i)); }
cout << res << endl;
return 0;
} | insert | 24 | 24 | 24 | 26 | 0 | |
p02573 | C++ | Runtime Error | // #pragma GCC optimize "trapv"
//-D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pm(m) \
for (auto itr = (m).begin(); itr != (m).end(); itr++) { \
itr->first << " " << itr->second << "\n"; \
}
#define int long long int
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define ii pair<int, int>
#define Max 100000 + 5
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define f first
#define s second
#define pb push_back
#define bug(x) \
cout << (x) << " "; \
exit(0);
int mod = 1000000007;
int mod1 = 998244353;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int mx = 100001;
vector<int> g[mx];
vector<int> vis(mx);
int cnt = 0;
void dfs(int u) {
vis[u] = 1;
cnt++;
for (auto v : g[u]) {
if (!vis[v]) {
dfs(v);
}
}
}
int32_t main() {
IO
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n,
m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for (int i = 1; i <= n; i++) {
cnt = 0;
if (vis[i] == 0) {
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans;
} | // #pragma GCC optimize "trapv"
//-D_GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pm(m) \
for (auto itr = (m).begin(); itr != (m).end(); itr++) { \
itr->first << " " << itr->second << "\n"; \
}
#define int long long int
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define ii pair<int, int>
#define Max 100000 + 5
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define f first
#define s second
#define pb push_back
#define bug(x) \
cout << (x) << " "; \
exit(0);
int mod = 1000000007;
int mod1 = 998244353;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int mx = 200001;
vector<int> g[mx];
vector<int> vis(mx);
int cnt = 0;
void dfs(int u) {
vis[u] = 1;
cnt++;
for (auto v : g[u]) {
if (!vis[v]) {
dfs(v);
}
}
}
int32_t main() {
IO
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n,
m;
cin >> n >> m;
int ans = 0;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for (int i = 1; i <= n; i++) {
cnt = 0;
if (vis[i] == 0) {
dfs(i);
ans = max(ans, cnt);
}
}
cout << ans;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using vst = vector<string>;
using P = pair<ll, ll>;
const int inf = 1e9 + 7;
const ll INF = 9e18;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int par[100010]; // 親
int rnk[100010]; // rankだと怒られる
void init(int n) { // 初期化
for (int i = 0; i < n; i++) {
par[i] = i;
rnk[i] = 1;
}
}
int find(int x) { // 親を求める
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) { // union
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) { // rankが小さい方にくっつける
par[x] = y;
} else {
par[y] = x;
if (rnk[x] == rnk[y])
rnk[x]++; // rankが同じ時は1増やす
}
}
bool same(int x, int y) { return find(x) == find(y); }
int main() {
cout << fixed << setprecision(20);
int n, m;
cin >> n >> m;
init(n);
rep(i, 0, m) {
int a, b;
cin >> a >> b;
a--;
b--;
unite(a, b);
}
/////////
vin cnt(n, 0);
rep(i, 0, n) { cnt[find(i)]++; }
int ans = 0;
rep(i, 0, n) { chmax(ans, cnt[i]); }
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using vst = vector<string>;
using P = pair<ll, ll>;
const int inf = 1e9 + 7;
const ll INF = 9e18;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int par[200010]; // 親
int rnk[200010]; // rankだと怒られる
void init(int n) { // 初期化
for (int i = 0; i < n; i++) {
par[i] = i;
rnk[i] = 1;
}
}
int find(int x) { // 親を求める
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) { // union
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) { // rankが小さい方にくっつける
par[x] = y;
} else {
par[y] = x;
if (rnk[x] == rnk[y])
rnk[x]++; // rankが同じ時は1増やす
}
}
bool same(int x, int y) { return find(x) == find(y); }
int main() {
cout << fixed << setprecision(20);
int n, m;
cin >> n >> m;
init(n);
rep(i, 0, m) {
int a, b;
cin >> a >> b;
a--;
b--;
unite(a, b);
}
/////////
vin cnt(n, 0);
rep(i, 0, n) { cnt[find(i)]++; }
int ans = 0;
rep(i, 0, n) { chmax(ans, cnt[i]); }
cout << ans << endl;
} | replace | 44 | 46 | 44 | 46 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int sz = 1e5 + 1;
int p[sz], w[sz];
int get(int x) { return x == p[x] ? x : p[x] = get(p[x]); }
void uni(int a, int b) {
if (a == b)
return;
a < b ? p[b] = a : p[a] = b;
w[a] = w[b] += w[a];
}
int main() {
int N, M, u, v;
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++)
p[i] = i, w[i] = 1;
while (M--) {
scanf("%d %d", &u, &v);
uni(get(u), get(v));
}
int res = 0;
for (int i = 1; i <= N; i++)
res = max(res, w[i]);
printf("%d\n", res);
} | #include <algorithm>
#include <cstdio>
using namespace std;
const int sz = 2e5 + 1;
int p[sz], w[sz];
int get(int x) { return x == p[x] ? x : p[x] = get(p[x]); }
void uni(int a, int b) {
if (a == b)
return;
a < b ? p[b] = a : p[a] = b;
w[a] = w[b] += w[a];
}
int main() {
int N, M, u, v;
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; i++)
p[i] = i, w[i] = 1;
while (M--) {
scanf("%d %d", &u, &v);
uni(get(u), get(v));
}
int res = 0;
for (int i = 1; i <= N; i++)
res = max(res, w[i]);
printf("%d\n", res);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll mod = 1000000007;
const int inf = 2147483647;
const int MAX_N = 21000;
const int MAX_W = 20100;
/*************ここから**********************/
class union_find {
public:
ll N;
ll par[MAX_N];
ll rank[MAX_N];
union_find(void) { init(); };
union_find(ll n) : N(n) { init(); }
void init() {
for (int i = 0; i < N; i++) {
par[i] = i;
rank[i] = 0;
}
}
// xの始点を探す
ll find(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// グループを結合
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
// 始点の親が同じか
bool same(ll x, ll y) { return find(x) == find(y); }
// 引数xの含まれるグループを表示
void print_tree(ll x) {
string str;
str = "{";
for (int i = 0; i < N; i++) {
if (same(x, i)) {
str = str + to_string(i) + ",";
}
}
str[str.size() - 1] = '}';
cout << str << endl;
}
// すべてのグループを表示
void print_all(void) {
vector<bool> is_printed(N, false);
for (int i = 0; i < N; i++) {
if (!is_printed[i]) {
print_tree(i);
for (int j = 0; j < N; j++) {
if (same(i, j))
is_printed[j] = true;
}
}
}
return;
}
};
/**************ここまで*************************/
int main(void) {
ll n, m;
cin >> n >> m;
union_find uf(n);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
uf.unite(a, b);
}
vector<ll> group(n);
for (int i = 0; i < n; i++) {
group[uf.find(i)]++;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, group[i]);
// cout << "i= " <<i << "group:" << group[i] << endl;
}
// uf.print_all();
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll mod = 1000000007;
const int inf = 2147483647;
const ll MAX_N = 2100000;
const ll MAX_W = 2010000;
/*************ここから**********************/
class union_find {
public:
ll N;
ll par[MAX_N];
ll rank[MAX_N];
union_find(void) { init(); };
union_find(ll n) : N(n) { init(); }
void init() {
for (int i = 0; i < N; i++) {
par[i] = i;
rank[i] = 0;
}
}
// xの始点を探す
ll find(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
// グループを結合
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
// 始点の親が同じか
bool same(ll x, ll y) { return find(x) == find(y); }
// 引数xの含まれるグループを表示
void print_tree(ll x) {
string str;
str = "{";
for (int i = 0; i < N; i++) {
if (same(x, i)) {
str = str + to_string(i) + ",";
}
}
str[str.size() - 1] = '}';
cout << str << endl;
}
// すべてのグループを表示
void print_all(void) {
vector<bool> is_printed(N, false);
for (int i = 0; i < N; i++) {
if (!is_printed[i]) {
print_tree(i);
for (int j = 0; j < N; j++) {
if (same(i, j))
is_printed[j] = true;
}
}
}
return;
}
};
/**************ここまで*************************/
int main(void) {
ll n, m;
cin >> n >> m;
union_find uf(n);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
uf.unite(a, b);
}
vector<ll> group(n);
for (int i = 0; i < n; i++) {
group[uf.find(i)]++;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, group[i]);
// cout << "i= " <<i << "group:" << group[i] << endl;
}
// uf.print_all();
cout << ans << endl;
} | replace | 7 | 9 | 7 | 9 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T> void setmax(T &a, T const &b) {
if (a < b)
a = b;
}
template <class T> void setmin(T &a, T const &b) {
if (a > b)
a = b;
}
template <typename T, typename X> auto vectors(T a, X x) {
return vector<T>(x, a);
}
template <typename T, typename X, typename Y, typename... Zs>
auto vectors(T a, X x, Y y, Zs... zs) {
auto cont = vectors(a, y, zs...);
return vector<decltype(cont)>(x, cont);
}
// 連結している頂点の集合について、それらは必ず別々に別れなければならない。
int main() {
int N, M;
cin >> N >> M;
auto G = vectors(0, N, 0);
for (int i = 0; i < M; ++i) {
int A, B;
cin >> A >> B;
--A, --B;
G[A].push_back(B);
G[B].push_back(A);
}
vector<bool> visited(N, false);
stack<int> stk;
for (int i = 0; i < N; ++i) {
stk.push(i);
}
auto dfs = [&](auto f, int cur, int &num) -> int {
visited[cur] = true;
++num;
for (int to : G[cur]) {
if (!visited[to])
f(f, to, num);
}
};
int res = 0;
while (!stk.empty()) {
int vertex = stk.top();
stk.pop();
if (!visited[vertex]) {
int tmp = 0;
dfs(dfs, vertex, tmp);
setmax(res, tmp);
}
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T> void setmax(T &a, T const &b) {
if (a < b)
a = b;
}
template <class T> void setmin(T &a, T const &b) {
if (a > b)
a = b;
}
template <typename T, typename X> auto vectors(T a, X x) {
return vector<T>(x, a);
}
template <typename T, typename X, typename Y, typename... Zs>
auto vectors(T a, X x, Y y, Zs... zs) {
auto cont = vectors(a, y, zs...);
return vector<decltype(cont)>(x, cont);
}
// 連結している頂点の集合について、それらは必ず別々に別れなければならない。
int main() {
int N, M;
cin >> N >> M;
auto G = vectors(0, N, 0);
for (int i = 0; i < M; ++i) {
int A, B;
cin >> A >> B;
--A, --B;
G[A].push_back(B);
G[B].push_back(A);
}
vector<bool> visited(N, false);
stack<int> stk;
for (int i = 0; i < N; ++i) {
stk.push(i);
}
auto dfs = [&](auto f, int cur, int &num) -> void {
visited[cur] = true;
++num;
for (int to : G[cur]) {
if (!visited[to])
f(f, to, num);
}
};
int res = 0;
while (!stk.empty()) {
int vertex = stk.top();
stk.pop();
if (!visited[vertex]) {
int tmp = 0;
dfs(dfs, vertex, tmp);
setmax(res, tmp);
}
}
cout << res << endl;
return 0;
} | replace | 50 | 51 | 50 | 51 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int z = (g); z < (p); z++)
#define ce(d) cout << d << endl;
#define vecp(p) \
int aa; \
cin >> aa; \
(p).push_back(aa);
#define vecpl(p) \
long long aa; \
cin >> aa; \
(p).push_back(aa);
#define vecps(p) \
string aa; \
cin >> aa; \
(p).push_back(aa);
#define vecp2(p) \
cin >> aa; \
(p).push_back(aa);
#define vecpl2(p) \
long long a b; \
cin >> ab; \
(p).push_back(ab);
#define vecps2(p) \
string ab; \
cin >> ab; \
(p).push_back(ab);
#define sorts(c) sort((c).begin(), (c).end());
#define reverses(c) reverse((c).begin(), (c).end());
#define vec(b) vector<int>(b);
#define vecl(b) vector<long long>(b);
#define vecs(b) vector<string>(b);
#define pb(b, a) (b).push_back((a));
#define doublece(a, b) cout << (a) << ' ' << (b) << endl;
#define pairs(s) vector<pair<int, int>>(s);
#define pairsp(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")
int par[100001];
int treesize[100001];
int group = 100000;
int find(int x) { // 親探し
if (par[x] == x) {
return x;
} else {
int z = find(par[x]);
par[x] = z;
return z;
}
}
bool unit(int x, int y) {
int xpar = find(x);
int ypar = find(y);
if (xpar == ypar) {
return false;
} // すでに結合済み
group--;
par[ypar] = xpar;
treesize[xpar] += treesize[ypar];
return true;
}
int main() {
int N, M;
cin >> N >> M;
group = N;
fx(N) {
par[x + 1] = x + 1;
treesize[x + 1] = 1;
}
fx(M) {
int a, b;
cin >> a >> b;
unit(a, b);
}
int ans = 0;
fx(N) {
int k = treesize[find(x + 1)];
ans = max(ans, k);
}
ce(ans) return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int z = (g); z < (p); z++)
#define ce(d) cout << d << endl;
#define vecp(p) \
int aa; \
cin >> aa; \
(p).push_back(aa);
#define vecpl(p) \
long long aa; \
cin >> aa; \
(p).push_back(aa);
#define vecps(p) \
string aa; \
cin >> aa; \
(p).push_back(aa);
#define vecp2(p) \
cin >> aa; \
(p).push_back(aa);
#define vecpl2(p) \
long long a b; \
cin >> ab; \
(p).push_back(ab);
#define vecps2(p) \
string ab; \
cin >> ab; \
(p).push_back(ab);
#define sorts(c) sort((c).begin(), (c).end());
#define reverses(c) reverse((c).begin(), (c).end());
#define vec(b) vector<int>(b);
#define vecl(b) vector<long long>(b);
#define vecs(b) vector<string>(b);
#define pb(b, a) (b).push_back((a));
#define doublece(a, b) cout << (a) << ' ' << (b) << endl;
#define pairs(s) vector<pair<int, int>>(s);
#define pairsp(s) \
int aa, bb; \
cin >> aa >> bb; \
(s).push_back(make_pair(aa, bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")
int par[200001];
int treesize[200001];
int group = 100000;
int find(int x) { // 親探し
if (par[x] == x) {
return x;
} else {
int z = find(par[x]);
par[x] = z;
return z;
}
}
bool unit(int x, int y) {
int xpar = find(x);
int ypar = find(y);
if (xpar == ypar) {
return false;
} // すでに結合済み
group--;
par[ypar] = xpar;
treesize[xpar] += treesize[ypar];
return true;
}
int main() {
int N, M;
cin >> N >> M;
group = N;
fx(N) {
par[x + 1] = x + 1;
treesize[x + 1] = 1;
}
fx(M) {
int a, b;
cin >> a >> b;
unit(a, b);
}
int ans = 0;
fx(N) {
int k = treesize[find(x + 1)];
ans = max(ans, k);
}
ce(ans) return 0;
}
| replace | 51 | 53 | 51 | 53 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INIT \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
int t, n, m, k, a[300010], q, l, r;
vector<int> g[100010];
bool v[100010];
int dfs(int s) {
int res = 1;
v[s] = true;
for (int i : g[s]) {
if (!v[i]) {
v[i] = true;
res += dfs(i);
}
}
return res;
}
int cnctd() {
int res = 0;
for (int i = 1; i <= n; i++) {
if (!v[i]) {
res = max(res, dfs(i));
}
}
return res;
}
int32_t main() {
INIT cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
int gr = cnctd();
cout << gr;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define INIT \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
int t, n, m, k, a[300010], q, l, r;
vector<int> g[200010];
bool v[200010];
int dfs(int s) {
int res = 1;
v[s] = true;
for (int i : g[s]) {
if (!v[i]) {
v[i] = true;
res += dfs(i);
}
}
return res;
}
int cnctd() {
int res = 0;
for (int i = 1; i <= n; i++) {
if (!v[i]) {
res = max(res, dfs(i));
}
}
return res;
}
int32_t main() {
INIT cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
int gr = cnctd();
cout << gr;
return 0;
}
| replace | 17 | 19 | 17 | 19 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x > y)
swap(x, y);
if (x == y)
return false;
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
UF.unite(--a, --b);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, UF.size(i));
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x > y)
swap(x, y);
if (x == y)
return false;
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
UF.unite(--a, --b);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, UF.size(i));
}
cout << ans;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
#define int long long
const int SIZE = 220;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int maxtree(int N) {
int kosuu[SIZE];
for (int i = 0; i < N; i++) {
kosuu[i] = 0;
}
for (int i = 0; i < N; i++) {
kosuu[root(i)]++;
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < kosuu[i])
max = kosuu[i];
}
return max;
}
};
signed main() {
int N, M;
int ans = 0;
cin >> N >> M;
int A[SIZE], B[SIZE];
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind tree(N);
for (int i = 0; i < M; i++) {
tree.unite(A[i] - 1, B[i] - 1);
}
ans = tree.maxtree(N);
cout << ans << endl;
cin >> ans;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
#include <climits>
#include <iomanip>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using Graph = vector<vector<int>>;
const double PI = 3.14159265358979323846;
#define int long long
const int SIZE = 200020;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
int maxtree(int N) {
int kosuu[SIZE];
for (int i = 0; i < N; i++) {
kosuu[i] = 0;
}
for (int i = 0; i < N; i++) {
kosuu[root(i)]++;
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < kosuu[i])
max = kosuu[i];
}
return max;
}
};
signed main() {
int N, M;
int ans = 0;
cin >> N >> M;
int A[SIZE], B[SIZE];
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
UnionFind tree(N);
for (int i = 0; i < M; i++) {
tree.unite(A[i] - 1, B[i] - 1);
}
ans = tree.maxtree(N);
cout << ans << endl;
cin >> ans;
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(), v.end()
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
struct UnionFind {
vector<int> d;
UnionFind(int n = 0) : d(n, -1) {}
int find(int x) {
if (d[x] < 0)
return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return false;
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return -d[find(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind uf(n);
int ans = 0;
rep(i, m) {
int a, b;
cin >> a >> b;
uf.unite(a, b);
}
for (int i = 1; i <= n; i++) {
int num = uf.size(i);
ans = max(ans, num);
// cout << uf.size(i) <<endl;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(), v.end()
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
struct UnionFind {
vector<int> d;
UnionFind(int n = 0) : d(n, -1) {}
int find(int x) {
if (d[x] < 0)
return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return false;
if (d[x] > d[y])
swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return -d[find(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind uf(n + 1);
int ans = 0;
rep(i, m) {
int a, b;
cin >> a >> b;
uf.unite(a, b);
}
for (int i = 1; i <= n; i++) {
int num = uf.size(i);
ans = max(ans, num);
// cout << uf.size(i) <<endl;
}
cout << ans << endl;
return 0;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p02573 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
// #include<boost/multiprecision/cpp_dec_float.hpp>
// namespace mp=boost::multiprecision;
// #define mulint mp::cpp_int
// #define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
constexpr int MOD = 1000000007;
// constexpr int MOD=998244353;
#define INF (1 << 30)
#define LINF (lint)(1LL << 56)
#define endl "\n"
#define rep(i, n) for (lint(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (lint(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
#define plint pair<lint, lint>
#define fi first
#define se second
typedef long long lint;
int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int MAX_N = 2e5 + 5;
// struct edge{lint to,num;};
lint par[100500]; // MAX_N
lint ufsize[100050]; // MAX_N
void init(lint x) { rep(i, x) par[i] = i, ufsize[i] = 1; }
lint root(lint x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
bool same(lint x, lint y) { return root(x) == root(y); }
void unite(lint x, lint y) {
x = root(x);
y = root(y);
if (x == y)
return;
lint s = ufsize[x] + ufsize[y];
ufsize[x] = s, ufsize[y] = s;
par[x] = y;
}
lint size(lint x) { return ufsize[root(x)]; }
int main(void) {
int N, M;
cin >> N >> M;
init(N);
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
unite(a, b);
}
lint ans = -INF;
rep(i, N) ans = max(ans, size(i));
cout << ans << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
// #include<boost/multiprecision/cpp_dec_float.hpp>
// namespace mp=boost::multiprecision;
// #define mulint mp::cpp_int
// #define mulfloat mp::cpp_dec_float_100
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
constexpr int MOD = 1000000007;
// constexpr int MOD=998244353;
#define INF (1 << 30)
#define LINF (lint)(1LL << 56)
#define endl "\n"
#define rep(i, n) for (lint(i) = 0; (i) < (n); (i)++)
#define reprev(i, n) for (lint(i) = (n - 1); (i) >= 0; (i)--)
#define Flag(x) (1 << (x))
#define Flagcount(x) __builtin_popcount(x)
#define pint pair<int, int>
#define pdouble pair<double, double>
#define plint pair<lint, lint>
#define fi first
#define se second
typedef long long lint;
int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int MAX_N = 2e5 + 5;
// struct edge{lint to,num;};
lint par[200500]; // MAX_N
lint ufsize[200050]; // MAX_N
void init(lint x) { rep(i, x) par[i] = i, ufsize[i] = 1; }
lint root(lint x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
bool same(lint x, lint y) { return root(x) == root(y); }
void unite(lint x, lint y) {
x = root(x);
y = root(y);
if (x == y)
return;
lint s = ufsize[x] + ufsize[y];
ufsize[x] = s, ufsize[y] = s;
par[x] = y;
}
lint size(lint x) { return ufsize[root(x)]; }
int main(void) {
int N, M;
cin >> N >> M;
init(N);
rep(i, M) {
int a, b;
cin >> a >> b;
a--, b--;
unite(a, b);
}
lint ans = -INF;
rep(i, N) ans = max(ans, size(i));
cout << ans << endl;
} | replace | 37 | 39 | 37 | 39 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
// for debugging
/*
g++ -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -std=c++14
*/
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
template <typename Ostream, typename Cont>
typename enable_if<is_same<Ostream, ostream>::value, Ostream &>::type
operator<<(Ostream &os, const Cont &v) {
os << "[";
for (auto &x : v) {
os << x << ", ";
}
return os << "]";
}
template <typename Ostream, typename... Ts>
Ostream &operator<<(Ostream &os, const pair<Ts...> &p) {
return os << "{" << p.first << ", " << p.second << "}";
}
// debugging ends here
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
// const int mxn = 2e5+99;
const int mxn = 1e5 + 100;
vi adj[mxn];
int vis[mxn];
int comp_size[mxn];
void dfs(int u, int comp, int p = -1) {
comp_size[comp] += 1;
vis[u] = 1;
for (auto v : adj[u]) {
if (!vis[v]) {
dfs(v, comp, u);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
--u, --v;
adj[u].pb(v);
adj[v].pb(u);
}
int ans = 0;
int comp = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, comp);
ans = max(ans, comp_size[comp]);
comp++;
}
}
cout << ans << endl;
}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// int t;cin >> t;while(t--)
solve();
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
// for debugging
/*
g++ -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -std=c++14
*/
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) \
{ \
++recur_depth; \
auto x_ = x; \
--recur_depth; \
cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":" \
<< __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl; \
}
#else
#define dbg(x)
#endif
template <typename Ostream, typename Cont>
typename enable_if<is_same<Ostream, ostream>::value, Ostream &>::type
operator<<(Ostream &os, const Cont &v) {
os << "[";
for (auto &x : v) {
os << x << ", ";
}
return os << "]";
}
template <typename Ostream, typename... Ts>
Ostream &operator<<(Ostream &os, const pair<Ts...> &p) {
return os << "{" << p.first << ", " << p.second << "}";
}
// debugging ends here
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
// const int mxn = 2e5+99;
const int mxn = 2e5 + 100;
vi adj[mxn];
int vis[mxn];
int comp_size[mxn];
void dfs(int u, int comp, int p = -1) {
comp_size[comp] += 1;
vis[u] = 1;
for (auto v : adj[u]) {
if (!vis[v]) {
dfs(v, comp, u);
}
}
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
--u, --v;
adj[u].pb(v);
adj[v].pb(u);
}
int ans = 0;
int comp = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
dfs(i, comp);
ans = max(ans, comp_size[comp]);
comp++;
}
}
cout << ans << endl;
}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// int t;cin >> t;while(t--)
solve();
}
| replace | 46 | 47 | 46 | 47 | -11 | |
p02573 | C++ | Runtime Error |
// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define nl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define sz(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof a)
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr << #x << " = " << x << "\n"
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define len(s) s.length()
#define watch(x) cout << #x << " = " << x << endl
#define trace(x) cerr << #x << " = " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds; // for storing unique elements
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // for repeating elements
int power(int a, int b, int m = mod) {
int ans = 1;
while (b > 0) {
if (b & 1)
ans = (ans * a) % m;
a = (a * a) % m;
b >>= 1;
}
return ans;
}
void babuBhaiya() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 1;
const double pi = acos(-1);
int parent[100005];
int R[100005];
int find(int a) {
if (parent[a] == a)
return a;
return parent[a] = find(parent[a]);
}
void merge(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (R[a] > R[b]) {
parent[b] = a;
R[a] += R[b];
} else {
parent[a] = b;
R[b] += R[a];
}
}
void solve() {
int n, m;
cin >> n >> m;
rep(i, 1, n + 1) {
parent[i] = i;
R[i] = 1;
}
rep(i, 0, m) {
int a, b;
cin >> a >> b;
if (find(a) == find(b))
continue;
else
merge(a, b);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, R[find(i)]);
}
cout << mx;
}
int32_t main() {
babuBhaiya();
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} |
// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define nl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vec(x) vector<x>
#define matrix(x) vector<vector<x>>
#define sz(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof a)
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define MOD 998244353
#define deb(x) cerr << #x << " = " << x << "\n"
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define len(s) s.length()
#define watch(x) cout << #x << " = " << x << endl
#define trace(x) cerr << #x << " = " << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds; // for storing unique elements
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // for repeating elements
int power(int a, int b, int m = mod) {
int ans = 1;
while (b > 0) {
if (b & 1)
ans = (ans * a) % m;
a = (a * a) % m;
b >>= 1;
}
return ans;
}
void babuBhaiya() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e5 + 1;
const double pi = acos(-1);
int parent[200005];
int R[200005];
int find(int a) {
if (parent[a] == a)
return a;
return parent[a] = find(parent[a]);
}
void merge(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (R[a] > R[b]) {
parent[b] = a;
R[a] += R[b];
} else {
parent[a] = b;
R[b] += R[a];
}
}
void solve() {
int n, m;
cin >> n >> m;
rep(i, 1, n + 1) {
parent[i] = i;
R[i] = 1;
}
rep(i, 0, m) {
int a, b;
cin >> a >> b;
if (find(a) == find(b))
continue;
else
merge(a, b);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
mx = max(mx, R[find(i)]);
}
cout << mx;
}
int32_t main() {
babuBhaiya();
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | replace | 83 | 85 | 83 | 85 | 0 | |
p02573 | C++ | Runtime Error | // AUTHOR: ROSHAN SRIVASTAVA
// WEBSITE: https://www.youtube.com/channel/UC6uQdd7kLLOdlHSVklhV7Cw
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<int> G[100009];
bool vis[100009];
int solve(int x, int par) {
vis[x] = true;
int ans = 1;
for (auto n : G[x]) {
if (n == par)
continue;
if (vis[n])
continue;
ans += solve(n, x);
}
return ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
memset(vis, false, sizeof vis);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
int ma = -1;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
ma = max(ma, solve(i, -1));
}
}
cout << ma << endl;
return 0;
} | // AUTHOR: ROSHAN SRIVASTAVA
// WEBSITE: https://www.youtube.com/channel/UC6uQdd7kLLOdlHSVklhV7Cw
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<int> G[200009];
bool vis[200009];
int solve(int x, int par) {
vis[x] = true;
int ans = 1;
for (auto n : G[x]) {
if (n == par)
continue;
if (vis[n])
continue;
ans += solve(n, x);
}
return ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
memset(vis, false, sizeof vis);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
int ma = -1;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
ma = max(ma, solve(i, -1));
}
}
cout << ma << endl;
return 0;
} | replace | 8 | 10 | 8 | 10 | -11 | |
p02573 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
const double EPS = 1e-9;
const double PI = acos(-1);
const int knightDir[8][2] = {{-2, -1}, {-2, 1}, {-1, 2}, {1, 2},
{2, -1}, {2, 1}, {-1, -2}, {1, -2}};
// const int dx[]={0,0,0,1,1,1,-1,-1,-1};
// const int dy[]={-1,0,1,-1,0,1,-1,0,1};
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
// #define MOD 1000000007LL
#define MAX 2000015
const ll MOD = 1000000000 + 7;
int parent[MAX], sz[MAX];
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
parent[b] = a;
sz[a] += sz[b];
}
}
int main() {
FAST int t;
t = 1;
while (t--) {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
make_set(i);
for (int i = 0; i <= k; i++) {
int a, b;
cin >> a >> b;
union_sets(a, b);
}
int mx = -1;
for (int i = 1; i <= n; i++)
mx = max(mx, sz[i]);
cout << mx << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
const double EPS = 1e-9;
const double PI = acos(-1);
const int knightDir[8][2] = {{-2, -1}, {-2, 1}, {-1, 2}, {1, 2},
{2, -1}, {2, 1}, {-1, -2}, {1, -2}};
// const int dx[]={0,0,0,1,1,1,-1,-1,-1};
// const int dy[]={-1,0,1,-1,0,1,-1,0,1};
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
// #define MOD 1000000007LL
#define MAX 2000015
const ll MOD = 1000000000 + 7;
int parent[MAX], sz[MAX];
int find_set(int v) {
if (v == parent[v])
return v;
return parent[v] = find_set(parent[v]);
}
void make_set(int v) {
parent[v] = v;
sz[v] = 1;
}
void union_sets(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a != b) {
if (sz[a] < sz[b])
swap(a, b);
parent[b] = a;
sz[a] += sz[b];
}
}
int main() {
FAST int t;
t = 1;
while (t--) {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
make_set(i);
for (int i = 1; i <= k; i++) {
int a, b;
cin >> a >> b;
union_sets(a, b);
}
int mx = -1;
for (int i = 1; i <= n; i++)
mx = max(mx, sz[i]);
cout << mx << endl;
}
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<ll, ll> mp;
vector<ll> v[100];
ll dfs(ll node) {
if (mp[node] == 0) {
mp[node]++;
ll i, l = v[node].size(), s = 0;
for (i = 0; i < l; i++) {
s += dfs(v[node][i]);
}
return s + 1;
} else {
return 0;
}
}
int main() {
ll i, j, t = 1;
// cin>>t;
for (i = 0; i < t; i++) {
ll n, m, x, y, mini = 0;
cin >> n >> m;
for (j = 0; j < m; j++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for (j = 1; j <= n; j++) {
if (mp[j] == 0) {
mini = max(mini, dfs(j));
}
}
cout << mini;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
map<ll, ll> mp;
vector<ll> v[1000000];
ll dfs(ll node) {
if (mp[node] == 0) {
mp[node]++;
ll i, l = v[node].size(), s = 0;
for (i = 0; i < l; i++) {
s += dfs(v[node][i]);
}
return s + 1;
} else {
return 0;
}
}
int main() {
ll i, j, t = 1;
// cin>>t;
for (i = 0; i < t; i++) {
ll n, m, x, y, mini = 0;
cin >> n >> m;
for (j = 0; j < m; j++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for (j = 1; j <= n; j++) {
if (mp[j] == 0) {
mini = max(mini, dfs(j));
}
}
cout << mini;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02573 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
UF.unite(a - 1, b - 1);
}
// for(int person : friends[1])
// cout<<person<<' ';
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, UF.size(i));
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
UF.unite(a - 1, b - 1);
}
// for(int person : friends[1])
// cout<<person<<' ';
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, UF.size(i));
cout << ans << endl;
return 0;
}
| insert | 26 | 26 | 26 | 27 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
using namespace std;
int a[maxn], b[maxn];
int find_(int x) { return x == a[x] ? x : find_(a[x]); }
void solve() {
int n, m, max_ = 0;
cin >> n >> m;
for (int j = 0; j <= n; ++j)
a[j] = j, b[j] = 1;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
int fx = find_(x);
int fy = find_(y);
if (fx != fy)
a[fx] = fy, b[fy] += b[fx];
}
for (int k = 1; k <= n; ++k)
if (b[k] > max_)
max_ = b[k];
cout << max_;
}
signed main() {
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int _ = 1;
// cin>>_;
while (_--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
// #define int ll
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
using namespace std;
int a[maxn], b[maxn];
int find_(int x) { return x == a[x] ? x : a[x] = find_(a[x]); }
void solve() {
int n, m, max_ = 0;
cin >> n >> m;
for (int j = 0; j <= n; ++j)
a[j] = j, b[j] = 1;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
int fx = find_(x);
int fy = find_(y);
if (fx != fy)
a[fx] = fy, b[fy] += b[fx];
}
for (int k = 1; k <= n; ++k)
if (b[k] > max_)
max_ = b[k];
cout << max_;
}
signed main() {
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int _ = 1;
// cin>>_;
while (_--) {
solve();
}
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define bug cout << "ok" << endl
const ll INF = 1e9 + 5, N = 500 + 5, mod = 1e9 + 7, M = 1e5 + 5;
int p[N], sz[N];
void make_set(int v) {
p[v] = v;
sz[v] = 1;
}
int find_set(int v) {
if (p[v] == v)
return v;
return p[v] = find_set(p[v]);
}
void union_set(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a == b)
return;
if (sz[a] < sz[b])
swap(a, b);
sz[a] += sz[b];
p[b] = a;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
make_set(i);
while (m--) {
int a, b;
cin >> a >> b;
union_set(a, b);
}
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(mx, sz[i]);
cout << mx << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define bug cout << "ok" << endl
const ll INF = 1e9 + 5, N = 2e5 + 5, mod = 1e9 + 7, M = 1e5 + 5;
int p[N], sz[N];
void make_set(int v) {
p[v] = v;
sz[v] = 1;
}
int find_set(int v) {
if (p[v] == v)
return v;
return p[v] = find_set(p[v]);
}
void union_set(int a, int b) {
a = find_set(a);
b = find_set(b);
if (a == b)
return;
if (sz[a] < sz[b])
swap(a, b);
sz[a] += sz[b];
p[b] = a;
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
make_set(i);
while (m--) {
int a, b;
cin >> a >> b;
union_set(a, b);
}
int mx = 0;
for (int i = 1; i <= n; i++)
mx = max(mx, sz[i]);
cout << mx << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
#define BS binary_search
#define M 1000000007
const long long INF = 1e18;
template <class A, class B>
ostream &operator<<(ostream &os, const pair<A, B> p) {
return os << "(" << p.first << "," << p.second << ")";
}
void dprint(string s) { cout << endl; }
template <class T, class... U> void dprint(string s, T t, U... u) {
int w = s.find(',');
cout << "[" << s.substr(0, w) << ": " << t << "] ";
dprint(s.substr(w + 1, (int)s.size() - w), u...);
}
#define DEBUG
#ifdef DEBUG
#define dbg(X...) dprint(#X, X)
#else
#define dbg(X...) "KEEP CALM"
#endif
const int N = 100005; // Don't forget to CHANGE this value ACC. TO Q.
set<int> adj[N];
int cnt = 0;
bool vis[N] = {false};
void dfs(int s) {
vis[s] = true;
cnt++;
for (auto it : adj[s]) {
if (!vis[it])
dfs(it);
}
}
int32_t main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int T = 1;
// cin>>T;
while (T--) {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].insert(b);
adj[b].insert(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
#define BS binary_search
#define M 1000000007
const long long INF = 1e18;
template <class A, class B>
ostream &operator<<(ostream &os, const pair<A, B> p) {
return os << "(" << p.first << "," << p.second << ")";
}
void dprint(string s) { cout << endl; }
template <class T, class... U> void dprint(string s, T t, U... u) {
int w = s.find(',');
cout << "[" << s.substr(0, w) << ": " << t << "] ";
dprint(s.substr(w + 1, (int)s.size() - w), u...);
}
#define DEBUG
#ifdef DEBUG
#define dbg(X...) dprint(#X, X)
#else
#define dbg(X...) "KEEP CALM"
#endif
const int N = 200005; // Don't forget to CHANGE this value ACC. TO Q.
set<int> adj[N];
int cnt = 0;
bool vis[N] = {false};
void dfs(int s) {
vis[s] = true;
cnt++;
for (auto it : adj[s]) {
if (!vis[it])
dfs(it);
}
}
int32_t main() {
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int T = 1;
// cin>>T;
while (T--) {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
adj[a].insert(b);
adj[b].insert(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
dfs(i);
ans = max(ans, cnt);
cnt = 0;
}
}
cout << ans << endl;
}
return 0;
} | replace | 35 | 36 | 35 | 36 | -11 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define pii pair<ll, ll>
#define pb push_back
#define rep0(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#define all(v) v.begin(), v.end()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const int N = 1e5 + 5;
vector<int> vis(N, 0);
vector<int> adj[N];
int mx = 0;
int dfs(int u) {
int ans = 0;
if (!vis[u]) {
vis[u] = true;
ans++;
for (auto v : adj[u]) {
ans += dfs(v);
}
}
return ans;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
adj[x].push_back(y);
adj[y].push_back(x);
}
for (int i = 0; i < n; i++) {
if (!vis[i]) {
mx = max(mx, dfs(i));
}
}
cout << mx;
}
int main() {
fast;
solve();
// int t;
// cin >> t;
// while(t--){
// solve();
// }
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define pii pair<ll, ll>
#define pb push_back
#define rep0(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
#define all(v) v.begin(), v.end()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
const int N = 2e5 + 5;
vector<int> vis(N, 0);
vector<int> adj[N];
int mx = 0;
int dfs(int u) {
int ans = 0;
if (!vis[u]) {
vis[u] = true;
ans++;
for (auto v : adj[u]) {
ans += dfs(v);
}
}
return ans;
}
void solve() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
adj[x].push_back(y);
adj[y].push_back(x);
}
for (int i = 0; i < n; i++) {
if (!vis[i]) {
mx = max(mx, dfs(i));
}
}
cout << mx;
}
int main() {
fast;
solve();
// int t;
// cin >> t;
// while(t--){
// solve();
// }
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define bit(a) __builtin_popcount(a)
#define all(x) x.begin(), x.end()
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define w(x) while (x--)
#define rep(i, a, b) for (i = a; i <= b; i++)
#define ll long long
#define pb push_back
#define vii vector<int>
#define vll vector<ll>
#define vcc vector<char>
#define sii set<int>
#define sll set<ll>
#define scc set<char>
#define li list<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mii map<int, int>
#define mll map<ll, ll>
#define fill(arr, x) memset(arr, x, sizeof(arr))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define srtc(a, b) sort(a, a + b, greater<int>())
#define pi acos(-1.00)
#define _ios \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
/*
//find the position of 0 or 1 in binary representation
int zero(int n)
{
int i=1,pos=0;
while(n)
{
if(n%2==0)pos=i;
n/=2;
i++;
}
return pos;
}
*/
//--------------Graph Moves--------------------------------------
const int dx[] = {+1, -1, +0, +0};
const int dy[] = {+0, +0, +1, -1};
// const int dx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move
// const int dy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move
// const int dx[] = {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move
// const int dy[] = {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
//---------------------------------------------------------------
int t, n, m;
int parent[100005];
int ra[100005];
string s;
void make_set() {
for (int i = 1; i <= n; i++) {
parent[i] = i;
ra[i] = 1;
}
}
int find_par(int n) {
if (n == parent[n])
return n;
return parent[n] = find_par(parent[n]);
}
void conect(int a, int b) {
int u = find_par(a);
int v = find_par(b);
parent[u] = v;
if (u != v)
ra[v] += ra[u];
}
int main() {
_ios;
cin >> n >> m;
make_set();
w(m) {
int x, y;
cin >> x >> y;
conect(x, y);
}
int ans = -1;
for (int i = 1; i <= n; i++) {
ans = max(ans, ra[i]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define bit(a) __builtin_popcount(a)
#define all(x) x.begin(), x.end()
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define w(x) while (x--)
#define rep(i, a, b) for (i = a; i <= b; i++)
#define ll long long
#define pb push_back
#define vii vector<int>
#define vll vector<ll>
#define vcc vector<char>
#define sii set<int>
#define sll set<ll>
#define scc set<char>
#define li list<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mii map<int, int>
#define mll map<ll, ll>
#define fill(arr, x) memset(arr, x, sizeof(arr))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define srtc(a, b) sort(a, a + b, greater<int>())
#define pi acos(-1.00)
#define _ios \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
/*
//find the position of 0 or 1 in binary representation
int zero(int n)
{
int i=1,pos=0;
while(n)
{
if(n%2==0)pos=i;
n/=2;
i++;
}
return pos;
}
*/
//--------------Graph Moves--------------------------------------
const int dx[] = {+1, -1, +0, +0};
const int dy[] = {+0, +0, +1, -1};
// const int dx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move
// const int dy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move
// const int dx[] = {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move
// const int dy[] = {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
//---------------------------------------------------------------
int t, n, m;
int parent[200005];
int ra[200005];
string s;
void make_set() {
for (int i = 1; i <= n; i++) {
parent[i] = i;
ra[i] = 1;
}
}
int find_par(int n) {
if (n == parent[n])
return n;
return parent[n] = find_par(parent[n]);
}
void conect(int a, int b) {
int u = find_par(a);
int v = find_par(b);
parent[u] = v;
if (u != v)
ra[v] += ra[u];
}
int main() {
_ios;
cin >> n >> m;
make_set();
w(m) {
int x, y;
cin >> x >> y;
conect(x, y);
}
int ans = -1;
for (int i = 1; i <= n; i++) {
ans = max(ans, ra[i]);
}
cout << ans << endl;
return 0;
}
| replace | 54 | 56 | 54 | 56 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
#define fix(n) cout << fixed << setprecision(n)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (long i = a; i <= b; i++)
#define REN(i, a, b) for (long i = b; i >= a; i--)
// Debugging
#define line cout << endl
#define out(n) cout << n << " "
#define bug(n) cout << n << "\n"
#define print(arr, start, end) \
REP(i, start, end) out(arr[i]); \
line
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pi;
typedef map<int, int> mii;
///// General Purpose functions /////
////////////////
int util(int s, vector<int> adj[], vector<bool> visited) {
visited[s] = true;
queue<int> q;
q.push(s);
int l = 0;
while (!q.empty()) {
int tmp = q.front();
l++;
q.pop();
for (auto it = adj[tmp].begin(); it != adj[tmp].end(); it++) {
if (visited[*it] == true)
continue;
visited[*it] = true;
q.push(*it);
}
}
return l;
}
int bfs(vector<int> adj[], int V) {
int len = 0;
vector<bool> visited(V, false);
for (int i = 0; i < V; i++) {
if (visited[i] == false) {
int l = util(i, adj, visited);
len = max(len, l);
}
}
return len;
}
void solve() {
int V, m;
cin >> V >> m;
int x, y;
vector<int> adj[V];
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x - 1].push_back(y - 1);
adj[y - 1].push_back(x - 1);
}
int max_len = bfs(adj, V);
// out("a\n");
bug(max_len);
}
void prep() {}
int main() {
// code
io;
int t = 1;
// cin >> t;
prep();
fix(12);
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
#define fix(n) cout << fixed << setprecision(n)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (long i = a; i <= b; i++)
#define REN(i, a, b) for (long i = b; i >= a; i--)
// Debugging
#define line cout << endl
#define out(n) cout << n << " "
#define bug(n) cout << n << "\n"
#define print(arr, start, end) \
REP(i, start, end) out(arr[i]); \
line
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pi;
typedef map<int, int> mii;
///// General Purpose functions /////
////////////////
int util(int s, vector<int> adj[], vector<bool> &visited) {
visited[s] = true;
queue<int> q;
q.push(s);
int l = 0;
while (!q.empty()) {
int tmp = q.front();
l++;
q.pop();
for (auto it = adj[tmp].begin(); it != adj[tmp].end(); it++) {
if (visited[*it] == true)
continue;
visited[*it] = true;
q.push(*it);
}
}
return l;
}
int bfs(vector<int> adj[], int V) {
int len = 0;
vector<bool> visited(V, false);
for (int i = 0; i < V; i++) {
if (visited[i] == false) {
int l = util(i, adj, visited);
len = max(len, l);
}
}
return len;
}
void solve() {
int V, m;
cin >> V >> m;
int x, y;
vector<int> adj[V];
for (int i = 0; i < m; i++) {
cin >> x >> y;
adj[x - 1].push_back(y - 1);
adj[y - 1].push_back(x - 1);
}
int max_len = bfs(adj, V);
// out("a\n");
bug(max_len);
}
void prep() {}
int main() {
// code
io;
int t = 1;
// cin >> t;
prep();
fix(12);
while (t--) {
solve();
}
return 0;
} | replace | 34 | 35 | 34 | 35 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn = 1e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<int> adj[mxn];
bool vis[mxn];
int dfs(int i) {
vis[i] = true;
int temp = 0;
for (auto x : adj[i]) {
if (!vis[x])
temp = temp + dfs(x);
}
return temp + 1;
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
int temp = dfs(i);
ans = max(ans, temp);
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mxn = 2e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<int> adj[mxn];
bool vis[mxn];
int dfs(int i) {
vis[i] = true;
int temp = 0;
for (auto x : adj[i]) {
if (!vis[x])
temp = temp + dfs(x);
}
return temp + 1;
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
u--, v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!vis[i]) {
int temp = dfs(i);
ans = max(ans, temp);
}
}
cout << ans;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int parent_find(int x, vector<int> &parent) {
while (parent[x] != x) {
x = parent[x];
}
return x;
}
void combine(int x, int y, vector<int> &parent, vector<int> &rank) {
int t = parent_find(x, parent);
int w = parent_find(y, parent);
if (t != w) {
parent[t] = w;
rank[w] += rank[t];
}
}
int main() {
int n;
cin >> n;
vector<int> group(n + 1, 0);
vector<int> rank(n + 1, 1);
for (int i = 0; i <= n; i++)
group[i] = i;
int t;
cin >> t;
while (t--) {
int x, y;
cin >> x >> y;
combine(x, y, group, rank);
}
cout << *max_element(rank.begin(), rank.end()) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int parent_find(int x, vector<int> &parent) {
while (parent[x] != x) {
x = parent[x];
}
return x;
}
void combine(int x, int y, vector<int> &parent, vector<int> &rank) {
int t = parent_find(x, parent);
int w = parent_find(y, parent);
if (t != w) {
if (rank[w] > rank[t]) {
parent[t] = w;
rank[w] += rank[t];
} else {
parent[w] = t;
rank[t] += rank[w];
}
}
}
int main() {
int n;
cin >> n;
vector<int> group(n + 1, 0);
vector<int> rank(n + 1, 1);
for (int i = 0; i <= n; i++)
group[i] = i;
int t;
cin >> t;
while (t--) {
int x, y;
cin >> x >> y;
combine(x, y, group, rank);
}
cout << *max_element(rank.begin(), rank.end()) << endl;
return 0;
} | replace | 15 | 17 | 15 | 23 | TLE | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define N ((int)2e5 + 5)
using namespace std;
bool vis[N];
int dis[N];
vector<int> vec[N];
int bfs(int src) {
memset(vis, 0, sizeof vis);
int cnt = 1;
queue<int> que;
que.push(src);
vis[src] = 1;
dis[src] = 0;
while (!que.empty()) {
int a = que.front();
que.pop();
for (int b : vec[a])
if (vis[b] == 0) {
cnt++;
que.push(b);
vis[b] = 1;
dis[b] = dis[a] + 1;
}
}
return cnt;
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
mx = max(mx, bfs(i));
}
}
cout << mx << endl;
}
| #include <bits/stdc++.h>
#define ll long long
#define N ((int)2e5 + 5)
using namespace std;
bool vis[N];
int dis[N];
vector<int> vec[N];
int bfs(int src) {
int cnt = 1;
queue<int> que;
que.push(src);
vis[src] = 1;
dis[src] = 0;
while (!que.empty()) {
int a = que.front();
que.pop();
for (int b : vec[a])
if (vis[b] == 0) {
cnt++;
que.push(b);
vis[b] = 1;
dis[b] = dis[a] + 1;
}
}
return cnt;
}
int main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
int mx = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
mx = max(mx, bfs(i));
}
}
cout << mx << endl;
}
| delete | 8 | 9 | 8 | 8 | TLE | |
p02573 | C++ | Runtime Error | #include <stdio.h>
typedef struct {
int Parent, Rank;
} UnionFind;
UnionFind uft[100000];
static inline int Root(int x) {
return (uft[x].Parent != x) ? uft[x].Parent = Root(uft[x].Parent) : x;
}
static inline int Unite(int x, int y) {
x = Root(x), y = Root(y);
if (x != y)
uft[x].Parent = y, uft[y].Rank += uft[x].Rank;
return x != y;
}
static inline int Size(int x) { return uft[Root(x)].Rank; }
static inline int Belong(int x, int y) { return Root(x) == Root(y); }
int main(void) {
int A, B, N, M, i = 0, estrange = 0;
if (!scanf("%d %d", &N, &M))
return -1;
while (i < N) {
uft[i].Parent = i;
uft[i++].Rank = 1;
}
while (M--) {
if (!scanf("%d %d", &A, &B)) {
return -1;
}
A--, B--;
Unite(A, B);
}
while (N--) {
estrange = estrange > Size(N - 1) ? estrange : Size(N - 1);
}
return printf("%d\n", estrange), 0;
} | #include <stdio.h>
typedef struct {
int Parent, Rank;
} UnionFind;
UnionFind uft[200000];
static inline int Root(int x) {
return (uft[x].Parent != x) ? uft[x].Parent = Root(uft[x].Parent) : x;
}
static inline int Unite(int x, int y) {
x = Root(x), y = Root(y);
if (x != y)
uft[x].Parent = y, uft[y].Rank += uft[x].Rank;
return x != y;
}
static inline int Size(int x) { return uft[Root(x)].Rank; }
static inline int Belong(int x, int y) { return Root(x) == Root(y); }
int main(void) {
int A, B, N, M, i = 0, estrange = 0;
if (!scanf("%d %d", &N, &M))
return -1;
while (i < N) {
uft[i].Parent = i;
uft[i++].Rank = 1;
}
while (M--) {
if (!scanf("%d %d", &A, &B)) {
return -1;
}
A--, B--;
Unite(A, B);
}
while (N--) {
estrange = estrange > Size(N - 1) ? estrange : Size(N - 1);
}
return printf("%d\n", estrange), 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define ll long long
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define vi vector<int>
#define ff first
#define ss second
#define fr(a, b) for (int i = a; i <= b; i++)
#define inf 1e18
#define mod 1000000007
vector<int> v[100005];
bool vis[100005];
void dfs(int src, int &c) {
c++;
vis[src] = true;
for (auto nvr : v[src]) {
if (vis[nvr] == false)
dfs(nvr, c);
}
}
int main() {
ll n, m;
cin >> n >> m;
while (m--) {
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
int ans = INT_MIN;
int c = 0;
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (vis[i] == false) {
c = 0;
dfs(i, c);
ans = max(ans, c);
}
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define ll long long
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define vi vector<int>
#define ff first
#define ss second
#define fr(a, b) for (int i = a; i <= b; i++)
#define inf 1e18
#define mod 1000000007
vector<int> v[200005];
bool vis[200005];
void dfs(int src, int &c) {
c++;
vis[src] = true;
for (auto nvr : v[src]) {
if (vis[nvr] == false)
dfs(nvr, c);
}
}
int main() {
ll n, m;
cin >> n >> m;
while (m--) {
int x, y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
int ans = INT_MIN;
int c = 0;
memset(vis, false, sizeof(vis));
for (int i = 1; i <= n; i++) {
if (vis[i] == false) {
c = 0;
dfs(i, c);
ans = max(ans, c);
}
}
cout << ans << "\n";
return 0;
}
| replace | 17 | 19 | 17 | 19 | 0 | |
p02573 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
a--;
b--;
UF.unite(a, b);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, UF.size(i));
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> r;
UnionFind(int N) { r = vector<int>(N, -1); }
int root(int x) {
if (r[x] < 0)
return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (r[x] > r[y])
swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) { return -r[root(x)]; }
};
int main() {
int n, m;
cin >> n >> m;
UnionFind UF(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
UF.unite(a, b);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = max(ans, UF.size(i));
}
cout << ans << endl;
return 0;
}
| insert | 36 | 36 | 36 | 37 | -11 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
using namespace std;
typedef uint64_t ulint;
typedef int64_t lint;
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
ulint gcd(lint a, lint b);
ulint lcm(lint a, lint b);
ulint digit(lint n, lint base);
ulint digit(lint n);
vector<lint> digitbreak(lint n, lint base);
vector<lint> digitbreak(lint n);
bool flagdebug = false;
const int MAX = 1000000;
const int MOD = 1000000007; // 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1; // 累乗
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int 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 COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<int> data;
int maxunion;
UnionFind(int sz) {
data.assign(sz, -1);
maxunion = 1;
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
maxunion = max(maxunion, -data[x]);
data[y] = x; //+になる
return (true);
}
int find(int k) {
if (data[k] < 0)
return (k);
return (data[k] = find(data[k]));
}
int size(int k) { return (-data[find(k)]); }
};
int main() {
//////////////////////////////////////////////////////
flagdebug = true; /// 本番時削除！！！！！
// 入力
lint n, m;
cin >> n >> m;
vector<pair<lint, lint>> a(n);
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
UnionFind uf(n);
rep0(i, m) { cin >> a[i].first >> a[i].second; }
// lint mx = 0;
rep0(i, m) { uf.unite(a[i].first, a[i].second); }
cout << uf.maxunion << endl;
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
// ペア
// pair<lint,lint> p = make_pair(1,2);
// vector<pair<lint,lint>> c(100010, pair<lint,lint>(0,0));
// タプル
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
// 昇順ソート
// sort(all(a));
// 降順ソート
// sort(all(a),greater<lint>());
// 特殊なソート（ラムダ式）
// sort(all(mat), [&i](const vector<lint> &a, const vector<lint> &b){return
// a[i] < b[i];}); 特殊なソート（pair） sort(all(a), [](const pair<lint,lint>
// &a, const pair<lint,lint> &b){return a.first < b.first;});
// //[&i]は参照する変数，いらなければからの大括弧でよし．
// ソート済集合（順序付き集合）
// set<lint> st;
// itr.insert(0);
// auto itrmin = st.begin(); //最小値の次へアクセス
// auto itrmax = st.end();
// //最大値の次へアクセス（かならずデクリメントが必要） itrmax --;
// //最大値はst.end()の1つ前 st.erase(0); st.find;
//////////////////////////////////////////////////////
// キュー
// queue<lint> que;
// que.push(value);
// que.front();
// //トップを参照（消されないので消したい場合は直後にpop()を使う） que.pop();
// //追い出す que.empty(); //空なら1，あれば0 優先度付きキュー
// priority_queue<lint> que;
// キューにque.push()で入れると最大値順に並べられる．que.pop()で取り出すときは常に最大値が前にくる．
// 最小値から取り出したい時はpriority_queue< lint, std::vector<lint>,
// std::greater<lint> >
//////////////////////////////////////////////////////
// スタック
// stack<lint> stk;
// stk.push(value);
// stk.top(); //先頭を参照（消されないので消したい場合は直後にpop()を使う）
// stk.pop(); //トップを削除
// stk.empty(); //空なら1,あれば0
// stk.size(); //数
//
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
s << "[\t";
for (auto i = v.begin(); i < v.end() - 1; i++) {
s << *i << "\t";
}
s << *(v.end() - 1) << "\t]\n";
return s;
}
// 最大公約数
ulint gcd(lint a, lint b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
// 最小公倍数
ulint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
// 桁数を求める
ulint digit(lint n, lint base) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) / log10(base) + 1;
}
// 桁数を求める
ulint digit(lint n) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) + 1;
}
// 桁分解, base進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n, lint base) {
vector<lint> a(base, 0);
while (n >= base) {
a[n % base]++;
n /= base;
}
a[n]++;
return a;
}
// 桁分解, 10進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n) { return digitbreak(n, 10); } | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
using namespace std;
typedef uint64_t ulint;
typedef int64_t lint;
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
ulint gcd(lint a, lint b);
ulint lcm(lint a, lint b);
ulint digit(lint n, lint base);
ulint digit(lint n);
vector<lint> digitbreak(lint n, lint base);
vector<lint> digitbreak(lint n);
bool flagdebug = false;
const int MAX = 1000000;
const int MOD = 1000000007; // 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1; // 累乗
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int 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 COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<int> data;
int maxunion;
UnionFind(int sz) {
data.assign(sz, -1);
maxunion = 1;
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
maxunion = max(maxunion, -data[x]);
data[y] = x; //+になる
return (true);
}
int find(int k) {
if (data[k] < 0)
return (k);
return (data[k] = find(data[k]));
}
int size(int k) { return (-data[find(k)]); }
};
int main() {
//////////////////////////////////////////////////////
flagdebug = true; /// 本番時削除！！！！！
// 入力
lint n, m;
cin >> n >> m;
vector<pair<lint, lint>> a(m);
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
UnionFind uf(n);
rep0(i, m) { cin >> a[i].first >> a[i].second; }
// lint mx = 0;
rep0(i, m) { uf.unite(a[i].first, a[i].second); }
cout << uf.maxunion << endl;
// 2次元配列
// vector<vector<lint>> mat(row, vector<lint>(column, 初期値));
// ペア
// pair<lint,lint> p = make_pair(1,2);
// vector<pair<lint,lint>> c(100010, pair<lint,lint>(0,0));
// タプル
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
// 昇順ソート
// sort(all(a));
// 降順ソート
// sort(all(a),greater<lint>());
// 特殊なソート（ラムダ式）
// sort(all(mat), [&i](const vector<lint> &a, const vector<lint> &b){return
// a[i] < b[i];}); 特殊なソート（pair） sort(all(a), [](const pair<lint,lint>
// &a, const pair<lint,lint> &b){return a.first < b.first;});
// //[&i]は参照する変数，いらなければからの大括弧でよし．
// ソート済集合（順序付き集合）
// set<lint> st;
// itr.insert(0);
// auto itrmin = st.begin(); //最小値の次へアクセス
// auto itrmax = st.end();
// //最大値の次へアクセス（かならずデクリメントが必要） itrmax --;
// //最大値はst.end()の1つ前 st.erase(0); st.find;
//////////////////////////////////////////////////////
// キュー
// queue<lint> que;
// que.push(value);
// que.front();
// //トップを参照（消されないので消したい場合は直後にpop()を使う） que.pop();
// //追い出す que.empty(); //空なら1，あれば0 優先度付きキュー
// priority_queue<lint> que;
// キューにque.push()で入れると最大値順に並べられる．que.pop()で取り出すときは常に最大値が前にくる．
// 最小値から取り出したい時はpriority_queue< lint, std::vector<lint>,
// std::greater<lint> >
//////////////////////////////////////////////////////
// スタック
// stack<lint> stk;
// stk.push(value);
// stk.top(); //先頭を参照（消されないので消したい場合は直後にpop()を使う）
// stk.pop(); //トップを削除
// stk.empty(); //空なら1,あれば0
// stk.size(); //数
//
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
s << "[\t";
for (auto i = v.begin(); i < v.end() - 1; i++) {
s << *i << "\t";
}
s << *(v.end() - 1) << "\t]\n";
return s;
}
// 最大公約数
ulint gcd(lint a, lint b) {
if (b != 0) {
return gcd(b, a % b);
}
return a;
}
// 最小公倍数
ulint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
// 桁数を求める
ulint digit(lint n, lint base) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) / log10(base) + 1;
}
// 桁数を求める
ulint digit(lint n) {
if (n == 0)
return 0;
if (n < 0)
n = -n;
return log10(n) + 1;
}
// 桁分解, base進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n, lint base) {
vector<lint> a(base, 0);
while (n >= base) {
a[n % base]++;
n /= base;
}
a[n]++;
return a;
}
// 桁分解, 10進数の桁ごとの数値に分解
vector<lint> digitbreak(lint n) { return digitbreak(n, 10); } | replace | 96 | 97 | 96 | 97 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
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;
}
const ll INF = 1LL << 60;
const double pi = acos(-1.0);
using Graph = vector<vector<int>>;
map<ll, ll> mp;
vector<bool> seen;
void dfs(const Graph &G, int v, int c) {
seen[v] = true;
mp[c]++;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v, c);
}
}
int main() {
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
seen.assign(N, false);
int cnt = 0;
rep(i, N) {
if (!seen[i]) {
dfs(G, i, cnt);
cnt++;
}
}
ll ans = 0;
while (mp.size()) {
ans++;
for (auto x : mp) {
mp[x.first]--;
}
for (auto x : mp)
if (x.second == 0)
mp.erase(x.first);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
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;
}
const ll INF = 1LL << 60;
const double pi = acos(-1.0);
using Graph = vector<vector<int>>;
map<ll, ll> mp;
vector<bool> seen;
void dfs(const Graph &G, int v, int c) {
seen[v] = true;
mp[c]++;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v, c);
}
}
int main() {
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
seen.assign(N, false);
int cnt = 0;
rep(i, N) {
if (!seen[i]) {
dfs(G, i, cnt);
cnt++;
}
}
ll ans = 0;
for (auto x : mp)
chmax(ans, x.second);
cout << ans << endl;
}
| replace | 63 | 72 | 63 | 65 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 2e6 + 1000;
const LL P = 1e9 + 7;
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 * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
void print(int x) {
if (x > 9)
print(x / 10);
putchar(x % 10 + '0');
}
int n, m;
int f[N], sz[N];
int find(int x) {
if (f[x] == x)
return x;
else
f[x] = find(f[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
f[i] = i;
sz[i] = 1;
}
int u, v;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &u, &v);
u = find(u);
v = find(v);
if (u == v)
continue;
f[u] = v;
sz[v] += sz[u];
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
u = find(i);
ans = max(ans, sz[u]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 2e6 + 1000;
const LL P = 1e9 + 7;
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 * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
void print(int x) {
if (x > 9)
print(x / 10);
putchar(x % 10 + '0');
}
int n, m;
int f[N], sz[N];
int find(int x) {
if (f[x] == x)
return x;
else
return f[x] = find(f[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
f[i] = i;
sz[i] = 1;
}
int u, v;
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &u, &v);
u = find(u);
v = find(v);
if (u == v)
continue;
f[u] = v;
sz[v] += sz[u];
}
int ans = 0;
for (int i = 1; i <= n; ++i) {
u = find(i);
ans = max(ans, sz[u]);
}
cout << ans << endl;
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02573 | C++ | Runtime Error | /*
* @Author: dnhirapara
* @Problem: abc177_d
* @Time: 11-September-2020 : ( 16:17:57 )
*/
#include <bits/stdc++.h>
using namespace std;
/************defination************/
#define endl "\n"
#define logger(x) cout << __LINE__ << ": " << #x << " -> " << (x) << endl;
#define ll long long int
#define ull unsigned long long int
vector<ll> g[100005];
vector<bool> vis(100005, 0);
ll max_len = 0;
void dfs(ll node, ll lvl) {
vis[node] = true;
for (auto i : g[node]) {
// logger(i);
if (!vis[i]) {
dfs(i, lvl + 1);
max_len++;
}
}
// max_len = max(lvl, max_len);
}
//@time comp :
//@space comp :
int main() {
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// cin.ignore(); must be there when using getline(cin, s)
ll tc = 1;
// cin >> tc;
while (tc--) {
ll n, m;
cin >> n >> m;
// logger(n);
ll u, v;
for (int i = 0; i <= n; i++) {
vis[i] = false;
}
for (ll i = 0; i < m; i++) {
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
ll maxi = LLONG_MIN;
for (ll i = 1; i <= n; i++) {
if (!vis[i]) {
max_len = 0;
dfs(i, 0);
// logger(max_len);
maxi = max(max_len, maxi);
}
}
cout << maxi + 1 << endl;
}
return 0;
} | /*
* @Author: dnhirapara
* @Problem: abc177_d
* @Time: 11-September-2020 : ( 16:17:57 )
*/
#include <bits/stdc++.h>
using namespace std;
/************defination************/
#define endl "\n"
#define logger(x) cout << __LINE__ << ": " << #x << " -> " << (x) << endl;
#define ll long long int
#define ull unsigned long long int
vector<ll> g[200005];
vector<bool> vis(200005, 0);
ll max_len = 0;
void dfs(ll node, ll lvl) {
vis[node] = true;
for (auto i : g[node]) {
// logger(i);
if (!vis[i]) {
dfs(i, lvl + 1);
max_len++;
}
}
// max_len = max(lvl, max_len);
}
//@time comp :
//@space comp :
int main() {
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// cin.ignore(); must be there when using getline(cin, s)
ll tc = 1;
// cin >> tc;
while (tc--) {
ll n, m;
cin >> n >> m;
// logger(n);
ll u, v;
for (int i = 0; i <= n; i++) {
vis[i] = false;
}
for (ll i = 0; i < m; i++) {
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
ll maxi = LLONG_MIN;
for (ll i = 1; i <= n; i++) {
if (!vis[i]) {
max_len = 0;
dfs(i, 0);
// logger(max_len);
maxi = max(max_len, maxi);
}
}
cout << maxi + 1 << endl;
}
return 0;
} | replace | 16 | 18 | 16 | 18 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (int)(b); i++)
#define per(i, a, b) for (int i = (a); i >= (int)(b); i--)
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int fa[maxn], siz[maxn];
int Find(int x) {
if (x == fa[x])
return x;
else
return fa[x] = Find(fa[x]);
}
void Union(int a, int b) {
int f1 = Find(a), f2 = Find(b);
siz[f1] += siz[f2];
fa[f2] = f1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
rep(i, 1, n) {
fa[i] = i;
siz[i] = 1;
}
while (m--) {
int a, b;
cin >> a >> b;
if (Find(a) != Find(b))
Union(a, b);
}
int ans = 0;
rep(i, 1, n) {
if (i == fa[i])
ans = max(ans, siz[i]);
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (int)(b); i++)
#define per(i, a, b) for (int i = (a); i >= (int)(b); i--)
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
int fa[maxn], siz[maxn];
int Find(int x) {
if (x == fa[x])
return x;
else
return fa[x] = Find(fa[x]);
}
void Union(int a, int b) {
int f1 = Find(a), f2 = Find(b);
siz[f1] += siz[f2];
fa[f2] = f1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
rep(i, 1, n) {
fa[i] = i;
siz[i] = 1;
}
while (m--) {
int a, b;
cin >> a >> b;
if (Find(a) != Find(b))
Union(a, b);
}
int ans = 0;
rep(i, 1, n) {
if (i == fa[i])
ans = max(ans, siz[i]);
}
cout << ans << '\n';
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define re return
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
vector<int> v[100005];
int vis[100005];
int dfs(int now) {
vis[now] = 1;
int num = 1;
for (int i : v[now])
if (!vis[i])
num += dfs(i);
re num;
}
signed main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
a--, b--;
v[a].pb(b);
v[b].pb(a);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!vis[i])
ans = max(ans, dfs(i));
}
cout << ans;
re 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define re return
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
vector<int> v[200005];
int vis[200005];
int dfs(int now) {
vis[now] = 1;
int num = 1;
for (int i : v[now])
if (!vis[i])
num += dfs(i);
re num;
}
signed main() {
int n, m;
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
a--, b--;
v[a].pb(b);
v[b].pb(a);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (!vis[i])
ans = max(ans, dfs(i));
}
cout << ans;
re 0;
}
| replace | 10 | 12 | 10 | 12 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int getID(vector<int> &v, int idx) {
if (v[idx] == -1)
return -1;
int cnt = 0;
while (1) {
if (v[idx] == idx)
break;
idx = v[idx];
if (cnt++ == 10000)
break;
}
return idx;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> d(N, 0);
vector<int> v(N, -1);
for (int i = 0; i < M; i++) {
int s[2];
cin >> s[0] >> s[1];
s[0]--;
s[1]--;
if (v[s[0]] == -1 && v[s[1]] == -1) {
v[s[0]] = s[0];
v[s[1]] = s[0];
d[s[0]] = 2;
} else if (v[s[0]] == -1 || v[s[1]] == -1) {
for (int j = 0; j < 2; j++) {
if (v[s[j]] == -1) {
int id = getID(v, s[(j + 1) % 2]);
v[s[j]] = id;
d[id]++;
}
}
} else {
int r1 = getID(v, s[0]);
int r2 = getID(v, s[1]);
if (r1 == r2)
continue;
v[r1] = r2;
d[r2] += d[r1];
d[r1] = 0;
}
}
int ans = 1;
for (int i = 0; i < N; i++) {
ans = max(ans, d[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int getID(vector<int> &v, int idx) {
if (v[idx] == idx)
return idx;
v[idx] = getID(v, v[idx]);
return v[idx];
}
int main() {
int N, M;
cin >> N >> M;
vector<int> d(N, 0);
vector<int> v(N, -1);
for (int i = 0; i < M; i++) {
int s[2];
cin >> s[0] >> s[1];
s[0]--;
s[1]--;
if (v[s[0]] == -1 && v[s[1]] == -1) {
v[s[0]] = s[0];
v[s[1]] = s[0];
d[s[0]] = 2;
} else if (v[s[0]] == -1 || v[s[1]] == -1) {
for (int j = 0; j < 2; j++) {
if (v[s[j]] == -1) {
int id = getID(v, s[(j + 1) % 2]);
v[s[j]] = id;
d[id]++;
}
}
} else {
int r1 = getID(v, s[0]);
int r2 = getID(v, s[1]);
if (r1 == r2)
continue;
v[r1] = r2;
d[r2] += d[r1];
d[r1] = 0;
}
}
int ans = 1;
for (int i = 0; i < N; i++) {
ans = max(ans, d[i]);
}
cout << ans << endl;
}
| replace | 4 | 15 | 4 | 8 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < n; i++)
#define fo1(i, n) for (i = 1; i <= n; i++)
#define foab(i, a, b) for (i = a; i <= b; i++)
#define of(i, n) for (i = n - 1; i >= 0; i--)
#define of1(i, n) for (i = n; i >= 1; i--)
#define ofab(i, a, b) for (i = a; i >= b; i--)
#define sq(a) (a) * (a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sortall(x) sort(all(x))
#define sortrall(x) sort(rall(x))
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define pii pair<int, int>
#define mk(arr, n, type) type *arr = new type[n];
#define vi vector<int>
#define vpii vector<pii>
#define si set<int>
#define spii set<pii>
#define usi unordered_set<int>
#define uspii unordered_set<pii>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define trailzrobits(x) __builtin_ctzll(x)
#define leadzrobits(x) __builtin_clzll(x)
#define paritybits(x) __builtin_parityll(x)
#define gcd __gcd
#define lcm(x, y) (x * y) / gcd(x, y)
#define endl '\n'
#define sz(s) (int)s.size()
#define sp(x, y) fixed << setprecision(y) << x
const int mod = 1000000007;
const int inf = 1000000000000000000;
const ld PI = 3.1415926535897932384626;
const ld eps = 1e-12;
void __print(int32_t x) { cout << x; }
void __print(int x) { cout << x; }
void __print(double x) { cout << x; }
void __print(ld x) { cout << x; }
void __print(float x) { cout << x; }
void __print(bool x) { cout << (x ? "true" : "false"); }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define dbg(x...) \
cout << "[" << #x << "]=["; \
_print(x)
#else
#define dbg(x...)
#endif
int powerMod(int base, int exp) {
int res = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
res = (res * base) % mod;
base = (base * base) % mod;
exp = exp >> 1;
}
return res;
}
int power(int base, int exp) {
int res = 1;
while (exp > 0) {
if (exp & 1)
res = res * base;
base = base * base;
exp = exp >> 1;
}
return res;
}
int inv(int x) { return powerMod(x, mod - 2) % mod; }
// ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
const int N = 1e5 + 5, M = N;
vector<int> adj[N];
vector<bool> vis(N, 0);
void dfs(int u, int &cnt) {
vis[u] = 1;
cnt++;
for (int v : adj[u]) {
if (!vis[v]) {
dfs(v, cnt);
}
}
}
void solve() {
int i, j, k;
int n, m;
cin >> n >> m;
spii s;
fo(i, m) {
int a, b;
cin >> a >> b;
if (s.count({a, b}) or s.count({b, a})) {
continue;
}
s.insert({a, b});
s.insert({b, a});
adj[a].pb(b);
adj[b].pb(a);
}
int mx = 0;
fo1(i, n) {
if (!vis[i]) {
int cnt = 0;
dfs(i, cnt);
mx = max(mx, cnt);
}
}
cout << mx;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, T = 1;
// cin>>T;
fo1(t, T) {
// cout<<"Case #"<<t<<": ";
solve();
}
// cout<<endl<<"Times Elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"sec";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < n; i++)
#define fo1(i, n) for (i = 1; i <= n; i++)
#define foab(i, a, b) for (i = a; i <= b; i++)
#define of(i, n) for (i = n - 1; i >= 0; i--)
#define of1(i, n) for (i = n; i >= 1; i--)
#define ofab(i, a, b) for (i = a; i >= b; i--)
#define sq(a) (a) * (a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sortall(x) sort(all(x))
#define sortrall(x) sort(rall(x))
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define pii pair<int, int>
#define mk(arr, n, type) type *arr = new type[n];
#define vi vector<int>
#define vpii vector<pii>
#define si set<int>
#define spii set<pii>
#define usi unordered_set<int>
#define uspii unordered_set<pii>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define pqmx priority_queue<int>
#define pqmn priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define trailzrobits(x) __builtin_ctzll(x)
#define leadzrobits(x) __builtin_clzll(x)
#define paritybits(x) __builtin_parityll(x)
#define gcd __gcd
#define lcm(x, y) (x * y) / gcd(x, y)
#define endl '\n'
#define sz(s) (int)s.size()
#define sp(x, y) fixed << setprecision(y) << x
const int mod = 1000000007;
const int inf = 1000000000000000000;
const ld PI = 3.1415926535897932384626;
const ld eps = 1e-12;
void __print(int32_t x) { cout << x; }
void __print(int x) { cout << x; }
void __print(double x) { cout << x; }
void __print(ld x) { cout << x; }
void __print(float x) { cout << x; }
void __print(bool x) { cout << (x ? "true" : "false"); }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define dbg(x...) \
cout << "[" << #x << "]=["; \
_print(x)
#else
#define dbg(x...)
#endif
int powerMod(int base, int exp) {
int res = 1;
base %= mod;
while (exp > 0) {
if (exp & 1)
res = (res * base) % mod;
base = (base * base) % mod;
exp = exp >> 1;
}
return res;
}
int power(int base, int exp) {
int res = 1;
while (exp > 0) {
if (exp & 1)
res = res * base;
base = base * base;
exp = exp >> 1;
}
return res;
}
int inv(int x) { return powerMod(x, mod - 2) % mod; }
// ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
const int N = 1e6 + 5, M = N;
vector<int> adj[N];
vector<bool> vis(N, 0);
void dfs(int u, int &cnt) {
vis[u] = 1;
cnt++;
for (int v : adj[u]) {
if (!vis[v]) {
dfs(v, cnt);
}
}
}
void solve() {
int i, j, k;
int n, m;
cin >> n >> m;
spii s;
fo(i, m) {
int a, b;
cin >> a >> b;
if (s.count({a, b}) or s.count({b, a})) {
continue;
}
s.insert({a, b});
s.insert({b, a});
adj[a].pb(b);
adj[b].pb(a);
}
int mx = 0;
fo1(i, n) {
if (!vis[i]) {
int cnt = 0;
dfs(i, cnt);
mx = max(mx, cnt);
}
}
cout << mx;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, T = 1;
// cin>>T;
fo1(t, T) {
// cout<<"Case #"<<t<<": ";
solve();
}
// cout<<endl<<"Times Elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"sec";
return 0;
} | replace | 108 | 109 | 108 | 109 | 0 | |
p02573 | C++ | Runtime Error | /// Bismillahir Rahmanir Rahim
/* Mohammad Morsalin
Dept of ICE, NSTU
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for (int i = 0; i < n; i++)
#define ms(x) memset(x, 0, sizeof(x))
#define ms2d(x, m, n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define uniq(vec) \
vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define pi pair<int, int>
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define ins insert
#define ALL(v) v.begin(), v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define fi first
#define se second
#define PI acos(-1)
#define sz(a) (int)a.size();
#define IOS ios::sync_with_stdio(false);
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const long long MOD = 1000000007;
double sq(double x) { return x * x; }
template <typename T> inline T Bigmod(T base, T power, T MOD) {
T ret = 1;
while (power) {
if (power & 1)
ret = (ret * base) % MOD;
base = (base * base) % MOD;
power >>= 1;
}
return ret;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
int arr[100005];
int Size[100005];
int n, m;
void init() {
for (int i = 0; i <= n; i++) {
arr[i] = i;
Size[i] = 1;
}
}
int root(int i) {
while (arr[i] != i) {
i = arr[arr[i]];
i = arr[i];
}
return i;
}
void w_union(int a, int b) {
int root_a = root(a);
int root_b = root(b);
if (root_a == root_b)
return;
if (Size[root_a] < Size[root_b]) {
arr[root_a] = arr[root_b];
Size[root_b] += Size[root_a];
} else {
arr[root_b] = arr[root_a];
Size[root_a] += Size[root_b];
}
}
signed main() {
IOS cin >> n >> m;
init();
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
w_union(a, b);
}
int maxx = 0;
for (int i = 1; i <= n; i++) {
int rooti = root(i);
maxx = max(maxx, (ll)Size[rooti]);
}
cout << maxx << endl;
return 0;
}
/// Alhamdulillah
| /// Bismillahir Rahmanir Rahim
/* Mohammad Morsalin
Dept of ICE, NSTU
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define int long long
#define f0(n) for (int i = 0; i < n; i++)
#define ms(x) memset(x, 0, sizeof(x))
#define ms2d(x, m, n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define uniq(vec) \
vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define pi pair<int, int>
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define ins insert
#define ALL(v) v.begin(), v.end()
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define fi first
#define se second
#define PI acos(-1)
#define sz(a) (int)a.size();
#define IOS ios::sync_with_stdio(false);
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const long long MOD = 1000000007;
double sq(double x) { return x * x; }
template <typename T> inline T Bigmod(T base, T power, T MOD) {
T ret = 1;
while (power) {
if (power & 1)
ret = (ret * base) % MOD;
base = (base * base) % MOD;
power >>= 1;
}
return ret;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
int arr[200005];
int Size[200005];
int n, m;
void init() {
for (int i = 0; i <= n; i++) {
arr[i] = i;
Size[i] = 1;
}
}
int root(int i) {
while (arr[i] != i) {
i = arr[arr[i]];
i = arr[i];
}
return i;
}
void w_union(int a, int b) {
int root_a = root(a);
int root_b = root(b);
if (root_a == root_b)
return;
if (Size[root_a] < Size[root_b]) {
arr[root_a] = arr[root_b];
Size[root_b] += Size[root_a];
} else {
arr[root_b] = arr[root_a];
Size[root_a] += Size[root_b];
}
}
signed main() {
IOS cin >> n >> m;
init();
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
w_union(a, b);
}
int maxx = 0;
for (int i = 1; i <= n; i++) {
int rooti = root(i);
maxx = max(maxx, (ll)Size[rooti]);
}
cout << maxx << endl;
return 0;
}
/// Alhamdulillah
| replace | 70 | 72 | 70 | 72 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using ll = long long;
using namespace std;
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define ar array
const int N = 1e5 + 9;
vector<int> g[N];
bool used[N];
int val[N];
int n, m;
int dfs(int u) {
used[u] = 1;
int y = 1;
for (auto x : g[u]) {
if (used[x])
continue;
y += dfs(x);
}
return y;
}
void solve() {
memset(used, 0, sizeof(used));
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].pb(b);
g[b].pb(a);
}
int ans = -1e9;
for (int i = 0; i < n; i++) {
if (!used[i]) {
int y = dfs(i);
ans = max(ans, y);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt",r,"stdin");
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
using ll = long long;
using namespace std;
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define ar array
const int N = 2e5 + 9;
vector<int> g[N];
bool used[N];
int val[N];
int n, m;
int dfs(int u) {
used[u] = 1;
int y = 1;
for (auto x : g[u]) {
if (used[x])
continue;
y += dfs(x);
}
return y;
}
void solve() {
memset(used, 0, sizeof(used));
cin >> n >> m;
while (m--) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].pb(b);
g[b].pb(a);
}
int ans = -1e9;
for (int i = 0; i < n; i++) {
if (!used[i]) {
int y = dfs(i);
ans = max(ans, y);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt",r,"stdin");
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define foi(n) for (ll i = 0; i < n; i++)
#define foj(n) for (ll j = 0; j < n; j++)
#define pb push_back
using namespace std;
ll a[100005];
vector<ll> v[100005];
bool visited[100005] = {false};
void bfs(ll i, ll cnt) {
visited[i] = true;
a[i] = cnt;
foj(v[i].size()) {
if (!visited[v[i][j]])
bfs(v[i][j], cnt);
}
}
int main() {
ll n, m;
cin >> n >> m;
ll cnt = 1;
while (m--) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
for (ll i = 1; i <= n; i++) {
if (!visited[i]) {
bfs(i, cnt);
cnt++;
}
}
sort(a + 1, a + n + 1);
map<ll, ll> ma;
foi(n) { ma[a[i + 1]]++; }
ll ans = 0;
for (auto it : ma) {
ans = max(ans, it.second);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define foi(n) for (ll i = 0; i < n; i++)
#define foj(n) for (ll j = 0; j < n; j++)
#define pb push_back
using namespace std;
ll a[200005];
vector<ll> v[200005];
bool visited[200005] = {false};
void bfs(ll i, ll cnt) {
visited[i] = true;
a[i] = cnt;
foj(v[i].size()) {
if (!visited[v[i][j]])
bfs(v[i][j], cnt);
}
}
int main() {
ll n, m;
cin >> n >> m;
ll cnt = 1;
while (m--) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
for (ll i = 1; i <= n; i++) {
if (!visited[i]) {
bfs(i, cnt);
cnt++;
}
}
sort(a + 1, a + n + 1);
map<ll, ll> ma;
foi(n) { ma[a[i + 1]]++; }
ll ans = 0;
for (auto it : ma) {
ans = max(ans, it.second);
}
cout << ans << endl;
} | replace | 7 | 10 | 7 | 10 | 0 | |
p02573 | C++ | Runtime Error |
// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#define int long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 1000000007
#define mod 998244353
#define bug cout << "HY" << endl
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define numize(A) A.numize(unique(A.begin(), A.end()) - A.begin())
typedef pair<int, int> P;
int power(int a, int b) {
if (b == 0)
return 1;
if (b % 2 == 0)
return (power((a * a) % mod, b / 2)) % mod;
return (a * (power((a * a) % mod, b / 2)) % mod) % mod;
}
int modInv(int n) { return power(n, MOD - 2); }
int nCr(int n, int r, int p = MOD) {
if (r == 0)
return 1;
int Fact[n + 1];
Fact[0] = 1;
for (int i = 1; i <= n; i++) {
Fact[i] = (Fact[i - 1] * i) % p;
}
return (((Fact[n] * modInv(Fact[r])) % MOD) * (modInv(Fact[n - r]) % MOD)) %
MOD;
}
double PI = 3.14159265359;
int DSU[100005];
int Rank[100005];
int find(int a) {
if (DSU[a] == a)
return a;
return DSU[a] = find(DSU[a]);
}
void Union(int a, int b) {
int x = find(a), y = find(b);
if (Rank[x] == Rank[x]) {
Rank[x]++;
DSU[y] = x;
} else if (Rank[x] > Rank[y]) {
DSU[y] = x;
} else {
DSU[x] = y;
}
return;
}
void solve() {
int n, m, i;
cin >> n >> m;
for (i = 0; i <= n; i++) {
DSU[i] = i;
Rank[i] = 1;
}
for (i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
if (DSU[u] == DSU[v])
continue;
Union(u, v);
}
map<int, int> M;
m = 0;
for (i = 1; i <= n; i++) {
M[find(i)]++;
m = max(m, M[DSU[i]]);
}
cout << m << endl;
}
int32_t main() {
boost;
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
// Problem : D - Friends
// Contest : AtCoder - AtCoder Beginner Contest 177
// URL : https://atcoder.jp/contests/abc177/tasks/abc177_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#define int long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define MOD 1000000007
#define mod 998244353
#define bug cout << "HY" << endl
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define numize(A) A.numize(unique(A.begin(), A.end()) - A.begin())
typedef pair<int, int> P;
int power(int a, int b) {
if (b == 0)
return 1;
if (b % 2 == 0)
return (power((a * a) % mod, b / 2)) % mod;
return (a * (power((a * a) % mod, b / 2)) % mod) % mod;
}
int modInv(int n) { return power(n, MOD - 2); }
int nCr(int n, int r, int p = MOD) {
if (r == 0)
return 1;
int Fact[n + 1];
Fact[0] = 1;
for (int i = 1; i <= n; i++) {
Fact[i] = (Fact[i - 1] * i) % p;
}
return (((Fact[n] * modInv(Fact[r])) % MOD) * (modInv(Fact[n - r]) % MOD)) %
MOD;
}
double PI = 3.14159265359;
int DSU[200005];
int Rank[200005];
int find(int a) {
if (DSU[a] == a)
return a;
return DSU[a] = find(DSU[a]);
}
void Union(int a, int b) {
int x = find(a), y = find(b);
if (Rank[x] == Rank[x]) {
Rank[x]++;
DSU[y] = x;
} else if (Rank[x] > Rank[y]) {
DSU[y] = x;
} else {
DSU[x] = y;
}
return;
}
void solve() {
int n, m, i;
cin >> n >> m;
for (i = 0; i <= n; i++) {
DSU[i] = i;
Rank[i] = 1;
}
for (i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
if (DSU[u] == DSU[v])
continue;
Union(u, v);
}
map<int, int> M;
m = 0;
for (i = 1; i <= n; i++) {
M[find(i)]++;
m = max(m, M[DSU[i]]);
}
cout << m << endl;
}
int32_t main() {
boost;
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| replace | 55 | 57 | 55 | 57 | 0 | |
p02573 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/****************************/
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define qi queue<int>
#define mii map<int, int>
#define msi map<string, int>
/****************************/
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep3(i, a, n) for (ll i = (a); i < (n); i++)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define pi 3.1415926535897932384626433832795
#define zero(n) memset(n, 0, sizeof(n));
#define SZ(n) n.size()
#define ss st.st
#define sn st.nd
#define mod 1000000007
/****************************/
using namespace std;
int n, m;
vi g[200010];
bool vis[200010];
ll ans = 0, res = 0;
;
void dfs(int x) {
vis[x] = true;
res++;
rep(i, g[x].size()) {
if (!vis[g[x][i]]) {
dfs(g[x][i]);
}
}
return;
}
int main() {
zero(vis);
cin >> n >> m;
ll now = 0;
rep(i, m) {
ll a, b;
cin >> a >> b;
bool flaga = false, flagb = false;
rep(j, g[a].size()) {
if (g[a][j] == b) {
flaga = true;
break;
}
}
if (!flaga)
g[a].pb(b);
rep(j, g[b].size()) {
if (g[b][j] == a) {
flagb = true;
break;
}
}
if (!flagb)
g[b].pb(a);
}
rep(i, n) {
if (!vis[i]) {
res = 0;
dfs(i);
ans = max(ans, res);
}
}
cout << ans;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/****************************/
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define qi queue<int>
#define mii map<int, int>
#define msi map<string, int>
/****************************/
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep3(i, a, n) for (ll i = (a); i < (n); i++)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define pi 3.1415926535897932384626433832795
#define zero(n) memset(n, 0, sizeof(n));
#define SZ(n) n.size()
#define ss st.st
#define sn st.nd
#define mod 1000000007
/****************************/
using namespace std;
int n, m;
vi g[200010];
bool vis[200010];
ll ans = 0, res = 0;
;
void dfs(int x) {
vis[x] = true;
res++;
rep(i, g[x].size()) {
if (!vis[g[x][i]]) {
dfs(g[x][i]);
}
}
return;
}
int main() {
zero(vis);
cin >> n >> m;
ll now = 0;
rep(i, m) {
ll a, b;
cin >> a >> b;
g[a].pb(b);
g[b].pb(a);
}
rep(i, n) {
if (!vis[i]) {
res = 0;
dfs(i);
ans = max(ans, res);
}
}
cout << ans;
return 0;
} | replace | 65 | 82 | 65 | 67 | TLE | |
p02573 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[100005], ctr = 0, val[200005];
bool vis[200005];
vector<ll> adj[100005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ginp \
for (int i = 0; i < m; i++) { \
int u, v; \
cin >> u >> v; \
adj[u].push_back(v); \
adj[v].push_back(u); \
}
#define pb push_back
#define ss second
#define ff first
#define fs first.second
#define fff first.first
#define sss second.second
#define sf second.first
#define mp make_pair
void printar(vector<ll> ar, ll l, ll r) {
for (int i = l; i < r; i++)
cout << ar[i] << " ";
cout << endl;
}
void dfs(ll node) {
vis[node] = true;
for (int i = 0; i < adj[node].size(); i++)
if (!vis[adj[node][i]]) {
val[ctr]++;
dfs(adj[node][i]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<pair<ll, ll>, bool> edge;
cin >> n >> m;
for (int i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
if (edge[mp(u, v)])
continue;
edge[mp(u, v)] = true;
edge[mp(v, u)] = true;
adj[v].pb(u);
adj[u].pb(v);
}
for (int i = 1; i <= n; i++)
if (!vis[i]) {
dfs(i);
val[ctr]++;
ctr++;
}
ll ans = 0;
for (int i = 0; i < ctr; i++)
ans = max(val[i], ans);
cout << ans << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, a[100005], ctr = 0, val[200005];
bool vis[200005];
vector<ll> adj[200005];
#define ari \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ginp \
for (int i = 0; i < m; i++) { \
int u, v; \
cin >> u >> v; \
adj[u].push_back(v); \
adj[v].push_back(u); \
}
#define pb push_back
#define ss second
#define ff first
#define fs first.second
#define fff first.first
#define sss second.second
#define sf second.first
#define mp make_pair
void printar(vector<ll> ar, ll l, ll r) {
for (int i = l; i < r; i++)
cout << ar[i] << " ";
cout << endl;
}
void dfs(ll node) {
vis[node] = true;
for (int i = 0; i < adj[node].size(); i++)
if (!vis[adj[node][i]]) {
val[ctr]++;
dfs(adj[node][i]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<pair<ll, ll>, bool> edge;
cin >> n >> m;
for (int i = 0; i < m; i++) {
ll u, v;
cin >> u >> v;
if (edge[mp(u, v)])
continue;
edge[mp(u, v)] = true;
edge[mp(v, u)] = true;
adj[v].pb(u);
adj[u].pb(v);
}
for (int i = 1; i <= n; i++)
if (!vis[i]) {
dfs(i);
val[ctr]++;
ctr++;
}
ll ans = 0;
for (int i = 0; i < ctr; i++)
ans = max(val[i], ans);
cout << ans << endl;
return (0);
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02573 | C++ | Runtime Error | /*
power code taken from geeks for geeks
*/
// cout << setprecision (2) << fixed << 1.2;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 1e18 + 5;
const ll MAX_N = 2e5 + 5;
const ll MODD = 1e9 + 7;
const ld PI = 3.14159265358979323846;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
double min(double a, double b) { return a < b ? a : b; }
ll modd(ll a) {
if (a < 0LL)
return a * -1LL;
return a;
}
ld modd(ld a) {
if (a < 0.0)
return a * -1.0;
return a;
}
ll modulo(ll a) { return (a + MODD) % MODD; }
ll power(ll k, ll p) {
if (p == 0)
return 1LL;
ll P = power(k, p / 2LL);
P = (P * P) % MODD;
if (p % 2 == 1)
P = (P * k) % MODD;
return P;
}
struct p_str {
ll a, b;
};
// vector<ll> adj[MAX_N];
// bool visited[MAX_N];
ll cnt = 0;
ll _dfs(ll s, vector<ll> adj[], bool visited[]) {
visited[s] = 1;
cnt++;
for (ll ch : adj[s]) {
if (visited[ch]) {
continue;
}
_dfs(ch, adj, visited);
}
}
void solve() {
ll n, m;
cin >> n >> m;
vector<ll> adj[n + 5];
bool visited[n + 5];
for (ll i = 0; i <= n; i++) {
visited[i] = 0;
}
ll u, v;
// map<string, int> seen;
string k1, k2;
for (ll i = 0; i < m; i++) {
cin >> u >> v;
// k1 = to_string(u) + "|" + to_string(v);
// k1 = to_string(v) + "|" + to_string(u);
// if(seen[k1]) {
// continue;
// }
adj[u].push_back(v);
adj[v].push_back(u);
// seen[k1] = 1;
// seen[k2] = 1;
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (visited[i] == 0) {
cnt = 0;
_dfs(i, adj, visited);
ans = max(ans, cnt);
// cout << "i " << i << " c " << c << endl;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | /*
power code taken from geeks for geeks
*/
// cout << setprecision (2) << fixed << 1.2;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = 1e18 + 5;
const ll MAX_N = 2e5 + 5;
const ll MODD = 1e9 + 7;
const ld PI = 3.14159265358979323846;
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
double min(double a, double b) { return a < b ? a : b; }
ll modd(ll a) {
if (a < 0LL)
return a * -1LL;
return a;
}
ld modd(ld a) {
if (a < 0.0)
return a * -1.0;
return a;
}
ll modulo(ll a) { return (a + MODD) % MODD; }
ll power(ll k, ll p) {
if (p == 0)
return 1LL;
ll P = power(k, p / 2LL);
P = (P * P) % MODD;
if (p % 2 == 1)
P = (P * k) % MODD;
return P;
}
struct p_str {
ll a, b;
};
// vector<ll> adj[MAX_N];
// bool visited[MAX_N];
ll cnt = 0;
void _dfs(ll s, vector<ll> adj[], bool visited[]) {
visited[s] = 1;
cnt++;
for (ll ch : adj[s]) {
if (visited[ch]) {
continue;
}
_dfs(ch, adj, visited);
}
}
void solve() {
ll n, m;
cin >> n >> m;
vector<ll> adj[n + 5];
bool visited[n + 5];
for (ll i = 0; i <= n; i++) {
visited[i] = 0;
}
ll u, v;
// map<string, int> seen;
string k1, k2;
for (ll i = 0; i < m; i++) {
cin >> u >> v;
// k1 = to_string(u) + "|" + to_string(v);
// k1 = to_string(v) + "|" + to_string(u);
// if(seen[k1]) {
// continue;
// }
adj[u].push_back(v);
adj[v].push_back(u);
// seen[k1] = 1;
// seen[k2] = 1;
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (visited[i] == 0) {
cnt = 0;
_dfs(i, adj, visited);
ans = max(ans, cnt);
// cout << "i " << i << " c " << c << endl;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | replace | 54 | 55 | 54 | 55 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.