TC SRM 588

这套题做的挺顺的……

250pt：

给N首歌，每首歌需要一定的时间演唱，两首歌之间会花音高差的时间进行调整，问在给定时间内最多能唱多少首歌。

首先唱歌的顺序最优方案的音高肯定是单调的，所以排序之后直接DP就行了。

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<cstring>

using namespace std;

int f[100][100];

struct rec
{
    int d,t;
    rec(){}
    rec(int a,int b)
    {
        d=a;t=b;
    }
    bool operator<(const rec &a)const
    {
        return t<a.t;
    }
}z[100];

class GUMIAndSongsDiv1 {
public:
    int maxSongs(vector <int> duration, vector <int> tone, int T) {
        int n=duration.size();
        for (int a=0;a<n;a++)
            z[a]=rec(duration[a],tone[a]);
        sort(z,z+n);
        memset(f,0x3f,sizeof(f));
        f[0][0]=0;
        f[0][1]=z[0].d;
        for (int a=1;a<n;a++)
            for (int b=0;b<=a+1;b++)
                if (!b) f[a][b]=0;
                else
                {
                    for (int c=0;c<a;c++)
                        f[a][b]=min(f[a][b],f[c][b-1]+z[a].d+(b==1 ? 0 : z[a].t-z[c].t));
                }
        int ans=0;
        for (int a=0;a<n;a++)
            for (int b=1;b<=n;b++)
                if (f[a][b]<=T) ans=max(ans,b);
        return ans;
        
    }
};


