oj.uz

답안 #422733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422733 2021-06-10T11:21:29 Z amunduzbaev 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++14
100 / 100
 1327 ms 79084 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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 18 ms 28448 KB Output is correct
3 Correct 21 ms 28492 KB Output is correct
4 Correct 20 ms 28416 KB Output is correct
5 Correct 20 ms 28492 KB Output is correct
6 Correct 19 ms 28432 KB Output is correct
7 Correct 19 ms 28492 KB Output is correct
8 Correct 21 ms 28492 KB Output is correct
9 Correct 19 ms 28440 KB Output is correct
10 Correct 17 ms 28436 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28508 KB Output is correct
14 Correct 19 ms 28476 KB Output is correct
15 Correct 18 ms 28428 KB Output is correct
16 Correct 23 ms 28488 KB Output is correct
17 Correct 18 ms 28444 KB Output is correct
18 Correct 19 ms 28520 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28420 KB Output is correct
21 Correct 18 ms 28428 KB Output is correct
22 Correct 19 ms 28460 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 19 ms 28492 KB Output is correct
25 Correct 19 ms 28492 KB Output is correct
26 Correct 18 ms 28528 KB Output is correct
27 Correct 19 ms 28424 KB Output is correct
28 Correct 19 ms 28524 KB Output is correct
29 Correct 17 ms 28404 KB Output is correct
30 Correct 18 ms 28432 KB Output is correct
31 Correct 19 ms 28492 KB Output is correct
32 Correct 18 ms 28516 KB Output is correct
33 Correct 19 ms 28488 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 18 ms 28448 KB Output is correct
3 Correct 21 ms 28492 KB Output is correct
4 Correct 20 ms 28416 KB Output is correct
5 Correct 20 ms 28492 KB Output is correct
6 Correct 19 ms 28432 KB Output is correct
7 Correct 19 ms 28492 KB Output is correct
8 Correct 21 ms 28492 KB Output is correct
9 Correct 19 ms 28440 KB Output is correct
10 Correct 17 ms 28436 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28508 KB Output is correct
14 Correct 19 ms 28476 KB Output is correct
15 Correct 18 ms 28428 KB Output is correct
16 Correct 23 ms 28488 KB Output is correct
17 Correct 18 ms 28444 KB Output is correct
18 Correct 19 ms 28520 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28420 KB Output is correct
21 Correct 18 ms 28428 KB Output is correct
22 Correct 19 ms 28460 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 19 ms 28492 KB Output is correct
25 Correct 19 ms 28492 KB Output is correct
26 Correct 18 ms 28528 KB Output is correct
27 Correct 19 ms 28424 KB Output is correct
28 Correct 19 ms 28524 KB Output is correct
29 Correct 17 ms 28404 KB Output is correct
30 Correct 18 ms 28432 KB Output is correct
31 Correct 19 ms 28492 KB Output is correct
32 Correct 18 ms 28516 KB Output is correct
33 Correct 19 ms 28488 KB Output is correct
34 Correct 21 ms 28620 KB Output is correct
35 Correct 111 ms 31972 KB Output is correct
36 Correct 139 ms 34380 KB Output is correct
37 Correct 142 ms 34528 KB Output is correct
38 Correct 138 ms 34116 KB Output is correct
39 Correct 21 ms 28680 KB Output is correct
40 Correct 23 ms 28724 KB Output is correct
41 Correct 23 ms 28752 KB Output is correct
42 Correct 20 ms 28620 KB Output is correct
43 Correct 22 ms 28752 KB Output is correct
44 Correct 22 ms 28744 KB Output is correct
45 Correct 21 ms 28624 KB Output is correct
46 Correct 21 ms 28636 KB Output is correct
47 Correct 24 ms 28748 KB Output is correct
48 Correct 23 ms 28808 KB Output is correct
49 Correct 30 ms 29372 KB Output is correct
50 Correct 151 ms 34504 KB Output is correct
51 Correct 30 ms 29004 KB Output is correct
52 Correct 142 ms 32916 KB Output is correct
53 Correct 30 ms 29372 KB Output is correct
54 Correct 131 ms 33732 KB Output is correct
55 Correct 25 ms 29176 KB Output is correct
56 Correct 25 ms 29212 KB Output is correct
57 Correct 24 ms 29164 KB Output is correct
58 Correct 25 ms 29132 KB Output is correct
59 Correct 22 ms 28636 KB Output is correct
60 Correct 107 ms 30964 KB Output is correct
61 Correct 22 ms 28852 KB Output is correct
62 Correct 140 ms 33992 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 18 ms 28448 KB Output is correct
3 Correct 21 ms 28492 KB Output is correct
4 Correct 20 ms 28416 KB Output is correct
5 Correct 20 ms 28492 KB Output is correct
6 Correct 19 ms 28432 KB Output is correct
7 Correct 19 ms 28492 KB Output is correct
8 Correct 21 ms 28492 KB Output is correct
9 Correct 19 ms 28440 KB Output is correct
10 Correct 17 ms 28436 KB Output is correct
11 Correct 18 ms 28492 KB Output is correct
12 Correct 18 ms 28492 KB Output is correct
13 Correct 18 ms 28508 KB Output is correct
14 Correct 19 ms 28476 KB Output is correct
15 Correct 18 ms 28428 KB Output is correct
16 Correct 23 ms 28488 KB Output is correct
17 Correct 18 ms 28444 KB Output is correct
18 Correct 19 ms 28520 KB Output is correct
19 Correct 19 ms 28492 KB Output is correct
20 Correct 19 ms 28420 KB Output is correct
21 Correct 18 ms 28428 KB Output is correct
22 Correct 19 ms 28460 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 19 ms 28492 KB Output is correct
25 Correct 19 ms 28492 KB Output is correct
26 Correct 18 ms 28528 KB Output is correct
27 Correct 19 ms 28424 KB Output is correct
28 Correct 19 ms 28524 KB Output is correct
29 Correct 17 ms 28404 KB Output is correct
30 Correct 18 ms 28432 KB Output is correct
31 Correct 19 ms 28492 KB Output is correct
32 Correct 18 ms 28516 KB Output is correct
33 Correct 19 ms 28488 KB Output is correct
34 Correct 21 ms 28620 KB Output is correct
35 Correct 111 ms 31972 KB Output is correct
36 Correct 139 ms 34380 KB Output is correct
37 Correct 142 ms 34528 KB Output is correct
38 Correct 138 ms 34116 KB Output is correct
39 Correct 21 ms 28680 KB Output is correct
40 Correct 23 ms 28724 KB Output is correct
41 Correct 23 ms 28752 KB Output is correct
42 Correct 20 ms 28620 KB Output is correct
43 Correct 22 ms 28752 KB Output is correct
44 Correct 22 ms 28744 KB Output is correct
45 Correct 21 ms 28624 KB Output is correct
46 Correct 21 ms 28636 KB Output is correct
47 Correct 24 ms 28748 KB Output is correct
48 Correct 23 ms 28808 KB Output is correct
49 Correct 30 ms 29372 KB Output is correct
50 Correct 151 ms 34504 KB Output is correct
51 Correct 30 ms 29004 KB Output is correct
52 Correct 142 ms 32916 KB Output is correct
53 Correct 30 ms 29372 KB Output is correct
54 Correct 131 ms 33732 KB Output is correct
55 Correct 25 ms 29176 KB Output is correct
56 Correct 25 ms 29212 KB Output is correct
57 Correct 24 ms 29164 KB Output is correct
58 Correct 25 ms 29132 KB Output is correct
59 Correct 22 ms 28636 KB Output is correct
60 Correct 107 ms 30964 KB Output is correct
61 Correct 22 ms 28852 KB Output is correct
62 Correct 140 ms 33992 KB Output is correct
63 Correct 658 ms 79084 KB Output is correct
64 Correct 658 ms 78964 KB Output is correct
65 Correct 655 ms 78956 KB Output is correct
66 Correct 276 ms 38736 KB Output is correct
67 Correct 636 ms 45400 KB Output is correct
68 Correct 260 ms 39108 KB Output is correct
69 Correct 579 ms 46272 KB Output is correct
70 Correct 304 ms 39080 KB Output is correct
71 Correct 298 ms 39060 KB Output is correct
72 Correct 665 ms 45572 KB Output is correct
73 Correct 590 ms 45508 KB Output is correct
74 Correct 1327 ms 57008 KB Output is correct
75 Correct 813 ms 51956 KB Output is correct
76 Correct 993 ms 56328 KB Output is correct
77 Correct 1215 ms 56388 KB Output is correct
78 Correct 323 ms 45128 KB Output is correct
79 Correct 562 ms 48204 KB Output is correct
80 Correct 299 ms 44952 KB Output is correct
81 Correct 490 ms 48280 KB Output is correct
82 Correct 1165 ms 66688 KB Output is correct
83 Correct 1201 ms 66632 KB Output is correct
84 Correct 861 ms 66480 KB Output is correct
85 Correct 942 ms 66500 KB Output is correct
86 Correct 431 ms 39920 KB Output is correct
87 Correct 485 ms 42216 KB Output is correct
88 Correct 669 ms 45564 KB Output is correct
89 Correct 1119 ms 56052 KB Output is correct