提出 e4835519-1fd0-4897-a494-cb38f55fd3c6

コード

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
#include<atcoder/all>

using namespace std;
using namespace atcoder;

//https://qiita.com/ageprocpp/items/7bda728d109c953ece3c
//# pragma GCC target("avx2")
//# pragma GCC optimize("O3")
//# pragma GCC optimize("unroll-loops")

#define rep(i,n) for(long long i = 0; i < (n); i++)
#define REP(i,a,n) for(long long i = (a); i< (n); i++)
#define rrep(i,n) for(long long i = (n-1);i>=0; i--)//n-1から0のループ
#define RREP(i,a,n) for(long long i = (a-1);i>=(n); i--)
#define repp(i,n) for(long long i= n;i>=0;i--)
#define REPP(i,a,n) for(long long i = a;i>=n;i--)
#define fore(x,a) for(auto (x):(a))
#define FORE(x,a) for(auto& (x):(a))
#define dwhile(a) while(!(a))//わかりやすいだけ
#define all(x) x.begin(), x.end()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yn(b) if(b){Yes;}else{No;}
#define YN(b) if(b){YES;}else{NO;}
#define rsort(i) sort(i);reverse(i)
#define UNIQUE(n) n.erase(unique(all(n)),n.end())

//https://qiita.com/hibit/items/8ca9a58ccd23014f3a54#%E5%85%A8%E9%83%A8%E3%81%BE%E3%81%A8%E3%82%81%E3%81%A6
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 (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)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 (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)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;
}
//入力
template<typename... T>
void vin(T&... args){
  ((cin>>args),...);
  return;
}template<typename T,typename... U>
void vvin(vector<T>& hd,vector<U>&... args){
  rep(i,(long long int)hd.size()){
    cin >> hd[i];
    ((cin>>args[i]),...);
  }return;
}
//出力
template<typename... T>
void println(T... args){
  ((cout << args << " "),...);
  cout << endl;
}
//vector
template<typename T>
T vmax(vector<T>& n){
  T mx=n[0];
  rep(i,n.size()){
    if(mx<n[i]){
      mx=n[i];
    }
  }return mx;
}template<typename T>
T vmin(vector<T>& n){
  T mn=n[0];
  rep(i,n.size()){
    if(mn>n[i]){
      mn=n[i];
    }
  }return mn;
}
//pair
template<typename T,typename S>
pair<T,S> operator+(const pair<T,S>&l,const pair<T,S>&r){
  return{l.first+r.first,l.second+r.second};
}template<typename T,typename S>
pair<T,S> operator-(const pair<T,S>&l,const pair<T,S>&r){
  return{l.first-r.first,l.second-r.second};
}template<typename T,typename S>
pair<T,S> operator*(const pair<T,S>&l,const pair<T,S>&r){
  return{l.first*r.first,l.second*r.second};
}template<typename T,typename S>
pair<T,S> operator/(const pair<T,S>&l,const pair<T,S>&r){
  return{l.first/r.first,l.second/r.second};
}template<typename T,typename S>
pair<T,S> operator%(const pair<T,S>&l,const pair<T,S>&r){
  return{l.first%r.first,l.second%r.second};
}template<typename T,typename S>
pair<T,S>& operator+=(pair<T,S>&l,const pair<T,S>&r){
  l.first+=r.first;
  l.second+=r.second;
  return l;
}template<typename T,typename S>
pair<T,S>& operator-=(pair<T,S>&l,const pair<T,S>&r){
  l.first-=r.first;
  l.second-=r.second;
  return l;
}template<typename T,typename S>
pair<T,S>& operator*=(pair<T,S>&l,const pair<T,S>&r){
  l.first*=r.first;
  l.second*=r.second;
  return l;
}template<typename T,typename S>
pair<T,S>& operator/=(pair<T,S>&l,const pair<T,S>&r){
  l.first/=r.first;
  l.second/=r.second;
  return l;
}template<typename T,typename S>
pair<T,S>& operator%=(pair<T,S>&l,const pair<T,S>&r){
  l.first%=r.first;
  l.second%=r.second;
  return l;
}
using ll = long long;
using pll = pair<ll,ll>;
using vpl = vector<pair<ll,ll>>;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T>>;
template<typename T> using vvv = v<vv<T>>;
using vl = v<ll>;
using vvl = vv<ll>;
using vvvl = vvv<ll>;
using vs = v<string>;
using vvs = vv<string>;
using vvvs = vvv<string>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using pq_g = priority_queue<T,vector<T>,greater<ll>>;
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const string abc = "abcdefghijklmnopqrstuvwxyz";
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const v<ll> dx={1,0,-1,0};
const v<ll> dy={0,1,0,-1};
const ll INF = 2e18;
const double pi = 3.1415926535897932384626;
//名前が(かぶらないと思われ)安全なほう
namespace my_library_one{
  template<typename T,typename U,typename V>ll tousa_sum(T a,U b,V c){//初項,交差,項数
    return (b*(c-1)+a*2)*c/2;
  }template<typename T>vector<T> get_rank(vector<T> A){
    ll r=0;
    map<ll,ll> taiou;
    sort(all(A));
    rep(i,A.size()){
      r++;
      if(i>0&&A[i]==A[i-1]){
        r--;
      }taiou[A[i]]=r;
    }rep(i,A.size()){
      A[i]=taiou[A[i]];
    }
    return A;
  }
  template<typename T,typename U>
  string to_baseN(T a,U N){
    if(N==0){
      return "0";
    }
    string ret="";
    while(N>0){
      ret+='0'+N%a;
      N/=a;
    }reverse(all(ret));
    return ret;
  }template<typename T>
  ll to_baseten(T a,string S){
    ll k=1,ret=0;
    reverse(all(S));
    rep(i,S.size()){
      ret+=k*(S[i]-'0');
      k*=a;
    }return ret;
  }template<typename T,typename U>
  bool in(U a,T b, T c){//おそらく半開区間
    return a<=b&&b<c;
  }template<typename T>
  bool in_grid(T H,T W,T a,T b){
    return(in(0,a,H)&&in(0,b,W));
  }vl topological_sort(vvl& g){
    ll N=g.size();
    vl ret(0);
    vl n(N);
    queue<ll> BFS;
    rep(i,N){
      fore(x,g[i]){
        n[x]++;
      }
    }rep(i,N){
      if(n[i]==0){
        ret.push_back(i);
        BFS.push(i);
      }
    }while(BFS.size()>0){
      fore(x,g[BFS.front()]){
        n[x]--;
        if(n[x]==0){
          ret.push_back(x);
          BFS.push(x);
        }
    }BFS.pop();
    }return ret;
  }
}
namespace my_library_two{
  template<typename T>
  struct BIT{
    int N;
    vector<T> bit;
    function<T(T,T)> op=[](T a,T b){return a+b;};
    function<T(T,T)> inv_op=[](T a,T b){return a-b;};
    BIT(int n):N(n+1),bit(n+1,T()){}
    template<typename F,typename G>
    BIT(int n,F operator_,G inv_operator_):N(n+1),bit(n+1,T()),op(operator_),inv_op(inv_operator_){}
    void add(int a,T b){//a番目にbを加算。0≦a<N
      a++;
      for(int i=a;i<N;i+=(i&-i)){
        bit[i]=op(bit[i],b);
      }
      return;
    }
    T sum(int a,int b){//[a,b)の和
      T ret=T();
      for(int i=a;i>0;i-=(i&-i)){
        ret=inv_op(ret,bit[i]);
      }for(int i=b;i>0;i-=(i&-i)){
        ret=op(ret,bit[i]);
      }return ret;
    }int lower_bound(T a){
      int idx=0,r=1;
      while(N>r)r*=2;
      for(int len=r;len>0;len=len>>1){
        if(idx+len<N&&bit[idx+len]<a){
          a=inv_op(a,bit[idx+len]);
          idx+=len;
        }
      }return idx;
    }int upper_bound(T a){
      int idx=0,r=1;
      while(N>r)r*=2;
      for(int len=r;len>0;len=len>>1){
        if(idx+len<N&&bit[idx+len]<=a){
          a=inv_op(a,bit[idx+len]);
          idx+=len;
        }
      }return idx;
    }
  };
}
void DFS(vvl& g,ll p,ll oya){
  /*行く(ついた)ときの処理*/
  for(ll x:g[p]){
    if(x==oya){
      continue;
    }
    DFS(g,x,p);
  }/*帰りの処理*/
}using namespace my_library_one;//安全な方
using namespace my_library_two;//名前被りなどを意識した方(こっちの方が新しいのが多い)
ll solve(){
  ll L,ans=0;
  cin >> L;
  set<ll> sakujo;
  vl B(L);
  cin >> B;
  vl Bd(0);
  rep(i,L){
    if(sakujo.find(B[i])!=sakujo.end()){
      continue;
    }
    if(Bd.size()==0){
      Bd.push_back(B[i]);
      continue;
    }
    if(Bd.back()==B[i]){
      sakujo.insert(B[i]);
      ans++;
    }else{
      Bd.push_back(B[i]);
    }
  }
  return ans;
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  ll T=1,ans=0;
  cin >> T;
  rep(i,T) ans+=solve();
  cout << ans << endl;
}
結果

