結果
問題 | No.2779 Don't make Pair |
ユーザー |
![]() |
提出日時 | 2024-06-07 21:46:23 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,802 bytes |
コンパイル時間 | 3,027 ms |
コンパイル使用メモリ | 212,396 KB |
実行使用メモリ | 17,060 KB |
最終ジャッジ日時 | 2024-12-26 07:37:57 |
合計ジャッジ時間 | 7,838 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 WA * 1 |
other | AC * 21 WA * 3 |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; #define lli long long int #define REP(i, s, n) for (lli i = s; i < n; i++) #define INF (1LL << 62) #define mp(a, b) make_pair(a, b) #define SORT(V) sort(V.begin(), V.end()) #define PI (3.141592653589794) #define TO_STRING(VariableName) #VariableName #define LOG1(x) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << endl; #define LOG2(x, y) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl; #define LOG3(x, y, z) \ if (DEBUG) \ cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \ << TO_STRING(z) << "=" << z << endl; #define LOG4(w, x, y, z) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \ << endl; #define LOG5(w, x, y, z, a) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << endl; #define LOG6(w, x, y, z, a, b) \ if (DEBUG) \ cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \ << TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z << " " \ << TO_STRING(a) << "=" << a << " " << TO_STRING(b) << "=" << b \ << endl; #define overload6(a, b, c, d, e, f, g, ...) g #define LOG(...) \ overload6(__VA_ARGS__, LOG6, LOG5, LOG4, LOG3, LOG2, LOG1)(__VA_ARGS__) template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } mt19937 engine; std::chrono::system_clock::time_point start, endTime; #define DEBUG 0 void solve() { // write your code here lli N; cin >> N; map<lli, lli> lefCnts; map<lli, lli> rigCnts; vector<lli> A(N); REP(i, 0, N) { cin >> A[i]; } lefCnts[A[0]]++; lli lefSeconds = 0; lli rigSeconds = 0; REP(i, 1, N) { rigCnts[A[i]]++; } for (auto e : rigCnts) { if (e.second >= 2) { rigSeconds++; } } vector<lli> ans; if (lefSeconds == 0 && rigSeconds == 0) { ans.push_back(0); } REP(i, 1, N) { lefCnts[A[i]]++; if (lefCnts[A[i]] == 2) { lefSeconds++; } rigCnts[A[i]]--; if (rigCnts[A[i]] == 1) { rigSeconds--; } if (lefSeconds == 0 && rigSeconds == 0) { ans.push_back(i); } } cout << ans.size() << endl; REP(i, 0, ans.size()) { cout << ans[i] + 1 << " "; } cout << endl; } // Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips: // You use the default template now. You can remove this line by using your // custom template) int main() { // Failed to predict input format lli N = 1; // cin >> N; while (N--) solve(); return 0; }