oj.uz

답안 #212792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212792 2020-03-24T10:13:41 Z BThero 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 27384 KB 
#define DBG 1
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>
//#include<ext/pb_ds/tree_policy.hpp>
//#include<ext/pb_ds/assoc_container.hpp>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) if (DBG) cerr << #x << " = " << x << endl;

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair<int, int> pii;

//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)1e5 + 5;

set<int> in[MAXN], out[MAXN], inv[MAXN];
vector<int> ver[MAXN];
int par[MAXN];
pii Q[MAXN];
int n, m, t;

int getPar(int x) {
    if (x == par[x]) {
        return x;
    }
    
    return par[x] = getPar(par[x]);
}

void uni(int a, int b) {
    a = getPar(a);
    b = getPar(b);
    
    if (a == b) {
        return;
    }
    
    for (int x : inv[b]) {
        if (getPar(x) != a) {
            inv[a].insert(x);
        }
    }
    
    inv[b].clear();
    
    for (int x : ver[b]) {
        inv[a].erase(x);
        ver[a].pb(x);
    }
    
    in[a].erase(b);
    out[a].erase(b);
    in[b].erase(a);
    out[b].erase(a);
    
    for (int x : out[b]) {
        in[x].erase(b);
        in[x].insert(a);
        out[a].insert(x);
        
        if (in[a].find(x) != in[a].end()) {
            Q[t++] = mp(a, x);
        }
    }
    
    out[b].clear();
    
    for (int x : in[b]) {
        out[x].erase(b);
        out[x].insert(a);
        in[a].insert(x);
        
        if (out[a].find(x) != out[a].end()) {
            Q[t++] = mp(a, x);
        }
    }
    
    in[b].clear();
    par[b] = a;
}

void push() {
    for (int i = 0; i < t; ++i) {
        uni(Q[i].fi, Q[i].se);
    }
}

void solve() {
	scanf("%d %d", &n, &m);
    
    for (int i = 1; i <= n; ++i) {
        par[i] = i;
        ver[i].pb(i);
    }
    
    for (int i = 1; i <= m; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        v = getPar(v);
        
        if (getPar(u) != v) {
            inv[v].insert(u);
            u = getPar(u);
            out[u].insert(v);
            in[v].insert(u);
            
            if (in[u].find(v) != in[u].end()) {
                t = 0;
                Q[t++] = mp(u, v);
                push();
            }
        }
        
        ll ans = 0;
        
        for (int j = 1; j <= n; ++j) {
            if (par[j] == j) {
                ans += ver[j].size() * inv[j].size();
                ans += ver[j].size() * (ver[j].size() - 1);
            }
        }
        
        printf("%lld\n", ans);
    }
}

int main() {
	int tt = 1;
	
	while (tt--) {
		solve();
	}

	return 0;
}

Compilation message

