提出 #73536005

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}

const ll MOD=998244353;
const ll INF=(1ll<<60);
int main(){
  ll T;
  cin>>T;
  rep(jkodfa,T){
    ll N;
    cin>>N;
    vl A(2*N);
    rep(i,2*N) cin>>A[i];
    vector<set<ll>> s(2);
    vl sik(0);
    ll next=0;
    ll gr=0;
    while(next<2*N){
      if(s[gr].count(A[next])){
        gr=(gr+1)%2;
        sik.pb(next);
        s[gr].insert(A[next]);
      }
      else{
        s[gr].insert(A[next]);
      }
      next++;
    }
    cout<<sik.size()<<endl;
    rep(i,sik.size()) cout<<sik[i]<<" ";
    cout<<endl;
  }
}

提出情報

ジャッジ結果