oj.uz

Submission #211895

# Submission time Handle Problem Language Result Execution time Memory
211895 2020-03-21T15:40:17 Z mieszko11b Making Friends on Joitter is Fun (JOI20_joitter2) C++14
100 / 100
 778 ms 41720 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;

#define X first
#define Y second

using ll = long long;

int n, m;
int p[100007], ran[100007];
set<ii> GID[100007];
set<int> GO[100007];

ll res = 0;

void init() {
	for(int i = 1 ; i <= n ; i++) {
		p[i] = i;
		ran[i] = 1;
	}
}

int Find(int a) {
	if(p[a] == a)
		return a;
	return p[a] = Find(p[a]);
}

void remove_between(int a, int b) {
	set<ii>::iterator it;
	while((it = GID[b].lower_bound({a, 0})) != GID[b].end() && it->X == a) {
		//~ cout << "x" << endl;
		res -= ran[b];
		GID[b].erase(it);
		GO[a].erase(b);
	}	
}


void print_all() {
	cout << "res is " << res << endl;
	for(int i = 1 ; i <= n ; i++)
		cout << "rep of "<< i << " is "<<Find(i) << endl;
	for(int i = 1 ; i <= n ; i++) {
		if(i == Find(i)) {
			cout << "AAA " <<i << endl;
			cout << "OUT: ";
			for(int x : GO[i])
				cout << x << " ";
			cout << endl;
			cout << "IN: ";
			for(ii x : GID[i])
				cout << "(" << x.X << ","<<x.Y <<") ";
			cout << endl;
		}
	}
}

void Union(int a, int b) {
	a = Find(a);
	b = Find(b);
	
	//~ cout << "Union " << a << " " << b << endl;
	//~ cout << "at the beginning:" << endl;
	//~ print_all();
	if(a == b)
		return ;
	
	if(ran[a] < ran[b])
		swap(a, b);

	remove_between(a, b);	
	//~ cout << "x" << endl;
	remove_between(b, a);
	
	//~ cout << "after edge removal:" << endl;
	//~ print_all();
	
	//~ cout << "x" << endl;
	
	vector<int> to_union;
	
	for(int x : GO[b]) {
		auto it = GID[x].lower_bound({b, 0});
		while((it = GID[x].lower_bound({b, 0})) != GID[x].end() && it->X == b) {
			auto p = *it;
			GID[x].erase(it);
			GID[x].insert({a, p.Y});
		}	
		GO[a].insert(x);
		if(GO[x].count(a))
			to_union.push_back(x);
	}
	GO[b].clear();
	
	res += (ll)ran[b] * GID[a].size();
	
	for(auto p : GID[b]) {
		GO[p.X].erase(b);
		GO[p.X].insert(a);
		if(!GID[a].count(p)) {
			res += ran[a];
			GID[a].insert(p);
		} else
			res -= ran[b];
		if(GO[a].count(p.X))
			to_union.push_back(p.X);
	}
	GID[b].clear();
	
	res -= (ll)ran[a] * (ran[a] - 1);
	res -= (ll)ran[b] * (ran[b] - 1);
	res += ll(ran[a] + ran[b]) * (ran[a] + ran[b] - 1);
	
	p[b] = a;
	ran[a] += ran[b];
	
	for(int x : to_union)
		Union(a, x);
}

void add_edge(int a, int b) {
	int wa = a;
	a = Find(a);
	b = Find(b);
	
	if(a == b)
		return ;
		
	if(!GID[b].count({a, wa})) {
		res += ran[b];
		GID[b].insert({a, wa});
		GO[a].insert(b);
	}
	
	if(GO[a].count(b) && GO[b].count(a))
		Union(a, b);
}


int main() {
	scanf("%d%d", &n, &m);
	init();
	for(int i = 0 ; i < m ; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		add_edge(a, b);
		printf("%lld\n", res);
		//~ print_all();
	}
	return 0;
}

Compilation message

joitter2.cpp: In function 'int main()':
joitter2.cpp:145:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
joitter2.cpp:149:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9728 KB Output is correct
4 Correct 9 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 13 ms 9728 KB Output is correct
9 Correct 11 ms 9728 KB Output is correct
10 Correct 9 ms 9728 KB Output is correct
11 Correct 11 ms 9728 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 9 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9728 KB Output is correct
16 Correct 9 ms 9600 KB Output is correct
17 Correct 9 ms 9728 KB Output is correct
18 Correct 9 ms 9728 KB Output is correct
19 Correct 9 ms 9728 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 11 ms 9728 KB Output is correct
24 Correct 9 ms 9728 KB Output is correct
25 Correct 10 ms 9728 KB Output is correct
26 Correct 9 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 9 ms 9728 KB Output is correct
30 Correct 9 ms 9728 KB Output is correct
31 Correct 10 ms 9728 KB Output is correct
32 Correct 11 ms 9728 KB Output is correct
33 Correct 10 ms 9728 KB Output is correct
34 Correct 13 ms 9856 KB Output is correct
35 Correct 127 ms 12768 KB Output is correct
36 Correct 149 ms 14584 KB Output is correct
37 Correct 154 ms 14584 KB Output is correct
38 Correct 160 ms 14328 KB Output is correct
39 Correct 12 ms 9728 KB Output is correct
40 Correct 13 ms 9856 KB Output is correct
41 Correct 12 ms 9856 KB Output is correct
42 Correct 12 ms 9728 KB Output is correct
43 Correct 14 ms 9856 KB Output is correct
44 Correct 13 ms 9856 KB Output is correct
45 Correct 11 ms 9728 KB Output is correct
46 Correct 12 ms 9728 KB Output is correct
47 Correct 13 ms 9856 KB Output is correct
48 Correct 13 ms 9856 KB Output is correct
49 Correct 20 ms 10368 KB Output is correct
50 Correct 152 ms 14644 KB Output is correct
51 Correct 17 ms 9984 KB Output is correct
52 Correct 136 ms 13560 KB Output is correct
53 Correct 20 ms 10240 KB Output is correct
54 Correct 146 ms 14072 KB Output is correct
55 Correct 14 ms 10112 KB Output is correct
56 Correct 14 ms 10112 KB Output is correct
57 Correct 14 ms 10368 KB Output is correct
58 Correct 15 ms 10368 KB Output is correct
59 Correct 12 ms 9728 KB Output is correct
60 Correct 128 ms 12264 KB Output is correct
61 Correct 15 ms 9856 KB Output is correct
62 Correct 143 ms 14328 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9728 KB Output is correct
4 Correct 9 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 13 ms 9728 KB Output is correct
9 Correct 11 ms 9728 KB Output is correct
10 Correct 9 ms 9728 KB Output is correct
11 Correct 11 ms 9728 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 9 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 9 ms 9728 KB Output is correct
16 Correct 9 ms 9600 KB Output is correct
17 Correct 9 ms 9728 KB Output is correct
18 Correct 9 ms 9728 KB Output is correct
19 Correct 9 ms 9728 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Correct 9 ms 9728 KB Output is correct
23 Correct 11 ms 9728 KB Output is correct
24 Correct 9 ms 9728 KB Output is correct
25 Correct 10 ms 9728 KB Output is correct
26 Correct 9 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 9 ms 9728 KB Output is correct
30 Correct 9 ms 9728 KB Output is correct
31 Correct 10 ms 9728 KB Output is correct
32 Correct 11 ms 9728 KB Output is correct
33 Correct 10 ms 9728 KB Output is correct
34 Correct 13 ms 9856 KB Output is correct
35 Correct 127 ms 12768 KB Output is correct
36 Correct 149 ms 14584 KB Output is correct
37 Correct 154 ms 14584 KB Output is correct
38 Correct 160 ms 14328 KB Output is correct
39 Correct 12 ms 9728 KB Output is correct
40 Correct 13 ms 9856 KB Output is correct
41 Correct 12 ms 9856 KB Output is correct
42 Correct 12 ms 9728 KB Output is correct
43 Correct 14 ms 9856 KB Output is correct
44 Correct 13 ms 9856 KB Output is correct
45 Correct 11 ms 9728 KB Output is correct
46 Correct 12 ms 9728 KB Output is correct
47 Correct 13 ms 9856 KB Output is correct
48 Correct 13 ms 9856 KB Output is correct
49 Correct 20 ms 10368 KB Output is correct
50 Correct 152 ms 14644 KB Output is correct
51 Correct 17 ms 9984 KB Output is correct
52 Correct 136 ms 13560 KB Output is correct
53 Correct 20 ms 10240 KB Output is correct
54 Correct 146 ms 14072 KB Output is correct
55 Correct 14 ms 10112 KB Output is correct
56 Correct 14 ms 10112 KB Output is correct
57 Correct 14 ms 10368 KB Output is correct
58 Correct 15 ms 10368 KB Output is correct
59 Correct 12 ms 9728 KB Output is correct
60 Correct 128 ms 12264 KB Output is correct
61 Correct 15 ms 9856 KB Output is correct
62 Correct 143 ms 14328 KB Output is correct
63 Correct 481 ms 40696 KB Output is correct
64 Correct 474 ms 40760 KB Output is correct
65 Correct 479 ms 40696 KB Output is correct
66 Correct 156 ms 12664 KB Output is correct
67 Correct 251 ms 16632 KB Output is correct
68 Correct 147 ms 12664 KB Output is correct
69 Correct 340 ms 17448 KB Output is correct
70 Correct 154 ms 12664 KB Output is correct
71 Correct 159 ms 12664 KB Output is correct
72 Correct 278 ms 16632 KB Output is correct
73 Correct 282 ms 16632 KB Output is correct
74 Correct 778 ms 24184 KB Output is correct
75 Correct 495 ms 20728 KB Output is correct
76 Correct 615 ms 23972 KB Output is correct
77 Correct 603 ms 23928 KB Output is correct
78 Correct 192 ms 16632 KB Output is correct
79 Correct 343 ms 18364 KB Output is correct
80 Correct 189 ms 16632 KB Output is correct
81 Correct 311 ms 18168 KB Output is correct
82 Correct 547 ms 30584 KB Output is correct
83 Correct 555 ms 30712 KB Output is correct
84 Correct 540 ms 41720 KB Output is correct
85 Correct 561 ms 41592 KB Output is correct
86 Correct 162 ms 11768 KB Output is correct
87 Correct 210 ms 12920 KB Output is correct
88 Correct 299 ms 16632 KB Output is correct
89 Correct 667 ms 23272 KB Output is correct