oj.uz

답안 #227498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
227498 2020-04-27T14:57:22 Z kshitij_sodani Lutrija (COCI19_lutrija) C++17
42 / 70
 2000 ms 384 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back

#define endl "\n"
llo ip(llo aa){
	if(aa==1){
		return 0; 
	}
	llo j=2;
	while(j*j<=aa){
		if(aa%j==0){
			return 0;
		}
		j+=1;
	}
	return 1;
}
vector<llo> solve(llo a,llo b){
	if(a==b){
		return {a};
	}
	if(a==2){
		if(ip(b-a)){
			return {a,b};
		}
		if(ip(b+2-a) and ip(b+2)){
			return {a,b+2,b};
		}
		if(b-2>a){
			if(ip(b-2-a) and ip(b-2)){
				return {a,b-2,b};
			}
		}
		return {-1};
	}
	else{
		llo st=1;
		for(llo i=a;i<=b;i+=2){
			if(ip(i)==0){
				st=0;
			}
		}
		if(st){
			vector<llo> ans2;
			for(llo i=a;i<=b;i+=2){
				ans2.pb(i);
			}
			return ans2;
		}
		vector<llo> x=solve(2,a);
		vector<llo> y=solve(2,b);
		if(x[0]==-1 or y[0]==-1){
			return {-1};
		}
		reverse(x.begin(),x.end());
		vector<llo> ans3;
		for(auto j:x){
			if(j>2){
				ans3.pb(j);
			}
		}
		for(auto j:y){
			
				ans3.pb(j);
			
		}
		return ans3;

	}
	

}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo a,b;
	cin>>a>>b;
	vector<llo> ans=solve(min(a,b),max(b,a));
	if(ans[0]==-1){
		cout<<-1<<endl;
		return 0;
	}
	cout<<ans.size()<<endl;
	if(a>b){
		reverse(ans.begin(),ans.end());
	}
	for(auto j:ans){
		cout<<j<<" ";
	}
	cout<<endl;
	return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct

Subtask #5
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #6
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #7
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2080 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2081 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2078 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2099 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -