SRM 207 Div II Level One: TransportCounting
2013-07-07 18:44
465 查看
题目来源:http://community.topcoder.com/tc?module=ProblemDetail&rd=5853&pm=2928
这道题目看上去比较简单,但正解率只有70%,主要是要注意一下Example 4,起始位置为0的车也要算进去,所以Example 4答案是3而不是2。
代码如下:
#include <iostream>
#include <vector>
using namespace std;
class TransportCounting
{
public:
int countBuses(int speed, vector <int> positions, vector <int> velocities, int time);
};
int TransportCounting::countBuses(int speed, vector<int> positions, vector<int> velocities, int time)
{
int size = positions.size();
int yourDis, carDis, count;
yourDis = speed * time;
count = 0;
for (int i = 0; i < size; i++) {
if (0 == positions[i]) {
++count;
} else {
carDis = positions[i] + velocities[i] * time;
if (yourDis >= carDis) {
++count;
}
}
}
return count;
}
这道题目看上去比较简单,但正解率只有70%,主要是要注意一下Example 4,起始位置为0的车也要算进去,所以Example 4答案是3而不是2。
代码如下:
#include <iostream>
#include <vector>
using namespace std;
class TransportCounting
{
public:
int countBuses(int speed, vector <int> positions, vector <int> velocities, int time);
};
int TransportCounting::countBuses(int speed, vector<int> positions, vector<int> velocities, int time)
{
int size = positions.size();
int yourDis, carDis, count;
yourDis = speed * time;
count = 0;
for (int i = 0; i < size; i++) {
if (0 == positions[i]) {
++count;
} else {
carDis = positions[i] + velocities[i] * time;
if (yourDis >= carDis) {
++count;
}
}
}
return count;
}
相关文章推荐
- SRM 207 Div II Level Two: RegularSeason,字符串操作(sstream),多关键字排序( 比较函数 )
- SRM 207 Div II Level Three: CaptureThemAll,BFS算法
- SRM 219 Div II Level One: WaiterTipping,小心约分
- SRM 583 Div II Level One:SwappingDigits
- SRM 212 Div II Level One: YahtzeeScore
- SRM 222 Div II Level One: TextCompressor,求最大重复子串问题
- SRM 207 Div II Level Two: RegularSeason,字符串操作(sstream),多关键字排序(操作符重载)
- SRM 582 Div II Level One: SemiPerfectSquare
- SRM 219 Div II Level One: WaiterTipping,小心约分
- SRM 222 Div II Level Two: GroceryBagger,STL map 用法
- SRM 223 Div II Level Two: BlackAndRed,O(N)复杂度
- SRM 578 Div II Level Two: GooseInZooDivTwo, DFS
- SRM 219 Div II Level Two: HealthFood
- SRM 583 Div II Level Three:GameOnABoard,Dijkstra最短路径算法
- SRM 579 Div II Level Two: UndoHistory
- SRM 578 Div II Level Three: WolfInZooDivTwo,Dynamic Programming,求教!
- SRM 212 Div II Level Two: WinningRecord,Brute Force
- SRM 585 Div II Level Two: TrafficCongestionDivTwo
- SRM 212 Div II Level Two: WinningRecord,Brute Force
- SRM 584 Div II Level Two: Egalitarianism,DFS,BFS算法