CF665B Shopping

题目描述

Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.

The store contains $ k $ items. $ n $ customers have already used the above service. Each user paid for $ m $ items. Let $ a_{ij} $ denote the $ j $ -th item in the $ i $ -th person’s order.

Due to the space limitations all the items are arranged in one single row. When Ayush receives the $ i $ -th order he will find one by one all the items $ a_{ij} $ ( $ 1<=j<=m $ ) in the row. Let $ pos(x) $ denote the position of the item $ x $ in the row at the moment of its collection. Then Ayush takes time equal to $ pos(a_{i1})+pos(a_{i2})+…+pos(a_{im}) $ for the $ i $ -th customer.

When Ayush accesses the $ x $ -th element he keeps a new stock in the front of the row and takes away the $ x $ -th element. Thus the values are updating.

Your task is to calculate the total time it takes for Ayush to process all the orders.

You can assume that the market has endless stock.

输入格式

The first line contains three integers

n

n

n ,

m

m

m and

k

k

k (

1

n

,

k

100

,

1

m

k

1\le n,k\le 100,1\le m\le k

1≤n,k≤100,1≤m≤k ) — the number of users, the number of items each user wants to buy and the total number of items at the market.

The next line contains

k

k

k distinct integers

p

l

p_{l}

pl​ (

1

<

=

p

l

<

=

k

1<=p_{l}<=k

1<=pl​<=k ) denoting the initial positions of the items in the store. The items are numbered with integers from

1

1

1 to

k

k

k .

Each of the next

n

n

n lines contains

m

m

m distinct integers

a

i

j

a_{ij}

aij​ (

1

<

=

a

i

j

<

=

k

1<=a_{ij}<=k

1<=aij​<=k ) — the order of the

i

i

i -th person.

输出格式

Print the only integer $ t $ — the total time needed for Ayush to process all the orders.

输入输出样例

样例输入1

2 2 5
3 4 1 2 5
1 5
3 1

样例输出1

14

说明/提示

Customer

1

1

1 wants the items

1

1

1 and

5

5

5 .

p

o

s

(

1

)

=

3

pos(1)=3

pos(1)=3 , so the new positions are:

[

1

,

3

,

4

,

2

,

5

]

[1,3,4,2,5]

[1,3,4,2,5] .

p

o

s

(

5

)

=

5

pos(5)=5

pos(5)=5 , so the new positions are:

[

5

,

1

,

3

,

4

,

2

]

[5,1,3,4,2]

[5,1,3,4,2] .

Time taken for the first customer is

3

+

5

=

8

3+5=8

3+5=8 .

Customer

2

2

2 wants the items

3

3

3 and

1

1

1 .

p

o

s

(

3

)

=

3

pos(3)=3

pos(3)=3 , so the new positions are:

[

3

,

5

,

1

,

4

,

2

]

[3,5,1,4,2]

[3,5,1,4,2] .

p

o

s

(

1

)

=

3

pos(1)=3

pos(1)=3 , so the new positions are:

[

1

,

3

,

5

,

4

,

2

]

[1,3,5,4,2]

[1,3,5,4,2] .

Time taken for the second customer is

3

+

3

=

6

3+3=6

3+3=6 .

Total time is

8

+

6

=

14

8+6=14

8+6=14 .

Formally

p

o

s

(

x

)

pos(x)

pos(x) is the index of

x

x

x in the current row.

思路

题上首先给了三个数

n

,

m

,

k

n,m,k

n,m,k,然后在第二行里给出了

k

k

k 个数,然后又

n

×

m

n\times m

n×m 个操作,代表每一次把这个操作的数移动到第一位,其他的往后推,每次移动的时候有一个权值(从第一个数到第这个数的相差的位置数),问的是所有权值的和,数据量不大,直接模拟就好。

看到楼上用的 vector,我这里用数组。

Code

#include <bits/stdc++.h>
using namespace std; int main()
{
int n, m, k, x, ans = 0, a[105];
scanf("%d %d %d", &n, &m, &k);
for (register int i(1); i <= k; ++i)
scanf("%d", &a[i]);
for (register int i(1); i <= n * m; ++i)
{
scanf("%d", &x);
register int j, l;
for (j = 1; j <= k; ++j)
if (a[j] == x)
break;
ans += j;
for (l = j; l >= 2; --l)
a[l] = a[l - 1];
a[1] = x;
}
printf("%d\n", ans);
return 0;
}

