B. Teams Formation

link

http://codeforces.com/contest/878/problem/B

describe

This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant from the city ai.

Today the bus has completed m trips, each time bringing n participants. The participants were then aligned in one line in the order they arrived, with people from the same bus standing in the order of their seats (i. e. if we write down the cities where the participants came from, we get the sequence a1, a2, ..., an repeated m times).

After that some teams were formed, each consisting of k participants form the same city standing next to each other in the line. Once formed, teams left the line. The teams were formed until there were no k neighboring participants from the same city.

Help the organizers determine how many participants have left in the line after that process ended. We can prove that answer doesn't depend on the order in which teams were selected.

Input

The first line contains three integers n, k and m (1 ≤ n ≤ 105, 2 ≤ k ≤ 109, 1 ≤ m ≤ 109).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105), where ai is the number of city, person from which must take seat i in the bus.

Output

Output the number of remaining participants in the line.

Examples

input

4 2 5

1 2 3 1

output

12

input

1 9 10

1

output

1

input

3 2 10

1 2 1

output

0

Note

In the second example, the line consists of ten participants from the same city. Nine of them will form a team. At the end, only one participant will stay in the line.

题意

给你长度为n的序列,现在把这个序列重复写m次,然后消去长度为k的相同序列,消去若干次之后,问最后剩下什么。

题解

首先预先先把能消除的消除了。然后我们把这个序列切成三块,l+mid+r,其中l和r是能够互相消去的。

假设l和r拼在一起,最后消成了p。

那么最后答案一定是这样的构成 l+mid+p+mid+p+....+p+mid+r这样的。

最后分p是否消除完来讨论即可。

如果p的长度为0,那么我们还得考虑多个mid合在一起的情况。

我的代码写的很丑。。。因为一开始我写的时候少考虑很多种情况,后面修修改改才过去的。

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+7;
int n,k,m,x,p,tot;
int val[maxn],cnt[maxn],val2[maxn],cnt2[maxn];
int a[maxn];
int main(){
scanf("%d%d%d",&n,&k,&m);
for(int i=0;i<n;i++){
scanf("%d",&x);
a[tot]=x;
cnt[tot]=1;
if(tot>0&&a[tot]==a[tot-1])cnt[tot]=cnt[tot-1]+1;
if(cnt[tot]>=k){
tot-=k;
}
tot++;
}
memset(cnt,0,sizeof(cnt));
for(int i=0;i<tot;i++){
x=a[i];
if(p>0&&x==val[p-1]){
cnt[p-1]++;
}else{
val[p]=x;
cnt[p]=1;
p++;
}
}
tot=0;
for(int i=0;i<p;i++){
cnt[i]%=k;
val2[i]=val[i];
cnt2[i]=cnt[i];
}
long long ans = 0;
for(int i=0;i<p;i++){
ans+=cnt[i];
}
if(p==1){
cout<<1ll*ans*m%k<<endl;
return 0;
}
if(m==1){
cout<<1ll*ans<<endl;
return 0;
}
for(int i=0;i<p;i++){
if(cnt2[i]==0)continue;
val[tot]=val2[i];
cnt[tot]=cnt2[i];
tot++;
}
if(val[0]!=val[tot-1]){
cout<<1ll*ans*m<<endl;
return 0;
}
int l = 0,r = tot-1;
int he = 0;
long long solve = 0;
long long deal = 0;
long long cntl=0,cntr=0;
while(he==0&&l<r){
if(val[l]==val[r]){
cntl+=cnt[l];
cntr+=cnt[r];
deal+=(cnt[l]+cnt[r]);
if((cnt[l]+cnt[r])%k){
solve+=(cnt[l]+cnt[r])%k;
he = 1;
break;
}
}else{
break;
}
l++;
r--;
}
long long mid = ans-deal;
//cout<<cntl<<" "<<cntr<<" "<<mid<<" "<<solve<<" "<<he<<endl;
if(val[0]==val[tot-1]&&he){
cout<<cntl+cntr+mid*m+solve*(m-1)<<endl;
return 0;
}
// cout<<r<<" "<<l<<endl;
int flag = r>l?0:1;
if(flag==0){
cout<<cntl+cntr+mid*m<<endl;
return 0;
}else if(mid*m%k==0){
cout<<(cntl+cntr)%k<<endl;
}else{
cout<<(cntl+cntr+mid*m%k)<<endl;
}
}