//<%:testing-code%>
//Powered by KawigiEdit 2.1.4 (beta) modified by pivanof!
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, vector <int> p0, vector <int> p1, int p2, bool hasAnswer, int p3) {
    cout << "Test " << testNum << ": [" << "{";
    for (int i = 0; int(p0.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p0[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p1.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p1[i];
    }
    cout << "}" << "," << p2;
    cout << "]" << endl;
    GUMIAndSongsDiv1 *obj;
    int answer;
    obj = new GUMIAndSongsDiv1();
    clock_t startTime = clock();
    answer = obj->maxSongs(p0, p1, p2);
    clock_t endTime = clock();
    delete obj;
    bool res;
    res = true;
    cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
    if (hasAnswer) {
        cout << "Desired answer:" << endl;
        cout << "	" << p3 << endl;
    }
    cout << "Your answer:" << endl;
    cout << "	" << answer << endl;
    if (hasAnswer) {
        res = answer == p3;
    }
    if (!res) {
        cout << "DOESN'T MATCH!!!!" << endl;
    } else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
        cout << "FAIL the timeout" << endl;
        res = false;
    } else if (hasAnswer) {
        cout << "Match :-)" << endl;
    } else {
        cout << "OK, but is it right?" << endl;
    }
    cout << "" << endl;
    return res;
}
int main() {
    bool all_right;
    all_right = true;
    
    vector <int> p0;
    vector <int> p1;
    int p2;
    int p3;
    
    {
    // ----- test 0 -----
    int t0[] = {3,5,4,11};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    int t1[] = {2,1,3,1};
            p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
    p2 = 17;
    p3 = 3;
    all_right = KawigiEdit_RunTest(0, p0, p1, p2, true, p3) && all_right;
    // ------------------
    }
    
    {
    // ----- test 1 -----
    int t0[] = {100,200,300};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    int t1[] = {1,2,3};
            p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
    p2 = 99;
    p3 = 0;
    all_right = KawigiEdit_RunTest(1, p0, p1, p2, true, p3) && all_right;
    // ------------------
    }
    
    {
    // ----- test 2 -----
    int t0[] = {1,2,3,4};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    int t1[] = {1,1,1,1};
            p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
    p2 = 100;
    p3 = 4;
    all_right = KawigiEdit_RunTest(2, p0, p1, p2, true, p3) && all_right;
    // ------------------
    }
    
    {
    // ----- test 3 -----
    int t0[] = {9,11,13,17};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    int t1[] = {2,1,3,4};
            p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
    p2 = 20;
    p3 = 1;
    all_right = KawigiEdit_RunTest(3, p0, p1, p2, true, p3) && all_right;
    // ------------------
    }
    
    {
    // ----- test 4 -----
    int t0[] = {87,21,20,73,97,57,12,80,86,97,98,85,41,12,89,15,41,17,68,37,21,1,9,65,4,67,38,91,46,82,7,98,21,70,99,41,21,65,11,1,8,12,77,62,52,69,56,33,98,97};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    int t1[] = {88,27,89,2,96,32,4,93,89,50,58,70,15,48,31,2,27,20,31,3,23,86,69,12,59,61,85,67,77,34,29,3,75,42,50,37,56,45,51,68,89,17,4,47,9,14,29,59,43,3};
            p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
    p2 = 212;
    p3 = 12;
    all_right = KawigiEdit_RunTest(4, p0, p1, p2, true, p3) && all_right;
    // ------------------
    }
    
    if (all_right) {
        cout << "You're a stud (at least on the example cases)!" << endl;
    } else {
        cout << "Some of the test cases had errors." << endl;
    }
    return 0;
}
// END KAWIGIEDIT TESTING

450pt：

红绿白三种颜色的钥匙，白色钥匙可以随意变成红色或者绿色，开每扇门会消耗掉一定的红色或者绿色钥匙，然后又会得到一定的钥匙数，问能得到的最多的钥匙总数是多少。

首先因为门的数量不多所以直接状压，并且我们发现如果没有白钥匙是很好做的，所以我们第二维记录将多少白色钥匙变为红色钥匙，这样可以就将白色钥匙的影响成功消除掉，然后每次枚举下一个选哪扇门并且如何分配白钥匙即可。

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<cstring>

using namespace std;

int sum[1<<13][3];

bool f[1<<13][200];

class KeyDungeonDiv1 {
public:
    int maxKeys(vector <int> doorR, vector <int> doorG, vector <int> roomR, vector <int> roomG, vector <int> roomW, vector <int> keys) {    
        int n=doorR.size();
        int sumw=keys[2];
        for (int a=0;a<n;a++)
            sumw+=roomW[a];
        for (int a=0;a<(1<<n);a++)
        {
            for (int b=0;b<3;b++)
                sum[a][b]=keys[b];
            for (int b=0;b<n;b++)
                if (a&(1<<b)) sum[a][0]+=roomR[b]-doorR[b],sum[a][1]+=roomG[b]-doorG[b],sum[a][2]+=roomW[b];
        }
        memset(f,false,sizeof(f));
        for (int a=0;a<=keys[2];a++)
            f[0][a]=true;
        for (int a=0;a<(1<<n)-1;a++)
            for (int b=0;b<=sumw;b++)
                if (f[a][b])
                {
                    int r=sum[a][0]+b,g=sum[a][1]+sum[a][2]-b;
                    for (int c=0;c<n;c++)
                        if (!((a>>c)&1) && r>=doorR[c] && g>=doorG[c])
                        {
                            for (int d=0;d<=roomW[c];d++)
                                f[a|(1<<c)][b+d]=true;
                        }
                }
        int ans=0;
        for (int a=0;a<(1<<n);a++)
        {
            bool exist=false;
            for (int b=0;b<=sumw;b++)
                if (f[a][b])
                {
                    exist=true;
                    break;
                }
            if (exist) ans=max(ans,sum[a][0]+sum[a][1]+sum[a][2]);
        }
        return ans;
    }
};


//<%:testing-code%>
//Powered by KawigiEdit 2.1.4 (beta) modified by pivanof!
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, vector <int> p0, vector <int> p1, vector <int> p2, vector <int> p3, vector <int> p4, vector <int> p5, bool hasAnswer, int p6) {
    cout << "Test " << testNum << ": [" << "{";
    for (int i = 0; int(p0.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p0[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p1.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p1[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p2.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p2[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p3.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p3[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p4.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p4[i];
    }
    cout << "}" << "," << "{";
    for (int i = 0; int(p5.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << p5[i];
    }
    cout << "}";
    cout << "]" << endl;
    KeyDungeonDiv1 *obj;
    int answer;
    obj = new KeyDungeonDiv1();
    clock_t startTime = clock();
    answer = obj->maxKeys(p0, p1, p2, p3, p4, p5);
    clock_t endTime = clock();
    delete obj;
    bool res;
    res = true;
    cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
    if (hasAnswer) {
        cout << "Desired answer:" << endl;
        cout << "	" << p6 << endl;
    }
    cout << "Your answer:" << endl;
    cout << "	" << answer << endl;
    if (hasAnswer) {
        res = answer == p6;
    }
    if (!res) {
        cout << "DOESN'T MATCH!!!!" << endl;
    } else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
        cout << "FAIL the timeout" << endl;
        res = false;
    } else if (hasAnswer) {
        cout << "Match :-)" << endl;
    } else {
        cout << "OK, but is it right?" << endl;
    }
    cout << "" << endl;
    return res;
}
int main() {
    bool all_right;
    all_right = true;

    vector <int> p0;
    vector <int> p1;
    vector <int> p2;
    vector <int> p3;
    vector <int> p4;
    vector <int> p5;
    int p6;

    {
        // ----- test 0 -----
        int t0[] = {1,2,3};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {0,4,9};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {0,0,10};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] = {0,8,9};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {1,0,8};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {3,1,2};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 8;
        all_right = KawigiEdit_RunTest(0, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 1 -----
        int t0[] = {1,1,1,2};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {0,2,3,1};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {2,1,0,4};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] = {1,3,3,1};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {1,0,2,1};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {0,4,0};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 4;
        all_right = KawigiEdit_RunTest(1, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 2 -----
        int t0[] = {2,0,4};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {3,0,4};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {0,0,9};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] = {0,0,9};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {8,5,9};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {0,0,0};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 27;
        all_right = KawigiEdit_RunTest(2, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 3 -----
        int t0[] = {5,3,0,0};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {0,1,2,1};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {0,9,2,4};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] = {2,9,2,0};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {0,9,1,1};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {1,1,0};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 32;
        all_right = KawigiEdit_RunTest(3, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 4 -----
        int t0[] = {9,5,10,8,4,3,0,8,4,1,3,9};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {9,10,0,8,9,4,3,8,1,8,10,4};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {1,2,0,2,3,3,5,3,1,3,0,5};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] = {5,2,5,0,5,2,3,4,0,0,5,2};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {1,5,1,2,0,4,4,0,3,3,1,3};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {5,0,1};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 16;
        all_right = KawigiEdit_RunTest(4, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 5 -----
        int t0[] = {8, 4, 3, 6, 1, 8, 0, 3, 6, 2, 1, 5};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {1, 7, 5, 9, 0, 3, 9, 1, 9, 3, 0, 8};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] =  {2, 1, 2, 1, 0, 2, 2, 3, 3, 0, 2, 0};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] ={0, 2, 1, 0, 3, 2, 2, 2, 3, 0, 2, 0};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] = {2, 0, 1, 3, 1, 3, 3, 2, 0, 1, 0, 1};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] = {1, 3, 0};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 11;
        all_right = KawigiEdit_RunTest(4, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    {
        // ----- test 6 -----
        int t0[] = {6, 7, 7, 5, 5, 6, 9, 7, 4, 8, 7, 9};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        int t1[] = {5, 4, 3, 2, 4, 4, 3, 2, 3, 3, 5, 2};
        p1.assign(t1, t1 + sizeof(t1) / sizeof(t1[0]));
        int t2[] = {4, 5, 5, 3, 2, 6, 4, 3, 6, 3, 2, 6};
        p2.assign(t2, t2 + sizeof(t2) / sizeof(t2[0]));
        int t3[] ={10, 10, 7, 7, 10, 7, 10, 8, 9, 5, 8, 10};
        p3.assign(t3, t3 + sizeof(t3) / sizeof(t3[0]));
        int t4[] ={1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2};
        p4.assign(t4, t4 + sizeof(t4) / sizeof(t4[0]));
        int t5[] ={3, 1, 7};
        p5.assign(t5, t5 + sizeof(t5) / sizeof(t5[0]));
        p6 = 61;
        all_right = KawigiEdit_RunTest(4, p0, p1, p2, p3, p4, p5, true, p6) && all_right;
        // ------------------
    }

    if (all_right) {
        cout << "You're a stud (at least on the example cases)!" << endl;
    } else {
        cout << "Some of the test cases had errors." << endl;
    }
    return 0;
}
// END KAWIGIEDIT TESTING

1100pt：

两个人在一棵树上玩游戏，轮流动。如果两人处在同一个位置，第一个人赢，如果一定回合之后第一个人没赢那么就算第二个人赢。第一个人会在游戏开始前确定他每一步的移动，并且第二个人会根据他的移动来做出相应的策略，问谁胜。

分情况讨论证明证明什么的……证明和结论都好复杂的样子……看TC上的题解吧……

#include <vector>
#include <list>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<cstring>

using namespace std;

char map[100][100];

int dist[2][100][100],bx[5],by[5];

void calc(int x,int y,int z,int d,int prex,int prey)
{
    if (map[x][y]=='#') return;
    dist[z][x][y]=d;
    for (int a=1;a<=4;a++)
    {
        int xx=x+bx[a];
        int yy=y+by[a];
        if (xx!=prex || yy!=prey) calc(xx,yy,z,d+1,x,y);
    }
}

int calc(int x,int y,int prex,int prey)
{
    if (map[x][y]=='#') return 0;
    int d=0;
    for (int a=1;a<=4;a++)
    {
        int xx=x+bx[a];
        int yy=y+by[a];
        if (xx!=prex || yy!=prey) d=max(d,calc(xx,yy,x,y));
    }
    return d+1;
}

class GameInDarknessDiv1 {
public:
    string check(vector <string> field) {
        bx[1]=1;bx[2]=-1;by[3]=1;by[4]=-1;
        int n=field.size();
        int m=field[0].size();
        for (int a=0;a<n;a++)
            for (int b=0;b<m;b++)
                map[a+1][b+1]=field[a][b];
        for (int a=0;a<=n+1;a++)
            map[a][0]=map[a][m+1]='#';
        for (int a=0;a<=m+1;a++)
            map[0][a]=map[n+1][a]='#';
        memset(dist,0,sizeof(dist));
        for (int a=1;a<=n;a++)
            for (int b=1;b<=m;b++)
                if (map[a][b]=='A') calc(a,b,0,0,-1,-1);
                else 
                {
                    if (map[a][b]=='B') calc(a,b,1,0,-1,-1);
                }
        for (int a=1;a<=n;a++)
            for (int b=1;b<=m;b++)
                if (dist[0][a][b]-dist[1][a][b]>=2)
                {
                    int cnt=0;
                    for (int c=1;c<=4;c++)
                        cnt+=(calc(a+bx[c],b+by[c],a,b)>=3);
                    if (cnt>=3) return "Bob wins";
                }
        return "Alice wins";
        
    }
};


//<%:testing-code%>
//Powered by KawigiEdit 2.1.4 (beta) modified by pivanof!
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, vector <string> p0, bool hasAnswer, string p1) {
    cout << "Test " << testNum << ": [" << "{";
    for (int i = 0; int(p0.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << """ << p0[i] << """;
    }
    cout << "}";
    cout << "]" << endl;
    GameInDarknessDiv1 *obj;
    string answer;
    obj = new GameInDarknessDiv1();
    clock_t startTime = clock();
    answer = obj->check(p0);
    clock_t endTime = clock();
    delete obj;
    bool res;
    res = true;
    cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
    if (hasAnswer) {
        cout << "Desired answer:" << endl;
        cout << "	" << """ << p1 << """ << endl;
    }
    cout << "Your answer:" << endl;
    cout << "	" << """ << answer << """ << endl;
    if (hasAnswer) {
        res = answer == p1;
    }
    if (!res) {
        cout << "DOESN'T MATCH!!!!" << endl;
    } else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
        cout << "FAIL the timeout" << endl;
        res = false;
    } else if (hasAnswer) {
        cout << "Match :-)" << endl;
    } else {
        cout << "OK, but is it right?" << endl;
    }
    cout << "" << endl;
    return res;
}
int main() {
    bool all_right;
    all_right = true;
    
    vector <string> p0;
    string p1;
    
    {
    // ----- test 0 -----
    string t0[] = {"A.B..","##.##","##.##"};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Alice wins";
    all_right = KawigiEdit_RunTest(0, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 1 -----
    string t0[] = {"A.B..",".#.#.","#..##"};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Bob wins";
    all_right = KawigiEdit_RunTest(1, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 2 -----
    string t0[] = {"#...#",".#A#.","..B..",".#.#.","#...#"};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Alice wins";
    all_right = KawigiEdit_RunTest(2, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 3 -----
    string t0[] = {"##..#","A.#..","#B..#","#.##.","....."};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Alice wins";
    all_right = KawigiEdit_RunTest(3, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 4 -----
    string t0[] = {"##################################################","###..................#................#........###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###.################.########.#######.########.###","###..........#######........#.#######........#.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########.###","############.#######.########.#######.########"
            ".###","###B.........#######..........#######..A.......###","##################################################"};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Bob wins";
    all_right = KawigiEdit_RunTest(4, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 5 -----
    string t0[] = {"###.#","###..","A..B#","###..","###.#"};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Alice wins";
    all_right = KawigiEdit_RunTest(5, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 6 -----
    string t0[] = {".....#.##.##.#.#",".###.#.##.##....","#......B#...#.#.","#.#A#.#.#.#..##.","...#..#....#...."};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Alice wins";
    all_right = KawigiEdit_RunTest(6, p0, true, p1) && all_right;
    // ------------------
    }
    
    {
    // ----- test 7 -----
    string t0[] = {"...#.....###....#.....#...#.#.",".#..#.##..#..#.#..###...#.....","..#..#..#...#.#..#....##.#.###",".#.#...###.#..#.#..###....#...","...##.###..#.#..#.#...#.##..#.",".#..#..#..#...#.#.#.#.#..#.#..","..#..#.#.#..#..##.#.#..#.##..#",".#.###.#.##..#.....A##......#.","#.........#.#..#.###..###.#...","..###.#.#.#..#.#....#.....#.#.",".#..#.#.####.#..#.#..#.#.###..","..#...#...#..#.#...#.#..#.#..#","#..#.#..#.#.#..###.#.#.#....#.","..#..##.##...#....#..#.#.####.","#..#...#...#..#.#..###.#......","#.#.##...#..#..#.#....#..#.#.#","....#..##.#..#....#.#.#.#...#.",".#.#..#....#.#.##..#..##..#.#.","..##.#..##.#..#..#..#...#.#...","#.#..##..#..#..#..#..##.#.#.#.","..#.#.#.#.#..#...##.#...#..#..",".##.....#..#.#.#.#..#.##.#..#.","...#.#.#..#..#.###.#..#...#.#.",".#..#....#..#.#...###.#.#..#..",".#.#.#####.#....#..#..#.##.#.#",".#...#......#.#..###B#....#...","..###..####.#..#.#...#.#.#..#.","#.#..#.#..#.#.#..#.#..#....#..","..#.##..#.#.#.####..#.#####..#","#.....#...#.#......#.......#.."};
            p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
    p1 = "Bob wins";
    all_right = KawigiEdit_RunTest(7, p0, true, p1) && all_right;
    // ------------------
    }
    
    if (all_right) {
        cout << "You're a stud (at least on the example cases)!" << endl;
    } else {
        cout << "Some of the test cases had errors." << endl;
    }
    return 0;
}
// END KAWIGIEDIT TESTING