oj.uz

Submission #212784

# Submission time Handle Problem Language Result Execution time Memory
212784 2020-03-24T09:44:48 Z BThero Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 23 ms 512 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 = 55;

int par[MAXN], sz[MAXN];
set<int> adj[MAXN];
set<pii> e;
int n, m;

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) {
        sz[a] += sz[b];
        par[b] = a;
    }
}

void compress() {
    set<pii> e2;
 
    for (auto it : e) {
        int u = it.fi;
        int v = it.se;
        u = getPar(u);
        v = getPar(v);
        
        if (u != v) {
            e2.insert(mp(u, v));
        }
    }
    
    e = e2;
    
    for (int i = 1; i <= n; ++i) {
        set<int> s;
        
        for (int x : adj[i]) {
            x = getPar(x);
            
            if (x != getPar(i)) {
                s.insert(x);
            }
        }
        
        adj[i] = s;
    }
}

void push() {
    bool did = 1;

    while (did) {
        compress();
        did = 0;
    
        for (auto it : e) {
            if (e.find(mp(it.se, it.fi)) != e.end()) {
                uni(it.fi, it.se);
                did = 1;
            }
        }
        
        compress();
    }
}

void solve() {
	scanf("%d %d", &n, &m);
    
    for (int i = 1; i <= n; ++i) {
        par[i] = i;
        sz[i] = 1;
    }
    
    for (int i = 1; i <= m; ++i) {
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].insert(v);
        u = getPar(u);
        v = getPar(v);
        e.insert(mp(u, v));
        
        if (e.find(mp(v, u)) != e.end()) {
            uni(u, v);
        }
    
        push();
        compress();
        ll ans = 0;
        
        for (int j = 1; j <= n; ++j) {
            if (par[j] == j) {
                ans += sz[j] * (sz[j] - 1ll);
            }
        }
        
        for (int j = 1; j <= n; ++j) {
            for (int x : adj[j]) {
                ans += sz[x];
            }
        }
        
        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

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 19 ms 384 KB Output is correct
9 Correct 19 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 6 ms 256 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 23 ms 384 KB Output is correct
22 Correct 8 ms 384 KB Output is correct
23 Correct 14 ms 384 KB Output is correct
24 Correct 15 ms 384 KB Output is correct
25 Correct 16 ms 384 KB Output is correct
26 Correct 8 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 6 ms 256 KB Output is correct
33 Correct 15 ms 384 KB Output is correct
34 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
35 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 16 ms 384 KB Output is correct
8 Correct 19 ms 384 KB Output is correct
9 Correct 19 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 6 ms 256 KB Output is correct
19 Correct 6 ms 256 KB Output is correct
20 Correct 11 ms 384 KB Output is correct
21 Correct 23 ms 384 KB Output is correct
22 Correct 8 ms 384 KB Output is correct
23 Correct 14 ms 384 KB Output is correct
24 Correct 15 ms 384 KB Output is correct
25 Correct 16 ms 384 KB Output is correct
26 Correct 8 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 6 ms 256 KB Output is correct
33 Correct 15 ms 384 KB Output is correct
34 Runtime error 6 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
35 Halted 0 ms 0 KB -