結果
問題 | No.1028 闇討ち |
ユーザー | Haar |
提出日時 | 2020-04-17 22:02:33 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 2,954 bytes |
コンパイル時間 | 2,338 ms |
コンパイル使用メモリ | 207,676 KB |
実行使用メモリ | 16,256 KB |
最終ジャッジ日時 | 2023-07-27 00:48:58 |
合計ジャッジ時間 | 6,046 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,356 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 3 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 10 ms
4,376 KB |
testcase_10 | AC | 14 ms
4,380 KB |
testcase_11 | AC | 54 ms
6,260 KB |
testcase_12 | AC | 240 ms
15,500 KB |
testcase_13 | AC | 237 ms
15,364 KB |
testcase_14 | AC | 129 ms
11,572 KB |
testcase_15 | AC | 40 ms
5,980 KB |
testcase_16 | AC | 253 ms
15,656 KB |
testcase_17 | AC | 255 ms
16,192 KB |
testcase_18 | AC | 255 ms
16,256 KB |
testcase_19 | AC | 257 ms
15,980 KB |
testcase_20 | AC | 258 ms
15,984 KB |
testcase_21 | AC | 255 ms
15,960 KB |
ソースコード
#include <bits/stdc++.h> using i32 = int_fast32_t; using i64 = int_fast64_t; using u32 = uint_fast32_t; using u64 = uint_fast64_t; using f64 = double; using f80 = long double; #define FOR(v, a, b) for(i64 v = (a); v < (b); ++v) #define FORE(v, a, b) for(i64 v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(i64 v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include <Mylib/Debug/debug.cpp> #else #define dump(...) ((void)0) #endif using namespace std; template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;} template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;} template <typename T> void pout(const T &value){std::cout << value << "\n";} template <typename T, typename ...Args> void pout(const T &value, const Args&... args){std::cout << value << " ";pout(args...);} template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);} template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; int dist(int x1, int y1, int x2, int y2){ x2 -= x1; y2 -= y1; if(x2 < 0) x2 = -x2; if(y2 < 0) y2 = -y2; if(x2 == 0) return y2; if(y2 == 0) return x2; if((x2 + y2) % 2 == 0) return max(x2, y2); return min(max(x2-1, y2), max(x2, y2-1)) + 1; } template <typename F> int ternary_search_downwards(int lb, int ub, const F &f){ lb -= 1; ub += 1; while(abs(lb - ub) > 1){ int mid = (lb + ub) / 2; if(f(mid) <= f(mid+1)){ ub = mid; }else{ lb = mid; } } return ub; } int main(){ int N; cin >> N; auto A = make_vector<int>(N, N, 0); cin >> A; vector<vector<pair<int,int>>> h(N); REP(i,N){ REP(j,N){ h[A[i][j]-1].emplace_back(i, j); } } int ans = 0; REP(i,N){ auto check = [&](int k){ int ret = 0; for(auto &[x,y] : h[i]){ ret += dist(k, 0, x, y); } return ret; }; int x = ternary_search_downwards(0, N, check); ans += check(x); } pout(ans); return 0; }