summary refs log tree commit diff
path: root/bonusaufgabe/src/main.rs
blob: f3a03016b3157f050261b3362bb112966d7afa6e (plain)
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
use bitvec::prelude::*;
use std::borrow::Borrow;
use std::env;
use std::fmt;
use std::fs;
use std::marker::PhantomData;
use std::mem;
use std::ops::BitXor;
use std::path::Display;
use std::process;

fn main() {
    let task_file_name = match env::args().nth(1) {
        Some(x) => x,
        None => {
            eprintln!("Nutzung: bonusaufgabe <dateiname>");
            process::exit(1);
        }
    };
    let task_str = fs::read_to_string(task_file_name).expect("Datei kann nicht gelesen werden");
    let task = Task::try_from(task_str.as_str()).expect("Datei enthält keine gültige Aufgabe");

    match solve_task(task) {
        Some(solution) => println!("{}", solution),
        None => eprintln!("Keine Lösung gefunden"),
    }
}

#[derive(Clone)]
struct Card(Vec<bool>);

struct Task {
    cards: Vec<Card>,
    num_pass_cards: usize,
    bits_per_card: usize,
}

struct Solution {
    real_cards: Vec<Card>,
}

fn solve_task(task: Task) -> Option<Solution> {
    let Task {
        cards,
        num_pass_cards,
        bits_per_card,
    } = task;
    let num_cards = cards.len();
    let num_real_cards = num_pass_cards + 1;

    let mut matrix: Vec<BitVec> = vec![BitVec::with_capacity(num_cards); bits_per_card];
    for card in cards.iter() {
        for (bit_idx, bit) in card.0.iter().enumerate() {
            matrix[bit_idx].push(*bit);
        }
    }

    let mut free_vars = Vec::new();
    let mut basic_vars = Vec::new();

    let mut current_row = 0;
    let mut current_col = 0;
    while current_row < bits_per_card && current_col < num_cards {
        let pivot_row = match (current_row..bits_per_card).find(|row| matrix[*row][current_col]) {
            Some(row) => row,
            None => {
                free_vars.push(current_col);
                current_col += 1;
                continue;
            }
        };
        matrix.swap(current_row, pivot_row);
        basic_vars.push((current_row, current_col));
        for lower_row in (current_row + 1)..bits_per_card {
            if matrix[lower_row][current_col] {
                let current_row_cloned = matrix[current_row].clone();
                matrix[lower_row] ^= current_row_cloned;
            }
        }
        current_row += 1;
        current_col += 1;
    }
    free_vars.extend(current_col..num_cards);

    let num_basic_vars = basic_vars.len();
    let num_free_vars = free_vars.len();

    // Sanity Check: Nach dem Rangsatz immer erfüllt
    assert_eq!(num_basic_vars + num_free_vars, num_cards);

    for (pivot_row, pivot_col) in basic_vars.iter().rev() {
        for upper_row in (0..*pivot_row).rev() {
            if matrix[upper_row][*pivot_col] {
                let pivot_row_cloned = matrix[*pivot_row].clone();
                matrix[upper_row] ^= pivot_row_cloned;
            }
        }
    }

    print_matrix(&matrix);

    let basic_vars_terms = basic_vars
        .iter()
        .map(|(basic_var_row, _basic_var_col)| {
            free_vars
                .iter()
                .map(|free_var| matrix[*basic_var_row][*free_var])
                .collect::<BitVec>()
        })
        .collect::<Vec<BitVec>>();

    println!("num_real_cards {}", num_real_cards);
    println!("num_cards {}", num_cards);
    println!("num_free_vars {}", num_free_vars);
    println!("num_basic_vars {}", num_basic_vars);

    // std::process::exit(0);

    let mut solution = None;

    'outer: for num_ones_in_free_vars in 0..=(num_free_vars.min(num_real_cards)) {
        let mut iterator = BitSubsetIterator::new(num_free_vars, num_ones_in_free_vars);
        while let Some(free_var_values) = iterator.next() {
            // print!("trying ");
            // for b in free_var_values {
            //     if *b {
            //         print!("1");
            //     } else {
            //         print!("0");
            //     }
            // }
            // println!("");

            let basic_var_values = basic_vars_terms
                .iter()
                .map(|basic_var_term| {
                    let basic_var_solution_term = basic_var_term.clone() & free_var_values;
                    let basic_var_solution = basic_var_solution_term
                        .iter()
                        .fold(false, |acc, bit| acc ^ *bit);
                    basic_var_solution
                })
                .collect::<BitVec>();
            let num_ones_in_basic_vars = basic_var_values
                .iter()
                .filter(|solution_bit| **solution_bit)
                .count();
            let num_ones_in_solution = num_ones_in_free_vars + num_ones_in_basic_vars;

            if num_ones_in_solution == num_real_cards {
                let mut solution_vector = BitVec::<usize, Lsb0>::repeat(false, num_cards);

                for (free_var_idx, free_var_val) in free_vars.iter().zip(free_var_values.iter()) {
                    solution_vector.set(*free_var_idx, *free_var_val);
                }
                for ((_, basic_var_idx), basic_var_val) in
                    basic_vars.iter().zip(basic_var_values.iter())
                {
                    solution_vector.set(*basic_var_idx, *basic_var_val);
                }

                assert_eq!(solution_vector.count_ones(), num_real_cards);
                //TODO: more sanity checks

                print!("solution free vars ");
                for b in free_var_values {
                    if *b {
                        print!("1");
                    } else {
                        print!("0");
                    }
                }
                println!("");

                solution = Some(Solution {
                    real_cards: solution_vector
                        .into_iter()
                        .enumerate()
                        .filter(|(_card_idx, is_real)| *is_real)
                        .map(|(real_card_idx, _)| (cards[real_card_idx]).clone())
                        .collect(),
                });

                break 'outer;
            }
        }
    }

    solution
}

