#466420 (C++14) No.1028 闇討ち

• 問題: No.1028 闇討ち
• ユーザー: Ogtsn99
• 提出日時: 2020-04-18 10:17:36
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 100 ms / 2,000 ms
• コード長: 5,204 bytes
• コンパイル時間: 1,942 ms
• コンパイル使用メモリ: 174,188 KB
• 実行使用メモリ: 26,880 KB
• 最終ジャッジ日時: 2024-10-03 23:05:04
• 合計ジャッジ時間: 3,909 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,820 KB
testcase_01	AC	2 ms; 6,820 KB
testcase_02	AC	2 ms; 6,820 KB
testcase_03	AC	2 ms; 6,816 KB
testcase_04	AC	2 ms; 6,820 KB
testcase_05	AC	2 ms; 6,820 KB
testcase_06	AC	2 ms; 6,820 KB
testcase_07	AC	2 ms; 6,816 KB
testcase_08	AC	2 ms; 6,820 KB
testcase_09	AC	5 ms; 6,820 KB
testcase_10	AC	8 ms; 6,820 KB
testcase_11	AC	23 ms; 8,576 KB
testcase_12	AC	92 ms; 25,344 KB
testcase_13	AC	91 ms; 25,216 KB
testcase_14	AC	52 ms; 15,360 KB
testcase_15	AC	18 ms; 7,040 KB
testcase_16	AC	99 ms; 26,752 KB
testcase_17	AC	100 ms; 26,624 KB
testcase_18	AC	100 ms; 26,880 KB
testcase_19	AC	99 ms; 26,752 KB
testcase_20	AC	99 ms; 26,880 KB
testcase_21	AC	98 ms; 26,752 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key) 
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
void YN(bool flg) {cout<<(flg?"YES":"NO")<<'\n';}
void Yn(bool flg) {cout<<(flg?"Yes":"No")<<'\n';}
void yn(bool flg) {cout<<(flg?"yes":"no")<<'\n';}
template <typename T> 
int getIndexOfLowerBound(vector <T> &v, T x){
    return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T> 
int getIndexOfUpperBound(vector <T> &v, T x){
    return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
    is >> p_var.first >> p_var.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec) is >> x;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &df) {
    for(int i=0;i<df.size();i++)for(int j=0;j<df[i].size();j++)
    is >> df[i][j];
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
    DUMPOUT<<'{';
    os << pair_var.first;
    DUMPOUT<<',';
    os << " "<< pair_var.second;
    DUMPOUT<<'}';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    DUMPOUT<<'[';
    for (int i = 0; i < vec.size(); i++) 
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    DUMPOUT<<']';
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto& vec : df) os<<vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
    DUMPOUT << "{";
    repi(itr, map_var) {
        os << *itr;
        itr++;
        if (itr != map_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
    DUMPOUT << "{";
    repi(itr, set_var) {
        os << *itr;
        itr++;
        if (itr != set_var.end()) DUMPOUT << ", ";
        itr--;
    }
    DUMPOUT << "}";
    return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

int midf(vector <int> &a){
    if(a.size()%2==0){
        int tmp = a[a.size()/2-1] + a[a.size()/2];
        //dump(a[a.size()/2-1], a[a.size()/2]);
        return (tmp + 1)/2;
    }else return a[a.size()/2];
}
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
    int n; cin>>n;
    if(n == 1) {print(0); return 0;}
    vector <vector<int>> g(n,vector <int>(n));
    cin>>g;
    vector <int> ans(n);
    rep(i, n)rep(j,n) ans[g[i][j]-1] += j;
    vector <int> ue(n), shita(n);
    vector <vector<int>> addue(n,vector <int>(n)), addshita(n,vector <int>(n));
    rep(i, n){
        
        rep(j, i){
            ue[g[i-1-j][j]-1]++;
        }     
        rep(j, n){
            if(i != 0) addue[i][j] = addue[i-1][j];
            addue[i][j] += ue[j];
        }
    }
    rrep(i, n){
        rep(j, n-1-i){
            shita[g[i+1+j][j]-1]++;
        }
        rep(j, n){
            if(i != n-1) addshita[i][j] = addshita[i+1][j];
            addshita[i][j] += shita[j];
        }
    }
    dump(addue, addshita);
    dump(ans);
    vector <int> tans(n, INF);
    rep(i, n){
        rep(j, n)
        chmin(tans[j], ans[j] + addue[i][j] + addshita[i][j]);
    }
    print(SUM(tans));
}