Submission #1595211

---

Source Code Expand

#include <bits/stdc++.h> 
 
using namespace std;
 
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

 
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;

//container util
//------------------------------------------
#define PB emplace_back
#define MP make_pair 
#define SZ(a) int((a).size())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
//constant
//--------------------------------------------
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
 
const LL INF=LONG_MAX;
const double EPS=0.00001;
const long double PI = acos(-1.0);

const int MAX_N=2e5+2;

int cnt[101];
int main(){
    int N;
    cin>>N;
    CLR(cnt);
    vector<int>aa;
    REP(i,N){
        int a;
        cin>>a;
        aa.PB(a);
        cnt[a]++;
    }
    SORT(aa);
    REP(i,SZ(aa)-1)if(aa[i+1]-aa[i]>1){
        cout<<"Impossible"<<endl;
        return 0;
    }

    if(cnt[1]>0){
        if((cnt[1]==1&&cnt[1]+cnt[2]==N)||(cnt[1]==2&&N==2)){
            cout<<"Possible"<<endl;
        }else{
            cout<<"Impossible"<<endl;
        }
        return 0;
    }else{
        int cnt1=0;
        REP(i,N)if(cnt[i]==1){
            cnt1++;
        }
        if(cnt1>=2){
            cout<<"Impossible"<<endl;
        }else{
            cout<<"Possible"<<endl;
        }
        return 0;
    }

    return 0;
}

Submission Info

Judge Result