結果

問題 No.335 門松宝くじ
ユーザー ecotteaecottea
提出日時 2024-09-21 03:54:13
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 19 ms / 2,000 ms
コード長 8,572 bytes
コンパイル時間 4,188 ms
コンパイル使用メモリ 269,700 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-21 03:54:18
合計ジャッジ時間 5,077 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = static_modint<1234567891>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//Sparse Table
/*
* Sparse_table<T>(vS a, bool max_flag = false) : O(n log n)
* a[0..n) max_flag = false[true] []
*
* T get(int l, int r) : O(1)
* min a[l..r) INFL
*/
template <class T>
class Sparse_table {
// : https://tookunn.hatenablog.com/entry/2016/07/13/211148
int n, m;
bool max_flag;
// acc[j][i] : min a[i..i+2^j)
vector<vector<T>> acc;
public:
// a[0..n) max_flag = false[true] []
Sparse_table(const vector<T>& a, bool max_flag = false)
: n(sz(a)), m(msb(n) + 1), max_flag(max_flag), acc(m, vector<T>(n))
{
// verify : https://judge.yosupo.jp/problem/staticrmq
rep(i, n) acc[0][i] = a[i];
if (max_flag) rep(i, n) acc[0][i] *= -1;
repi(j, 1, m - 1) {
int d = 1 << (j - 1);
rep(i, n - d) {
// acc[j - 1]
// acc[j][i] get
acc[j][i] = min(acc[j - 1][i], acc[j - 1][i + d]);
}
}
}
Sparse_table() : n(0), m(0), max_flag(false) {}
// min a[l..r)
T get(int l, int r) {
// verify : https://judge.yosupo.jp/problem/staticrmq
chmax(l, 0); chmin(r, n);
if (l >= r) {
if (!max_flag) return T(INFL);
else return -T(INFL);
}
int j = msb(r - l);
return min(acc[j][l], acc[j][r - (1 << j)]) * (max_flag ? -1 : 1);
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Sparse_table& st) {
rep(j, st.m) {
rep(i, st.n) os << st.acc[j][i] << " ";
os << "\n";
}
return os;
}
#endif
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, m;
cin >> n >> m;
vvl a(m, vl(n));
cin >> a;
vector<Sparse_table<ll>> A_min(m);
rep(j, m) A_min[j] = Sparse_table<ll>(a[j]);
vector<Sparse_table<ll>> A_max(m);
rep(j, m) A_max[j] = Sparse_table<ll>(a[j], 1);
ll e_max = -1; int j_max = -1;
auto kadoQ = [](ll a, ll b, ll c) {
if (b < a && a < c) return true;
if (c < a && a < b) return true;
if (b < c && c < a) return true;
if (a < c && c < b) return true;
return false;
};
rep(j, m) {
ll e = 0;
rep(l, n) repi(r, l + 1, n - 1) {
ll sc = 0;
if (a[j][l] < a[j][r]) {
ll v = A_max[j].get(0, l);
if (v > a[j][l]) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
}
else {
ll v = A_min[j].get(0, l);
if (v < a[j][l]) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
}
ll v = A_max[j].get(l + 1, r);
if (v > max(a[j][l], a[j][r])) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
else {
v = A_min[j].get(l + 1, r);
if (v < min(a[j][l], a[j][r])) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
}
if (a[j][l] > a[j][r]) {
ll v = A_max[j].get(r + 1, n);
if (v > a[j][r]) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
}
else {
ll v = A_min[j].get(r + 1, n);
if (v < a[j][r]) {
chmax(sc, max({ v, a[j][l], a[j][r] }));
}
}
e += sc;
}
if (chmax(e_max, e)) j_max = j;
}
EXIT(j_max);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0