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. IDEA 小白采坑

    IDEA Debug状态下,断点第一次可以进去,之后都不能进去 调试时候不要用Ctrl+F9,如果是点击Tool Windows 上的图标的话,也要注意改图标的快捷键是不是Ctrl+F9 Ctrl+F ...

  2. Java基础知识➣泛型整理(四)

    概述 泛型的本质是参数化类型,使用同一套代码来满足不同数据类型的业务需要,提高代码的执行效率,使代码简单明了. 泛型方法 该方法在调用时可以接收不同类型的参数.根据传递给泛型方法的参数类型,编译器适当 ...

  3. 正则表达式匹配URL或者网址

    正则表达式 (http|ftp|https):\/\/[\w\-_]+(\.[\w\-_]+)+([\w\-\.,@?^=%&:/~\+#]*[\w\-\@?^=%&/~\+#])? ...

  4. WPF: Hide grid row

    http://stackoverflow.com/questions/2502178/wpf-hide-grid-row Setting all the Items in the Row to Vis ...

  5. 51Nod1039 N^3 Mod P 数论 原根 BSGS

    原文链接https://www.cnblogs.com/zhouzhendong/p/51Nod1039.html 题目传送门 - 51Nod1039 题意 题解 这题我用求高次剩余的做法,要卡常数. ...

  6. day32 process模块用法

    昨日作业: 服务端: 服务端: from socket import * from multiprocessing import Process def server(ip,port): server ...

  7. 基于Keil软件的MCU环境搭建

    我们在开发一款新的MCU的时候,偶尔会遇到Keil软件没有对应的Device设备选型,以下,我们以STM32F407VGT6作为实例来演示整个环境的搭建过程: 一.如下所示,我需要选择的是ST公司的S ...

  8. vee-validate校验demo

    //太长了,把异步校验放到前面吧: VeeValidate.Validator.extend('checkLoginName',{ getMessage:function () { return &q ...

  9. 从URL输入到页面展现到底发生什么

    前言 打开浏览器从输入网址到网页呈现在大家面前,背后到底发生了什么?经历怎么样的一个过程?先给大家来张总体流程图,具体步骤请看下文分解!   从URL输入到页面展现 总体来说分为以下几个过程: DNS ...

  10. numpy学习笔记.

    import numpy as np import cv2 import matplotlib.pyplot as plt 一.数组的创建 1. 创建二维数组 np.array([ [1,2,3], ...