栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 2510 Tullia and Chocolate II

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 2510 Tullia and Chocolate II

#include <iostream>#include <vector>#include <string>#include <algorithm>using namespace std;vector<double> queries;class cSubstance{public:cSubstance( int type, double time, double n ): _type( type ), _time( time ), _n( n ){}~cSubstance(){}double getEffect( double t ){if( t < _time ) return 0;double ret = 0;if( _type == 1 )ret = 8.0*_n-(t-_time)/12.0;else ret = 2.0*_n-(t-_time)*(t-_time)/79.0;if( ret < 0 )ret = 0;return ret;}double _time;double _n;int _type;};cSubstance *subs[100];int nsubs;int main(){char buff[255];while( cin.getline( buff, 255 ) ){if( buff[0] == 'Q' ){double time;sscanf( buff+5, "%lf", &time );queries.push_back( time );continue;}char stype[25];double time;double n;sscanf( buff, "%s %lf %lf", stype, &time, &n );subs[ nsubs++ ] = new cSubstance( (string( "Coffee" ) == stype ? 0 : 1 ), time, n );}sort( queries.begin(), queries.end() );for( int i=0; i<queries.size(); i++ ){double total = 0;for( int j=0; j<nsubs; j++ )total += subs[j]->getEffect( queries[i] );if( total < 1 )total = 1;printf( "%d %.1fn", int(queries[i]), total );}for( int i=0; i<nsubs; i++ )delete subs[i];return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/377745.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号