| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 857745 | 2023-10-06T19:30:53 Z | efedmrlr | Making Friends on Joitter is Fun (JOI20_joitter2) | C++17 | 2 ms | 6748 KB |
#include <bits/stdc++.h>
using namespace std;
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl
#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
int p[N];
int sz[N];
unordered_set<int> st[N];
int ans = 0;
void make_set(int x) {
p[x] = x;
st[x].clear();
st[x].insert(x);
sz[x] = 1;
}
int find_set(int x) {
if(p[x] == x) return x;
return find_set(p[x]);
}
void union_set(int x, int y) {
x = find_set(x);
y = find_set(y);
if(x==y) return;
if(st[x].size() < st[y].size()) swap(x,y);
ans -= sz[x] * (sz[x] - 1ll);
ans -= sz[y] * (sz[y] - 1ll);
ans -= (st[x].size() - sz[x] ) * sz[x];
ans -= (st[y].size() - sz[y]) * sz[y];
assert(ans >= 0);
p[y] = x;
sz[x] += sz[y];
for(auto el : st[y]) {
st[x].insert(el);
}
ans += sz[x] * (sz[x] - 1ll);
ans += (st[x].size() - sz[x]) * sz[x];
}
void add_edge(int a, int b) {
int repa = find_set(a), repb = find_set(b);
if(st[repb].find(a) == st[repb].end()) {
ans += sz[repb];
}
st[repb].insert(a);
if(st[repa].find(b) != st[repa].end()) {
union_set(repa, repb);
}
}
inline void solve() {
cin>>n>>m;
for(int i = 1; i<=n; i++) {
make_set(i);
}
for(int i = 0; i<m; i++) {
int a,b;
cin>>a>>b;
add_edge(a ,b);
cout<<ans<<"\n";
}
}
signed main() {
//freopen("milkvisits.in", "r", stdin);
//freopen("milkvisits.out", "w", stdout);
fastio();
int test = 1;
//cin>>test;
while(test--) {
solve();
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2 ms | 6748 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2 ms | 6748 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2 ms | 6748 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |