CodeForces703B Mishka and trip 数学
来源:互联网 发布:子宫肌瘤微创手术知乎 编辑:程序博客网 时间:2024/05/18 18:18
Little Mishka is a great traveller and she visited many countries. After thinking about where to travel this time, she chose XXX — beautiful, but little-known northern country.
Here are some interesting facts about XXX:
- XXX consists of n cities, k of whose (just imagine!) are capital cities.
- All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of i-th city equals to ci.
- All the cities are consecutively connected by the roads, including 1-st and n-th city, forming a cyclic route 1 — 2 — ... — n — 1. Formally, for every 1 ≤ i < n there is a road between i-th and i + 1-th city, and another one between 1-st and n-th city.
- Each capital city is connected with each other city directly by the roads. Formally, if city x is a capital city, then for every 1 ≤ i ≤ n, i ≠ x, there is a road between cities x and i.
- There is at most one road between any two cities.
- Price of passing a road directly depends on beauty values of cities it connects. Thus if there is a road between cities i and j, price of passing it equals ci·cj.
Mishka started to gather her things for a trip, but didn't still decide which route to follow and thus she asked you to help her determine summary price of passing each of the roads in XXX. Formally, for every pair of cities a and b (a < b), such that there is a road between a and b you are to find sum of products ca·cb. Will you help her?
The first line of the input contains two integers n and k (3 ≤ n ≤ 100 000, 1 ≤ k ≤ n) — the number of cities in XXX and the number of capital cities among them.
The second line of the input contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 10 000) — beauty values of the cities.
The third line of the input contains k distinct integers id1, id2, ..., idk (1 ≤ idi ≤ n) — indices of capital cities. Indices are given in ascending order.
Print the only integer — summary price of passing each of the roads in XXX.
4 12 3 1 23
17
5 23 5 2 2 41 4
71
This image describes first sample case:
It is easy to see that summary price is equal to 17.
This image describes second sample case:
It is easy to see that summary price is equal to 71.
求解首都城市到其他城市的价值之和时,用前缀和来优化,并为避免重复,每处理一个首都城市就应该在前缀和中将其出去。
#include <iostream>#include <cstdio>#include <map>#include <set>#include <vector>#include <queue>#include <stack>#include <cmath>#include <algorithm>#include <cstring>#include <string>using namespace std;#define INF 0x3f3f3f3ftypedef long long LL;int c[100005];int a[100005];bool v[100005];int main(){ int n,k; LL ans,sum; while(~scanf("%d%d",&n,&k)){ ans=0; memset(v,false,sizeof(v)); scanf("%d",&c[1]); sum=c[1]; for(int i=2;i<=n;i++){ scanf("%d",&c[i]); ans+=c[i]*c[i-1]; sum+=c[i]; } ans+=c[1]*c[n]; for(int i=1;i<=k;i++){ scanf("%d",&a[i]); v[a[i]]=true; int p=0; int q=0; if(a[i]==1){ q=n; }else if(a[i]==n){ p=-n; } sum-=c[a[i]]; LL temp=sum; if(!v[a[i]+1+p]){ temp-=c[a[i]+1+p]; } if(!v[a[i]-1+q]){ temp-=c[a[i]-1+q]; } ans+=temp*c[a[i]]; } cout<<ans<<endl;; } return 0;}
- CodeForces703B Mishka and trip 数学
- Codeforces703B Mishka and trip
- cf B. Mishka and trip (数学)
- Mishka and trip
- codeforceB. Mishka and trip
- (模拟+数学)codeforces - 703B Mishka and trip
- codeforces B. Mishka and trip
- 703B - Mishka and trip
- Mishka and trip(CF 703B)
- codeforces 703B Mishka and trip
- 【Codeforces 703B - Mishka and trip】
- Codeforces-703B Mishka and trip
- CodeForces 703B Mishka and trip(图论)
- CodeForces 703B Mishka and trip【水题】
- CodeForces 703B Mishka and trip
- CodeForces 703B Mishka and trip
- Coderforces 703B Mishka and trip
- Mishka and trip 道路权值和
- Javascript实现继承的6种方式
- 用指针实现库函数strncpy strncmp strncat
- hdu 2089(数位DP)
- HDU 2817 A sequence of numbers (数学+快速幂)
- tensorflow example
- CodeForces703B Mishka and trip 数学
- Centos6.5 双网卡配置一个上外网一个接局域网
- 基于jquery的轮播插件操作
- ThreadPoolTaskExecutor线程池
- C#实体类中在数据类型后面添加问号是什么意思
- dp_1
- 数据结构实验之二叉树二:遍历二叉树
- 互联网创业者必答题:如果腾讯复制了你的项目
- Python 之 encode()/decode()