Submission #676479

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
676479	2022-12-31 03:35:30	penguin133	Experimental Charges (NOI19_charges)	C++17	100 / 100	39 ms	8524 KiB

charges

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int p[100005], C[100005];
vector<int>v[100005];
int getr(int x){
  if(p[x] == x)return x;
  else return p[x] = getr(p[x]);
}
void merge(int a, int b, int c){
  int pa = a, pb= b;
  a = getr(a); b = getr(b);
  if(a != b){
    if(v[a].size() > v[b].size()){
      p[b] = a;
      for(auto i : v[b])v[a].push_back(i);
      if(c != (C[pa] ^ C[pb]))for(auto i : v[b])C[i] = 1 - C[i];
    }
    else{
      p[a] = b;
      for(auto i : v[a])v[b].push_back(i);
      if(c != (C[pa] ^ C[pb]))for(auto i : v[a])C[i] = 1 - C[i];
    }
  }
}
int main(){
  ios::sync_with_stdio(0);cin.tie(0);
  int n,q;
  cin >> n >> q;
  for(int i=1;i<=n;i++)C[i] = 1, p[i] = i, v[i].push_back(i);
  while(q--){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 14 / 14
• Subtask 4: 12 / 12
• Subtask 5: 25 / 25
• Subtask 6: 31 / 31