結果

問題 No.689 E869120 and Constructing Array 3
ユーザー heno239heno239
提出日時 2023-04-05 01:29:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 9 ms / 1,000 ms
コード長 9,651 bytes
コンパイル時間 1,992 ms
コンパイル使用メモリ 156,584 KB
実行使用メモリ 11,976 KB
最終ジャッジ日時 2024-04-09 02:54:13
合計ジャッジ時間 3,554 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,848 KB
testcase_01 AC 8 ms
11,720 KB
testcase_02 AC 8 ms
11,720 KB
testcase_03 AC 8 ms
11,716 KB
testcase_04 AC 8 ms
11,852 KB
testcase_05 AC 8 ms
11,720 KB
testcase_06 AC 9 ms
11,976 KB
testcase_07 AC 8 ms
11,976 KB
testcase_08 AC 8 ms
11,720 KB
testcase_09 AC 8 ms
11,848 KB
testcase_10 AC 8 ms
11,848 KB
testcase_11 AC 8 ms
11,844 KB
testcase_12 AC 9 ms
11,848 KB
testcase_13 AC 8 ms
11,724 KB
testcase_14 AC 8 ms
11,852 KB
testcase_15 AC 8 ms
11,720 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};
struct LowLink {
private:
	vector<vector<int>> G;
	vector<int> used, ord, low;
	vector<int> art;

	//make graph with bridge
	vector<vector<int>> fG;
	vector<vector<int>> ori;
	vector<int> trans;
public:
	LowLink(int n) {
		G.resize(n);
		used.resize(n, 0);
		ord.resize(n, 0);
		low.resize(n, 0);
	}
	void add_edge(int a, int b) {
		if (a == b)return;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	int dfs(int id, int k, int par) {
		used[id] = true;
		ord[id] = k++;
		low[id] = ord[id];
		bool is_art = false;
		int cnt = 0;
		for (auto&& to : G[id]) {
			if (!used[to]) {
				++cnt;
				k = dfs(to, k, id);
				low[id] = min(low[id], low[to]);
				if (~par && low[to] >= ord[id])is_art = true;
			}
			else if (to != par) {
				low[id] = min(low[id], ord[to]);
			}
		}
		if (par == -1 && cnt > 1)is_art = true;
		if (is_art)art.push_back(id);
		return k;
	}
	void complete() {
		int k = 0;
		rep(i, G.size()) {
			if (!used[i]) {
				k = dfs(i, k, -1);
			}
		}

	}
	vector<int> arts() {
		return art;
	}
	vector<bool> isart;
	int dfs2(int id, int par, int nm, int& tmp) {
		trans[id] = nm;
		ori[nm].push_back(id);
		used[id] = true;
		int memo = nm;
		if (isart[id]) {
			if (par >= 0) {
				fG[id].push_back(nm);
				fG[nm].push_back(id);
				nm = tmp; tmp++;
				ori[nm].push_back(id);
			}
			for (int to : G[id])if (!used[to]) {
				if (low[to] < ord[id]) {
					dfs2(to, id, memo, tmp);
				}
				else {
					fG[id].push_back(nm);
					fG[nm].push_back(id);
					int memo2 = nm;
					nm = tmp; tmp++;
					ori[nm].push_back(id);
					dfs2(to, id, memo2, tmp);
				}
			}
		}
		else {
			for (int to : G[id])if (!used[to]) {
				dfs2(to, id, nm, tmp);
			}
		}
		return memo;
	}
	//root is n
	//number of vertice is less than N+2*M
	void makegraph_vertice(int sz) {
		int n = G.size();
		fG.resize(sz);
		ori.resize(sz);
		trans.resize(n);
		fill(all(used), false);
		isart.resize(n);
		for (int id : art)isart[id] = true;
		int tmp = n + 1;
		dfs2(0, -1, n, tmp);
		rep(i, n)if (isart[i])trans[i] = i;
	}
	bool isok(int m) {
		int n = G.size();
		vector<int> ids;
		function<void(int, int)> dfs = [&](int id, int fr) {
			ids.push_back(id);
			for (int to : fG[id])if (to != fr) {
				dfs(to, id);
			}
		}; dfs(n, -1);
		vector<int> ks;
		for (int id : ids) {
			if (id < n)continue;
			if (ori[id].size() <= 2)return false;
			//cout << "? " << id << " " << ori[id].size() << "\n";
			ks.push_back(ori[id].size());
		}
		//coutarray(ks);
		assert(!ks.empty());
		sort(all(ks));
		if (ks[0] != ks.back())return false;
		int k = ks[0];
		if (ks.size() != k + 1)return false;
		ll num = (ll)k * (k + 1);
		if (num != m)return false;
		vector<int> ds;
		int cnt = 0;
		for (int id : ids) {
			if (id < n) {
				cnt++;
				if (fG[id].size() != 2)return false;
			}
			else {
				ds.push_back(fG[id].size());
			}
		}
		if (cnt != k)return false;
		sort(all(ds));
		rep(i, k)if (ds[i] != 1)return false;
		if (ds[k] != k)return false;


		return true;
	}
	vector<vector<int>> get_graph() {
		return fG;
	}
	vector<int> get_trans() {
		return trans;
	}
	void debug() {
		rep(i, ori.size()) {
			cout << "hai " << i << "\n";
			for (int id : ori[i])cout << id << " ";
			cout << "\n";
		}
		cout << "trans\n";
		rep(i, trans.size())cout << trans[i] << " ";
		cout << "\n";
	}
};

void solve() {
	int n; cin >> n;
	vector<int> ans;
	rep(i, 100)ans.push_back(2);
	rep(i, 10)ans.push_back(6);
	rep(i, 1)ans.push_back(18);
	rep(i, n / 100)ans.push_back(3); n %= 100;
	rep(i, n / 10)ans.push_back(7); n %= 10;
	rep(i, n / 1)ans.push_back(19); n %= 1;
	cout << ans.size() << "\n";
	coutarray(ans);
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}
0