oj.uz

Submission #858220

# Submission time Handle Problem Language Result Execution time Memory
858220 2023-10-07T16:09:46 Z efedmrlr Making Friends on Joitter is Fun (JOI20_joitter2) C++17
100 / 100
 836 ms 69632 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
int p[N];
int sz[N];
set<int> st[N], outst[N], childs[N];
int ans = 0;
queue<array<int,2> > upds;
void make_set(int x) {
    p[x] = x;
    st[x].clear();
    sz[x] = 1;
    outst[x].clear();
    childs[x].clear();
    childs[x].insert(x);
}
int find_set(int x) {
    if(p[x] == x) return x;
    return find_set(p[x]);
}
void insert_weak(int a, int b) {
    if(st[b].count(a) ) {
        assert(outst[a].count(b));
        return;
    }
    st[b].insert(a);
    outst[a].insert(b);
    if(st[a].count(b)) {
        assert(outst[b].count(a));
        upds.push({a,b});
    }
}
int dsu_size(int x) {
    return st[x].size() + outst[x].size() + childs[x].size();
}

void union_set(int x, int y) {
    x = find_set(x);
    y = find_set(y);
    if(x==y) return;
    if(dsu_size(x) < dsu_size(y)) swap(x,y);

    ans -= (childs[x].size() - sz[x]) * (sz[x]) + (childs[y].size() - sz[y]) * (sz[y]);
    ans -= sz[x] * (sz[x] - 1) + sz[y] * (sz[y] - 1);

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

    st[x].erase(y), outst[x].erase(y);
    st[y].erase(x), outst[y].erase(x);
    for(auto el : outst[y]) {
        st[el].erase(y);
        insert_weak(x, el);
    }
    for(auto el : st[y]) {
        outst[el].erase(y);
        insert_weak(el, x);
    }
    for(auto el : childs[y]) {
        childs[x].insert(el);
    }

    ans += sz[x] * (sz[x] - 1);
    ans += sz[x] * (childs[x].size() - sz[x]);


}
inline void solve() {
    cin>>n>>m;
    for(int i = 1; i<=n; i++) {
        make_set(i);
    }
    for(int i = 0; i<m; i++) {
        int a,b;
        cin>>a>>b;
        b = find_set(b);
        if(find_set(a) != b && !(childs[b].count(a))) {
            ans += sz[b];
            childs[b].insert(a);
            a = find_set(a);
            insert_weak(a, b);
        }
        while(upds.size()) {
            array<int,2> tmp = upds.front();
            upds.pop();
            union_set(tmp[0], tmp[1]);

        }
        cout<<ans<<"\n";
    }
    
}
 
