codeforces 390C Inna and Candy Boxes
2015-11-13 17:48
489 查看
C. Inna and Candy Boxes
time limit per test 1 second
memory limit per test 256 megabytes
input
standard input
output
standard output
Inna loves sweets very much. She has n closed present boxes lines up in a row in front of her. Each of these boxes contains either a candy (Dima's work) or nothing (Sereja's work). Let's assume that the boxes are numbered
from 1 to n, from left to right.
As the boxes are closed, Inna doesn't know which boxes contain candies and which boxes contain nothing. Inna chose number
k and asked w questions to Dima to find that out. Each question is characterised by two integers
li, ri (1 ≤ li ≤ ri ≤ n;
r - l + 1 is divisible by
k), the i-th question is: "Dima, is that true that among the boxes with numbers from
li to
ri, inclusive, the candies lie
only in boxes with numbers
li + k - 1,
li + 2k - 1,
li + 3k - 1, ...,
ri?"
Dima hates to say "no" to Inna. That's why he wonders, what number of actions he will have to make for each question to make the answer to the question positive. In one action, Dima can either secretly take the candy from any box or put a candy to any box
(Dima has infinitely many candies). Help Dima count the number of actions for each Inna's question.
Please note that Dima doesn't change the array during Inna's questions. That's why when you calculate the number of operations for the current question, please assume that the sequence of boxes didn't change.
Input
The first line of the input contains three integers n,
k and w
(1 ≤ k ≤ min(n, 10), 1 ≤ n, w ≤ 105). The second line contains
n characters. If the
i-th box contains a candy, the i-th character of the line equals 1, otherwise it equals 0.
Each of the following w lines contains two integers
li and
ri
(1 ≤ li ≤ ri ≤ n) — the description of the
i-th question. It is guaranteed that
ri - li + 1 is divisible by
k.
Output
For each question, print a single number on a single line — the minimum number of operations Dima needs to make the answer to the question positive.
Sample test(s)
Input
Output
Note
For the first question, you need to take a candy from the first box to make the answer positive. So the answer is 1.
For the second question, you need to take a candy from the first box, take a candy from the fifth box and put a candy to the sixth box. The answer is 3.
For the third question, you need to take a candy from the fifth box and put it to the sixth box. The answer is 2.
解题思路:设X=l~r区间中“1”的个数,Y=l~r区间中指定位置中“1”的个数,Z=l~r区间中指定位置的个数。
所以,最后的结果应该等于X+Z-2*Y;
其中可以用一个数组a[],来记录每个下标之前“1”的个数,比如a[i]=1~i中“1”的个数,所以X=a[r]-a[l-1]。
Z=(r+1-l)/k;
Y的计算可能不太好理解,因为指定位置%k相等,所以可以设数组b[][],b[i%k][i]表示1~i中,模k等于i%k的数中“1”的个数,所以
Y=b[r%k][r]-b[r%k][l-1];
题目链接:http://codeforces.com/problemset/problem/390/C
代码:
time limit per test 1 second
memory limit per test 256 megabytes
input
standard input
output
standard output
Inna loves sweets very much. She has n closed present boxes lines up in a row in front of her. Each of these boxes contains either a candy (Dima's work) or nothing (Sereja's work). Let's assume that the boxes are numbered
from 1 to n, from left to right.
As the boxes are closed, Inna doesn't know which boxes contain candies and which boxes contain nothing. Inna chose number
k and asked w questions to Dima to find that out. Each question is characterised by two integers
li, ri (1 ≤ li ≤ ri ≤ n;
r - l + 1 is divisible by
k), the i-th question is: "Dima, is that true that among the boxes with numbers from
li to
ri, inclusive, the candies lie
only in boxes with numbers
li + k - 1,
li + 2k - 1,
li + 3k - 1, ...,
ri?"
Dima hates to say "no" to Inna. That's why he wonders, what number of actions he will have to make for each question to make the answer to the question positive. In one action, Dima can either secretly take the candy from any box or put a candy to any box
(Dima has infinitely many candies). Help Dima count the number of actions for each Inna's question.
Please note that Dima doesn't change the array during Inna's questions. That's why when you calculate the number of operations for the current question, please assume that the sequence of boxes didn't change.
Input
The first line of the input contains three integers n,
k and w
(1 ≤ k ≤ min(n, 10), 1 ≤ n, w ≤ 105). The second line contains
n characters. If the
i-th box contains a candy, the i-th character of the line equals 1, otherwise it equals 0.
Each of the following w lines contains two integers
li and
ri
(1 ≤ li ≤ ri ≤ n) — the description of the
i-th question. It is guaranteed that
ri - li + 1 is divisible by
k.
Output
For each question, print a single number on a single line — the minimum number of operations Dima needs to make the answer to the question positive.
Sample test(s)
Input
10 3 3 1010100011 1 3 1 6 4 9
Output
1 3 2
Note
For the first question, you need to take a candy from the first box to make the answer positive. So the answer is 1.
For the second question, you need to take a candy from the first box, take a candy from the fifth box and put a candy to the sixth box. The answer is 3.
For the third question, you need to take a candy from the fifth box and put it to the sixth box. The answer is 2.
解题思路:设X=l~r区间中“1”的个数,Y=l~r区间中指定位置中“1”的个数,Z=l~r区间中指定位置的个数。
所以,最后的结果应该等于X+Z-2*Y;
其中可以用一个数组a[],来记录每个下标之前“1”的个数,比如a[i]=1~i中“1”的个数,所以X=a[r]-a[l-1]。
Z=(r+1-l)/k;
Y的计算可能不太好理解,因为指定位置%k相等,所以可以设数组b[][],b[i%k][i]表示1~i中,模k等于i%k的数中“1”的个数,所以
Y=b[r%k][r]-b[r%k][l-1];
题目链接:http://codeforces.com/problemset/problem/390/C
代码:
#include <iostream> #include <cmath> #include <cstring> #include <stdio.h> #define N 100005 using namespace std; int sum1 ; int sum2[10] ; int main() { int n,k,w; char c ; while(scanf("%d%d%d",&n,&k,&w)!=EOF) { memset(sum1,0,sizeof(sum1)); memset(sum2,0,sizeof(sum2)); scanf("%s",c); for(int i=1;i<=k;i++) { sum1[i]+=sum1[i-1]+c[i-1]-'0'; sum2[i%k][i]=c[i-1]-'0'; } for(int i=k+1;i<=n;i++) { sum1[i]+=sum1[i-1]+c[i-1]-'0'; sum2[i%k][i]=sum2[i%k][i-k]+c[i-1]-'0'; } int l,r; while(w--) { scanf("%d%d",&l,&r); int ans=sum1[r]-sum1[l-1]+(r-l+1)/k-2*(sum2[r%k][r]-sum2[r%k][l-1]); printf("%d\n",ans); } } return 0; }
相关文章推荐
- 使用pivot和unpivot语句实现行转列,列转行
- Android从相册和照相机获取图片
- Linux如何移动文件夹及其子文件笔记
- ORACLE 多表连接与子查询
- ●HR的99种死法-爱护HR,人人有责!
- 《Programming WPF》翻译 第5章 1.不使用样式
- mongodb数据库分片
- Maven之——如何把maven项目转成web项目
- Enterprise Architect 视频教程地址
- 巧用nc,模拟GET和POST
- 《Programming WPF》翻译 第3章 4.我们进行到哪里了?
- 十天冲刺---Day7
- Java NIO教程(八)SocketChannel
- 第k个数
- java递归解迷宫 求所有解
- 关于map::erase的使用说明
- mapreduce去重
- R语言-开发环境安装
- 杭电1065 I Think I Need a Houseboat
- session(会话)