-
Notifications
You must be signed in to change notification settings - Fork 10
/
counter_m.cpp
55 lines (46 loc) · 1.48 KB
/
counter_m.cpp
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
/*
* Copyright 2017-2018 Tom van Dijk, Johannes Kepler University Linz
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <iostream>
#include "oink/game.hpp"
using namespace pg;
int
main(int argc, char** argv)
{
if (argc != 2) {
std::cout << "Syntax: " << argv[0] << " N" << std::endl;
return -1;
}
int n = std::stoi(argv[1]);
Game game(3*n+3);
game.vec_init();
/* create 2n+1 pieces */
for (int i=0; i<=n; i++) {
game.init_vertex(3*i+0, i+2, (i&1));
game.init_vertex(3*i+1, 1-(i&1), (i&1));
game.init_vertex(3*i+2, 1-(i&1), 1-(i&1));
game.vec_add_edge(3*i+0, 3*i+1);
game.vec_add_edge(3*i+1, 3*i+2);
game.vec_add_edge(3*i+2, 3*i+1);
}
/* connect the pieces */
for (int i=0; i<n; i++) {
game.vec_add_edge(3*i+0, 3*i+3);
game.vec_add_edge(3*i+1, 3*i+3);
game.vec_add_edge(3*i+5, 3*i+2);
}
game.vec_finish();
game.write_pgsolver(std::cout);
}