제출 #1076132

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1076132	2024-08-26 11:20:20	Abito	Simurgh (IOI17_simurgh)	C++17	30 / 100	3032 ms	3508 KiB

simurgh

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 "simurgh.h"
#include <bits/stdc++.h>
#define pb push_back
#define ask count_common_roads
using namespace std;
const int N=2005;
int par[N],sz[N];
bool in[N];
int getpar(int x){
  if (x==par[x]) return x;
  return par[x]=getpar(par[x]);
}
bool link(int x,int y){
  x=getpar(x);
  y=getpar(y);
  if (x==y) return 0;
  if (sz[x]>sz[y]) swap(x,y);
  sz[y]+=sz[x];
  par[x]=y;
  return 1;
}
std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
  int m=u.size();
  for (int i=0;i<m;i++) u[i]++,v[i]++;
  for (int i=1;i<=n;i++) sz[i]=1,par[i]=i;
  vector<int> r;
  for (int i=0;i<m;i++){
    if (link(u[i],v[i])) r.pb(i),in[i]=1;
  }
  int ans=ask(r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 17 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30