提出 14443bd8-e166-4834-8144-e7abd08cc399

コード

#ifndef INCLUDE_MACRO
#define INCLUDE_MACRO
#include __FILE__

int solve() {
    
    return 0;
}

signed main() {
    int _T;
    cin >> _T;
    int ans = 0;
    rep(_, _T) {
        int n;
        cin >> n;
        vector<int> vec(n);
        map<int, vector<int>> rev;
        rep(i, n) {
            cin >> vec[i];
            if (0 < i && i < n - 1) rev[vec[i]].push_back(i - 1);
        }
        vector<pair<int, int>> pvec(n - 1);
        vector<int> same(n - 1);
        set<int> seen;
        queue<int> que;
        rep(i, n - 1) {
            pvec[i].first = vec[i];
            pvec[i].second = vec[i + 1];
            same[i] = i + 1;
            if (pvec[i].first == pvec[i].second && !seen.count(pvec[i].first)) {
                que.push(pvec[i].first);
                seen.insert(pvec[i].first);
            }
        }
        while(!que.empty()) {
            int now = que.front();
            que.pop();
            for (auto i : rev[now]) {
                swap(pvec[same[i]].first, pvec[i].first);
                if (pvec[same[i]].first == pvec[same[i]].second && !seen.count(pvec[same[i]].first)) {
                    que.push(pvec[same[i]].first);
                    seen.insert(pvec[same[i]].first);
                }
                if (i - 1 >= 0) same[i - 1] = same[i];
            }
        }
        ans += seen.size();
    }
    cout << ans << endl;
    return 0;
}

#else

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define int long long
#define under(N) std::fixed << std::setprecision(N)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (int i = 0; i < n; i++)
#define orep(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define cy std::cout << "Yes" << std::endl
#define cyre {std::cout << "Yes" << std::endl; return 0;}
#define cn std::cout << "No" << std::endl
#define cnre {std::cout << "No" << std::endl; return 0;}
#define MOD 998244353LL
#define INF (3LL<<60)
#define PI 3.141592653589793238
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
std::vector<int> dx = {1, -1, 0, 0};
std::vector<int> dy = {0, 0, 1, -1};
std::vector<int> dx8 = {1, -1, 0, 0, 1, -1, -1, 1};
std::vector<int> dy8 = {0, 0, 1, -1, 1, -1, 1, -1};
template<class T>
T ipow(T x, T y) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret *= x;
        }
        x *= x;
        y >>= 1;
    }
    return ret;
}
template<class T>
T mod_pow(T x, T y, T mod) {
    T ret = 1;
    while (y > 0) {
        if (y % 2 == 1) {
            ret = ret * x % mod;
        }
        x = x * x % mod;
        y >>= 1;
    }
    return ret;
}
template<class T>
T isqrt(T n) {
    if (n == 0) return 0;
    T rinzi = T(std::sqrt(n)) - 1;
    return rinzi * (rinzi + 2) < n ? rinzi + 1 : rinzi;
}
template<class T>
bool out_glid(T i, T j, T h, T w) {
    if (i < 0 || h <= i || j < 0 || w <= j) return true;
    else return false;
}
void allout(vector<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<string> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it << std::endl;
    }
}
void allout(vector<bool> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        if (*it) std::cout << 1;
        else std::cout << 0;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(vector<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(set<int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << *it;
        if (it != prev(x.end())) std::cout << " ";
    }
    std::cout << std::endl;
}
void allout(set<pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " " << it->second << endl;
    }
}
template<class T>
void allout(vector<set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        allout(*it);
    }
}
void allout(map<int, int> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << it->second << std::endl;
    }
}
void allout(map<int, pair<int, int>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : " << (it->second).first << " " << (it->second).second << std::endl;
    }
}
template<class T>
void allout(map<int, vector<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
template<class T>
void allout(map<int, set<T>> &x) {
    for (auto it = x.begin(); it != x.end(); it++) {
        std::cout << it->first << " : ";
        allout(it->second);
    }
}
class Timer {
    chrono::system_clock::time_point start;
public:
    Timer() : start(chrono::system_clock::now()) {}
    double count() {
        chrono::duration<double> Time_ = chrono::system_clock::now() - start;
        return Time_.count();
    }
    bool is_under(double x) {
        return (this->count()) < x;
    }
};

#endif

結果

問題	点数	言語	結果	実行時間	メモリ
C1. Mibae Ga Warui	0	C++ (gcc)	WA	160 ms	17920 KiB

テストセット

テストセット	結果	得点	実行時間	メモリ
All	WA × 19 AC × 8	0	160 ms	17920 KiB
Sample	AC × 3	0	15 ms	8192 KiB

詳細結果

テストケース	結果	実行時間	メモリ
All_1	WA	108 ms	12544 KiB
All_10	WA	95 ms	8320 KiB
All_11	WA	86 ms	9600 KiB
All_12	WA	156 ms	17920 KiB
All_13	WA	160 ms	16348 KiB
All_14	WA	144 ms	17536 KiB
All_15	WA	137 ms	14208 KiB
All_16	WA	101 ms	11392 KiB
All_17	WA	126 ms	7936 KiB
All_18	WA	119 ms	8320 KiB
All_19	WA	107 ms	8064 KiB
All_2	WA	121 ms	9272 KiB
All_20	WA	159 ms	8064 KiB
All_21	WA	109 ms	8320 KiB
All_22	WA	107 ms	8064 KiB
All_23	WA	102 ms	8320 KiB
All_24	WA	133 ms	8192 KiB
All_3	AC	59 ms	9928 KiB
All_4	AC	19 ms	8320 KiB
All_5	WA	118 ms	9588 KiB
All_6	AC	31 ms	8064 KiB
All_7	AC	58 ms	9856 KiB
All_8	WA	75 ms	9936 KiB
All_9	AC	44 ms	8192 KiB
sample_1	AC	15 ms	8064 KiB
sample_2	AC	15 ms	8192 KiB
sample_3	AC	14 ms	7936 KiB