oj.uz

Submission #211898

# Submission time Handle Problem Language Result Execution time Memory
211898 2020-03-21T15:54:21 Z Benq Making Friends on Joitter is Fun (JOI20_joitter2) C++14
100 / 100
 1332 ms 104292 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

int N,M;
int comp[MX]; vi rcomp[MX];
unordered_set<int> child[MX], adj[MX], radj[MX];
ll ans;

queue<pi> todo;
void insEd(int A, int B) {
	adj[A].insert(B), radj[B].insert(A);
	if (adj[B].count(A)) todo.push({A,B});
}

void red(int A, int B) {
	if (A == B) return;
	if (sz(rcomp[A]) < sz(rcomp[B])) swap(A,B);
	ans += (ll)sz(child[A])*sz(rcomp[B])+(ll)sz(child[B])*sz(rcomp[A]);
	trav(t,rcomp[B]) { comp[t] = A; rcomp[A].pb(t); }
	trav(t,child[B]) {
		if (child[A].count(t)) ans -= sz(rcomp[A]);
		else child[A].insert(t);
	}
	adj[A].erase(B); radj[A].erase(B);
	trav(t,adj[B]) if (t != A) { radj[t].erase(B); insEd(A,t); }
	trav(t,radj[B]) if (t != A) { adj[t].erase(B); insEd(t,A); }
}

void upd(int A, int B) {
	B = comp[B]; if (comp[A] == B) return;
	if (child[B].count(A)) return;
	child[B].insert(A); ans += sz(rcomp[B]); 
	A = comp[A]; insEd(A,B);
	while (sz(todo)) {
		pi p = todo.ft; todo.pop();
		red(comp[p.f],comp[p.s]);
	}
}

int main() {
	setIO(); re(N,M);
	FOR(i,1,N+1) { comp[i] = i; rcomp[i] = {i}; child[i] = {i}; }
	F0R(i,M) {
		int A,B; re(A,B); upd(A,B);
		ps(ans);
	}
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

joitter2.cpp: In function 'void setIn(std::__cxx11::string)':
joitter2.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
joitter2.cpp: In function 'void setOut(std::__cxx11::string)':
joitter2.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 37888 KB Output is correct
2 Correct 27 ms 38008 KB Output is correct
3 Correct 27 ms 37888 KB Output is correct
4 Correct 27 ms 37888 KB Output is correct
5 Correct 27 ms 37888 KB Output is correct
6 Correct 28 ms 37888 KB Output is correct
7 Correct 28 ms 38012 KB Output is correct
8 Correct 28 ms 38016 KB Output is correct
9 Correct 29 ms 38016 KB Output is correct
10 Correct 27 ms 38016 KB Output is correct
11 Correct 27 ms 37888 KB Output is correct
12 Correct 27 ms 37888 KB Output is correct
13 Correct 27 ms 37888 KB Output is correct
14 Correct 27 ms 37888 KB Output is correct
15 Correct 27 ms 37888 KB Output is correct
16 Correct 29 ms 37888 KB Output is correct
17 Correct 27 ms 37888 KB Output is correct
18 Correct 27 ms 37888 KB Output is correct
19 Correct 28 ms 37888 KB Output is correct
20 Correct 27 ms 37888 KB Output is correct
21 Correct 29 ms 38016 KB Output is correct
22 Correct 27 ms 37888 KB Output is correct
23 Correct 27 ms 38016 KB Output is correct
24 Correct 32 ms 37888 KB Output is correct
25 Correct 28 ms 38016 KB Output is correct
26 Correct 27 ms 37888 KB Output is correct
27 Correct 27 ms 38016 KB Output is correct
28 Correct 28 ms 37888 KB Output is correct
29 Correct 27 ms 37888 KB Output is correct
30 Correct 27 ms 37888 KB Output is correct
31 Correct 27 ms 38016 KB Output is correct
32 Correct 30 ms 37888 KB Output is correct
33 Correct 29 ms 38016 KB Output is correct
34 Correct 31 ms 38016 KB Output is correct
35 Correct 142 ms 41464 KB Output is correct
36 Correct 168 ms 43896 KB Output is correct
37 Correct 166 ms 44024 KB Output is correct
38 Correct 161 ms 43640 KB Output is correct
39 Correct 31 ms 38528 KB Output is correct
40 Correct 37 ms 38912 KB Output is correct
41 Correct 35 ms 38912 KB Output is correct
42 Correct 32 ms 38528 KB Output is correct
43 Correct 32 ms 38656 KB Output is correct
44 Correct 32 ms 38528 KB Output is correct
45 Correct 32 ms 38528 KB Output is correct
46 Correct 32 ms 38528 KB Output is correct
47 Correct 37 ms 38776 KB Output is correct
48 Correct 33 ms 38784 KB Output is correct
49 Correct 40 ms 39416 KB Output is correct
50 Correct 166 ms 44024 KB Output is correct
51 Correct 36 ms 38784 KB Output is correct
52 Correct 171 ms 42488 KB Output is correct
53 Correct 40 ms 39288 KB Output is correct
54 Correct 161 ms 43256 KB Output is correct
55 Correct 34 ms 38912 KB Output is correct
56 Correct 34 ms 38784 KB Output is correct
57 Correct 34 ms 38784 KB Output is correct
58 Correct 33 ms 38784 KB Output is correct
59 Correct 34 ms 38912 KB Output is correct
60 Correct 142 ms 41336 KB Output is correct
61 Correct 40 ms 38784 KB Output is correct
62 Correct 182 ms 43512 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 37888 KB Output is correct
2 Correct 27 ms 38008 KB Output is correct
3 Correct 27 ms 37888 KB Output is correct
4 Correct 27 ms 37888 KB Output is correct
5 Correct 27 ms 37888 KB Output is correct
6 Correct 28 ms 37888 KB Output is correct
7 Correct 28 ms 38012 KB Output is correct
8 Correct 28 ms 38016 KB Output is correct
9 Correct 29 ms 38016 KB Output is correct
10 Correct 27 ms 38016 KB Output is correct
11 Correct 27 ms 37888 KB Output is correct
12 Correct 27 ms 37888 KB Output is correct
13 Correct 27 ms 37888 KB Output is correct
14 Correct 27 ms 37888 KB Output is correct
15 Correct 27 ms 37888 KB Output is correct
16 Correct 29 ms 37888 KB Output is correct
17 Correct 27 ms 37888 KB Output is correct
18 Correct 27 ms 37888 KB Output is correct
19 Correct 28 ms 37888 KB Output is correct
20 Correct 27 ms 37888 KB Output is correct
21 Correct 29 ms 38016 KB Output is correct
22 Correct 27 ms 37888 KB Output is correct
23 Correct 27 ms 38016 KB Output is correct
24 Correct 32 ms 37888 KB Output is correct
25 Correct 28 ms 38016 KB Output is correct
26 Correct 27 ms 37888 KB Output is correct
27 Correct 27 ms 38016 KB Output is correct
28 Correct 28 ms 37888 KB Output is correct
29 Correct 27 ms 37888 KB Output is correct
30 Correct 27 ms 37888 KB Output is correct
31 Correct 27 ms 38016 KB Output is correct
32 Correct 30 ms 37888 KB Output is correct
33 Correct 29 ms 38016 KB Output is correct
34 Correct 31 ms 38016 KB Output is correct
35 Correct 142 ms 41464 KB Output is correct
36 Correct 168 ms 43896 KB Output is correct
37 Correct 166 ms 44024 KB Output is correct
38 Correct 161 ms 43640 KB Output is correct
39 Correct 31 ms 38528 KB Output is correct
40 Correct 37 ms 38912 KB Output is correct
41 Correct 35 ms 38912 KB Output is correct
42 Correct 32 ms 38528 KB Output is correct
43 Correct 32 ms 38656 KB Output is correct
44 Correct 32 ms 38528 KB Output is correct
45 Correct 32 ms 38528 KB Output is correct
46 Correct 32 ms 38528 KB Output is correct
47 Correct 37 ms 38776 KB Output is correct
48 Correct 33 ms 38784 KB Output is correct
49 Correct 40 ms 39416 KB Output is correct
50 Correct 166 ms 44024 KB Output is correct
51 Correct 36 ms 38784 KB Output is correct
52 Correct 171 ms 42488 KB Output is correct
53 Correct 40 ms 39288 KB Output is correct
54 Correct 161 ms 43256 KB Output is correct
55 Correct 34 ms 38912 KB Output is correct
56 Correct 34 ms 38784 KB Output is correct
57 Correct 34 ms 38784 KB Output is correct
58 Correct 33 ms 38784 KB Output is correct
59 Correct 34 ms 38912 KB Output is correct
60 Correct 142 ms 41336 KB Output is correct
61 Correct 40 ms 38784 KB Output is correct
62 Correct 182 ms 43512 KB Output is correct
63 Correct 785 ms 91312 KB Output is correct
64 Correct 774 ms 91256 KB Output is correct
65 Correct 784 ms 91216 KB Output is correct
66 Correct 370 ms 69888 KB Output is correct
67 Correct 849 ms 97584 KB Output is correct
68 Correct 338 ms 69888 KB Output is correct
69 Correct 459 ms 70280 KB Output is correct
70 Correct 361 ms 69884 KB Output is correct
71 Correct 372 ms 69992 KB Output is correct
72 Correct 754 ms 82688 KB Output is correct
73 Correct 804 ms 84356 KB Output is correct
74 Correct 1332 ms 103944 KB Output is correct
75 Correct 621 ms 75396 KB Output is correct
76 Correct 978 ms 88348 KB Output is correct
77 Correct 941 ms 88196 KB Output is correct
78 Correct 323 ms 68520 KB Output is correct
79 Correct 505 ms 75780 KB Output is correct
80 Correct 304 ms 67252 KB Output is correct
81 Correct 443 ms 72372 KB Output is correct
82 Correct 786 ms 84200 KB Output is correct
83 Correct 832 ms 84160 KB Output is correct
84 Correct 672 ms 83080 KB Output is correct
85 Correct 735 ms 82956 KB Output is correct
86 Correct 677 ms 103140 KB Output is correct
87 Correct 712 ms 104292 KB Output is correct
88 Correct 838 ms 83292 KB Output is correct
89 Correct 1006 ms 87024 KB Output is correct