問題	点数	言語	結果	実行時間	メモリ
C1. Mibae Ga Warui	0	C++ (gcc)	WA	91 ms	8448 KiB
テストセット

テストセット	結果	得点	実行時間	メモリ
All	WA × 19 AC × 8	0	91 ms	8448 KiB
Sample	AC × 3	0	16 ms	8192 KiB
詳細結果

テストケース	結果	実行時間	メモリ
All_1	WA	32 ms	8064 KiB
All_10	WA	33 ms	8192 KiB
All_11	WA	32 ms	8192 KiB
All_12	WA	49 ms	8192 KiB
All_13	WA	56 ms	8064 KiB
All_14	WA	47 ms	8320 KiB
All_15	WA	44 ms	8064 KiB
All_16	WA	26 ms	8064 KiB
All_17	WA	44 ms	7936 KiB
All_18	WA	38 ms	8320 KiB
All_19	WA	37 ms	8064 KiB
All_2	WA	34 ms	8320 KiB
All_20	WA	91 ms	7808 KiB
All_21	WA	39 ms	8064 KiB
All_22	WA	40 ms	8064 KiB
All_23	WA	39 ms	8064 KiB
All_24	WA	39 ms	8064 KiB
All_3	AC	25 ms	8320 KiB
All_4	AC	15 ms	8192 KiB
All_5	WA	32 ms	8192 KiB
All_6	AC	22 ms	8320 KiB
All_7	AC	21 ms	8448 KiB
All_8	WA	30 ms	8192 KiB
All_9	AC	23 ms	8064 KiB
sample_1	AC	13 ms	8192 KiB
sample_2	AC	16 ms	8064 KiB
sample_3	AC	13 ms	8192 KiB