oj.uz

Submission #216568

# Submission time Handle Problem Language Result Execution time Memory
216568 2020-03-27T14:06:37 Z combi1k1 Making Friends on Joitter is Fun (JOI20_joitter2) C++14
17 / 100
 5000 ms 23544 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 1e5 + 5;

typedef pair<int,int>   ii;

int p[N];
int s[N];

ll  ans = 0;

queue<ii>   pending;

int lead(int x) {
    return p[x] == x ? x : p[x] = lead(p[x]);
}

struct Edge {
    int pa, a;
    int pb;

    Edge(int _a = 0,int _b = 0) : pa(lead(_a)), a(_a), pb(lead(_b)) {}
};
bool operator < (const Edge&x,const Edge&y) {
    auto tmp1 = make_tuple(x.pa,x.pb,x.a);
    auto tmp2 = make_tuple(y.pa,y.pb,y.a);

    return  tmp1 < tmp2;
}
set<Edge> fr[N];
set<Edge> to[N];
unordered_map<int,int>  cnt[N];

void addEdge(int x,int y)   {   //an egde directed from x to y
    int a = lead(x);
    int b = lead(y);

    if (a == b) return;

    Edge E(y,x);    E.a = 0;
    auto it = fr[b].lower_bound(E);

    if (it == fr[b].end() || (*it).pb != a) {
        E = Edge(x,y);

        if(!fr[a].count(E)) {
            fr[a].insert(E);
            to[b].insert(E);    ans += s[b];
        }
        return;
    }
    pending.push(ii(a,b));
}

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;
    int m;  cin >> m;

    iota(p + 1,p + 1 + n,1);
    fill(s + 1,s + 1 + n,1);

    for(int i = 0 ; i < m ; ++i)    {
        int x;  cin >> x;
        int y;  cin >> y;   addEdge(x,y);

        while (pending.size())  {
            int x = lead(pending.front().X);
            int y = lead(pending.front().Y);

            pending.pop();

            if (x == y) continue;

            Edge E(x,y);    E.a = 0;
            Edge F(y,x);    F.a = 0;

            vector<Edge> remA;
            vector<Edge> remB;

            for(auto it = fr[x].lower_bound(E) ; it != fr[x].end() && (*it).pb == y ; remA.pb(*it++));
            for(auto it = fr[y].lower_bound(F) ; it != fr[y].end() && (*it).pb == x ; remB.pb(*it++));

            for(Edge E : remA)  fr[x].erase(E), to[y].erase(E);
            for(Edge E : remB)  fr[y].erase(E), to[x].erase(E);

            ans -= 1ll * sz(remA) * s[x];
            ans -= 1ll * sz(remB) * s[y];

            if (to[x].size() < to[y].size())
                swap(x,y);

            ans += 2ll * s[x] * s[y];

            ans += 1ll * s[y] * sz(to[x]);
            ans -= 1ll * s[y] * sz(to[y]);

            p[y] = x;
            s[x] += s[y];

            for(Edge E : to[y]) fr[E.pa].erase(E),  addEdge(E.a,x);
            for(Edge E : fr[y]) to[E.pb].erase(E),  addEdge(E.a,E.pb),
                ans -= s[E.pb];

            fr[y].clear();
            to[y].clear();
        }
        ll  ans = 0;

        for(int j = 1 ; j <= n ; ++j)
            if (j == p[j])
                ans += 1ll * s[j] * (s[j] - 1),
                ans += 1ll * s[j] * sz(to[j]);

        cout << ans << "\n";
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15232 KB Output is correct
2 Correct 14 ms 15232 KB Output is correct
3 Correct 14 ms 15232 KB Output is correct
4 Correct 14 ms 15232 KB Output is correct
5 Correct 14 ms 15232 KB Output is correct
6 Correct 13 ms 15232 KB Output is correct
7 Correct 14 ms 15232 KB Output is correct
8 Correct 15 ms 15232 KB Output is correct
9 Correct 15 ms 15360 KB Output is correct
10 Correct 14 ms 15232 KB Output is correct
11 Correct 13 ms 15232 KB Output is correct
12 Correct 15 ms 15232 KB Output is correct
13 Correct 13 ms 15232 KB Output is correct
14 Correct 14 ms 15232 KB Output is correct
15 Correct 13 ms 15232 KB Output is correct
16 Correct 14 ms 15232 KB Output is correct
17 Correct 15 ms 15232 KB Output is correct
18 Correct 13 ms 15232 KB Output is correct
19 Correct 13 ms 15232 KB Output is correct
20 Correct 14 ms 15232 KB Output is correct
21 Correct 15 ms 15232 KB Output is correct
22 Correct 14 ms 15232 KB Output is correct
23 Correct 14 ms 15360 KB Output is correct
24 Correct 14 ms 15232 KB Output is correct
25 Correct 15 ms 15232 KB Output is correct
26 Correct 14 ms 15232 KB Output is correct
27 Correct 13 ms 15232 KB Output is correct
28 Correct 14 ms 15232 KB Output is correct
29 Correct 14 ms 15232 KB Output is correct
30 Correct 15 ms 15232 KB Output is correct
31 Correct 15 ms 15232 KB Output is correct
32 Correct 14 ms 15232 KB Output is correct
33 Correct 15 ms 15232 KB Output is correct
34 Correct 17 ms 15360 KB Output is correct
35 Correct 503 ms 21100 KB Output is correct
36 Correct 967 ms 23288 KB Output is correct
37 Correct 922 ms 23544 KB Output is correct
38 Correct 917 ms 23160 KB Output is correct
39 Correct 35 ms 15360 KB Output is correct
40 Correct 35 ms 15488 KB Output is correct
41 Correct 35 ms 15480 KB Output is correct
42 Correct 36 ms 15360 KB Output is correct
43 Correct 38 ms 15488 KB Output is correct
44 Correct 36 ms 15480 KB Output is correct
45 Correct 36 ms 15360 KB Output is correct
46 Correct 39 ms 15360 KB Output is correct
47 Correct 36 ms 15488 KB Output is correct
48 Correct 41 ms 15440 KB Output is correct
49 Correct 62 ms 15992 KB Output is correct
50 Correct 932 ms 23416 KB Output is correct
51 Correct 65 ms 15736 KB Output is correct
52 Correct 862 ms 22008 KB Output is correct
53 Correct 64 ms 15992 KB Output is correct
54 Correct 892 ms 22648 KB Output is correct
55 Correct 33 ms 15744 KB Output is correct
56 Correct 34 ms 15864 KB Output is correct
57 Correct 31 ms 15744 KB Output is correct
58 Correct 32 ms 15864 KB Output is correct
59 Correct 36 ms 15360 KB Output is correct
60 Correct 872 ms 20612 KB Output is correct
61 Correct 39 ms 15488 KB Output is correct
62 Correct 905 ms 22860 KB Output is correct

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15232 KB Output is correct
2 Correct 14 ms 15232 KB Output is correct
3 Correct 14 ms 15232 KB Output is correct
4 Correct 14 ms 15232 KB Output is correct
5 Correct 14 ms 15232 KB Output is correct
6 Correct 13 ms 15232 KB Output is correct
7 Correct 14 ms 15232 KB Output is correct
8 Correct 15 ms 15232 KB Output is correct
9 Correct 15 ms 15360 KB Output is correct
10 Correct 14 ms 15232 KB Output is correct
11 Correct 13 ms 15232 KB Output is correct
12 Correct 15 ms 15232 KB Output is correct
13 Correct 13 ms 15232 KB Output is correct
14 Correct 14 ms 15232 KB Output is correct
15 Correct 13 ms 15232 KB Output is correct
16 Correct 14 ms 15232 KB Output is correct
17 Correct 15 ms 15232 KB Output is correct
18 Correct 13 ms 15232 KB Output is correct
19 Correct 13 ms 15232 KB Output is correct
20 Correct 14 ms 15232 KB Output is correct
21 Correct 15 ms 15232 KB Output is correct
22 Correct 14 ms 15232 KB Output is correct
23 Correct 14 ms 15360 KB Output is correct
24 Correct 14 ms 15232 KB Output is correct
25 Correct 15 ms 15232 KB Output is correct
26 Correct 14 ms 15232 KB Output is correct
27 Correct 13 ms 15232 KB Output is correct
28 Correct 14 ms 15232 KB Output is correct
29 Correct 14 ms 15232 KB Output is correct
30 Correct 15 ms 15232 KB Output is correct
31 Correct 15 ms 15232 KB Output is correct
32 Correct 14 ms 15232 KB Output is correct
33 Correct 15 ms 15232 KB Output is correct
34 Correct 17 ms 15360 KB Output is correct
35 Correct 503 ms 21100 KB Output is correct
36 Correct 967 ms 23288 KB Output is correct
37 Correct 922 ms 23544 KB Output is correct
38 Correct 917 ms 23160 KB Output is correct
39 Correct 35 ms 15360 KB Output is correct
40 Correct 35 ms 15488 KB Output is correct
41 Correct 35 ms 15480 KB Output is correct
42 Correct 36 ms 15360 KB Output is correct
43 Correct 38 ms 15488 KB Output is correct
44 Correct 36 ms 15480 KB Output is correct
45 Correct 36 ms 15360 KB Output is correct
46 Correct 39 ms 15360 KB Output is correct
47 Correct 36 ms 15488 KB Output is correct
48 Correct 41 ms 15440 KB Output is correct
49 Correct 62 ms 15992 KB Output is correct
50 Correct 932 ms 23416 KB Output is correct
51 Correct 65 ms 15736 KB Output is correct
52 Correct 862 ms 22008 KB Output is correct
53 Correct 64 ms 15992 KB Output is correct
54 Correct 892 ms 22648 KB Output is correct
55 Correct 33 ms 15744 KB Output is correct
56 Correct 34 ms 15864 KB Output is correct
57 Correct 31 ms 15744 KB Output is correct
58 Correct 32 ms 15864 KB Output is correct
59 Correct 36 ms 15360 KB Output is correct
60 Correct 872 ms 20612 KB Output is correct
61 Correct 39 ms 15488 KB Output is correct
62 Correct 905 ms 22860 KB Output is correct
63 Execution timed out 5063 ms 19904 KB Time limit exceeded
64 Halted 0 ms 0 KB -