struct BitSubsetIterator {
    fresh: bool,
    state: BitVec<usize, Lsb0>,
}

impl BitSubsetIterator {
    fn new(set_size: usize, subset_size: usize) -> Self {
        let mut initial_state = BitVec::repeat(false, set_size);
        initial_state.get_mut(0..subset_size).unwrap().fill(true);

        Self {
            fresh: true,
            state: initial_state,
        }
    }

    fn next(&mut self) -> Option<&BitSlice> {
        if self.fresh {
            self.fresh = false;
            Some(self.state.borrow())
        } else {
            self.state
                .iter_ones()
                .enumerate()
                .find(
                    |(_num_prev_ones, one_idx)| match self.state.get(*one_idx + 1) {
                        Some(bit) => !bit,
                        None => false,
                    },
                )
                .map(|(num_prev_ones, moveable_one_idx)| {
                    self.state.set(moveable_one_idx, false);
                    self.state.set(moveable_one_idx + 1, true);
                    self.state.get_mut(0..num_prev_ones).unwrap().fill(true);
                    self.state
                        .get_mut(num_prev_ones..moveable_one_idx)
                        .unwrap()
                        .fill(false);
                    self.state.borrow()
                })
        }
    }
}

fn print_matrix(matrix: &[BitVec]) {
    for row in matrix {
        for col in row {
            if *col {
                print!("1");
            } else {
                print!("0");
            }
        }
        println!("");
    }
}

impl TryFrom<&str> for Task {
    type Error = ();

    fn try_from(value: &str) -> Result<Self, Self::Error> {
        let mut lines = value.lines();
        let first_line = lines.next().ok_or(())?;
        let mut first_line_words = first_line.split_ascii_whitespace();

        let total_num_cards_str = first_line_words.next().ok_or(())?;
        let total_num_cards = str::parse::<usize>(total_num_cards_str).map_err(|_| ())?;
        let num_pass_cards_str = first_line_words.next().ok_or(())?;
        let num_pass_cards = str::parse::<usize>(num_pass_cards_str).map_err(|_| ())?;
        let bits_per_card_str = first_line_words.next().ok_or(())?;
        let bits_per_card = str::parse::<usize>(bits_per_card_str).map_err(|_| ())?;

        let cards = lines
            .into_iter()
            .map(|line| {
                Card(
                    line.chars()
                        .flat_map(|char| match char {
                            '0' => Some(false),
                            '1' => Some(true),
                            _ => None,
                        })
                        .collect::<Vec<bool>>(),
                )
            })
            .collect::<Vec<Card>>();

        if cards.len() != total_num_cards {
            return Err(());
        }

        Ok(Task {
            cards,
            num_pass_cards,
            bits_per_card,
        })
    }
}

impl fmt::Display for Solution {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        for card in self.real_cards.iter() {
            for bit in card.0.iter() {
                match bit {
                    true => write!(f, "1")?,
                    false => write!(f, "0")?,
                };
            }
            writeln!(f, "")?;
        }
        Ok(())
    }
}