Time-3 - I'm Not Blind!

#include <bits/stdc++.h>

#define rep(i,n) for(int i = 0; i < n; i++) //[0,n)

#define srep(i,a,b) for(int i = a; i < b; i++) //[a,b)

#define all(A) (A).begin(),(A).end()

#define rall(A) (A).rbegin(),(A).rend()

#define pmt(A) next_permutation(A)

using namespace std;

using ll = long long;

using ull = unsigned long long;

using P = pair<ll,ll>;

using pq = priority_queue<ll,vector<ll>,greater<ll>>;

const ll inf = 8e18;

const int iinf = (int)1e9;

const int mod9 = 998244353;

const int mod1 = 1000000007;

struct Edge { int to; ll cost; int from; };

bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }

using Graph = vector<vector<int>>;

using EGraph = vector<Edge>;

using SGraph = vector<set<ll>>;

template <typename T>

int siz(T& a){ return (int)a.size(); }

using namespace std;

​

int main(){

    int n,m; cin >> n >> m;

    vector<int> A(n);

    set<int> B;

    rep(i,n) cin >> A[i];

    rep(i,m){

        int b; cin >> b;

        B.insert(b);

    }

​

    set<int> st;

    sort(all(A));

    do {

        int res = 0;

        rep(i,n) if(!B.count(i)) res += A[i];

        st.insert(res);

    } while(pmt(all(A)));

​

    cout << siz(st);

}

​

import itertools

​

n,m = list(map(int,input().split()))

A = list(map(int,input().split()))

​

if m == 0:

    print(1)

    exit()

​

B = list(map(int,input().split()))

​

st = set()

for v in itertools.permutations(A):

    t = 0

    for i in range(n):

        if i+1 in B: continue

        t += v[i]

    st.add(t)

print(len(st))