#1150872 (C++17) No.3453 Crape Shop

• 問題: No.3453 Crape Shop
• ユーザー: mkzkm
• 提出日時: 2026-03-01 09:22:37
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 7 ms / 2,000 ms
• コード長: 4,666 bytes
• コンパイル時間: 1,843 ms
• コンパイル使用メモリ: 213,276 KB
• 実行使用メモリ: 7,972 KB
• 最終ジャッジ日時: 2026-03-01 09:22:41
• 合計ジャッジ時間: 3,234 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 22

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lll =__int128;
using ld = long double;
#define mod99 998244353
#define mod107 1000000007
#define endl "\n"
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define prep(i,a,n) for (ll i = a; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define si(x) ((long long)(x).size())
#define yn(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define PRE(x) cout << fixed << setprecision(x)
#define yes cout << "Yes\n"
#define no cout << "No\n"
template <typename T> inline T gcd(T a,T b) {return (b==0)?a:gcd(b,a%b);}
template <typename T> inline T lcm(T a, T b) {return a/gcd(a,b)*b;}
#define sq(x) ((x)*(x))
#define cube(x) ((x)*(x)*(x))
const ld PI=3.141592653589793238462643383279;
const ll INF=5000000000000000000LL;
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc = "abcdefghijklmnopqrstuvwxyz";
#define next_p next_permutation
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
#define ull unsigned long long
#define u_map unordered_map
#define setting(x) sort(x.begin(),x.end());x.erase(unique(x.begin(),x.end()),x.end())
template<typename T> using vc = vector<T>; using vcc = vector<char>;
template<typename T> using vv = vc<vc<T>>; using vvc = vv<char>;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using vb = vc<bool>; using vvb = vv<bool>; using vvvb = vv<vb>;
using vs = vc<string>; using vvs = vv<string>;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vpii = vc<pii>; using vpll = vc<pll>;
using vvpii = vv<pii>; using vvpll = vv<pll>;
using vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p){
  os<<"("<<p.first<<","<<p.second<<")";
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p){
  is>>p.first>>p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for(ll i=0;i<(ll)v.size();i++) os<<v[i]<<(i+1!=(ll)v.size()?" ":"");
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v){
  for(ll i = 0; i < (ll)v.size(); i++) os<<v[i]<<endl;
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v){
  for(int i = 0; i < (int)v.size(); i++){
    os<<"i = "<<i<<endl;
    os<<v[i];
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v){
  for(T &in:v) is >> in;
  return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &mp){
  for(auto &[key, val]:mp) os<key<<":"<<val<<" ";
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &st){
  auto itr = st.begin();
  for(ll i=0; i<(ll)st.size();i++) {
    os<<*itr<<(i+1!=(ll)st.size()?" ":"");
    itr++;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &st){
  auto itr = st.begin();
  for(ll i = 0; i < (ll)st.size(); i++) {
    os<<*itr<<(i+1!=(ll)st.size()?" ":"");
    itr++;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q){
  while(q.size()) {
    os<<q.front()<<" ";
    q.pop();
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q){
  while(q.size()) {
    os<<q.front()<<" ";
    q.pop_front();
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st){
  while(st.size()) {
    os<<st.top()<<" ";
    st.pop();
  }
  return os;
}

template <class T, class Container, class Compare>
ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){
  while(pq.size()) {
    os<<pq.top()<<" ";
    pq.pop();
  }
  return os;
}

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
//#include<atcoder/all>
//using namespace atcoder;
//using mint=modint998244353;

/*
ostream &operator<<(ostream &os,const mint &i){
  os<<i.val();
  return os;
}

ostream &operator<<(ostream &os, const vector<mint> &v){
  for(ll i=0;i<(ll)v.size();i++) os<<v[i].val()<<(i+1!=(ll)v.size()?" ":"");
  return os;
}
*/



int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  ll n;cin >> n;
  ll a,b;cin>>a>>b;
  rep(i,n) {
    ll p;cin>>p;
    if(p==1) a--;
    else if(p==2) b--;
    else {a--;b--;}
    if(a==-1||b==-1) {cout<<i+1<<endl;return 0;}
  }
  cout<<-1<<endl;
}