제출 #17300

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
17300	2015-11-19 07:38:02	gs14004	지도 색칠하기 (GA3_map)	C++14	85 / 120	1500 ms	1088 KiB

map

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
struct disj{
  int pa[42];
  void init(int n){
    for(int i=1; i<=n; i++) pa[i] = i;
  }
  int find(int x){
    return pa[x] = (pa[x] == x ? x : find(pa[x]));
  }
  bool uni(int p, int q){
    p = find(p);
    q = find(q);
    if(p == q) return 0;
    pa[q] = p;
    return 1;
  }
}disj;
long long NumberOfMaps (int N, int M, int *A, int *B){
  long long sum = 0;
  for(int i=0; i<(1<<(N-1)); i++){
    disj.init(2*N);
    bool bad = 0;
    for(int j=0; j<M; j++){
      if(((i >> (A[j] - 1)) & 1) == ((i >> (B[j] - 1)) & 1)){
        disj.uni(A[j], B[j] + N);
        disj.uni(B[j], A[j] + N);
        if(disj.find(A[j]) == disj.find(A[j] + N)){
          bad = 1;
          break;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 30 / 30
• Subtask 5: 0 / 35