Gym-101612E E - Equal Numbers n个数转化为同样类型数

最新推荐文章于 2020-09-10 23:58:11 发布

twh233

最新推荐文章于 2020-09-10 23:58:11 发布

阅读量556

点赞数

分类专栏： gcd

本文链接：https://blog.csdn.net/qq_36553623/article/details/78722602

版权

gcd 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

http://codeforces.com/gym/101612/attachments

题意：给n个数，每次可以改变任意一个数的大小，改变方式是x*i(i∈[1,无穷大))。输出每次改变次数类型数最少有多少个。

做法：第一眼看到的时候觉得跟lcm有关，其实也确实有关，首先用a存有多少类型的数，b存在a基础上倍数上的数。

那么对于第i个操作来说，首先得满足他们改变种类的个数不超过i，另外有可能改变a中小的数改成a的倍数b，那么一共就是

b里面的数个数的总数。然后两者取最大值，用总数减最大值得最小值。

可能说的有点乱，具体看代码。

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
#pragma GCC optimize(2)
#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
#define sz size()
typedef long long LL;
typedef pair <int, int> ii;
const int INF=~0U>>1;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e6+10;
const int maxx=1e3+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=19260817;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

//void readString(string &s)
//{
//	static char str[maxn];
//	scanf("%s", str);
//	s = str;
//}
int n;
int cnt=0;
vector<int>a,b,d(maxn,0);
void solve()
{
	s_1(n);
	FOR(1,n,i) 
	{
		int x;
		s_1(x);
		++d[x];
	}
	FOr(1,d.sz,i)
		if(d[i])
		{
			a.pb(d[i]);
			for(int j=2*i;j<d.sz;j+=i)
				if(d[j]){b.pb(d[i]);break;}
		}
	sort(a.begin(),a.end());
	sort(b.begin(),b.end());
	int q=0,p=0,sp=0,sq=0;
	FOR(0,n,i)
	{
		W(p<a.sz&&sp+a[p]<=i)
			sp+=a[p++];
		W(q<b.sz&&sq+b[q]<=i)
			sq+=b[q++];
		printf("%d%c",a.sz-max(q,p-1),i==n?'\n':' ');
	}
}
int main()
{
    //freopen( "equal.in" , "r" , stdin );
    //freopen( "equal.out" , "w" , stdout );
    int t=1;
    //init();
    //s_1(t);
    for(int cas=1;cas<=t;cas++)
    {
        //printf("Case #%d: ",cas);
        solve();
    }
}