結果
問題 |
No.1028 闇討ち
|
ユーザー |
|
提出日時 | 2025-05-30 00:05:04 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 4,354 bytes |
コンパイル時間 | 4,148 ms |
コンパイル使用メモリ | 313,480 KB |
実行使用メモリ | 24,832 KB |
最終ジャッジ日時 | 2025-05-30 00:05:14 |
合計ジャッジ時間 | 9,290 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
// competitive-verifier: PROBLEM #include <algorithm> #include <functional> #include <queue> #include <vector> /// @brief slope trick template <class T> struct slope_trick { T min_f; std::priority_queue<T> l; std::priority_queue<T, std::vector<T>, std::greater<>> r; slope_trick() : min_f(), l(), r() {} T get_x() { return l.top(); } T get() { return min_f; } T get_y() { return get(); } /// @brief Add f(x) = a void add(T a) { min_f += a; } /// @brief Add f(x) = max(0, x - a) void add_f(T a) { if (!l.empty()) min_f += std::max(T(), l.top() - a); l.emplace(a); auto x = l.top(); l.pop(); r.emplace(x); } /// @brief Add f(x) = max(0, a - x) void add_g(T a) { if (!r.empty()) min_f += std::max(T(), a - r.top()); r.emplace(a); auto x = r.top(); r.pop(); l.emplace(x); } /// @brief Add f(x) = abs(x - a) = max(0, x - a) + max(0, a - x) void add_abs(T a) { add_f(a); add_g(a); } void min_l() { r = std::priority_queue<T, std::vector<T>, std::greater<>>(); } void min_r() { l = std::priority_queue<T>(); } }; #ifdef ATCODER #pragma GCC target("sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2") #endif #pragma GCC optimize("Ofast,fast-math,unroll-all-loops") #include <bits/stdc++.h> #ifndef ATCODER #pragma GCC target("sse4.2,avx2,bmi2") #endif template <class T, class U> constexpr bool chmax(T &a, const U &b) { return a < (T)b ? a = (T)b, true : false; } template <class T, class U> constexpr bool chmin(T &a, const U &b) { return (T)b < a ? a = (T)b, true : false; } constexpr std::int64_t INF = 1000000000000000003; constexpr int Inf = 1000000003; constexpr double EPS = 1e-7; constexpr double PI = 3.14159265358979323846; #define FOR(i, m, n) for (int i = (m); i < int(n); ++i) #define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i) #define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i) #define rep(i, n) FOR (i, 0, n) #define repn(i, n) FOR (i, 1, n + 1) #define repr(i, n) FORR (i, n, 0) #define repnr(i, n) FORR (i, n + 1, 1) #define all(s) (s).begin(), (s).end() struct Sonic { Sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(20); } constexpr void operator()() const {} } sonic; using namespace std; using ll = std::int64_t; using ld = long double; template <class T, class U> std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { return is >> p.first >> p.second; } template <class T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is >> i; return is; } template <class T, class U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) { return os << '(' << p.first << ',' << p.second << ')'; } template <class T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? "" : " ") << *it; return os; } template <class Head, class... Tail> void co(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cout << head << '\n'; else std::cout << head << ' ', co(std::forward<Tail>(tail)...); } template <class Head, class... Tail> void ce(Head &&head, Tail &&...tail) { if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n'; else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...); } void Yes(bool is_correct = true) { std::cout << (is_correct ? "Yes\n" : "No\n"); } void No(bool is_not_correct = true) { Yes(!is_not_correct); } void YES(bool is_correct = true) { std::cout << (is_correct ? "YES\n" : "NO\n"); } void NO(bool is_not_correct = true) { YES(!is_not_correct); } void Takahashi(bool is_correct = true) { std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n'; } void Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); } int main(void) { int n; cin >> n; vector a(n, vector(n, 0)); cin >> a; vector<slope_trick<ll>> v(n); rep (i, n) { rep (j, n) { v[a[i][j] - 1].add(j); v[a[i][j] - 1].add_f(i + j); v[a[i][j] - 1].add_g(i - j); } } ll ans = 0; rep (i, n) ans += v[i].get(); co(ans); return 0; }