OJ Board

plz endure my poor english
I hold that the biggest puzzle of this problem is how to build a map form the input to a graph,then we can use DFS to solve it.
we can build a matrix 2*mx2*n,every four rect describe a character '\'or'/',then its very easy to program.
I sole it in 0.020s.

it's drive me crazy...
#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<map>

using namespace std;

struct nd{
nd():a(-1),b(0){}
int a,b;
};

int main()
{
int t;
cin>>t;
while(t--)
{
int dnum;
string fuck;
cin>>dnum;
getline(cin,fuck);

map<string,int ...

#include<iostream>
#include<cstdio>

using namespace std;

long bo[3][3],maxs,maxt,cot[3],cos[3],maxa;
bool flag[3];
char cr[3]={'B','G','C'};

void se(int b)
{
if(b==0){int i;
for(i=0;i<3;++i)
{
maxs=0;

flag[i]=false;
maxs+=(bo[i][1]+bo[i][2]);

cot[b]=i;


se(1);
flag[i]=true ...

#include<iostream>
#include<cstdio>

using namespace std;

long bo[3][3],maxs,maxt,cot[3],cos[3],maxa;
bool flag[3];
char cr[3]={'B','G','C'};

void se(int b)
{
if(b==0){int i;
for(i=0;i<3;++i)
{
maxs=0;

flag =false;
maxs+=(bo [1]+bo [2]);

cot =i;


se(1);
flag =true;
}}
else ...

who can tell me if all input is zero what string should be output?