oj.uz

Submission #212017

# Submission time Handle Problem Language Result Execution time Memory
212017 2020-03-22T03:45:55 Z Mercenary Making Friends on Joitter is Fun (JOI20_joitter2) C++14
100 / 100
 686 ms 50800 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int n , m;
ll res = 0;

int lab[maxn];
set<int> in[maxn],out[maxn];
vector<int> node[maxn];
int FindLab(int u){return lab[u] < 0 ? u : lab[u] = FindLab(lab[u]);}
void Merge(int u , int v){
    u = FindLab(u);v = FindLab(v);
    if(u == v)return;
    res -= (ll)in[u].size() * node[u].size();
    res -= (ll)in[v].size() * node[v].size();
    res -= (ll)node[u].size() * ((int)node[u].size() - 1);
    res -= (ll)node[v].size() * ((int)node[v].size() - 1);
    if(in[u].size() + out[u].size() + node[u].size() < in[v].size() + out[v].size() + node[v].size())
        swap(u , v);
    lab[u] += lab[v];
    lab[v] = u;
    for(auto & c : node[v]){
        node[u].pb(c);
        in[u].erase(c);
    }
    vector<int> add;
    for(auto & c : in[v]){
        if(FindLab(c) != u){
            out[FindLab(c)].erase(v);
            out[FindLab(c)].insert(u);
            in[u].insert(c);
            if(out[u].find(FindLab(c)) != out[u].end()){
                add.pb(c);
            }
        }
    }
    for(auto & c : out[v]){
        if(FindLab(c) != u){
            out[u].insert(c);
            if(out[c].find(u) != out[c].end()){
                add.pb(c);;
            }
        }
    }
    out[u].erase(v);
    res += (ll)in[u].size() * node[u].size();
    res += (ll)node[u].size() * ((int)node[u].size() - 1);
    for(auto c : add){
        Merge(u,c);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> m;
    for(int i = 1 ; i <= n ; ++i){
        lab[i] = -1;node[i].pb(i);
    }
    for(int i = 1 ; i <= m ; ++i){
        int u , v;cin >> u >> v;
        if(FindLab(u) != FindLab(v)){
            if(out[FindLab(v)].find(FindLab(u)) != out[FindLab(v)].end()){
                Merge(u,v);
            }else if(in[FindLab(v)].find(u) == in[FindLab(v)].end()){
                in[FindLab(v)].insert(u);
                res += node[FindLab(v)].size();
                out[FindLab(u)].insert(FindLab(v));
            }
        }
        cout << res << '\n';
    }
}

Compilation message

joitter2.cpp: In function 'int main()':
joitter2.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
joitter2.cpp:74:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 12 ms 11904 KB Output is correct
4 Correct 11 ms 12032 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 11 ms 12032 KB Output is correct
7 Correct 12 ms 12160 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 11 ms 12160 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 11 ms 12032 KB Output is correct
12 Correct 11 ms 12032 KB Output is correct
13 Correct 15 ms 12032 KB Output is correct
14 Correct 14 ms 12160 KB Output is correct
15 Correct 11 ms 12032 KB Output is correct
16 Correct 11 ms 12160 KB Output is correct
17 Correct 11 ms 12160 KB Output is correct
18 Correct 11 ms 12032 KB Output is correct
19 Correct 11 ms 12032 KB Output is correct
20 Correct 11 ms 12032 KB Output is correct
21 Correct 13 ms 12160 KB Output is correct
22 Correct 11 ms 12032 KB Output is correct
23 Correct 11 ms 12032 KB Output is correct
24 Correct 12 ms 12160 KB Output is correct
25 Correct 12 ms 12160 KB Output is correct
26 Correct 13 ms 12032 KB Output is correct
27 Correct 11 ms 12160 KB Output is correct
28 Correct 11 ms 12160 KB Output is correct
29 Correct 12 ms 12032 KB Output is correct
30 Correct 11 ms 12032 KB Output is correct
31 Correct 13 ms 12032 KB Output is correct
32 Correct 12 ms 12160 KB Output is correct
33 Correct 11 ms 12160 KB Output is correct
34 Correct 13 ms 12160 KB Output is correct
35 Correct 98 ms 15352 KB Output is correct
36 Correct 116 ms 17144 KB Output is correct
37 Correct 111 ms 17144 KB Output is correct
38 Correct 111 ms 16884 KB Output is correct
39 Correct 13 ms 12288 KB Output is correct
40 Correct 0 ms 12416 KB Output is correct
41 Correct 16 ms 12416 KB Output is correct
42 Correct 14 ms 12288 KB Output is correct
43 Correct 13 ms 12288 KB Output is correct
44 Correct 14 ms 12288 KB Output is correct
45 Correct 12 ms 12288 KB Output is correct
46 Correct 14 ms 12288 KB Output is correct
47 Correct 14 ms 12416 KB Output is correct
48 Correct 13 ms 12416 KB Output is correct
49 Correct 19 ms 12928 KB Output is correct
50 Correct 116 ms 17272 KB Output is correct
51 Correct 18 ms 12544 KB Output is correct
52 Correct 104 ms 16248 KB Output is correct
53 Correct 19 ms 12928 KB Output is correct
54 Correct 107 ms 16632 KB Output is correct
55 Correct 16 ms 12544 KB Output is correct
56 Correct 15 ms 12544 KB Output is correct
57 Correct 17 ms 12800 KB Output is correct
58 Correct 15 ms 12800 KB Output is correct
59 Correct 14 ms 12416 KB Output is correct
60 Correct 93 ms 14712 KB Output is correct
61 Correct 15 ms 12416 KB Output is correct
62 Correct 107 ms 16888 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 12 ms 11904 KB Output is correct
4 Correct 11 ms 12032 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 11 ms 12032 KB Output is correct
7 Correct 12 ms 12160 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 11 ms 12160 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 11 ms 12032 KB Output is correct
12 Correct 11 ms 12032 KB Output is correct
13 Correct 15 ms 12032 KB Output is correct
14 Correct 14 ms 12160 KB Output is correct
15 Correct 11 ms 12032 KB Output is correct
16 Correct 11 ms 12160 KB Output is correct
17 Correct 11 ms 12160 KB Output is correct
18 Correct 11 ms 12032 KB Output is correct
19 Correct 11 ms 12032 KB Output is correct
20 Correct 11 ms 12032 KB Output is correct
21 Correct 13 ms 12160 KB Output is correct
22 Correct 11 ms 12032 KB Output is correct
23 Correct 11 ms 12032 KB Output is correct
24 Correct 12 ms 12160 KB Output is correct
25 Correct 12 ms 12160 KB Output is correct
26 Correct 13 ms 12032 KB Output is correct
27 Correct 11 ms 12160 KB Output is correct
28 Correct 11 ms 12160 KB Output is correct
29 Correct 12 ms 12032 KB Output is correct
30 Correct 11 ms 12032 KB Output is correct
31 Correct 13 ms 12032 KB Output is correct
32 Correct 12 ms 12160 KB Output is correct
33 Correct 11 ms 12160 KB Output is correct
34 Correct 13 ms 12160 KB Output is correct
35 Correct 98 ms 15352 KB Output is correct
36 Correct 116 ms 17144 KB Output is correct
37 Correct 111 ms 17144 KB Output is correct
38 Correct 111 ms 16884 KB Output is correct
39 Correct 13 ms 12288 KB Output is correct
40 Correct 0 ms 12416 KB Output is correct
41 Correct 16 ms 12416 KB Output is correct
42 Correct 14 ms 12288 KB Output is correct
43 Correct 13 ms 12288 KB Output is correct
44 Correct 14 ms 12288 KB Output is correct
45 Correct 12 ms 12288 KB Output is correct
46 Correct 14 ms 12288 KB Output is correct
47 Correct 14 ms 12416 KB Output is correct
48 Correct 13 ms 12416 KB Output is correct
49 Correct 19 ms 12928 KB Output is correct
50 Correct 116 ms 17272 KB Output is correct
51 Correct 18 ms 12544 KB Output is correct
52 Correct 104 ms 16248 KB Output is correct
53 Correct 19 ms 12928 KB Output is correct
54 Correct 107 ms 16632 KB Output is correct
55 Correct 16 ms 12544 KB Output is correct
56 Correct 15 ms 12544 KB Output is correct
57 Correct 17 ms 12800 KB Output is correct
58 Correct 15 ms 12800 KB Output is correct
59 Correct 14 ms 12416 KB Output is correct
60 Correct 93 ms 14712 KB Output is correct
61 Correct 15 ms 12416 KB Output is correct
62 Correct 107 ms 16888 KB Output is correct
63 Correct 412 ms 45916 KB Output is correct
64 Correct 396 ms 45816 KB Output is correct
65 Correct 393 ms 45820 KB Output is correct
66 Correct 130 ms 22768 KB Output is correct
67 Correct 236 ms 28528 KB Output is correct
68 Correct 132 ms 22768 KB Output is correct
69 Correct 291 ms 24560 KB Output is correct
70 Correct 149 ms 22768 KB Output is correct
71 Correct 132 ms 22764 KB Output is correct
72 Correct 266 ms 26360 KB Output is correct
73 Correct 258 ms 26484 KB Output is correct
74 Correct 686 ms 45368 KB Output is correct
75 Correct 471 ms 29308 KB Output is correct
76 Correct 499 ms 36212 KB Output is correct
77 Correct 496 ms 36336 KB Output is correct
78 Correct 180 ms 26740 KB Output is correct
79 Correct 282 ms 29424 KB Output is correct
80 Correct 189 ms 26820 KB Output is correct
81 Correct 289 ms 28528 KB Output is correct
82 Correct 457 ms 38388 KB Output is correct
83 Correct 443 ms 38260 KB Output is correct
84 Correct 452 ms 50776 KB Output is correct
85 Correct 426 ms 50800 KB Output is correct
86 Correct 165 ms 26864 KB Output is correct
87 Correct 211 ms 27884 KB Output is correct
88 Correct 271 ms 26612 KB Output is correct
89 Correct 536 ms 34832 KB Output is correct