joitter2.cpp: In function 'void solve()':
joitter2.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
joitter2.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16768 KB Output is correct
3 Correct 14 ms 16768 KB Output is correct
4 Correct 15 ms 16768 KB Output is correct
5 Correct 15 ms 16768 KB Output is correct
6 Correct 14 ms 16768 KB Output is correct
7 Correct 18 ms 16768 KB Output is correct
8 Correct 15 ms 16768 KB Output is correct
9 Correct 16 ms 16768 KB Output is correct
10 Correct 14 ms 16768 KB Output is correct
11 Correct 14 ms 16768 KB Output is correct
12 Correct 14 ms 16768 KB Output is correct
13 Correct 14 ms 16768 KB Output is correct
14 Correct 14 ms 16768 KB Output is correct
15 Correct 15 ms 16768 KB Output is correct
16 Correct 15 ms 16896 KB Output is correct
17 Correct 14 ms 16768 KB Output is correct
18 Correct 14 ms 16768 KB Output is correct
19 Correct 14 ms 16768 KB Output is correct
20 Correct 14 ms 16768 KB Output is correct
21 Correct 15 ms 16768 KB Output is correct
22 Correct 14 ms 16768 KB Output is correct
23 Correct 14 ms 16768 KB Output is correct
24 Correct 14 ms 16768 KB Output is correct
25 Correct 15 ms 16768 KB Output is correct
26 Correct 14 ms 16768 KB Output is correct
27 Correct 14 ms 16768 KB Output is correct
28 Correct 14 ms 16768 KB Output is correct
29 Correct 14 ms 16768 KB Output is correct
30 Correct 14 ms 16768 KB Output is correct
31 Correct 15 ms 16816 KB Output is correct
32 Correct 14 ms 16768 KB Output is correct
33 Correct 15 ms 16768 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16768 KB Output is correct
3 Correct 14 ms 16768 KB Output is correct
4 Correct 15 ms 16768 KB Output is correct
5 Correct 15 ms 16768 KB Output is correct
6 Correct 14 ms 16768 KB Output is correct
7 Correct 18 ms 16768 KB Output is correct
8 Correct 15 ms 16768 KB Output is correct
9 Correct 16 ms 16768 KB Output is correct
10 Correct 14 ms 16768 KB Output is correct
11 Correct 14 ms 16768 KB Output is correct
12 Correct 14 ms 16768 KB Output is correct
13 Correct 14 ms 16768 KB Output is correct
14 Correct 14 ms 16768 KB Output is correct
15 Correct 15 ms 16768 KB Output is correct
16 Correct 15 ms 16896 KB Output is correct
17 Correct 14 ms 16768 KB Output is correct
18 Correct 14 ms 16768 KB Output is correct
19 Correct 14 ms 16768 KB Output is correct
20 Correct 14 ms 16768 KB Output is correct
21 Correct 15 ms 16768 KB Output is correct
22 Correct 14 ms 16768 KB Output is correct
23 Correct 14 ms 16768 KB Output is correct
24 Correct 14 ms 16768 KB Output is correct
25 Correct 15 ms 16768 KB Output is correct
26 Correct 14 ms 16768 KB Output is correct
27 Correct 14 ms 16768 KB Output is correct
28 Correct 14 ms 16768 KB Output is correct
29 Correct 14 ms 16768 KB Output is correct
30 Correct 14 ms 16768 KB Output is correct
31 Correct 15 ms 16816 KB Output is correct
32 Correct 14 ms 16768 KB Output is correct
33 Correct 15 ms 16768 KB Output is correct
34 Correct 19 ms 16896 KB Output is correct
35 Correct 404 ms 20392 KB Output is correct
36 Correct 678 ms 22776 KB Output is correct
37 Correct 686 ms 22780 KB Output is correct
38 Correct 657 ms 22520 KB Output is correct
39 Correct 67 ms 27384 KB Output is correct
40 Correct 34 ms 17024 KB Output is correct
41 Correct 34 ms 17024 KB Output is correct
42 Correct 74 ms 27384 KB Output is correct
43 Correct 274 ms 22520 KB Output is correct
44 Correct 255 ms 22140 KB Output is correct
45 Correct 67 ms 27384 KB Output is correct
46 Correct 66 ms 27384 KB Output is correct
47 Correct 47 ms 18040 KB Output is correct
48 Correct 47 ms 17912 KB Output is correct
49 Correct 64 ms 17656 KB Output is correct
50 Correct 703 ms 23008 KB Output is correct
51 Correct 208 ms 20472 KB Output is correct
52 Correct 671 ms 21288 KB Output is correct
53 Correct 65 ms 17912 KB Output is correct
54 Correct 658 ms 22008 KB Output is correct
55 Correct 31 ms 17400 KB Output is correct
56 Correct 32 ms 17400 KB Output is correct
57 Correct 31 ms 17408 KB Output is correct
58 Correct 30 ms 17408 KB Output is correct
59 Correct 35 ms 16896 KB Output is correct
60 Correct 653 ms 19320 KB Output is correct
61 Correct 80 ms 19064 KB Output is correct
62 Correct 664 ms 22264 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 16768 KB Output is correct
2 Correct 14 ms 16768 KB Output is correct
3 Correct 14 ms 16768 KB Output is correct
4 Correct 15 ms 16768 KB Output is correct
5 Correct 15 ms 16768 KB Output is correct
6 Correct 14 ms 16768 KB Output is correct
7 Correct 18 ms 16768 KB Output is correct
8 Correct 15 ms 16768 KB Output is correct
9 Correct 16 ms 16768 KB Output is correct
10 Correct 14 ms 16768 KB Output is correct
11 Correct 14 ms 16768 KB Output is correct
12 Correct 14 ms 16768 KB Output is correct
13 Correct 14 ms 16768 KB Output is correct
14 Correct 14 ms 16768 KB Output is correct
15 Correct 15 ms 16768 KB Output is correct
16 Correct 15 ms 16896 KB Output is correct
17 Correct 14 ms 16768 KB Output is correct
18 Correct 14 ms 16768 KB Output is correct
19 Correct 14 ms 16768 KB Output is correct
20 Correct 14 ms 16768 KB Output is correct
21 Correct 15 ms 16768 KB Output is correct
22 Correct 14 ms 16768 KB Output is correct
23 Correct 14 ms 16768 KB Output is correct
24 Correct 14 ms 16768 KB Output is correct
25 Correct 15 ms 16768 KB Output is correct
26 Correct 14 ms 16768 KB Output is correct
27 Correct 14 ms 16768 KB Output is correct
28 Correct 14 ms 16768 KB Output is correct
29 Correct 14 ms 16768 KB Output is correct
30 Correct 14 ms 16768 KB Output is correct
31 Correct 15 ms 16816 KB Output is correct
32 Correct 14 ms 16768 KB Output is correct
33 Correct 15 ms 16768 KB Output is correct
34 Correct 19 ms 16896 KB Output is correct
35 Correct 404 ms 20392 KB Output is correct
36 Correct 678 ms 22776 KB Output is correct
37 Correct 686 ms 22780 KB Output is correct
38 Correct 657 ms 22520 KB Output is correct
39 Correct 67 ms 27384 KB Output is correct
40 Correct 34 ms 17024 KB Output is correct
41 Correct 34 ms 17024 KB Output is correct
42 Correct 74 ms 27384 KB Output is correct
43 Correct 274 ms 22520 KB Output is correct
44 Correct 255 ms 22140 KB Output is correct
45 Correct 67 ms 27384 KB Output is correct
46 Correct 66 ms 27384 KB Output is correct
47 Correct 47 ms 18040 KB Output is correct
48 Correct 47 ms 17912 KB Output is correct
49 Correct 64 ms 17656 KB Output is correct
50 Correct 703 ms 23008 KB Output is correct
51 Correct 208 ms 20472 KB Output is correct
52 Correct 671 ms 21288 KB Output is correct
53 Correct 65 ms 17912 KB Output is correct
54 Correct 658 ms 22008 KB Output is correct
55 Correct 31 ms 17400 KB Output is correct
56 Correct 32 ms 17400 KB Output is correct
57 Correct 31 ms 17408 KB Output is correct
58 Correct 30 ms 17408 KB Output is correct
59 Correct 35 ms 16896 KB Output is correct
60 Correct 653 ms 19320 KB Output is correct
61 Correct 80 ms 19064 KB Output is correct
62 Correct 664 ms 22264 KB Output is correct
63 Execution timed out 5081 ms 22692 KB Time limit exceeded
64 Halted 0 ms 0 KB -