Codeforces 500B New Year Permutation(更换位置,找最小字典数)
来源:互联网 发布:淘宝店铺运营思路 编辑:程序博客网 时间:2024/06/06 01:09
Description
User ainta has a permutation p1, p2, ..., pn. As the New Year is coming, he wants to make his permutation as pretty as possible.
Permutation a1, a2, ..., an is prettier than permutation b1, b2, ..., bn, if and only if there exists an integer k (1 ≤ k ≤ n) where a1 = b1, a2 = b2, ..., ak - 1 = bk - 1 and ak < bk all holds.
As known, permutation p is so sensitive that it could be only modified by swapping two distinct elements. But swapping two elements is harder than you think. Given an n × n binary matrix A, user ainta can swap the values of pi and pj (1 ≤ i, j ≤ n, i ≠ j) if and only if Ai, j = 1.
Given the permutation p and the matrix A, user ainta wants to know the prettiest permutation that he can obtain.
Input
The first line contains an integer n (1 ≤ n ≤ 300) — the size of the permutation p.
The second line contains n space-separated integers p1, p2, ..., pn — the permutation p that user ainta has. Each integer between 1 andn occurs exactly once in the given permutation.
Next n lines describe the matrix A. The i-th line contains n characters '0' or '1' and describes the i-th row of A. The j-th character of thei-th line Ai, j is the element on the intersection of the i-th row and the j-th column of A. It is guaranteed that, for all integers i, j where 1 ≤ i < j ≤ n, Ai, j = Aj, i holds. Also, for all integers i where 1 ≤ i ≤ n, Ai, i = 0 holds.
Output
In the first and only line, print n space-separated integers, describing the prettiest permutation that can be obtained.
Sample Input
75 2 4 3 6 7 10001001000000000000101000001000000000100001001000
1 2 4 3 6 7 5
54 2 1 5 30010000011100100110101010
1 2 3 4 5
Hint
In the first sample, the swap needed to obtain the prettiest permutation is: (p1, p7).
In the second sample, the swaps needed to obtain the prettiest permutation is (p1, p3), (p4, p5), (p3, p4).
A permutation p is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Thei-th element of the permutation p is denoted as pi. The size of the permutation p is denoted as n.
先将可以交换的两个数找出,然后冒泡填充
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[310];
int map[310][310];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
char s[310];
for(int i=0;i<n;i++)
{
scanf("%s",s);
for(int j=0;j<n;j++)
map[i][j]=s[j]-'0';
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
if(map[i][k]==1&&map[k][j]==1)
map[i][j]=1;
}
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++)
if(a[i]>a[j]&&map[i][j])
swap(a[i],a[j]);
for(int i=0;i<n;i++)
{
if(i)
printf(" ");
printf("%d",a[i]);
}
printf("\n");
}
- Codeforces 500B New Year Permutation(更换位置,找最小字典数)
- Codeforces 500B - New Year Permutation (思维)
- codeforces #500B# New Year Permutation
- Codeforces 500B New Year Permutation
- CodeForces 500B New Year Permutation
- Codeforces 500B New Year Permutation [贪心]
- 【CodeForces 500B】【贪心】New Year Permutation
- Codeforces 500B - New Year Permutation(最短路)
- CodeForces 500 B. New Year Permutation(贪心+Floyd)
- 【CodeForces】500B - New Year Permutation(思维)
- CodeForces 500B New Year Permutation(序列的变换)
- 500B New Year Permutation(Floyd)
- CodeForces 500B Good Bye 2014 New Year Permutation
- Codeforces 500B New Year Permutation Floyd算法+贪心
- CodeForces 500B New Year Permutation (Floyd判断通路是否存在)(贪心)
- Codeforces 500B:New Year Permutation(并查集||Floyd+思维)
- B - New Year Permutation
- B. New Year Permutation
- 映射多对对关联关系
- hdu5879Cure(java解法)
- 关于多线程情况下的生产者消费者模式的一些记录
- [hdu 5898 odd-even number] 数位DP
- Android使用Application总结
- Codeforces 500B New Year Permutation(更换位置,找最小字典数)
- leetcode 15 3Sum
- Arch linux (虚拟机)安装教程
- HDU 5898 odd-even number (2016亚洲区沈阳站网络赛 )
- Permutations I , II
- Asp图片大小处理及AspJpeg失效设置
- 通过反射获取泛型类的类型
- 【java】面向对象——封装性、继承性和多态性
- Android帧缓冲区(Frame Buffer)硬件抽象层(HAL)模块Gralloc的实现原理分析