oj.uz

Submission #422731

# Submission time Handle Problem Language Result Execution time Memory
422731 2021-06-10T11:20:15 Z amunduzbaev Making Friends on Joitter is Fun (JOI20_joitter2) C++14
17 / 100
 5000 ms 79044 KB 
/* made by amunduzbaev */
 
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
 
using namespace std;
//~ using namespace __gnu_pbds;

#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);  
	freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T, 
//~ null_type, less_equal<T>, rb_tree_tag, 
//~ tree_order_statistics_node_update> ordered_set;
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
int n, m, k, s, t, q, ans, res, a[N];
int par[N], sz[N];
set<int> in[N], tocomp[N], fromcomp[N];
queue<pii> qq;

void add(int a, int b){
	tocomp[a].insert(b), fromcomp[b].insert(a);
	if(tocomp[b].count(a) && fromcomp[a].count(b)) qq.push({a, b});
}

int f(int x) { return (x == par[x] ? x : par[x] = f(par[x])); }
void merge(int a, int b){
	a = f(a), b = f(b);
	if(a == b) return;
	if(sz(in[a]) + sz(tocomp[a]) + sz(fromcomp[a]) > sz(in[b]) + sz(tocomp[b]) + sz(fromcomp[b])) swap(a, b);
	res += (sz(in[a]) * sz[b] + sz(in[b]) * sz[a]);
	par[b] = a, sz[a] += sz[b];
	for(auto x : in[b]){
		if(in[a].count(x)) res -= sz[a];
		else in[a].insert(x);
	}
	
	tocomp[a].erase(b), fromcomp[a].erase(b);
	tocomp[b].erase(a), fromcomp[b].erase(a);
	for(auto x : tocomp[b]){
		fromcomp[x].erase(b);
		add(a, f(x));
	}
	for(auto x : fromcomp[b]){
		tocomp[x].erase(b);
		add(f(x), a);
	}
	
	tocomp[b].clear(), fromcomp[b].clear(), in[b].clear();
}

void solve(int t_case){
	cin>>n>>m;
	for(int i=1;i<=n;i++) in[i].insert(i), par[i] = i, sz[i] = 1;
	while(m--){
		int a, b; cin>>a>>b;
		if(f(a) == f(b) || in[f(b)].count(a)){
			cout<<res<<"\n";
			continue;
		} in[f(b)].insert(a);
		res += sz[f(b)];
		add(f(a), f(b));
		
		while(!qq.empty()){
			int a = qq.front().ff, b = qq.front().ss; qq.pop();
			merge(a, b);
		} cout<<res<<"\n";
	}
}

signed main(){
	NeedForSpeed
	if(MULTI){
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	} else solve(1);
	return 0;
}

Compilation message

