2674.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 53 行

Problem Id:2674  User Id:fzk 
Memory:9316K  Time:640MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <algorithm>
#include <memory.h>
#include <math.h>
#include <string.h>

using namespace std;

struct person
{
	double pos;
	bool dir;
	char *name;
}p[32010];

bool cmp( person a, person b )
{
	return a.pos < b.pos;
};

char w[32010][300];
int n;
double l, v;

bool init( )
{
	int i;
	char s[100];

	scanf( "%d", &n );
	if( n <= 0 )
		return false;
	scanf( "%lf %lf", &l, &v );

	for( i=0; i<n; i++ )
	{
		scanf( "%1s %lf %s" , s, &p[i].pos, w[i] );
		p[i].name = w[i];
		p[i].dir = ( s[0] == 'p' || s[0] == 'P' );
	}

	sort( p, p+n, cmp );

	return true;
}