oj.uz

답안 #1000230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000230 2024-06-17T06:48:58 Z snpmrnhlol 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
17 / 100
 5000 ms 61868 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5;
typedef long long ll;
ll ans = 0;
int n,m;
struct DSU{
    int p,sz;
    set <int> boys;
    vector <int> comp;
}dsu[N];
set <int> edges[N];
int leader(int x){
    if(x == dsu[x].p)return x;
    return dsu[x].p = leader(dsu[x].p);
}
bool checkedge(int x,int y){
    int compx = leader(x);
    int compy = leader(y);
    if(compx == compy)return 1;
    if(dsu[compy].boys.find(x) != dsu[compy].boys.end())return 1;
    return 0;
}
bool check(int x,int y){
    if(x == y)return 1;
    for(auto i:dsu[x].comp){
        if(edges[i].find(y) != edges[i].end()){
            return 1;
        }
    }
    return 0;
}
void connect(int x,int y){
    x = leader(x);
    y = leader(y);
    if(x == y)return;
    if(dsu[x].sz + dsu[x].boys.size() > dsu[y].sz + dsu[y].boys.size())swap(x,y);
    ///y connected to x
    auto it = dsu[x].boys.begin();
    while(it != dsu[x].boys.end()){
        if(leader(*it) == y){
            ans-=dsu[x].sz;
            it = dsu[x].boys.erase(it);
            edges[*it].erase(x);
        }else{
            it++;
        }
    }
    ///x connected to y
    for(auto i:dsu[x].comp){
        auto it = dsu[y].boys.find(i);
        if(it != dsu[y].boys.end()){
            ans-=dsu[y].sz;
            dsu[y].boys.erase(it);
            edges[*it].erase(y);
        }
        dsu[y].comp.push_back(i);
    }
    ans+=1ll*dsu[x].boys.size()*dsu[y].sz;
    ans+=1ll*dsu[y].boys.size()*dsu[x].sz;
    ///x and y connected to random node
    for(auto i:dsu[x].boys){
        assert(leader(i) != y);
        if(dsu[y].boys.find(i) != dsu[y].boys.end()){
            ans-=dsu[x].sz;
            ans-=dsu[y].sz;
        }
        dsu[y].boys.insert(i);
        edges[i].erase(x);
        edges[i].insert(y);
    }
    ans+=2ll*dsu[x].sz*dsu[y].sz;
    dsu[x].comp.clear();
    dsu[x].boys.clear();
    dsu[x].p = y;
    dsu[y].sz+=dsu[x].sz;
    ///check for new connections
    for(auto i:dsu[y].boys){
        if(check(leader(i),y) && check(y,leader(i))){
            connect(leader(i),y);
            break;
        }
    }
}
void addedge(int x,int y){
    int compx = leader(x);
    int compy = leader(y);
    if(checkedge(x,y))return;
    if(check(compy,compx)){
        connect(x,y);
    }else{
        dsu[compy].boys.insert(x);
        edges[x].insert(compy);
        ans+=dsu[compy].sz;
    }
}
void dbg(){
    for(int i = 0;i < n;i++){
        cout<<"dsuinvestigate:"<<i<<'\n';
        cout<<dsu[i].p<<' '<<dsu[i].sz<<'\n';
        for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
        for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(int i = 0;i < n;i++){
        dsu[i] = {i,1};
        dsu[i].comp.push_back(i);
    }
    for(int i = 0;i < m;i++){
        int u,w;
        cin>>u>>w;
        u--;w--;
        addedge(u,w);
        //dbg();
        cout<<ans<<'\n';
    }
    return 0;
}
/**
5 20
4 2
1 5
2 3
2 5
3 2
3 1
4 5
1 2
5 2
1 4
4 1
3 4
5 1
2 4
2 1
4 3
1 3
5 4
3 5
5 3

**/

Compilation message

joitter2.cpp: In function 'void dbg()':
joitter2.cpp:101:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  101 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:101:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  101 |         for(auto j:dsu[i].boys)cout<<j<<' ';cout<<'\n';
      |                                             ^~~~
joitter2.cpp:102:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  102 |         for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
      |         ^~~
joitter2.cpp:102:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  102 |         for(auto j:dsu[i].comp)cout<<j<<' ';cout<<'\n';
      |                                             ^~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 25432 KB Output is correct
2 Correct 10 ms 25508 KB Output is correct
3 Correct 10 ms 25488 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 9 ms 25436 KB Output is correct
6 Correct 10 ms 25344 KB Output is correct
7 Correct 10 ms 25436 KB Output is correct
8 Correct 9 ms 25436 KB Output is correct
9 Correct 10 ms 25504 KB Output is correct
10 Correct 9 ms 25436 KB Output is correct
11 Correct 11 ms 25432 KB Output is correct
12 Correct 11 ms 25436 KB Output is correct
13 Correct 9 ms 25332 KB Output is correct
14 Correct 9 ms 25436 KB Output is correct
15 Correct 9 ms 25436 KB Output is correct
16 Correct 11 ms 25436 KB Output is correct
17 Correct 9 ms 25436 KB Output is correct
18 Correct 10 ms 25436 KB Output is correct
19 Correct 10 ms 25508 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 10 ms 25432 KB Output is correct
23 Correct 10 ms 25436 KB Output is correct
24 Correct 9 ms 25440 KB Output is correct
25 Correct 10 ms 25340 KB Output is correct
26 Correct 10 ms 25436 KB Output is correct
27 Correct 9 ms 25384 KB Output is correct
28 Correct 9 ms 25436 KB Output is correct
29 Correct 9 ms 25436 KB Output is correct
30 Correct 11 ms 25436 KB Output is correct
31 Correct 10 ms 25448 KB Output is correct
32 Correct 9 ms 25436 KB Output is correct
33 Correct 9 ms 25436 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 25432 KB Output is correct
2 Correct 10 ms 25508 KB Output is correct
3 Correct 10 ms 25488 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 9 ms 25436 KB Output is correct
6 Correct 10 ms 25344 KB Output is correct
7 Correct 10 ms 25436 KB Output is correct
8 Correct 9 ms 25436 KB Output is correct
9 Correct 10 ms 25504 KB Output is correct
10 Correct 9 ms 25436 KB Output is correct
11 Correct 11 ms 25432 KB Output is correct
12 Correct 11 ms 25436 KB Output is correct
13 Correct 9 ms 25332 KB Output is correct
14 Correct 9 ms 25436 KB Output is correct
15 Correct 9 ms 25436 KB Output is correct
16 Correct 11 ms 25436 KB Output is correct
17 Correct 9 ms 25436 KB Output is correct
18 Correct 10 ms 25436 KB Output is correct
19 Correct 10 ms 25508 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 10 ms 25432 KB Output is correct
23 Correct 10 ms 25436 KB Output is correct
24 Correct 9 ms 25440 KB Output is correct
25 Correct 10 ms 25340 KB Output is correct
26 Correct 10 ms 25436 KB Output is correct
27 Correct 9 ms 25384 KB Output is correct
28 Correct 9 ms 25436 KB Output is correct
29 Correct 9 ms 25436 KB Output is correct
30 Correct 11 ms 25436 KB Output is correct
31 Correct 10 ms 25448 KB Output is correct
32 Correct 9 ms 25436 KB Output is correct
33 Correct 9 ms 25436 KB Output is correct
34 Correct 11 ms 25432 KB Output is correct
35 Correct 69 ms 30548 KB Output is correct
36 Correct 126 ms 32592 KB Output is correct
37 Correct 126 ms 32684 KB Output is correct
38 Correct 132 ms 32348 KB Output is correct
39 Correct 18 ms 25692 KB Output is correct
40 Correct 11 ms 25692 KB Output is correct
41 Correct 11 ms 25588 KB Output is correct
42 Correct 10 ms 25688 KB Output is correct
43 Correct 444 ms 25692 KB Output is correct
44 Correct 425 ms 25704 KB Output is correct
45 Correct 16 ms 25692 KB Output is correct
46 Correct 15 ms 25712 KB Output is correct
47 Correct 33 ms 25692 KB Output is correct
48 Correct 35 ms 25744 KB Output is correct
49 Correct 283 ms 26208 KB Output is correct
50 Correct 117 ms 32596 KB Output is correct
51 Correct 891 ms 26128 KB Output is correct
52 Correct 297 ms 31720 KB Output is correct
53 Correct 463 ms 26148 KB Output is correct
54 Correct 187 ms 32084 KB Output is correct
55 Correct 713 ms 26448 KB Output is correct
56 Correct 649 ms 26196 KB Output is correct
57 Correct 602 ms 26036 KB Output is correct
58 Correct 688 ms 26192 KB Output is correct
59 Correct 10 ms 25688 KB Output is correct
60 Correct 57 ms 30120 KB Output is correct
61 Correct 222 ms 25764 KB Output is correct
62 Correct 146 ms 32336 KB Output is correct

Subtask #3
0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 25432 KB Output is correct
2 Correct 10 ms 25508 KB Output is correct
3 Correct 10 ms 25488 KB Output is correct
4 Correct 12 ms 25436 KB Output is correct
5 Correct 9 ms 25436 KB Output is correct
6 Correct 10 ms 25344 KB Output is correct
7 Correct 10 ms 25436 KB Output is correct
8 Correct 9 ms 25436 KB Output is correct
9 Correct 10 ms 25504 KB Output is correct
10 Correct 9 ms 25436 KB Output is correct
11 Correct 11 ms 25432 KB Output is correct
12 Correct 11 ms 25436 KB Output is correct
13 Correct 9 ms 25332 KB Output is correct
14 Correct 9 ms 25436 KB Output is correct
15 Correct 9 ms 25436 KB Output is correct
16 Correct 11 ms 25436 KB Output is correct
17 Correct 9 ms 25436 KB Output is correct
18 Correct 10 ms 25436 KB Output is correct
19 Correct 10 ms 25508 KB Output is correct
20 Correct 10 ms 25432 KB Output is correct
21 Correct 10 ms 25436 KB Output is correct
22 Correct 10 ms 25432 KB Output is correct
23 Correct 10 ms 25436 KB Output is correct
24 Correct 9 ms 25440 KB Output is correct
25 Correct 10 ms 25340 KB Output is correct
26 Correct 10 ms 25436 KB Output is correct
27 Correct 9 ms 25384 KB Output is correct
28 Correct 9 ms 25436 KB Output is correct
29 Correct 9 ms 25436 KB Output is correct
30 Correct 11 ms 25436 KB Output is correct
31 Correct 10 ms 25448 KB Output is correct
32 Correct 9 ms 25436 KB Output is correct
33 Correct 9 ms 25436 KB Output is correct
34 Correct 11 ms 25432 KB Output is correct
35 Correct 69 ms 30548 KB Output is correct
36 Correct 126 ms 32592 KB Output is correct
37 Correct 126 ms 32684 KB Output is correct
38 Correct 132 ms 32348 KB Output is correct
39 Correct 18 ms 25692 KB Output is correct
40 Correct 11 ms 25692 KB Output is correct
41 Correct 11 ms 25588 KB Output is correct
42 Correct 10 ms 25688 KB Output is correct
43 Correct 444 ms 25692 KB Output is correct
44 Correct 425 ms 25704 KB Output is correct
45 Correct 16 ms 25692 KB Output is correct
46 Correct 15 ms 25712 KB Output is correct
47 Correct 33 ms 25692 KB Output is correct
48 Correct 35 ms 25744 KB Output is correct
49 Correct 283 ms 26208 KB Output is correct
50 Correct 117 ms 32596 KB Output is correct
51 Correct 891 ms 26128 KB Output is correct
52 Correct 297 ms 31720 KB Output is correct
53 Correct 463 ms 26148 KB Output is correct
54 Correct 187 ms 32084 KB Output is correct
55 Correct 713 ms 26448 KB Output is correct
56 Correct 649 ms 26196 KB Output is correct
57 Correct 602 ms 26036 KB Output is correct
58 Correct 688 ms 26192 KB Output is correct
59 Correct 10 ms 25688 KB Output is correct
60 Correct 57 ms 30120 KB Output is correct
61 Correct 222 ms 25764 KB Output is correct
62 Correct 146 ms 32336 KB Output is correct
63 Correct 243 ms 61736 KB Output is correct
64 Correct 242 ms 61868 KB Output is correct
65 Correct 238 ms 61780 KB Output is correct
66 Execution timed out 5074 ms 32348 KB Time limit exceeded
67 Halted 0 ms 0 KB -