結果
問題 | No.2779 Don't make Pair |
ユーザー |
|
提出日時 | 2024-06-07 21:50:50 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 150 ms / 2,000 ms |
コード長 | 3,430 bytes |
コンパイル時間 | 3,010 ms |
コンパイル使用メモリ | 255,948 KB |
実行使用メモリ | 8,960 KB |
最終ジャッジ日時 | 2024-12-26 07:46:24 |
合計ジャッジ時間 | 5,877 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 24 |
ソースコード
// github.com/Johniel/contests// yukicoder/2779/main.cpp#include <bits/stdc++.h>#define each(i, c) for (auto& i : c)#define unless(cond) if (!(cond))using namespace std;template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p);template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p);template<typename P, typename Q, typename R> ostream& operator << (ostream& os, tuple<P, Q, R> t) { os << "(" << get<0>(t) << "," << get<1>(t) << ","<< get<2>(t) << ")"; return os; }template<typename P, typename Q, typename R> istream& operator >> (istream& is, tuple<P, Q, R>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); returnis; }template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "set{"; for (auto& i: s) os << i << ","; os << "}"; return os; }template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "map{"; for (auto& i: m) os << i << ","; os << "}"; return os; }template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; }template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; }template<typename T> ostream& operator << (ostream& os, stack<T> s) { os << "stack{"; while (s.size()) { os << s.top() << ","; s.pop(); } os << "}";return os; }template<typename T> ostream& operator << (ostream& os, queue<T> q) { os << "queue{"; while (q.size()) { os << q.front() << ","; q.pop(); } os << "}";return os; }template<typename T> ostream& operator << (ostream& os, deque<T> q) { os << "deque{"; for (int i = 0; i < q.size(); ++i) os << q[i] << ","; os << "}";return os; }template<typename T> ostream& operator << (ostream& os, priority_queue<T> q) { os << "heap{"; while (q.size()) { os << q.top() << ","; q.pop(); } os<< "}"; return os; }template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }__attribute__((constructor)) static void _____(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; }using lli = long long int;using ull = unsigned long long;using str = string;template<typename T> using vec = vector<T>;// constexpr lli mod = 1e9 + 7;constexpr lli mod = 998244353;int main(int argc, char *argv[]){int n;while (cin >> n) {vec<int> a(n);cin >> a;map<int, int> x, y;each (i, a) ++y[i];vec<int> v;for (int i = 0; i < a.size(); ++i) {--y[a[i]];if (y[a[i]] == 0) y.erase(a[i]);++x[a[i]];if (y.size() && x.size() == i + 1 && x.size() + y.size() == n) v.push_back(i);}cout << v.size() << endl;each (i, v) cout << i + 1 << ' '; cout << endl;}return 0;}