oj.uz

Submission #212110

# Submission time Handle Problem Language Result Execution time Memory
212110 2020-03-22T09:40:36 Z abacaba Making Friends on Joitter is Fun (JOI20_joitter2) C++14
0 / 100
 30 ms 47360 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;
 
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
#define int long long

template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}
 
template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}
 
ostream &operator << (ostream &cout, vector <int> &a) {
	cout << "{";
	for (auto & it : a) cout << it << ", ";
	cout << "}";
	return cout;
}
 
ostream &operator << (ostream &cout, set <int> &a) {
	cout << "{";
	for (auto & it : a) cout << it << ", ";
	cout << "}";
	return cout;
}
 
const int mod = 1e9 + 7;
const int inf = 2e9;
const int N = 3e5 + 15;
int n, m, p[N], sz[N];
 
set <int> g[N], gr[N], gr_find[N];

vector <pii> q;

ll ans;

int find(int v) {
	if(v == p[v])
		return v;
	return p[v] = find(p[v]);
}

inline void upd_ans(int v, int sign) {
	ans += sign * (1ll * sz[v] * (sz[v] - 1) + 1ll * sz[v] * ((int)gr[v].size() - sz[v]));
}

inline void unio(int a, int b) {
	a = find(a);
	b = find(b);
	if(a != b) {
		upd_ans(a, -1);
		upd_ans(b, -1);

		gr_find[b].erase(a);
		gr_find[a].erase(b);

		g[a].erase(b);
		g[b].erase(a);

		for(int v : g[b]) {

			if(gr_find[a].count(v))
				q.pb({v, a});

			gr_find[v].erase(b);

			g[a].insert(v);
			gr_find[v].insert(a);
		}

		for(int v : gr_find[b]) {

			if(g[a].count(v))
				q.pb({v, a});

			g[v].erase(b);

			gr_find[a].insert(v);
			g[v].insert(a);
		}

		gr[a].insert(gr[b].begin(), gr[b].end());

		// gr_find[b].clear();
		// g[b].clear();
		// gr[b].clear();

		p[b] = a;
		sz[a] += sz[b];

		upd_ans(a, 1);
	}
}
 
main() {
	for(int i = 0; i < N; ++i)
		p[i] = i, sz[i] = 1;
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		if(find(u) == find(v)) {
			cout << ans << endl;
			continue;
		}

		if(gr_find[find(u)].count(find(v))) {

 			q.pb({find(u), find(v)});

 			while(!q.empty()) {
 				int u = q.back().f, v = q.back().se;
 				q.ppb();
 				unio(u, v);
 			}
		}
		else {
			upd_ans(find(v), -1);

			gr_find[find(v)].insert(find(u));
			g[find(u)].insert(find(v));

			gr[find(v)].insert(u);

			upd_ans(find(v), 1);
		}
		cout << ans << endl;
	}
	return 0;
}

Compilation message

joitter2.cpp:131:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47232 KB Output is correct
2 Correct 28 ms 47352 KB Output is correct
3 Correct 29 ms 47352 KB Output is correct
4 Correct 28 ms 47360 KB Output is correct
5 Correct 30 ms 47232 KB Output is correct
6 Incorrect 29 ms 47232 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47232 KB Output is correct
2 Correct 28 ms 47352 KB Output is correct
3 Correct 29 ms 47352 KB Output is correct
4 Correct 28 ms 47360 KB Output is correct
5 Correct 30 ms 47232 KB Output is correct
6 Incorrect 29 ms 47232 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 47232 KB Output is correct
2 Correct 28 ms 47352 KB Output is correct
3 Correct 29 ms 47352 KB Output is correct
4 Correct 28 ms 47360 KB Output is correct
5 Correct 30 ms 47232 KB Output is correct
6 Incorrect 29 ms 47232 KB Output isn't correct
7 Halted 0 ms 0 KB -