結果

問題 No.2779 Don't make Pair
ユーザー hibit_athibit_at
提出日時 2024-06-08 10:11:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 74 ms / 2,000 ms
コード長 4,552 bytes
コンパイル時間 1,272 ms
コンパイル使用メモリ 129,020 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-08 10:11:52
合計ジャッジ時間 3,288 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 8 ms
5,376 KB
testcase_10 AC 40 ms
6,168 KB
testcase_11 AC 12 ms
5,376 KB
testcase_12 AC 29 ms
5,376 KB
testcase_13 AC 31 ms
5,376 KB
testcase_14 AC 21 ms
5,376 KB
testcase_15 AC 47 ms
6,256 KB
testcase_16 AC 51 ms
6,280 KB
testcase_17 AC 36 ms
5,376 KB
testcase_18 AC 29 ms
5,376 KB
testcase_19 AC 40 ms
5,376 KB
testcase_20 AC 20 ms
5,376 KB
testcase_21 AC 64 ms
6,608 KB
testcase_22 AC 63 ms
6,608 KB
testcase_23 AC 69 ms
6,944 KB
testcase_24 AC 74 ms
6,484 KB
testcase_25 AC 64 ms
6,608 KB
testcase_26 AC 64 ms
6,484 KB
testcase_27 AC 64 ms
6,480 KB
testcase_28 AC 63 ms
6,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

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)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    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, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, 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, 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 <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}
#include<atcoder/segtree>
using namespace atcoder;
int op(int a,int b){
    return max(a,b);
}
int e(){
    return 0;
}
int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    auto zaz = [](auto a)
    {
        auto b = a;
        sort(all(b));
        b.erase(unique(all(b)), b.end());
        vector<int> ans;
        for (auto i : a)
        {
            auto where = lower_bound(all(b), i);
            ans.push_back(where - b.begin());
        }
        return ans;
    };
    a = zaz(a);
    // debug(a);
    vector<int> buc(n);
    rep(i,n){
        buc[a[i]]++;
    }
    // debug(buc);
    segtree<int,op,e> right(buc);
    segtree<int,op,e> left(n);
    vector<int> ans;
    rep(i,n-1){
        right.set(a[i],right.get(a[i])-1);
        left.set(a[i],left.get(a[i])+1);
        if(left.all_prod()<2 && right.all_prod()<2){
            ans.push_back(i+1);
        }
    }
    cout << ans.size() << endl;
    cout << ans << endl;
}
0