제출 #344954

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344954		Pichon5	Lutrija (COCI19_lutrija)	C++17	42 / 70	2090 ms	828 KiB

lutrija

#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
using namespace std;
bool is_prime(ll x){
    if(x<2){
        return false;
    }
    if(x==2){
        return true;
    }
    for(int i=2;i*i<=x;i++){
        if(x%i==0){
            return false;
        }
    }
    return true;
}
vi nodos;
map<ll,vll>G;
map<ll,bool>vis;
map<ll,vll>UF;
vll ans;
ll A,B;
void dfs(ll u){
    if(u==B){
        ans=UF[B];
        return;
    }
    vis[u]=true;
    for(auto it : G[u]){
        if(!vis[it]){
            UF[it]=UF[u];
            UF[it].pb(it);
            dfs(it);
        }
    }
}
int main()
{
    cin>>A>>B;
    map<ll,bool>vis;
    for(int i=A-4;i<=A+4;i++){
        if(is_prime(i) && vis[i]==false){
            nodos.pb(i);
            vis[i]=1;
        }
    }
    for(int i=B-4;i<=B+4;i++){
        if(is_prime(i) && vis[i]==false){
            nodos.pb(i);
            vis[i]=1;
        }
    }
    if(!vis[2]){
        nodos.pb(2);
    }
    for(int i=0;i<nodos.size();i++){
        for(int l=i+1;l<nodos.size();l++){
            if(is_prime(abs(nodos[i]-nodos[l]))){
                G[nodos[i]].pb(nodos[l]);
                G[nodos[l]].pb(nodos[i]);
            }
        }
    }
    UF[A].pb(A);
    dfs(A);
    if(ans.size()==0){
        cout<<-1<<endl;
    }else{
        cout<<ans.size()<<endl;
        for(int i=0;i<ans.size();i++){
            cout<<ans[i]<<" ";
        }
    }


    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lutrija.cpp: In function 'int main()':
lutrija.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int i=0;i<nodos.size();i++){
      |                 ~^~~~~~~~~~~~~
lutrija.cpp:75:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for(int l=i+1;l<nodos.size();l++){
      |                       ~^~~~~~~~~~~~~
lutrija.cpp:88:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for(int i=0;i<ans.size();i++){
      |                     ~^~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7