CodeForces 353B Two Heaps
Valera has 2·n cubes, each cube contains an integer from 10 to 99. He arbitrarily chooses n cubes and puts them in the first heap. The remaining cubes form the second heap.
Valera decided to play with cubes. During the game he takes a cube from the first heap and writes down the number it has. Then he takes a cube from the second heap and write out its two digits near two digits he had written (to the right of them). In the end he obtained a single fourdigit integer — the first two digits of it is written on the cube from the first heap, and the second two digits of it is written on the second cube from the second heap.
Valera knows arithmetic very well. So, he can easily count the number of distinct fourdigit numbers he can get in the game. The other question is: how to split cubes into two heaps so that this number (the number of distinct fourdigit integers Valera can get) will be as large as possible?
The first line contains integer n (1 ≤ n ≤ 100). The second line contains 2·n space-separated integers ai (10 ≤ ai ≤ 99), denoting the numbers on the cubes.
In the first line print a single number — the maximum possible number of distinct four-digit numbers Valera can obtain. In the second line print 2·n numbers bi (1 ≤ bi ≤ 2). The numbers mean: the i-th cube belongs to the bi-th heap in your division.
If there are multiple optimal ways to split the cubes into the heaps, print any of them.
1
10 99
1
2 1
2
13 24 13 45
4
1 2 2 1
In the first test case Valera can put the first cube in the first heap, and second cube — in second heap. In this case he obtain number1099. If he put the second cube in the first heap, and the first cube in the second heap, then he can obtain number 9910. In both cases the maximum number of distinct integers is equal to one.
In the second test case Valera can obtain numbers 1313, 1345, 2413, 2445. Note, that if he put the first and the third cubes in the first heap, he can obtain only two numbers 1324 and 1345.
重复出现2次及以上的数,先在两边各分一个。。。只出现一次的数分成尽量相等的两半。。。。
用剩下的出现2次及以上的数把两个堆补齐。。。。。
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 5 using namespace std; 6 7 int n,use[100],a[220],cnt[100],cnt1=0,cnt2=0,temp=0,sol[220],size1=0; 8 9 int main() 10 { 11 scanf("%d",&n); 12 n=n*2; 13 for(int i=0;i<n;i++) 14 { 15 scanf("%d",a+i); 16 cnt[a[i]]++; 17 } 18 for(int i=10;i<=99;i++) 19 { 20 if(cnt[i]>=2) cnt2++; 21 else if(cnt[i]==1) cnt1++; 22 } 23 int ans=(cnt2+(cnt1/2))*(cnt2+((cnt1+1)/2)); 24 for(int i=0;i<n;i++) 25 { 26 if(cnt[a[i]]>=2&&use[a[i]]<2) 27 { 28 sol[i]=++use[a[i]]; 29 if(sol[i]==1) size1++; 30 } 31 else if(cnt[a[i]]==1) 32 { 33 if(temp<cnt1/2) 34 { 35 sol[i]=1; 36 size1++; 37 temp++; 38 } 39 else sol[i]=2; 40 } 41 } 42 printf("%d\n",ans); 43 for(int i=0;i<n;i++) 44 { 45 if(sol[i]) printf("%d ",sol[i]); 46 else 47 { 48 if(size1<n/2) {printf("1 "); size1++;} 49 else printf("2 "); 50 } 51 } 52 return 0; 53 }
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 智能桌面机器人:用.NET IoT库控制舵机并多方法播放表情
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· DeepSeek火爆全网,官网宕机?本地部署一个随便玩「LLM探索」
· 开发者新选择:用DeepSeek实现Cursor级智能编程的免费方案
· 【译】.NET 升级助手现在支持升级到集中式包管理
· 独立开发经验谈:如何通过 Docker 让潜在客户快速体验你的系统
· Tinyfox 发生重大改版