广告

绿树公司 - 官方网站:https://wangping-lvshu.github.io/LvshuNew/

绿树智能 - 官方网站:https://wangping-lvshu.github.io/LvshuZhineng/

(现在使用,人人均可获得300元大奖)

CF665B Shopping的更多相关文章

  1. Shopping(山东省第一届ACM省赛)

    Shopping Time Limit: 1000MS Memory limit: 65536K 题目描述 Saya and Kudo go shopping together.You can ass ...

  2. sdutoj 2154 Shopping

    http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2154 Shopping Time Limit: ...

  3. Shopping(SPFA+DFS HDU3768)

    Shopping Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Sub ...

  4. eclipse中 起动tomcat时报Multiple Contexts have a path of "/shopping"

    eclipse中 启动tomcat时报Multiple Contexts have a path of "/shopping". 这个是由于你的server服务器中的server. ...

  5. 洛谷P2732 商店购物 Shopping Offers

    P2732 商店购物 Shopping Offers 23通过 41提交 题目提供者该用户不存在 标签USACO 难度提高+/省选- 提交  讨论  题解 最新讨论 暂时没有讨论 题目背景 在商店中, ...

  6. UVALive - 6572 Shopping Malls floyd

    题目链接: http://acm.hust.edu.cn/vjudge/problem/48416 Shopping Malls Time Limit: 3000MS 问题描述 We want to ...

  7. Codeforces Gym 100803C Shopping 贪心

    Shopping 题目连接: http://codeforces.com/gym/100803/attachments Description Your friend will enjoy shopp ...

  8. Codeforces Round #332 (Div. 2) A. Patrick and Shopping 水题

    A. Patrick and Shopping Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/5 ...

  9. poj 1170 Shopping Offers

    Shopping Offers Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4696   Accepted: 1967 D ...

随机推荐

  1. django-rest-framework 基础三 认证、权限和频率

    django-rest-framework 基础三 认证.权限和频率 目录 django-rest-framework 基础三 认证.权限和频率 1. 认证 1.1 登录接口 1.2 认证 2. 权限 ...

  2. 交互式 .Net 容器版

    背景介绍 在之前的文章 - 交互式 .Net 中已经介绍了什么是交互式 .Net,文中是通过 Visual Studio Code 插件的方式实现交互式 .Net 的.现在,我们将使用容器的方式实现交 ...

  3. 151-模型-Power BI&Power Pivot模型DAX函数使用量分析

    151-模型-Power BI&Power Pivot模型DAX函数使用量分析 1.背景 我们在 Power BI 或者 Power Pivot 项目中会写很多的 DAX 表达式.在最后项目交 ...

  4. pymysql.err.OperationalError: (1054, "Unknown column 'aa' in 'field list'")(已解决)

    错误描述: 今天使用python连接mysql数据库进行数据添加时,出现报错"pymysql.err.OperationalError: (1054, "Unknown colum ...

  5. Fail2ban 配置详解 配置说明

    fail2ban的配置主要由基础配置(fail2ban.conf)和监禁配置(jail.conf)两部分组成. fail2ban的配置采用标签块"[块名]"和键值"key ...

  6. 满满干货!手把手教你实现基于eTS的分布式计算器

    最近收到很多小伙伴反馈,想基于扩展的TS语言(eTS)进行HarmonyOS应用开发,但是不知道代码该从何处写起,从0到1的过程让新手们抓狂. 本期我们将带来"分布式计算器"的开发 ...

  7. 通过CSS让图片变的清楚

    image { width: 100%; height: 100%; border-radius: 10upx; //让图片变清楚 image-rendering: -moz-crisp-edges; ...

  8. JOISC2020 题解

    Day1T1 建筑装饰4 题目链接:Day1T1 建筑装饰4 Solution 我们先考虑朴素的\(dp\)方法: 设\(dp_{i,j,k}\)表示前\(i\)个数中,选了\(j\)个\(B\)数组 ...

  9. 关于mybatis的应用

    导入依赖 <dependencies> <dependency> <groupId>org.mybatis</groupId> <artifact ...

  10. 155_模型_Power BI & Power Pivot 进销存之安全库存

    155_模型_Power BI & Power Pivot 进销存之安全库存 一.背景 谈进销存的概念时,我们也需要提及另外一个概念:安全库存. 库存周转在理想的状态下是做到零库存,但是在内部 ...