結果
問題 | No.1537 私の代わりに仕事やっといてください。 |
ユーザー |
![]() |
提出日時 | 2023-05-13 19:12:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,051 bytes |
コンパイル時間 | 1,706 ms |
コンパイル使用メモリ | 197,960 KB |
最終ジャッジ日時 | 2025-02-13 00:09:28 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | WA * 9 |
ソースコード
#include <bits/stdc++.h>using namespace std;struct iofast_t {iofast_t() {ios::sync_with_stdio(false);cin.tie(nullptr);}} iofast;struct uns_t {} uns;template <typename Element, typename Head, typename ...Args>auto vec(Element init, Head arg, Args ...args) {if constexpr (sizeof...(Args) == 0) return vector(arg, init);else return vector(arg, vec(init, args...));}template <typename Element, typename Head, typename ...Args>auto vec(uns_t, Head arg, Args ...args) {return vec(Element(), arg, args...);}template <typename Container>auto distance(const Container &c, decltype(begin(c)) iter) {return distance(begin(c), iter);}template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>auto isort(RIter first, RIter last, Compare comp = Compare()) {vector<int> i(distance(first, last));iota(begin(i), end(i), 0);sort(begin(i), end(i), [&](auto x, auto y) {return comp(*(first + x), *(first + y));});return i;}template <typename, template <typename> typename, typename = void_t<>>struct detect : false_type {};template <typename T, template <typename> typename Check>struct detect<T, Check, void_t<Check<T>>> : true_type {};template <typename T, template <typename> typename Check>constexpr inline bool detect_v = detect<T, Check>::value;template <typename T>using has_member_sort = decltype(declval<T>().sort());template <typename Container, typename Compare = less<typename Container::value_type>>auto sorted(Container c, Compare comp = Compare()) {if constexpr (detect_v<Container, has_member_sort>) {c.sort(comp);return c;}else {sort(begin(c), end(c), comp);return c;}}template <typename Container, typename Compare = equal_to<typename Container::value_type>>auto uniqued(Container c, Compare comp = Compare()) {c.erase(unique(begin(c), end(c), comp), end(c));return c;}template <typename T, typename Compare = less<T>>T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }template <typename T, typename Compare = less<T>>T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }template <typename F>constexpr auto fix(F &&f) noexcept {return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);};}int main() {int n; cin >> n;auto a = vec<int>(uns, n);for (auto &e : a) cin >> e;auto idx = vec<int>(uns, n);iota(begin(idx), end(idx), 0);sort(begin(idx), end(idx), [&](int i, int j) {return a[i] < a[j];});int count = 0;for (int i = 0; i < n + n; ++i) {count += (idx[i % n] == 0);if (count == 0) {continue;}cout << idx[i % n] + 1;if (count != 2) {cout << " ";}else {break;}}cout << endl;}