博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
codeforces #261 C题 Pashmak and Buses(瞎搞)
阅读量:7246 次
发布时间:2019-06-29

本文共 2220 字,大约阅读时间需要 7 分钟。

题目地址:

C. Pashmak and Buses
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which has n students. The school planned to take the students to d different places for d days (each day in one place). Each day the company provides all the buses for the trip. Pashmak has to arrange the students in the buses. He wants to arrange the students in a way that no two students become close friends. In his ridiculous idea, two students will become close friends if and only if they are in the same buses for all d days.

Please help Pashmak with his weird idea. Assume that each bus has an unlimited capacity.

Input

The first line of input contains three space-separated integers n, k, d (1 ≤ n, d ≤ 1000; 1 ≤ k ≤ 109).

Output

If there is no valid arrangement just print -1. Otherwise print d lines, in each of them print n integers. The j-th integer of the i-th line shows which bus the j-th student has to take on the i-th day. You can assume that the buses are numbered from 1 to k.

Sample test(s)
input
3 2 2
output
1 1 2 1 2 1
input
3 2 1
output
-1
Note

Note that two students become close friends only if they share a bus each day. But the bus they share can differ from day to day.

这题就是求一全排列。由于要求每一天的都不同样,所以最多是k^d种。假设要输出的话,最简单的方法就是进行全排列呗。。。。

要注意。。

假设用的跟我的求全排列方法一样的话。那须要注意中间的cnt值是会非常大的。可是由于最多仅仅须要输出n种,所以假设大于n的话就直接让他等于n+1。

代码例如以下:

#include 
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;#define LL __int64LL mp[3100][3100];int main(){ LL n, k, d, i, j, cnt, h, flag=0, x, y; scanf("%I64d%I64d%I64d",&n,&k,&d); memset(mp,0,sizeof(mp)); cnt=1; for(i=1;i<=d;i++) { for(j=1;j<=n;j++) { if((j-1)%cnt==0) { mp[i][j]=mp[i][j-1]+1; if(mp[i][j]>k) { mp[i][j]=1; if(i==d) { flag=1; break; } } } else mp[i][j]=mp[i][j-1]; } if(j!=n+1) break; cnt*=k; if(cnt>1000) cnt=1001; } if(flag) { printf("-1\n"); } else { for(i=d;i>=1;i--) { for(j=1;j<=n;j++) { printf("%I64d ",mp[i][j]); } printf("\n"); } } return 0;}

转载地址:http://gdnbm.baihongyu.com/

你可能感兴趣的文章
【开篇】基于C#+EmguCV的机器视觉平台开发
查看>>
HBase与MongDB等NoSQL数据库对照
查看>>
上海地铁游移动APP需求分析
查看>>
Behave + Selenium(Python) ------ (第二篇)
查看>>
用LabVIEW做声源定位系统
查看>>
JAVA中static关键字
查看>>
2018/9/26 10.36
查看>>
【模拟】牛慢跑
查看>>
元素的显示和隐藏:display、visibility、overflow
查看>>
各管理相关的工具和技术
查看>>
『004』索引-Python
查看>>
安装第三方模块
查看>>
SMTP
查看>>
用CSS实现的图片透明度链接效果代码
查看>>
大牛给计算机专业的七个建议
查看>>
[SAN4N学习笔记]使用SysTick精准延时
查看>>
C++ auto_ptr
查看>>
Alpha阶段项目展示
查看>>
zzz KVC/KVO原理详解及编程指南
查看>>
window对象
查看>>