oj.uz

Submission #313617

# Submission time Handle Problem Language Result Execution time Memory
313617 2020-10-16T12:04:35 Z YJU Lutrija (COCI19_lutrija) C++14
0 / 70
 2000 ms 3448 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

bool ck(ll k){
	if(k<=1)return 0;
	for(ll i=2;i*i<=k;i++)if(k%i==0)return 0;
	return 1;
}

vector<ll> v,p;
ll a,b,vis[N];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>a>>b;
	for(ll i=2;i<N;i++){
		if(vis[i])continue;
		p.pb(i);
		REP(j,SZ(p)){
			if(p[j]*i<N)vis[p[j]*i]=1;
			if(i%p[j]==0)break;
		}
	}
	if(ck(abs(a-b))){cout<<"2\n"<<a<<" "<<b<<"\n";return 0;}
	for(auto i:p)v.pb(i),v.pb(a-i),v.pb(a+i),v.pb(b-i),v.pb(b+i);
	sort(v.begin(),v.end());
	v.resize(unique(v.begin(),v.end())-v.begin());
	for(ll i:v){
		if(ck(i)&&ck(abs(a-i))&&ck(abs(b-i))){
			cout<<"3\n"<<a<<" "<<i<<" "<<b<<"\n";return 0;
		}
	}
	cout<<"-1\n";
	return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2043 ms 2596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2078 ms 3448 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2043 ms 2672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2086 ms 3188 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2005 ms 3092 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 3320 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 2680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 2680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2062 ms 2764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2066 ms 2724 KB Time limit exceeded
2 Halted 0 ms 0 KB -