joitter2.cpp: In function 'void usaco(std::string)':
joitter2.cpp:32:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 20 ms 28504 KB Output is correct
3 Correct 18 ms 28508 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 19 ms 28512 KB Output is correct
6 Correct 19 ms 28496 KB Output is correct
7 Correct 19 ms 28544 KB Output is correct
8 Correct 19 ms 28476 KB Output is correct
9 Correct 20 ms 28516 KB Output is correct
10 Correct 18 ms 28516 KB Output is correct
11 Correct 18 ms 28456 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28396 KB Output is correct
14 Correct 18 ms 28516 KB Output is correct
15 Correct 18 ms 28484 KB Output is correct
16 Correct 19 ms 28492 KB Output is correct
17 Correct 19 ms 28436 KB Output is correct
18 Correct 22 ms 28476 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28536 KB Output is correct
21 Correct 19 ms 28540 KB Output is correct
22 Correct 19 ms 28492 KB Output is correct
23 Correct 20 ms 28488 KB Output is correct
24 Correct 19 ms 28544 KB Output is correct
25 Correct 19 ms 28536 KB Output is correct
26 Correct 19 ms 28528 KB Output is correct
27 Correct 19 ms 28412 KB Output is correct
28 Correct 18 ms 28500 KB Output is correct
29 Correct 18 ms 28520 KB Output is correct
30 Correct 19 ms 28492 KB Output is correct
31 Correct 22 ms 28512 KB Output is correct
32 Correct 18 ms 28400 KB Output is correct
33 Correct 20 ms 28492 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 20 ms 28504 KB Output is correct
3 Correct 18 ms 28508 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 19 ms 28512 KB Output is correct
6 Correct 19 ms 28496 KB Output is correct
7 Correct 19 ms 28544 KB Output is correct
8 Correct 19 ms 28476 KB Output is correct
9 Correct 20 ms 28516 KB Output is correct
10 Correct 18 ms 28516 KB Output is correct
11 Correct 18 ms 28456 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28396 KB Output is correct
14 Correct 18 ms 28516 KB Output is correct
15 Correct 18 ms 28484 KB Output is correct
16 Correct 19 ms 28492 KB Output is correct
17 Correct 19 ms 28436 KB Output is correct
18 Correct 22 ms 28476 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28536 KB Output is correct
21 Correct 19 ms 28540 KB Output is correct
22 Correct 19 ms 28492 KB Output is correct
23 Correct 20 ms 28488 KB Output is correct
24 Correct 19 ms 28544 KB Output is correct
25 Correct 19 ms 28536 KB Output is correct
26 Correct 19 ms 28528 KB Output is correct
27 Correct 19 ms 28412 KB Output is correct
28 Correct 18 ms 28500 KB Output is correct
29 Correct 18 ms 28520 KB Output is correct
30 Correct 19 ms 28492 KB Output is correct
31 Correct 22 ms 28512 KB Output is correct
32 Correct 18 ms 28400 KB Output is correct
33 Correct 20 ms 28492 KB Output is correct
34 Correct 23 ms 28620 KB Output is correct
35 Correct 605 ms 35732 KB Output is correct
36 Correct 2302 ms 49192 KB Output is correct
37 Correct 2577 ms 50160 KB Output is correct
38 Correct 2275 ms 48900 KB Output is correct
39 Correct 306 ms 28736 KB Output is correct
40 Correct 25 ms 28748 KB Output is correct
41 Correct 24 ms 28796 KB Output is correct
42 Correct 302 ms 28752 KB Output is correct
43 Correct 671 ms 28948 KB Output is correct
44 Correct 666 ms 28868 KB Output is correct
45 Correct 298 ms 28728 KB Output is correct
46 Correct 298 ms 28824 KB Output is correct
47 Correct 81 ms 28748 KB Output is correct
48 Correct 83 ms 28692 KB Output is correct
49 Correct 513 ms 31172 KB Output is correct
50 Correct 2181 ms 49800 KB Output is correct
51 Correct 816 ms 29232 KB Output is correct
52 Correct 1788 ms 43936 KB Output is correct
53 Correct 673 ms 30936 KB Output is correct
54 Correct 2056 ms 47048 KB Output is correct
55 Correct 890 ms 30164 KB Output is correct
56 Correct 864 ms 30108 KB Output is correct
57 Correct 650 ms 29248 KB Output is correct
58 Correct 667 ms 29252 KB Output is correct
59 Correct 22 ms 28620 KB Output is correct
60 Correct 115 ms 31024 KB Output is correct
61 Correct 210 ms 28840 KB Output is correct
62 Correct 2089 ms 49596 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 20 ms 28504 KB Output is correct
3 Correct 18 ms 28508 KB Output is correct
4 Correct 18 ms 28508 KB Output is correct
5 Correct 19 ms 28512 KB Output is correct
6 Correct 19 ms 28496 KB Output is correct
7 Correct 19 ms 28544 KB Output is correct
8 Correct 19 ms 28476 KB Output is correct
9 Correct 20 ms 28516 KB Output is correct
10 Correct 18 ms 28516 KB Output is correct
11 Correct 18 ms 28456 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28396 KB Output is correct
14 Correct 18 ms 28516 KB Output is correct
15 Correct 18 ms 28484 KB Output is correct
16 Correct 19 ms 28492 KB Output is correct
17 Correct 19 ms 28436 KB Output is correct
18 Correct 22 ms 28476 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28536 KB Output is correct
21 Correct 19 ms 28540 KB Output is correct
22 Correct 19 ms 28492 KB Output is correct
23 Correct 20 ms 28488 KB Output is correct
24 Correct 19 ms 28544 KB Output is correct
25 Correct 19 ms 28536 KB Output is correct
26 Correct 19 ms 28528 KB Output is correct
27 Correct 19 ms 28412 KB Output is correct
28 Correct 18 ms 28500 KB Output is correct
29 Correct 18 ms 28520 KB Output is correct
30 Correct 19 ms 28492 KB Output is correct
31 Correct 22 ms 28512 KB Output is correct
32 Correct 18 ms 28400 KB Output is correct
33 Correct 20 ms 28492 KB Output is correct
34 Correct 23 ms 28620 KB Output is correct
35 Correct 605 ms 35732 KB Output is correct
36 Correct 2302 ms 49192 KB Output is correct
37 Correct 2577 ms 50160 KB Output is correct
38 Correct 2275 ms 48900 KB Output is correct
39 Correct 306 ms 28736 KB Output is correct
40 Correct 25 ms 28748 KB Output is correct
41 Correct 24 ms 28796 KB Output is correct
42 Correct 302 ms 28752 KB Output is correct
43 Correct 671 ms 28948 KB Output is correct
44 Correct 666 ms 28868 KB Output is correct
45 Correct 298 ms 28728 KB Output is correct
46 Correct 298 ms 28824 KB Output is correct
47 Correct 81 ms 28748 KB Output is correct
48 Correct 83 ms 28692 KB Output is correct
49 Correct 513 ms 31172 KB Output is correct
50 Correct 2181 ms 49800 KB Output is correct
51 Correct 816 ms 29232 KB Output is correct
52 Correct 1788 ms 43936 KB Output is correct
53 Correct 673 ms 30936 KB Output is correct
54 Correct 2056 ms 47048 KB Output is correct
55 Correct 890 ms 30164 KB Output is correct
56 Correct 864 ms 30108 KB Output is correct
57 Correct 650 ms 29248 KB Output is correct
58 Correct 667 ms 29252 KB Output is correct
59 Correct 22 ms 28620 KB Output is correct
60 Correct 115 ms 31024 KB Output is correct
61 Correct 210 ms 28840 KB Output is correct
62 Correct 2089 ms 49596 KB Output is correct
63 Correct 654 ms 79020 KB Output is correct
64 Correct 657 ms 79044 KB Output is correct
65 Correct 663 ms 78916 KB Output is correct
66 Execution timed out 5052 ms 35520 KB Time limit exceeded
67 Halted 0 ms 0 KB -