oj.uz

Submission #883102

# Submission time Handle Problem Language Result Execution time Memory
883102 2023-12-04T14:29:19 Z marvinthang Making Friends on Joitter is Fun (JOI20_joitter2) C++17
100 / 100
 319 ms 40548 KB 
/*************************************
*    author: marvinthang             *
*    created: 04.12.2023 16:58:46    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n, m; cin >> n >> m;
	vector <int> par(n, -1);
	function<int(int)> find = [&] (int u) {
		return par[u] < 0 ? u : par[u] = find(par[u]);
	};
	vector <set <int>> in(n);
	vector <set <pair <int, int>>> out(n);
	long long res = 0;
	REP(i, m) {
		int u, v; cin >> u >> v; --u; --v;
		vector <pair <int, int>> edges;
		edges.emplace_back(u, v);
		while (!edges.empty()) {
			auto [u, v] = edges.back();
			edges.pop_back();
			int rt_u = find(u); v = find(v);
			if (rt_u == v || in[v].count(u)) continue;
			auto it = out[v].lower_bound(pair{rt_u, 0});
			if (it != out[v].end() && it->fi == rt_u) {
				u = rt_u;
				if (par[u] > par[v]) swap(u, v);
				res += 2LL * par[u] * par[v];
				res += 1LL * in[u].size() * par[u] + 1LL * in[v].size() * par[v];
				for (auto it: out[v]) {
					if (it.fi == u) {
						in[u].erase(it.se);
						continue;
					}
					auto pt = out[it.fi].lower_bound(pair{u, 0});
					if (pt != out[it.fi].end() && pt->fi == u) {
						edges.emplace_back(it.se, it.fi);
						in[it.fi].erase(it.se);
						res += par[it.fi];
					} else out[u].insert(it);
				}
				out[v].clear();
				for (int w: in[v]) {
					int rt_w = find(w);
					if (rt_w == u) {
						out[u].erase(out[u].find(pair{v, w}));
						continue;
					}
					auto it = out[u].lower_bound(pair{rt_w, 0});
					if (it != out[u].end() && it->fi == rt_w) {
						edges.emplace_back(w, u);
						out[rt_w].erase(pair{v, w});
					} else {
						in[u].insert(w);
						out[rt_w].erase(pair{v, w});
						out[rt_w].insert(pair{u, w});
					}
				}
				in[v].clear();
				par[u] += par[v];
				par[v] = u;
				res -= 1LL * in[u].size() * par[u];
			} else {
				res -= par[v];
				out[rt_u].insert(pair{v, u});
				in[v].insert(u);
			}
		}
		cout << res << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_joitter2");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

joitter2.cpp: In function 'int main()':
joitter2.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:114:2: note: in expansion of macro 'file'
  114 |  file("JOI20_joitter2");
      |  ^~~~
joitter2.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:114:2: note: in expansion of macro 'file'
  114 |  file("JOI20_joitter2");
      |  ^~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 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 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 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 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 64 ms 3388 KB Output is correct
36 Correct 76 ms 5124 KB Output is correct
37 Correct 76 ms 5372 KB Output is correct
38 Correct 74 ms 4960 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 6 ms 1116 KB Output is correct
50 Correct 77 ms 5380 KB Output is correct
51 Correct 5 ms 856 KB Output is correct
52 Correct 76 ms 4072 KB Output is correct
53 Correct 6 ms 1112 KB Output is correct
54 Correct 73 ms 4696 KB Output is correct
55 Correct 3 ms 1112 KB Output is correct
56 Correct 3 ms 860 KB Output is correct
57 Correct 3 ms 860 KB Output is correct
58 Correct 3 ms 860 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 65 ms 2896 KB Output is correct
61 Correct 3 ms 600 KB Output is correct
62 Correct 75 ms 4984 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 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 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 472 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 64 ms 3388 KB Output is correct
36 Correct 76 ms 5124 KB Output is correct
37 Correct 76 ms 5372 KB Output is correct
38 Correct 74 ms 4960 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 6 ms 1116 KB Output is correct
50 Correct 77 ms 5380 KB Output is correct
51 Correct 5 ms 856 KB Output is correct
52 Correct 76 ms 4072 KB Output is correct
53 Correct 6 ms 1112 KB Output is correct
54 Correct 73 ms 4696 KB Output is correct
55 Correct 3 ms 1112 KB Output is correct
56 Correct 3 ms 860 KB Output is correct
57 Correct 3 ms 860 KB Output is correct
58 Correct 3 ms 860 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 65 ms 2896 KB Output is correct
61 Correct 3 ms 600 KB Output is correct
62 Correct 75 ms 4984 KB Output is correct
63 Correct 250 ms 40272 KB Output is correct
64 Correct 246 ms 40404 KB Output is correct
65 Correct 279 ms 40548 KB Output is correct
66 Correct 59 ms 12112 KB Output is correct
67 Correct 87 ms 16272 KB Output is correct
68 Correct 63 ms 12304 KB Output is correct
69 Correct 135 ms 16804 KB Output is correct
70 Correct 62 ms 12116 KB Output is correct
71 Correct 64 ms 12116 KB Output is correct
72 Correct 105 ms 16260 KB Output is correct
73 Correct 109 ms 16184 KB Output is correct
74 Correct 319 ms 23192 KB Output is correct
75 Correct 237 ms 20404 KB Output is correct
76 Correct 273 ms 22976 KB Output is correct
77 Correct 273 ms 23124 KB Output is correct
78 Correct 88 ms 16344 KB Output is correct
79 Correct 156 ms 18260 KB Output is correct
80 Correct 87 ms 16148 KB Output is correct
81 Correct 172 ms 17932 KB Output is correct
82 Correct 271 ms 30288 KB Output is correct
83 Correct 274 ms 30544 KB Output is correct
84 Correct 214 ms 30292 KB Output is correct
85 Correct 245 ms 30292 KB Output is correct
86 Correct 60 ms 11344 KB Output is correct
87 Correct 84 ms 12460 KB Output is correct
88 Correct 109 ms 16176 KB Output is correct
89 Correct 250 ms 22840 KB Output is correct