#736793 (C++23) No.1831 Parasol

提出ソース

結果

問題	No.1831 Parasol
ユーザー	👑 hitonanode
提出日時	2022-02-04 22:06:06
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,939 bytes
コンパイル時間	1,970 ms
コンパイル使用メモリ	184,052 KB
実行使用メモリ	4,512 KB
最終ジャッジ日時	2023-09-02 04:55:24
合計ジャッジ時間	5,423 ms
ジャッジサーバーID （参考情報）	judge11 / judge16

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	1 ms 4,380 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: 関数 ‘int main()’ 内:
main.cpp:122:17: 警告: ignoring return value of ‘constexpr std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::size() const [with _Tp = std::tuple<int, int, int>; _Alloc = std::allocator<std::tuple<int, int, int> >; size_type = long unsigned int]’, declared with attribute ‘nodiscard’ [-Wunused-result]
  122 |     dbg(ret.size());
      |                 ^
main.cpp:72:17: 備考: in definition of macro ‘dbg’
   72 | #define dbg(x) (x)
      |                 ^
次のファイルから読み込み:  /usr/local/gcc7/include/c++/12.2.0/vector:64,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/functional:62,
         次から読み込み:  main.cpp:11:
/usr/local/gcc7/include/c++/12.2.0/bits/stl_vector.h:987:7: 備考: ここで宣言されています
  987 |       size() const _GLIBCXX_NOEXCEPT
      |       ^~~~

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif


int main() {
    int N;
    cin >> N;
    vector<pint> Vlabel(N * 2);
    REP(i, Vlabel.size()) Vlabel[i] = make_pair(i, i);
    vector<tuple<int, int, int>> ret;
    dbg(Vlabel);
    while (Vlabel.size() > 3) {
        int j = Vlabel.size() - 2, k = Vlabel.size() - 1;
        int match = 2;
        if (Vlabel.size() == 6) match = 3;
        if (Vlabel.size() == 7) match = 4;
        FOR(i, 1, Vlabel.size() - 2) {
            REP(t, 2) {
                ret.emplace_back(Vlabel[i].second, Vlabel[j].second, Vlabel[k].second);
                Vlabel[i].first--;
                Vlabel[j].first--;
                Vlabel[k].first--;
                if (i != match) break;
            }
        }
        sort(ALL(Vlabel));
        dbg(Vlabel);
        Vlabel.erase(Vlabel.begin());
        Vlabel.erase(Vlabel.begin());
        Vlabel.erase(Vlabel.begin());
        if (Vlabel.size() == 3) {
            dbg("A");
            dbg(Vlabel);
            ret.emplace_back(Vlabel[0].second, Vlabel[1].second, Vlabel[2].second);
            Vlabel.clear();
        }
        if (Vlabel.size() == 4) {
            dbg("A");
            dbg(Vlabel);
            ret.emplace_back(Vlabel[0].second, Vlabel[2].second, Vlabel[3].second);
            ret.emplace_back(Vlabel[1].second, Vlabel[2].second, Vlabel[3].second);
            Vlabel.clear();
        }
    }
    dbg(Vlabel);
    cout << ret.size() << '\n';
    vector<int> cntr(N * 2);
    int sum = (N * 2 - 1) * (N * 2) / 2 / 3;
    dbg(sum);
    dbg(ret.size());
    for (auto [a, b, c] : ret) {
        cntr.at(a)++;
        cntr.at(b)++;
        cntr.at(c)++;
        cout << a << ' ' << b << ' ' << c << '\n';
    }
    dbg(cntr);
    FOR(i, 1, cntr.size()) assert(cntr[i] <= i);
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード