oj.uz

Submission #871610

# Submission time Handle Problem Language Result Execution time Memory
871610 2023-11-11T07:44:20 Z AmirAli_H1 Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 37 ms 604 KB 
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

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

#define 	all(x)					(x).begin(),(x).end()
#define 	len(x)					((ll) (x).size())
#define 	F						first
#define 	S						second
#define 	pb						push_back
#define 	sep						' '
#define 	endl					'\n'
#define 	Mp						make_pair
#define 	kill(x)					cout << x << '\n', exit(0)
#define 	set_dec(x)				cout << fixed << setprecision(x);
#define 	file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

int n, q;
const int maxn = 50 + 4;
bool M[maxn][maxn];
int p[maxn], sz[maxn]; vector<pii> E;

int get(int a) {
	return (p[a] == a) ? a : p[a] = get(p[a]);
}

void merge(int a, int b) {
	a = get(a); b = get(b);
	if (a == b) return ;
	p[a] = b; sz[b] += sz[a]; sz[a] = 0;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	cin >> n >> q;
	for (int i = 0; i < n; i++) {
		p[i] = i; sz[i] = 1;
	}
	
	for (int i = 0; i < q; i++) {
		int u1, v1;
		cin >> u1 >> v1; u1--; v1--;
		E.pb(Mp(u1, v1));
		
		while (true) {
			pii res = Mp(-1, -1);
			
			for (auto f : E) {
				int u = f.F, v = f.S;
				u = get(u); v = get(v);
				if (u == v) continue;
				M[u][v] = 1;
				if (M[v][u]) {
					res = Mp(u, v);
				}
			}
			for (auto f : E) {
				int u = f.F, v = f.S;
				u = get(u); v = get(v);
				if (u == v) continue;
				M[u][v] = 0;
			}
			
			if (res.F == -1) break;
			merge(res.F, res.S);
		}
		
		ll res = 0;
		for (int i = 0; i < n; i++) res += 1ll * sz[i] * (sz[i] - 1);
		for (auto f : E) {
			int u1 = f.F, v1 = f.S;
			int u = get(u1), v = get(v1);
			if (u == v) continue;
			
			if (!M[u1][v]) res += sz[v];
			M[u1][v] = 1;
		}
		for (auto f : E) {
			int u1 = f.F, v1 = f.S;
			int u = get(u1), v = get(v1);
			if (u == v) continue;
			M[u1][v] = 0;
		}
		
		cout << res << endl;
	}
	
	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 30 ms 348 KB Output is correct
8 Correct 37 ms 508 KB Output is correct
9 Correct 31 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 29 ms 524 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 20 ms 504 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 20 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 20 ms 508 KB Output is correct
34 Runtime error 1 ms 600 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 30 ms 348 KB Output is correct
8 Correct 37 ms 508 KB Output is correct
9 Correct 31 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 29 ms 524 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 20 ms 504 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 20 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 20 ms 508 KB Output is correct
34 Runtime error 1 ms 600 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -