oj.uz

Submission #359285

# Submission time Handle Problem Language Result Execution time Memory
359285 2021-01-26T15:54:35 Z Return_0 Making Friends on Joitter is Fun (JOI20_joitter2) C++17
100 / 100
 1623 ms 80108 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1);
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< x << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a) {
	return out << '(' << a.first << ", " << a.second << ')';    }
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

ll sz [N], par [N], n, m;
set <ll> in [N], out [N], frfr [N], comp [N];
long long ans;

ll root (cl &v) { return par[v] = (par[v] == v ? v : root(par[v])); }
void unite (ll v, ll u) {
	v = root(v), u = root(u);
	if (v == u)	return;
	if (SZ(in[v]) + SZ(out[v]) + SZ(frfr[v]) + SZ(comp[v]) > SZ(in[u]) + SZ(out[u]) + SZ(frfr[u]) + SZ(comp[u])) swap(u, v);

	//!			v bere tu u

	for (auto &it : comp[v]) if (!frfr[u].count(it)) ans += sz[u];

	ans += 1LL * sz[u] * sz[v];
	for (auto &it : frfr[v]) if (comp[u].count(it)) ans -= sz[v];

	ll t = SZ(frfr[u]);
	for (auto &it : comp[v])	if (frfr[u].count(it))	t--;
	for (auto &it : frfr[v])	if (frfr[u].count(it))	t--;
	ans += t * sz[v];

	t = SZ(frfr[v]);
	for (auto &it : frfr[v])	if (comp[u].count(it))	t--;
	for (auto &it : frfr[v])	if (frfr[u].count(it))	t--;
	ans += t * sz[u];

	vector <pll> vec;
	for (auto &it : out[v]) if (in[u].count(it) && !in[v].count(it))	vec.push_back({it, u});
	for (auto &it : in[v])	if (!in[u].count(it) && out[u].count(it))	vec.push_back({it, u});

	for (auto &it : in[v]) {
		in[u].insert(it);
		out[it].erase(v);
		out[it].insert(u);
	}

	for (auto &it : out[v]) {
		out[u].insert(it);
		in[it].erase(v);
		in[it].insert(u);
	}

	for (auto &it : comp[v])	comp[u].insert(it),		frfr[u].erase(it);
	for (auto &it : frfr[v])	if (!comp[u].count(it))	frfr[u].insert(it);

	par[v] = u; sz[u] += sz[v];
	in[v].clear(); out[v].clear();

	for (auto &it : vec) if (out[it.sc].count(it.fr)) unite(it.fr, it.sc);
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	iota(par, par + N, 0);
	fill(sz, sz + N, 1);
	for (ll i = 0; i < N; i++)	comp[i].insert(i);

	cin>> n >> m;

	for (ll v, u, pu, pv; m--;) {
		cin>> u >> v;
		pu = root(u), pv = root(v);

		if (pu ^ pv && !frfr[pv].count(u)) {
			out[pu].insert(pv);
			in[pv].insert(pu);
			frfr[pv].insert(u);
			ans += sz[pv];

			if (out[pv].count(pu)) unite(pu, pv);
		}

		cout<< ans << '\n';
	}

	return 0;
}
/*
4 6
1 2
2 3
3 2
1 3
3 4
4 3

6 10
1 2
2 3
3 4
4 5
5 6
6 5
5 4
4 3
3 2
2 1

*/

Compilation message

joitter2.cpp: In function 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)':
joitter2.cpp:44:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |  ^~
joitter2.cpp:44:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   44 |  if(a.empty())return out<<"[]";out<< '[' << a[0]; for (int i = 0; ++i < (int)(a.size());) out<< ", " << a[i];out<< ']';  }
      |                                ^~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24684 KB Output is correct
2 Correct 21 ms 24556 KB Output is correct
3 Correct 21 ms 24556 KB Output is correct
4 Correct 21 ms 24556 KB Output is correct
5 Correct 21 ms 24556 KB Output is correct
6 Correct 21 ms 24556 KB Output is correct
7 Correct 21 ms 24684 KB Output is correct
8 Correct 21 ms 24684 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 22 ms 24556 KB Output is correct
11 Correct 21 ms 24556 KB Output is correct
12 Correct 21 ms 24556 KB Output is correct
13 Correct 21 ms 24556 KB Output is correct
14 Correct 21 ms 24556 KB Output is correct
15 Correct 21 ms 24556 KB Output is correct
16 Correct 21 ms 24556 KB Output is correct
17 Correct 21 ms 24556 KB Output is correct
18 Correct 21 ms 24556 KB Output is correct
19 Correct 24 ms 24556 KB Output is correct
20 Correct 25 ms 24556 KB Output is correct
21 Correct 23 ms 24684 KB Output is correct
22 Correct 21 ms 24556 KB Output is correct
23 Correct 25 ms 24684 KB Output is correct
24 Correct 22 ms 24684 KB Output is correct
25 Correct 24 ms 24684 KB Output is correct
26 Correct 22 ms 24684 KB Output is correct
27 Correct 21 ms 24556 KB Output is correct
28 Correct 21 ms 24684 KB Output is correct
29 Correct 21 ms 24684 KB Output is correct
30 Correct 22 ms 24668 KB Output is correct
31 Correct 21 ms 24812 KB Output is correct
32 Correct 21 ms 24684 KB Output is correct
33 Correct 22 ms 24708 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24684 KB Output is correct
2 Correct 21 ms 24556 KB Output is correct
3 Correct 21 ms 24556 KB Output is correct
4 Correct 21 ms 24556 KB Output is correct
5 Correct 21 ms 24556 KB Output is correct
6 Correct 21 ms 24556 KB Output is correct
7 Correct 21 ms 24684 KB Output is correct
8 Correct 21 ms 24684 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 22 ms 24556 KB Output is correct
11 Correct 21 ms 24556 KB Output is correct
12 Correct 21 ms 24556 KB Output is correct
13 Correct 21 ms 24556 KB Output is correct
14 Correct 21 ms 24556 KB Output is correct
15 Correct 21 ms 24556 KB Output is correct
16 Correct 21 ms 24556 KB Output is correct
17 Correct 21 ms 24556 KB Output is correct
18 Correct 21 ms 24556 KB Output is correct
19 Correct 24 ms 24556 KB Output is correct
20 Correct 25 ms 24556 KB Output is correct
21 Correct 23 ms 24684 KB Output is correct
22 Correct 21 ms 24556 KB Output is correct
23 Correct 25 ms 24684 KB Output is correct
24 Correct 22 ms 24684 KB Output is correct
25 Correct 24 ms 24684 KB Output is correct
26 Correct 22 ms 24684 KB Output is correct
27 Correct 21 ms 24556 KB Output is correct
28 Correct 21 ms 24684 KB Output is correct
29 Correct 21 ms 24684 KB Output is correct
30 Correct 22 ms 24668 KB Output is correct
31 Correct 21 ms 24812 KB Output is correct
32 Correct 21 ms 24684 KB Output is correct
33 Correct 22 ms 24708 KB Output is correct
34 Correct 27 ms 24812 KB Output is correct
35 Correct 120 ms 30572 KB Output is correct
36 Correct 157 ms 33388 KB Output is correct
37 Correct 183 ms 33432 KB Output is correct
38 Correct 160 ms 33260 KB Output is correct
39 Correct 25 ms 24812 KB Output is correct
40 Correct 26 ms 25196 KB Output is correct
41 Correct 27 ms 25196 KB Output is correct
42 Correct 24 ms 24940 KB Output is correct
43 Correct 26 ms 24940 KB Output is correct
44 Correct 26 ms 24940 KB Output is correct
45 Correct 24 ms 24812 KB Output is correct
46 Correct 25 ms 24812 KB Output is correct
47 Correct 31 ms 25068 KB Output is correct
48 Correct 27 ms 25088 KB Output is correct
49 Correct 37 ms 25836 KB Output is correct
50 Correct 166 ms 33536 KB Output is correct
51 Correct 32 ms 25196 KB Output is correct
52 Correct 138 ms 31852 KB Output is correct
53 Correct 37 ms 25708 KB Output is correct
54 Correct 148 ms 32748 KB Output is correct
55 Correct 33 ms 25344 KB Output is correct
56 Correct 31 ms 25336 KB Output is correct
57 Correct 30 ms 25708 KB Output is correct
58 Correct 31 ms 25708 KB Output is correct
59 Correct 26 ms 25324 KB Output is correct
60 Correct 111 ms 30188 KB Output is correct
61 Correct 30 ms 25196 KB Output is correct
62 Correct 158 ms 33004 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24684 KB Output is correct
2 Correct 21 ms 24556 KB Output is correct
3 Correct 21 ms 24556 KB Output is correct
4 Correct 21 ms 24556 KB Output is correct
5 Correct 21 ms 24556 KB Output is correct
6 Correct 21 ms 24556 KB Output is correct
7 Correct 21 ms 24684 KB Output is correct
8 Correct 21 ms 24684 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 22 ms 24556 KB Output is correct
11 Correct 21 ms 24556 KB Output is correct
12 Correct 21 ms 24556 KB Output is correct
13 Correct 21 ms 24556 KB Output is correct
14 Correct 21 ms 24556 KB Output is correct
15 Correct 21 ms 24556 KB Output is correct
16 Correct 21 ms 24556 KB Output is correct
17 Correct 21 ms 24556 KB Output is correct
18 Correct 21 ms 24556 KB Output is correct
19 Correct 24 ms 24556 KB Output is correct
20 Correct 25 ms 24556 KB Output is correct
21 Correct 23 ms 24684 KB Output is correct
22 Correct 21 ms 24556 KB Output is correct
23 Correct 25 ms 24684 KB Output is correct
24 Correct 22 ms 24684 KB Output is correct
25 Correct 24 ms 24684 KB Output is correct
26 Correct 22 ms 24684 KB Output is correct
27 Correct 21 ms 24556 KB Output is correct
28 Correct 21 ms 24684 KB Output is correct
29 Correct 21 ms 24684 KB Output is correct
30 Correct 22 ms 24668 KB Output is correct
31 Correct 21 ms 24812 KB Output is correct
32 Correct 21 ms 24684 KB Output is correct
33 Correct 22 ms 24708 KB Output is correct
34 Correct 27 ms 24812 KB Output is correct
35 Correct 120 ms 30572 KB Output is correct
36 Correct 157 ms 33388 KB Output is correct
37 Correct 183 ms 33432 KB Output is correct
38 Correct 160 ms 33260 KB Output is correct
39 Correct 25 ms 24812 KB Output is correct
40 Correct 26 ms 25196 KB Output is correct
41 Correct 27 ms 25196 KB Output is correct
42 Correct 24 ms 24940 KB Output is correct
43 Correct 26 ms 24940 KB Output is correct
44 Correct 26 ms 24940 KB Output is correct
45 Correct 24 ms 24812 KB Output is correct
46 Correct 25 ms 24812 KB Output is correct
47 Correct 31 ms 25068 KB Output is correct
48 Correct 27 ms 25088 KB Output is correct
49 Correct 37 ms 25836 KB Output is correct
50 Correct 166 ms 33536 KB Output is correct
51 Correct 32 ms 25196 KB Output is correct
52 Correct 138 ms 31852 KB Output is correct
53 Correct 37 ms 25708 KB Output is correct
54 Correct 148 ms 32748 KB Output is correct
55 Correct 33 ms 25344 KB Output is correct
56 Correct 31 ms 25336 KB Output is correct
57 Correct 30 ms 25708 KB Output is correct
58 Correct 31 ms 25708 KB Output is correct
59 Correct 26 ms 25324 KB Output is correct
60 Correct 111 ms 30188 KB Output is correct
61 Correct 30 ms 25196 KB Output is correct
62 Correct 158 ms 33004 KB Output is correct
63 Correct 551 ms 72428 KB Output is correct
64 Correct 548 ms 72428 KB Output is correct
65 Correct 574 ms 72476 KB Output is correct
66 Correct 326 ms 38508 KB Output is correct
67 Correct 613 ms 62288 KB Output is correct
68 Correct 294 ms 38508 KB Output is correct
69 Correct 725 ms 39660 KB Output is correct
70 Correct 364 ms 38508 KB Output is correct
71 Correct 387 ms 38452 KB Output is correct
72 Correct 735 ms 46756 KB Output is correct
73 Correct 740 ms 48364 KB Output is correct
74 Correct 1623 ms 63880 KB Output is correct
75 Correct 1065 ms 45260 KB Output is correct
76 Correct 1341 ms 55204 KB Output is correct
77 Correct 1321 ms 55532 KB Output is correct
78 Correct 353 ms 40812 KB Output is correct
79 Correct 624 ms 45036 KB Output is correct
80 Correct 397 ms 39660 KB Output is correct
81 Correct 676 ms 43244 KB Output is correct
82 Correct 1408 ms 56556 KB Output is correct
83 Correct 1338 ms 56448 KB Output is correct
84 Correct 1269 ms 80040 KB Output is correct
85 Correct 1341 ms 80108 KB Output is correct
86 Correct 452 ms 71316 KB Output is correct
87 Correct 500 ms 73580 KB Output is correct
88 Correct 768 ms 47464 KB Output is correct
89 Correct 1312 ms 52972 KB Output is correct