Codeforces Round #443 (Div. 1) B. Teams Formation的更多相关文章

  1. Codeforces Round #443 (Div. 2) 【A、B、C、D】

    Codeforces Round #443 (Div. 2) codeforces 879 A. Borya's Diagnosis[水题] #include<cstdio> #inclu ...

  2. Codeforces Round #443 Div. 1

    A:考虑每一位的改变情况,分为强制变为1.强制变为0.不变.反转四种,得到这个之后and一发or一发xor一发就行了. #include<iostream> #include<cst ...

  3. Codeforces Round #443 (Div. 1) D. Magic Breeding 位运算

    D. Magic Breeding link http://codeforces.com/contest/878/problem/D description Nikita and Sasha play ...

  4. Codeforces Round #443 (Div. 1) A. Short Program

    A. Short Program link http://codeforces.com/contest/878/problem/A describe Petya learned a new progr ...

  5. Codeforces Round #443 (Div. 2) C. Short Program

    C. Short Program time limit per test 2 seconds memory limit per test 256 megabytes input standard in ...

  6. Codeforces Round #443 (Div. 1) C. Tournament

    题解: 思路挺简单 但这个set的应用好厉害啊.. 我们把它看成图,如果a存在一门比b大,那么a就可以打败b,a——>b连边 然后求强联通分量之后最后顶层的强联通分量就是能赢的 但是因为是要动态 ...

  7. Codeforces Round #443 (Div. 2)

    C. Short Program Petya learned a new programming language CALPAS. A program in this language always ...

  8. Codeforces Round #443 (Div. 2) C 位运算

    C. Short Program time limit per test 2 seconds memory limit per test 256 megabytes input standard in ...

  9. 【Codeforces Round #443 (Div. 2) A】Borya's Diagnosis

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 模拟 [代码] #include <bits/stdc++.h> using namespace std; const ...

随机推荐

  1. Html中,id、name、class、type的区别

    <input type="text" name="name" id="name" class="txt"> ...

  2. MySQL 官方 Docker 镜像的使用

    首先是pull image,这里我拉取的是5.6.35: $ sudo docker pull mysql:5.6.35 拉下来以后大可以按照官方的说明无脑启动,但是外部无法访问,所以绑定端口: $ ...

  3. noip2012

    题解: 闲着无聊做了一遍noip2012 我觉得出题出的好奇怪啊... 为什么两道倍增两道二分答案??? 两天第一题: 第一天第一题傻逼普及组题没什么好说的了 第二天第一题你会扩欧就秒了 两天第二题: ...

  4. FastJson 支持配置的PropertyNamingStrategy四种策略

    摘要: FastJson默认使用CamelCase,在1.2.15版本之后,FastJson支持配置PropertyNamingStrategy,支持四种策略: CamelCase.PascalCas ...

  5. nginx与php-fpm通信的两种方式

    简述 在linux中,nginx服务器和php-fpm可以通过tcp socket和unix socket两种方式实现. unix socket是一种终端,可以使同一台操作系统上的两个或多个进程进行数 ...

  6. TopCoder SRM500 Div1 1000 其他

    原文链接https://www.cnblogs.com/zhouzhendong/p/SRM500-1000.html SRM500 Div1 1000 设 \(v_1,v_2,\cdots ,v_9 ...

  7. Cloudera Manager的安装

    1.  cloudera manager的概念 简单来说,Cloudera Manager是一个拥有集群自动化安装.中心化管理.集群监控.报警功能的一个工具(软件),使得安装集群从几天的时间缩短在几个 ...

  8. 028 IDEA中下载与上传程序

    在学习的时候,更多的时候在使用eclipse,但是在使用过程中,IDEA有时候使用起来更加方便轻松. 关于,在使用过程中的一些常识,这里谢谢写写文档. 一:拉代码 1.说明 在第一次开始项目的时候,需 ...

  9. js(javaScript)的各种事件触发,以常见为主eg:onclick

    js的各种事件触发,以常见为主eg:onclick1.onclick,点击后触发事件 (1)<h1 onclick="this.innerHTML='谢谢!'">请点击 ...

  10. Number String(DP)

    题目: 题意: 给你一个字符串s,s[i] = 'D'表示排列中a[i] > a[i+1],s[i] = 'I'表示排列中a[i] < a[i+1]. 比如排列 {3, 1, 2, 7, ...