signed main() {
    //freopen("milkvisits.in", "r", stdin);
    //freopen("milkvisits.out", "w", stdout);
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

joitter2.cpp: In function 'std::string to_string(std::string, int, int)':
joitter2.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 14964 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 2 ms 14936 KB Output is correct
6 Correct 3 ms 14784 KB Output is correct
7 Correct 3 ms 15024 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14784 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 15012 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 4 ms 14956 KB Output is correct
24 Correct 4 ms 15192 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 3 ms 14772 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 3 ms 14936 KB Output is correct
34 Correct 5 ms 14940 KB Output is correct
35 Correct 63 ms 20812 KB Output is correct
36 Correct 80 ms 23376 KB Output is correct
37 Correct 82 ms 23480 KB Output is correct
38 Correct 77 ms 23124 KB Output is correct
39 Correct 5 ms 15192 KB Output is correct
40 Correct 6 ms 15708 KB Output is correct
41 Correct 6 ms 15704 KB Output is correct
42 Correct 5 ms 15196 KB Output is correct
43 Correct 5 ms 15196 KB Output is correct
44 Correct 6 ms 15196 KB Output is correct
45 Correct 5 ms 15448 KB Output is correct
46 Correct 5 ms 15196 KB Output is correct
47 Correct 6 ms 15552 KB Output is correct
48 Correct 6 ms 15452 KB Output is correct
49 Correct 12 ms 16292 KB Output is correct
50 Correct 88 ms 24024 KB Output is correct
51 Correct 8 ms 15688 KB Output is correct
52 Correct 72 ms 21840 KB Output is correct
53 Correct 13 ms 15964 KB Output is correct
54 Correct 76 ms 22616 KB Output is correct
55 Correct 8 ms 15708 KB Output is correct
56 Correct 8 ms 15784 KB Output is correct
57 Correct 8 ms 15524 KB Output is correct
58 Correct 6 ms 15708 KB Output is correct
59 Correct 6 ms 15780 KB Output is correct
60 Correct 69 ms 20636 KB Output is correct
61 Correct 6 ms 15452 KB Output is correct
62 Correct 77 ms 23000 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 4 ms 14964 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 3 ms 14936 KB Output is correct
5 Correct 2 ms 14936 KB Output is correct
6 Correct 3 ms 14784 KB Output is correct
7 Correct 3 ms 15024 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14784 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 15012 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 4 ms 14956 KB Output is correct
24 Correct 4 ms 15192 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 3 ms 14772 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 3 ms 14936 KB Output is correct
34 Correct 5 ms 14940 KB Output is correct
35 Correct 63 ms 20812 KB Output is correct
36 Correct 80 ms 23376 KB Output is correct
37 Correct 82 ms 23480 KB Output is correct
38 Correct 77 ms 23124 KB Output is correct
39 Correct 5 ms 15192 KB Output is correct
40 Correct 6 ms 15708 KB Output is correct
41 Correct 6 ms 15704 KB Output is correct
42 Correct 5 ms 15196 KB Output is correct
43 Correct 5 ms 15196 KB Output is correct
44 Correct 6 ms 15196 KB Output is correct
45 Correct 5 ms 15448 KB Output is correct
46 Correct 5 ms 15196 KB Output is correct
47 Correct 6 ms 15552 KB Output is correct
48 Correct 6 ms 15452 KB Output is correct
49 Correct 12 ms 16292 KB Output is correct
50 Correct 88 ms 24024 KB Output is correct
51 Correct 8 ms 15688 KB Output is correct
52 Correct 72 ms 21840 KB Output is correct
53 Correct 13 ms 15964 KB Output is correct
54 Correct 76 ms 22616 KB Output is correct
55 Correct 8 ms 15708 KB Output is correct
56 Correct 8 ms 15784 KB Output is correct
57 Correct 8 ms 15524 KB Output is correct
58 Correct 6 ms 15708 KB Output is correct
59 Correct 6 ms 15780 KB Output is correct
60 Correct 69 ms 20636 KB Output is correct
61 Correct 6 ms 15452 KB Output is correct
62 Correct 77 ms 23000 KB Output is correct
63 Correct 456 ms 68512 KB Output is correct
64 Correct 457 ms 68688 KB Output is correct
65 Correct 459 ms 68516 KB Output is correct
66 Correct 171 ms 34456 KB Output is correct
67 Correct 323 ms 61484 KB Output is correct
68 Correct 170 ms 34456 KB Output is correct
69 Correct 287 ms 35516 KB Output is correct
70 Correct 174 ms 34388 KB Output is correct
71 Correct 175 ms 34504 KB Output is correct
72 Correct 356 ms 45424 KB Output is correct
73 Correct 350 ms 47012 KB Output is correct
74 Correct 836 ms 68880 KB Output is correct
75 Correct 444 ms 42576 KB Output is correct
76 Correct 590 ms 54292 KB Output is correct
77 Correct 631 ms 54548 KB Output is correct
78 Correct 174 ms 38040 KB Output is correct
79 Correct 310 ms 42488 KB Output is correct
80 Correct 175 ms 37236 KB Output is correct
81 Correct 289 ms 40528 KB Output is correct
82 Correct 659 ms 55392 KB Output is correct
83 Correct 763 ms 55732 KB Output is correct
84 Correct 598 ms 53844 KB Output is correct
85 Correct 531 ms 53844 KB Output is correct
86 Correct 263 ms 67456 KB Output is correct
87 Correct 274 ms 69632 KB Output is correct
88 Correct 349 ms 46524 KB Output is correct
89 Correct 600 ms 52348 KB Output is correct