結果
| 問題 | No.775 tatyamと素数大富豪(hard) |
| ユーザー |
 tatyam
|
| 提出日時 | 2018-12-06 23:30:45 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,242 bytes |
| コンパイル時間 | 2,689 ms |
| コンパイル使用メモリ | 223,364 KB |
| 実行使用メモリ | 28,064 KB |
| 最終ジャッジ日時 | 2024-04-22 02:41:53 |
| 合計ジャッジ時間 | 7,810 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | TLE | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using pdl=pair<double,ll>;
const ll LINF=0x3fffffffffffffff;
const ll MOD=1000000007;
const ll MODD=0x3b800001;
const int INF=0x3fffffff;
const double DINF=numeric_limits<double>::infinity();
const vector<pii> four={{1,0},{0,1},{-1,0},{0,-1}};
#define _overload4(_1,_2,_3,_4,name,...) name
#define _overload3(_1,_2,_3,name,...) name
#define _rep1(n) _rep2(i,n)
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(ll i=a;i<b;++i)
#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)
#define _rrep1(n) _rrep2(i,n)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)
#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)
#define each(i,a) for(auto&& i:a)
#define sum(...) accumulate(range(__VA_ARGS__),0LL)
#define _range(i) (i).begin(),(i).end()
#define _range2(i,k) (i).begin(),(i).begin()+k
#define _range3(i,a,b) (i).begin()+a,(i).begin()+b
#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)
#define Yes(i) out(i?"Yes":"No")
#define YES(i) out(i?"YES":"NO")
//#define START auto start=system_clock::now()
//#define END auto end=system_clock::now();cerr<<duration_cast<milliseconds>(end-start).count()<<" ms\n"
#define elif else if
#define unless(a) if(!(a))
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)
__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(15);};
template<class T>
inline constexpr T gcd (T a,T b) {if(a==b)return a;else return gcd(b,(a-1)%b+1);}
template<class T>
inline constexpr T lcm (T a,T b) {a*b/gcd(a,b);}
template<class T>
inline constexpr T min(vector<T>& v){return *min_element(range(v));}
inline char min(string& v){return *min_element(range(v));}
template<class T>
inline constexpr T max(vector<T>& v){return *max_element(range(v));}
inline char max(string& v){return *max_element(range(v));}
template<typename T>
inline bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}
template<typename T>
inline bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}
inline void in() {}
template<class T>
istream& operator >> (istream& is, vector<T>& vec);
template<class T,size_t size>
istream& operator >> (istream& is, array<T,size>& vec);
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p);
template<class T>
ostream& operator << (ostream& os, vector<T>& vec);
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p);
template<class T>
istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}
template<class T,class L>
istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}
template<class T>
ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}
template<class T>
ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}
template<class T,class L>
ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}
ostream &operator<<(ostream &dest, __uint128_t value) {
ostream::sentry s(dest);
if (s) {
char buffer[128];
char *d = end(buffer);
do {
--d;
*d = "0123456789"[value % 10];
value /= 10;
} while (value != 0);
int len = end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(ios_base::badbit);
}
}
return dest;
}
template <class Head, class... Tail>
inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}
template <class T>
inline void out(T t){cout<<t<<'\n';}
inline void out(){cout<<'\n';}
template <class Head, class... Tail>
inline void out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);}
template <class T>
inline void err(T t){cerr<<t<<'\n';}
inline void err(){cerr<<'\n';}
template <class Head, class... Tail>
inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}
__uint128_t bigMul(__uint128_t a,__uint128_t b,__uint128_t m){
__uint128_t a_low=a&0xffffffffffffffff,a_high=a>>64,b_low=b&0xffffffffffffffff,b_high=b>>64,result;
result=a_high*b_high%m;
rep(64)result=result*2%m;
result=(result+a_low*b_high+b_low*a_high)%m;
rep(64)result=result*2%m;
result=(result+a_low*b_low)%m;
return result;
}
//n**p % m
__uint128_t bigPowMod(__uint128_t n, __uint128_t p, __uint128_t m){
__uint128_t ans = 1, ln = n;
if(p <= 0) return 1;
while(p != 0){
if((p & 1) == 1) ans = bigMul(ans, ln, m); //ans = (ans*ln) % m;
//ln = (ln * ln) % m;
ln = bigMul(ln, ln, m);
p = p >> 1;
}
return ans;
}
bool suspect(int a, int s, __uint128_t d, __uint128_t n) {
__uint128_t x = bigPowMod(a, d, n);
if (x == 1) return true;
for (int r = 0; r < s; ++r) {
if (x == n - 1) return true;
//x = x * x % n;
x = bigMul(x, x, n);
}
return false;
}
const vector<int> test={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
bool MillerRabin(__uint128_t n) {
if (n <= 1 || (n > 2 && n % 2 == 0)) return false;
__uint128_t d = n - 1;
int s = 0;
while (d%2==0){
s++;
d /= 2;
}
each(i,test)if (!suspect(i, s, d, n)) return false;
return true;
}
bool is_prime(__uint128_t n){
if (n < 2) return false;
if (n < 4) return true;
if (!(n % 2)) return false;
if (!(n % 3)) return false;
__uint128_t sq = sqrt(double(n))+1;
const vector<__uint128_t>p={5,7,11,13,17,19};
each(i,p){
if (sq < i) return true;
if (!(n % i)) return false;
}
if(MillerRabin(n))return true;
return false;
}
int n,k;
vector<__uint128_t>primes;
set<tuple<int,string,vector<int>,int>>s;
bool permsearch(int n,string num,__uint128_t num_i,vector<int>&card,int last=0){
if(s.count({n,num,card,last}))return 0;
s.insert({n,num,card,last});
if(n==0){
if(is_prime(num_i)){
primes.push_back(num_i);
k--;
if(!k)return 1;
}
if(k<=100)k--;
return !k;
}
bool b=1;
rep(i,1,100,2)if(i%5&&card[i]){
b=0;
break;
}
if(b)return 0;
b=1;
rep(i,1,10)if(card[i]){
b=0;
break;
}
if(b){
int c=int(num_i%11);
rep(i,10,100)c+=card[i]*i;
if(c%11==0)return 0;
}
rrep(i,10,100){
if(i%11==0&&card[i/11]){
if(last==i)continue;
int card1=card[i/11],card11=card[i],m=n;
string num2=num;
auto num_i2=num_i;
card[i/11]=0;
card[i]=0;
m-=card1+card11;
rep(j,card11){
num2=num2+to_string(i);
num_i2=num_i2*100+i;
}
rep(j,card1){
num2=num2+to_string(i/11);
num_i2=num_i2*10+i/11;
}
while(card[i/11]!=card1||card[i]!=card11){
if(permsearch(m,num2,num_i2,card,i))return 1;
if(card[i/11]!=card1){
card[i/11]++;
m++;
num2.pop_back();
num_i2/=10;
}
else{
if(card1){
card[i]++;
card[i/11]--;
num2.pop_back();
num_i2/=10;
}
else{
card[i]++;
m++;
num2.pop_back();
num2.pop_back();
num_i2/=100;
}
}
}
card[i/11]=card1;
card[i]=card11;
}
elif(card[i]){
card[i]--;
if(permsearch(n-1,num+to_string(i),num_i*100+i,card))return 1;
card[i]++;
}
}
return 0;
}
signed main(){
in(n,k);
if(n==1){
INT(a);
if(is_prime(a))out(a);
return puts("-1")&0;
}
int l=k;
k+=100;
VEC(int,a,n);
if(sum(a)%3==0)return puts("-1")&0;
vector<int>card(100);
each(i,a)card[i]++;
permsearch(n,"",0,card);
sort(range(primes),greater<__uint128_t>());
rep(min(l,int(primes.size())))out(primes[i]);
out(-1);
}