A10519 | Mishka and trip
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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:
1. XXX consists of $n$ cities, $k$ of whose (just imagine!) are capital cities.
2. All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of $i$ -th city equals to $c_{i}$ .
3. 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.
4. 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$ .
5. There is at most one road between any two cities.
6. 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 $c_{i}·c_{j}$ .
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 $c_{a}·c_{b}$ . Will you help her?
Here are some interesting facts about XXX:
1. XXX consists of $n$ cities, $k$ of whose (just imagine!) are capital cities.
2. All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of $i$ -th city equals to $c_{i}$ .
3. 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.
4. 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$ .
5. There is at most one road between any two cities.
6. 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 $c_{i}·c_{j}$ .
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 $c_{a}·c_{b}$ . Will you help her?
输入格式
The first line of the input contains two integers $n$ and $k$ ( $3<=n<=100000,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 $c_{1},c_{2},...,c_{n}$ ( $1<=c_{i}<=10000$ ) — beauty values of the cities.
The third line of the input contains $k$ distinct integers $id_{1},id_{2},...,id_{k}$ ( $1<=id_{i}<=n$ ) — indices of capital cities. Indices are given in ascending order.
The second line of the input contains $n$ integers $c_{1},c_{2},...,c_{n}$ ( $1<=c_{i}<=10000$ ) — beauty values of the cities.
The third line of the input contains $k$ distinct integers $id_{1},id_{2},...,id_{k}$ ( $1<=id_{i}<=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.
输入输出样例
输入 #1
4 1 2 3 1 2 3
输出 #1
17
输入 #2
5 2 3 5 2 2 4 1 4
输出 #2
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$ .

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$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted