首页 > ACM题库 > HDU-杭电 > HDU 3568-Help Johnny[解题报告]HOJ
2014
11-05

HDU 3568-Help Johnny[解题报告]HOJ

Help Johnny

问题描述 :

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. The match value of (R1, B1) and (R2, B2) is R1*B2+R2*B1. Warmouth has a generator to calculate the match value of two pairs. 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?

输入:

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.

输出:

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.

样例输入:

2
3
1 3 2 2 3 1
2
4 5 6 7

样例输出:

Case 1: 26
Case 2: 58

#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define INF 0x7fffffff
#define LL long long
#define LD long double
#define PII pair<int,int>
#define x first
#define y second
#define pb push_back
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

int main() {
 int cas,n;
 scanf("%d\n",&cas);
 for (int t=1;t<=cas;t++) {
 scanf("%d\n",&n);
 vector<LL> a(n+2),b(n+2),suma(n+2),sumb(n+2);
 for (int i=1;i<=n;i++) {
 LL p,q;
 scanf("%I64d%I64d",&p,&q);
 a[i]=p,b[i]=q;
 }
 for (int i=n;i;i--) {
 suma[i]=suma[i+1]+a[i];
 sumb[i]=sumb[i+1]+b[i];
 }
 LL ans=0;
 for (int i=1;i<=n;i++) {
 ans+=a[i]*sumb[i+1];
 ans+=b[i]*suma[i+1];
 }
 printf("Case %d: %I64d\n",t,ans);
 }
 return 0;
}