#1018204 (C++23) No.2929 Miracle Branch

提出ソース

結果

問題	No.2929 Miracle Branch
ユーザー	mikam
提出日時	2024-10-12 16:09:34
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	4,488 bytes
コンパイル時間	9,040 ms
コンパイル使用メモリ	454,984 KB
実行使用メモリ	10,496 KB
最終ジャッジ日時	2024-10-12 16:09:52
合計ジャッジ時間	15,874 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	AC	3 ms 5,248 KB
testcase_02	AC	3 ms 5,248 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	AC	3 ms 5,248 KB
testcase_19	AC	3 ms 5,248 KB
testcase_20	AC	3 ms 5,248 KB
testcase_21	AC	4 ms 5,248 KB
testcase_22	WA	-
testcase_23	AC	5 ms 5,248 KB
testcase_24	AC	11 ms 5,248 KB
testcase_25	WA	-
testcase_26	AC	3 ms 5,248 KB
testcase_27	AC	3 ms 5,248 KB
testcase_28	TLE	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-
testcase_37	--	-
testcase_38	--	-
testcase_39	--	-
testcase_40	--	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
#define pb push_back
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using ull = unsigned long long;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}
struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;
int di[]={0,1,0,-1,-1,-1,1,1};
int dj[]={1,0,-1,0,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
map<int,int> prime_factor(int n) {
	map<int,int> ret;
	for(int i=2; i*i<=n;i++){
		while(n%i==0){
			ret[i]++;
			n/=i;
		}
	}
	if(n!=1)ret[n]=1;
	return ret;
}
signed main() {

	INT(x);
	auto p = prime_factor(x);
	vi chs;
	for(auto [k,v]:p){
		while(v--)chs.push_back(k);
	}
	if(accumulate(all(chs),0ll)+chs.size()>200000)return print(-1);
	int b = chs.size();
	vector<vi> g(b);
	rep(i,b-1){
		g[i].push_back(i+1);
	}
	int v = b;
	rep(i,b){
		rep(_,chs[i])g[i].push_back(v++);
	}
	print(v);
	rep(i,b){
		for(auto j:g[i])print(i+1,j+1);
	}
	rep(i,b)cout<<"b ";
	rep(i,v-b)cout<<"g ";
	cout<<endl;
	return 0;
}

yukicoder

結果

テストケース

ソースコード