You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
114 lines
2.5 KiB
114 lines
2.5 KiB
3 years ago
|
/**
|
||
|
|
* Checker to compare output and answer in the form:
|
||
|
|
*
|
||
|
|
* Case 1: <token> <token> ... <token>
|
||
|
|
* Case 2: <token> <token> ... <token>
|
||
|
|
* ...
|
||
|
|
* Case n: <token> <token> ... <token>
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "testlib.h"
|
||
|
|
|
||
|
|
#include <iostream>
|
||
|
|
#include <sstream>
|
||
|
|
#include <fstream>
|
||
|
|
#include <iomanip>
|
||
|
|
#include <string>
|
||
|
|
#include <cstdlib>
|
||
|
|
#include <cstdio>
|
||
|
|
#include <cstring>
|
||
|
|
#include <cmath>
|
||
|
|
#include <ctime>
|
||
|
|
#include <climits>
|
||
|
|
#include <cassert>
|
||
|
|
#include <vector>
|
||
|
|
#include <queue>
|
||
|
|
#include <stack>
|
||
|
|
#include <deque>
|
||
|
|
#include <set>
|
||
|
|
#include <map>
|
||
|
|
#include <bitset>
|
||
|
|
#include <utility>
|
||
|
|
#include <algorithm>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
#define forn(i, n) for (int i = 0; i < int(n); i++)
|
||
|
|
|
||
|
|
string token;
|
||
|
|
|
||
|
|
vector<string> readStreamCase(InStream& in, TResult pe, int testCase, bool& prereadCase)
|
||
|
|
{
|
||
|
|
if (!prereadCase)
|
||
|
|
{
|
||
|
|
string caseStr = in.readToken();
|
||
|
|
if (caseStr != "Case")
|
||
|
|
quitf(pe, "Expected 'Case' but found '%s' [test case %d]", compress(caseStr).c_str(), testCase);
|
||
|
|
}
|
||
|
|
|
||
|
|
string numExpStr;
|
||
|
|
stringstream ss;
|
||
|
|
ss << testCase;
|
||
|
|
ss >> numExpStr;
|
||
|
|
numExpStr += ":";
|
||
|
|
string numStr = in.readToken();
|
||
|
|
if (numExpStr != numStr)
|
||
|
|
quitf(pe, "Expected '%s' but found '%s' [test case %d]", compress(numExpStr).c_str(), compress(numStr).c_str(), testCase);
|
||
|
|
|
||
|
|
vector<string> result;
|
||
|
|
while (!in.seekEof())
|
||
|
|
{
|
||
|
|
in.readTokenTo(token);
|
||
|
|
if (token == "Case")
|
||
|
|
{
|
||
|
|
prereadCase = true;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
|
||
|
|
result.push_back(token);
|
||
|
|
}
|
||
|
|
|
||
|
|
return result;
|
||
|
|
}
|
||
|
|
|
||
|
|
string stringsToString(const vector<string>& a)
|
||
|
|
{
|
||
|
|
if (a.empty())
|
||
|
|
return "\"\" [size=0]";
|
||
|
|
|
||
|
|
string elems;
|
||
|
|
forn(i, a.size())
|
||
|
|
elems += a[i] + " ";
|
||
|
|
|
||
|
|
return format("\"%s\" [size=%d]", compress(trim(elems)).c_str(), (int)a.size());
|
||
|
|
}
|
||
|
|
|
||
|
|
int main(int argc, char* argv[])
|
||
|
|
{
|
||
|
|
setName("Tokens checker with testcase-support");
|
||
|
|
registerTestlibCmd(argc, argv);
|
||
|
|
|
||
|
|
int testCase = 0;
|
||
|
|
|
||
|
|
bool ansPrereadCase = false;
|
||
|
|
bool oufPrereadCase = false;
|
||
|
|
|
||
|
|
while (!ans.seekEof())
|
||
|
|
{
|
||
|
|
testCase++;
|
||
|
|
|
||
|
|
vector<string> ja = readStreamCase(ans, _fail, testCase, ansPrereadCase);
|
||
|
|
vector<string> pa = readStreamCase(ouf, _pe, testCase, oufPrereadCase);
|
||
|
|
|
||
|
|
if (ja != pa)
|
||
|
|
{
|
||
|
|
string js = stringsToString(ja);
|
||
|
|
string ps = stringsToString(pa);
|
||
|
|
quitf(_wa, "Sequences differ: jury has %s, but participant has %s [test case %d]", js.c_str(), ps.c_str(), testCase);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
quitf(_ok, "%d test cases(s)", testCase);
|
||
|
|
}
|