当前位置: 首页>>代码示例>>C++>>正文


C++ TheProgrammingContestDivTwo::find方法代码示例

本文整理汇总了C++中TheProgrammingContestDivTwo::find方法的典型用法代码示例。如果您正苦于以下问题:C++ TheProgrammingContestDivTwo::find方法的具体用法?C++ TheProgrammingContestDivTwo::find怎么用?C++ TheProgrammingContestDivTwo::find使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在TheProgrammingContestDivTwo的用法示例。


在下文中一共展示了TheProgrammingContestDivTwo::find方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: requiredTime

    void testCase5() {
		int T = 100000;
        int requiredTime_[] = {1};
        vector<int> requiredTime(requiredTime_, requiredTime_ + (sizeof(requiredTime_) / sizeof(requiredTime_[0])));
        int expected__[] = {1, 1};
        vector<int> expected_(expected__, expected__ + (sizeof(expected__) / sizeof(expected__[0])));
        assertEquals(5, expected_, solution.find(T, requiredTime));
    }
开发者ID:y42sora,项目名称:soraSRM,代码行数:8,代码来源:TheProgrammingContestDivTwoTest.cpp

示例2: do_test

bool do_test(int T, vector<int> requiredTime, vector<int> __expected) {
    time_t startClock = clock();
    TheProgrammingContestDivTwo *instance = new TheProgrammingContestDivTwo();
    vector<int> __result = instance->find(T, requiredTime);
    double elapsed = (double)(clock() - startClock) / CLOCKS_PER_SEC;
    delete instance;

    if (__result == __expected) {
        cout << "PASSED!" << " (" << elapsed << " seconds)" << endl;
        return true;
    }
    else {
        cout << "FAILED!" << " (" << elapsed << " seconds)" << endl;
        cout << "           Expected: " << to_string(__expected) << endl;
        cout << "           Received: " << to_string(__result) << endl;
        return false;
    }
}
开发者ID:k-ori,项目名称:topcoder-offline,代码行数:18,代码来源:TheProgrammingContestDivTwo.cpp

示例3: KawigiEdit_RunTest

// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.4 (beta) modified by pivanof
bool KawigiEdit_RunTest(int testNum, int p0, vector <int> p1, bool hasAnswer, vector <int> p2) {
	cout << "Test " << testNum << ": [" << p0 << "," << "{";
	for (int i = 0; int(p1.size()) > i; ++i) {
		if (i > 0) {
			cout << ",";
		}
		cout << p1[i];
	}
	cout << "}";
	cout << "]" << endl;
	TheProgrammingContestDivTwo *obj;
	vector <int> answer;
	obj = new TheProgrammingContestDivTwo();
	clock_t startTime = clock();
	answer = obj->find(p0, p1);
	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 << "\t" << "{";
		for (int i = 0; int(p2.size()) > i; ++i) {
			if (i > 0) {
				cout << ",";
			}
			cout << p2[i];
		}
		cout << "}" << endl;
	}
	cout << "Your answer:" << endl;
	cout << "\t" << "{";
	for (int i = 0; int(answer.size()) > i; ++i) {
		if (i > 0) {
			cout << ",";
		}
		cout << answer[i];
	}
	cout << "}" << endl;
	if (hasAnswer) {
		if (answer.size() != p2.size()) {
			res = false;
		} else {
			for (int i = 0; int(answer.size()) > i; ++i) {
				if (answer[i] != p2[i]) {
					res = false;
				}
			}
		}
	}
	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;
}
开发者ID:Ziklon,项目名称:algorithms,代码行数:66,代码来源:TheProgrammingContestDivTwo.cpp


注:本文中的TheProgrammingContestDivTwo::find方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。