結果

問題 No.689 E869120 and Constructing Array 3
ユーザー しらっ亭
提出日時 2018-05-18 23:39:17
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 6 ms / 1,000 ms
コード長 6,110 bytes
コンパイル時間 1,189 ms
コンパイル使用メモリ 122,308 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-28 14:03:22
合計ジャッジ時間 2,560 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

vector<bool> sieve(int n) {
	vector<bool> flg(n, 1);
	if (n <= 2) {
		for (int i = 0; i < n; i++) {
			flg[i] = false;
		}
		return flg;
	}
	for (int i = 0; i < min(n, 2); i++) {
		flg[i] = false;
	}
	for (int j = 4; j < n; j += 2) {
		flg[j] = false;
	}
	int lim = int(sqrt(n)) + 1;
	for (int i = 3; i < lim; i += 2) {
		if (flg[i]) {
			for (int j = i * i; j < n; j += i * 2) {
				flg[j] = 0;
			}
		}
	}
	return flg;
}

vb is_prime;

int validate(vi &A) {
	int n = sz(A);
	int cnt = 0;
	rep(i, n) rep(j, i) {
		if (is_prime[A[i] + A[j]]) cnt++;
	}
	return cnt;
}

void Main() {
	int k = ri();

	if (k == 0) {
		cout << "1\n1\n";
		return;
	}

	is_prime = sieve(2000000);

	int mi = 1e9;
	int x = -1, y = -1;
	rep(i, 100) rep(j, 100) {
		int cnt = i*(i-1) / 2 + i * j;
		if (cnt <= k) {
			if (amin(mi, k-cnt)) {
				x = i, y = j;
			}
		}
	}
	out(mi,x,y);
	k -= x*(x-1) / 2 + x * y;
	out(k);

	vi A;
	rep(i, x) A.emplace_back(1);
	rep(i, y) A.emplace_back(2);
	A.emplace_back(8);
	rep(i, k) A.emplace_back(23);


	cout << sz(A) << endl;
	forr(a, A) cout << a << ' ';
	cout << endl;

/*
	vi O, E;
	{
		int e = 2;
		rep(i, 150) {
			E.emplace_back(e);
			e += 2;
		}
	}
	out(E);

	map<int, int> C;

	for (int o = 3; o < 1000; o += 2) {
		int cnt = 0;
		forr(e, E) {
			if (is_prime[o*o + e]) cnt++;
		}
		if (C.count(cnt) == 0) C[cnt] = o;
	}

	out(C);

	while (k) {
		auto it = C.upper_bound(k);
		out(*it);
		it = prev(it);
		out(k, *it);
		E.emplace_back(it->snd);
		k -= it->fst;
	}

	out(E);

	int vali = validate(E);
	out(vali, sz(E));


*/
	/*
	vi O;
	for (int o = 1001; o <= 1200; o+=2) {
		O.emplace_back(o);
	}

	map<int, vi> C;

	for (int e = 2; e < 1000; e+=2) {
		int cnt = 0;
		forr(o, O) {
			if (is_prime[o + e]) cnt++;
		}
		C[cnt].emplace_back(e);
	}

	out(C);
	out(sz(O));
	out(validate(O));
	*/


}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}
0