BTNK/main.cpp at level2 · novaxlong/BTNK · GitHub

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
#include <iostream>
#include <vector>
#include <cstdlib>
#include "data.h"
#include "alg.h"

using namespace std;


int main(int argc, const char* argv[]) {

    int len = 100, lambda = 3;

//    train function Q.
    initQ();
//    for (int i = 0; i < 100000; ++i) {
//        int QLLen = len, QLLambda = lambda;
//        VVI QLSeq, QLL, QLR;
//        VVD QLCost;
//        VI QLLmate, QLRmate;
//        generateSequence("../syntheticData/QLSequence.dat", QLLen, QLLambda);
//        readSequence("../syntheticData/QLSequence.dat", QLSeq);
//        splitSequence(QLSeq, QLL, QLR);
//        generateMatrix("../syntheticData/QLMatrix.dat", QLL, QLR);
//        readMatrix("../syntheticData/QLMatrix.dat", QLLen, QLCost);
//        RQL(QLCost, QLSeq);
//    }

    for (int i = 0; i < 10; ++i) {
        double btnk;
        VVI seq, L, R;
        VI Lmate, Rmate;
        PII pair;
        VVD cost;
        printf("==================================================================\n");

//        generateSequence("../syntheticData/sequence.dat", len, lambda);
        readSequence("../syntheticData/sequence.dat", seq);
        splitSequence(seq, L, R);
//        generateMatrix("../syntheticData/matrix.dat", L, R);
        readMatrix("../syntheticData/matrix.dat", len, cost);


        printf("Optimal\n");
        btnk = swapChain(cost, L, R, Lmate, Rmate, pair);
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", Lmate[j]);
        }
        printf("\n\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", Rmate[j]);
        }
        printf("\n%.3f < %d, %d >\n\n", btnk, pair.first, pair.second);
//
        printf("Online Greedy\n");
        btnk = onlineGreedy(cost, L, R, Lmate, Rmate, pair);
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", Lmate[j]);
        }
        printf("\n\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", Rmate[j]);
        }
        printf("\n%.4f < %d, %d >\n\n", btnk, pair.first, pair.second);

        printf("CandGreedy\n");
        btnk = CandGreedy(cost, L, R, Lmate, Rmate, pair);
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", Lmate[j]);
        }
        printf("\n\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", Rmate[j]);
        }
        printf("\n%.4f < %d, %d >\n\n", btnk, pair.first, pair.second);
//
        printf("RQL\n");
        btnk = QL(cost, seq, Lmate, Rmate, pair);
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < L.size(); ++j) {
            printf("%4d", Lmate[j]);
        }
        printf("\n\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", j);
        }
        printf("\n");
        for (int j = 0; j < R.size(); ++j) {
            printf("%4d", Rmate[j]);
        }
        printf("\n%.3f < %d, %d >\n\n", btnk, pair.first, pair.second);
//
        printf("==================================================================\n");
    }


    return 0;
}