【codeforces 758C】Unfair Poll
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
On the Literature lesson Sergei noticed an awful injustice, it seems that some students are asked more often than others.
Seating in the class looks like a rectangle, where n rows with m pupils in each.
The teacher asks pupils in the following order: at first, she asks all pupils from the first row in the order of their seating, then she continues to ask pupils from the next row. If the teacher asked the last row, then the direction of the poll changes, it means that she asks the previous row. The order of asking the rows looks as follows: the 1-st row, the 2-nd row, …, the n - 1-st row, the n-th row, the n - 1-st row, …, the 2-nd row, the 1-st row, the 2-nd row, …
The order of asking of pupils on the same row is always the same: the 1-st pupil, the 2-nd pupil, …, the m-th pupil.
During the lesson the teacher managed to ask exactly k questions from pupils in order described above. Sergei seats on the x-th row, on the y-th place in the row. Sergei decided to prove to the teacher that pupils are asked irregularly, help him count three values:
the maximum number of questions a particular pupil is asked,
the minimum number of questions a particular pupil is asked,
how many times the teacher asked Sergei.
If there is only one row in the class, then the teacher always asks children from this row.
Input
The first and the only line contains five integers n, m, k, x and y (1 ≤ n, m ≤ 100, 1 ≤ k ≤ 1018, 1 ≤ x ≤ n, 1 ≤ y ≤ m).
Output
Print three integers:
the maximum number of questions a particular pupil is asked,
the minimum number of questions a particular pupil is asked,
how many times the teacher asked Sergei.
Examples
input
1 3 8 1 1
output
3 2 3
input
4 2 9 4 2
output
2 1 1
input
5 5 25 4 3
output
1 1 1
input
100 100 1000000000000000000 100 100
output
101010101010101 50505050505051 50505050505051
Note
The order of asking pupils in the first test:
the pupil from the first row who seats at the first table, it means it is Sergei;
the pupil from the first row who seats at the second table;
the pupil from the first row who seats at the third table;
the pupil from the first row who seats at the first table, it means it is Sergei;
the pupil from the first row who seats at the second table;
the pupil from the first row who seats at the third table;
the pupil from the first row who seats at the first table, it means it is Sergei;
the pupil from the first row who seats at the second table;
The order of asking pupils in the second test:
the pupil from the first row who seats at the first table;
the pupil from the first row who seats at the second table;
the pupil from the second row who seats at the first table;
the pupil from the second row who seats at the second table;
the pupil from the third row who seats at the first table;
the pupil from the third row who seats at the second table;
the pupil from the fourth row who seats at the first table;
the pupil from the fourth row who seats at the second table, it means it is Sergei;
the pupil from the third row who seats at the first table;
【题目链接】:http://codeforces.com/contest/758/problem/C
【题解】
画一画;
会发现;
走完第一行之后;
之后每2*(n-1)*m个格子为一个周期;
这一个周期;
固定把第一行和最后一行的格子每个格子递增1;
同时第二行到第n-1行每个格子都递增2;
我是以k<=n*m和k>n*m作为划分的;
对于k<=n*m的情况直接暴力模拟(n*m最大为10000完全可以接受);
对于k>n*m的情况
先把第一行都加上1(先走完第一行);
然后k-=m;
周期的个数就为k/(2*(n-1)*m);
然后对于剩下的k%(2*(n-1)*m)
暴力搞完就好;
特判一下n=1的情就好;
不会很难的;
到了n+1则变成n-1,转个方向;
到了0则变成2,转个方向;
【完整代码】
#include <bits/stdc++.h>
#define LL long long
using namespace std;
int x,y;
LL n,m,k;
LL a[110][110];
int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin >> n >> m >> k >> x >> y;
if (k<=n*m)
{
int rest = k;
int nx = 1,ny = 1,fx=1;
while (rest>0)
{
a[nx][ny]++;
rest--;
ny++;
if (ny>m)
{
ny = 1;
nx+=fx;
}
if (nx>n)
{
nx-=2;
fx=-fx;
}
if (nx<1)
{
nx = 2;
if (nx>n)
nx = 1;
fx=-fx;
}
}
}
else
if (k > n*m)
{
if (n>1)
{
for (int i = 1;i <= m;i++)
a[1][i] = 1;
LL temp,rest;
k-=m;
temp = k/(2*(n-1)*m);
rest = k%(2*(n-1)*m);
for (int i = 1;i <= m;i++)
a[1][i]+=temp,a[n][i]+=temp;
for (int i = 2;i <= n-1;i++)
for (int j = 1;j <= m;j++)
a[i][j]+=temp*2;
int nx = 2,ny = 1,fx=1;
if (nx>n)
nx = 1;
while (rest>0)
{
a[nx][ny]++;
rest--;
ny++;
if (ny>m)
{
ny = 1;
nx+=fx;
}
if (nx>n)
{
nx-=2;
fx=-fx;
}
if (nx<1)
{
nx = 2;
fx = -fx;
}
}
}
else
if (n==1)
{
LL temp = k/m;
LL rest = k%m;
for (int i = 1;i <= m;i++)
a[1][i]+=temp;
for (int i = 1;i <= rest;i++)
a[1][i]++;
}
}
LL ma = a[1][1],mi = a[1][1];
for (int i = 1;i <= n;i++)
for (int j = 1;j <= m;j++)
{
ma = max(ma,a[i][j]);
mi = min(mi,a[i][j]);
}
cout << ma << ' ' <<mi << ' '<<a[x][y]<<endl;
return 0;
}
【codeforces 758C】Unfair Poll的更多相关文章
- Codeforces 758C:Unfair Poll(思维+模拟)
http://codeforces.com/problemset/problem/758/C 题意:教室里有n列m排,老师上课点名从第一列第一排开始往后点,直到点到第一列第m排,就从第二列第一排开始点 ...
- 【codeforces 415D】Mashmokh and ACM(普通dp)
[codeforces 415D]Mashmokh and ACM 题意:美丽数列定义:对于数列中的每一个i都满足:arr[i+1]%arr[i]==0 输入n,k(1<=n,k<=200 ...
- 【codeforces 707E】Garlands
[题目链接]:http://codeforces.com/contest/707/problem/E [题意] 给你一个n*m的方阵; 里面有k个联通块; 这k个联通块,每个连通块里面都是灯; 给你q ...
- 【codeforces 707C】Pythagorean Triples
[题目链接]:http://codeforces.com/contest/707/problem/C [题意] 给你一个数字n; 问你这个数字是不是某个三角形的一条边; 如果是让你输出另外两条边的大小 ...
- 【codeforces 709D】Recover the String
[题目链接]:http://codeforces.com/problemset/problem/709/D [题意] 给你一个序列; 给出01子列和10子列和00子列以及11子列的个数; 然后让你输出 ...
- 【codeforces 709B】Checkpoints
[题目链接]:http://codeforces.com/contest/709/problem/B [题意] 让你从起点开始走过n-1个点(至少n-1个) 问你最少走多远; [题解] 肯定不多走啊; ...
- 【codeforces 709C】Letters Cyclic Shift
[题目链接]:http://codeforces.com/contest/709/problem/C [题意] 让你改变一个字符串的子集(连续的一段); ->这一段的每个字符的字母都变成之前的一 ...
- 【Codeforces 429D】 Tricky Function
[题目链接] http://codeforces.com/problemset/problem/429/D [算法] 令Si = A1 + A2 + ... + Ai(A的前缀和) 则g(i,j) = ...
- 【Codeforces 670C】 Cinema
[题目链接] http://codeforces.com/contest/670/problem/C [算法] 离散化 [代码] #include<bits/stdc++.h> using ...
随机推荐
- echarts如何设置背景图的颜色
公司的业务涉及到统计图的有很多,最近一直echarts里面踩各种坑,感觉应该建立一个echarts专题才对,前端的东西博大精深,无论在哪一个知识点,只要细细深究,都是别有一方天地在等待,随着需求的不同 ...
- Apple Watch 集成环信SDK
本文简单的讲述下怎样用Apple Watch Kit集成环信SDK. 升级xcode到version 6.2,和 IOS SDK8.2 下载环信SDK从官网 打开XCode->new proje ...
- ORACLE11g R2【RAC+ASM→RAC+ASM】
ORACLE11g R2[RAC+ASM→RAC+ASM] 本演示案例所用环境:RAC+ASM+OMF primary standby OS Hostname node1,node2 dgnode ...
- COCOS学习笔记--持续动作ActionInterval
上一篇博客介绍了即时动作ActionInstant.与即时动作相对的是持续动作ActionInterval. 顾名思义,持续动作就是须要一段时间来持续运行的动作,而且在有限时间内改变运行对象的一些属性 ...
- ES6的基础知识总结
一. ES6 ES6中定义变量使用 let/const let 使用let定义的变量不能进行"变量提升" 同一个作用域中,let不能重复定义相同的变量名 使用var在全局作用域中定 ...
- 关于JS的面向对象总结
什么是面向对象: 对象由两部分构成:属性 和 方法: 面向对象的特点: 1.封装:对于相同功能的代码,放在一个函数中,以后再用到此功能,只需要调用即可,无需再重写:避免大量冗余代码: 专业话说:低耦合 ...
- 用多年前据说买买提上理论水平最高的帖子做镇楼贴---NASA有吹牛了
美国国会一直有意把nasa 划入国防部,取消太空探索所关联的部门,因为这些部门都是些烧钱的大包袱,而把具有军事意义的部门留下.国会想把烧钱部卖给google,可能是要价太高,最后没有谈拢,不了了之.但 ...
- apper
查漏补缺系列之dapper初体验 什么是dapper 在维护一些较老的项目的时候,往往我们会用很多sql那么这个时候我们要考虑优化这些项目的时候,我们就可以使用dapper dapper 是一款轻 ...
- 等价变换(equivalent transformation)
1. 加加减减 (x−b)n=(x−a+a−b)n=∑i=0n(ni)(x−a)i(a−b)n−i
- go 字符串 数字 整型 浮点 转换
import "strconv" //先导入strconv包 // string到int int, err := strconv.Atoi(string) // string到in ...