文档章节

7_12_2013 F: Help Johnny

電泡泡
 電泡泡
发布于 2013/07/19 18:10
字数 435
阅读 11
收藏 0

Problem F: Help Johnny

Time Limit: 1 Sec   Memory Limit: 128 MB
Submit: 100   Solved: 42
[ Submit][ Status][ Web Board]

Description

Poor Johnny is so busy this term. His tutor threw lots of hard problems to him and demanded him to 
accomplish those problems in a month. What a wicked tutor! After cursing his tutor thousands of times, 
Johnny realized that he must start his work immediately.  
The very problem Johnny should solve firstly is about a strange machine called Warmouth. In the Warmouth 
there are many pairs of balls. Each pair consists of a red ball and a blue ball and each ball is assigned a value. 
We can represent a pair in the form of (R, B) in which R is the value of the red ball and B is of the blue one. 
Warmouth has a generator to calculate the match value of two pairs. The match value of (R1, B1) and (R2, 
B2) is R1*B2+R2*B1. Initially, Warmouth is empty. Pairs are sent into Warmouth in order. Once a new pair 
comes, it will be taken into the generator with all the pairs already in Warmouth.  
Johnny’s work is to tell his tutor the sum of all match values given the list of pairs in order. As the best 
friend of Johnny, would you like to help him? 

Input

The first line of the input is T (no more than 10), which stands for the number of lists Johnny received.  
Each list begins with “N“(without quotes). N is the number of pairs of this list and is no more than 100000. 
The next line gives N pairs in chronological order. The 2i-th number is the value of the red ball of the i-th 
pair and the (2i+1)-th number is the value of the blue ball of the i-th pair. The numbers are positive integers 
and smaller than 100000. 

Output

Please output the result in a single line for each list.  

Sample Input

2

 3 

 1 3 2 2 3 1 

 2

 4 5 6 7

Sample Output

26 

 58

#include <stdio.h>
#include <iostream>
using namespace std;

int
main()
{
    //freopen("help.in", "r", stdin);
    //freopen("HELP.out", "w", stdout);
    int n, tu, a[100010], b[100010];
    long long int sum, sa, sb;
    cin>>tu;
    while(tu--){
        sum=sa=sb=0;
        cin>>n;
        for(int i=0; i<n; i++){
            cin>>a[i]>>b[i];
            sa+=a[i];
            sb+=b[i];
        }
        for(int i=0; i<n; i++){
            sum+=a[i]*(sb-b[i])+b[i]*(sa-a[i]);
        }
        cout<<sum/2<<endl;
    }
    return 0;
}


© 著作权归作者所有

共有 人打赏支持
電泡泡
粉丝 23
博文 183
码字总数 69717
作品 0
衡阳
私信 提问
Windows开发的几个下载地址

Microsoft Windows SDK for Windows 7 and .NET Framework 4 (ISO) The Windows SDK provides tools, compilers, headers, libraries, code samples, and a new help system that developers......

北上广深
2014/10/30
0
0
Codeforces 626G Raffles(贪心+线段树)

2 using namespace std; 3 const int maxn = 2e5+6; 4 inline int read() 5 { 6 int x=0,f=1;char ch=getchar(); 7 while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} 8 while(ch>='0'&......

angel_kitty
2017/06/29
0
0
find命令之xargs

在使用 find命令的-exec选项处理匹配到的文件时, find命令将所有匹配到的文件一起传递给exec执行。但有些系统对能够传递给exec的命令长度有限制,这样在find命令运行几分钟之后,就会出现溢...

mengbo2006214
2017/09/21
0
0
【极客之作】快到极致的Android模拟器——Genymotion

转载声明:Ryan的博客文章欢迎您的转载,但在转载的同时,请注明文章的来源出处,不胜感激! :-) http://my.oschina.net/ryanhoo/blog/141824 还在用Android原生模拟器? 给你推荐一款全方位...

RyanHoo
2013/07/02
0
44
求高手关注,关于梅花桩问题

ohnny Q在你的帮助下终于进入了城堡,现在出现在他面前的是一条恐怖的黑水河。河中有大量传说中的食人怪兽------法克鱿,同时还有一个N层正三角梅花桩阵,每个桩上都印有一个数字,如图所示是一个...

小辉211
2012/05/27
622
11

没有更多内容

加载失败,请刷新页面

加载更多

四、RabbitMQ3.7在CentOS7下的安装

安装依赖 sudo yum install -y gcc gcc-c++ glibc-devel make ncurses-devel openssl-devel autoconf java-1.8.0-openjdk-devel git 创建yum源 vi /etc/yum.repos.d/rabbitmq-erlang.repo [......

XuePeng77
今天
2
0
android 延长Toast的时长

示例:myToast(5000,"hello"); public void myToast(int showTime, String msg) { Toast hello = Toast.makeText(getActivity(), msg, Toast.LENGTH_SHORT); new CountDownTimer(......

雨焰
昨天
4
0
浅谈mybatis的日志适配模式

Java开发中经常用到的日志框架有很多,Log4j、Log4j2、slf4j等等,Mybatis定义了一套统一的日志接口供上层使用,并为上述常用的日志框架提供了相应的适配器。有关适配器模式例子可以参考 设计...

算法之名
昨天
13
0
大数据教程(13.6)sqoop使用教程

上一章节,介绍了sqoop数据迁移工具安装以及简单导入实例的相关知识;本篇博客,博主将继续为小伙伴们分享sqoop的使用。 一、sqoop数据导入 (1)、导入关系表到HIVE ./sqoop import --connect...

em_aaron
昨天
3
0
Git cherry-pick 使用总结

应用背景:假设现在有两个分支:dev_01, dev_02. 如果我想把dev_01分支上的某几个commit合并到dev_02分支, 那么怎么办呢? 这就是cherry-pick的工作了。cherry-pick会捡选某些commit, 即把某...

天王盖地虎626
昨天
9
0

没有更多内容

加载失败,请刷新页面

加载更多

返回顶部
顶部