結果
問題 | No.2743 Twisted Lattice |
ユーザー | noya2 |
提出日時 | 2024-04-21 14:54:18 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 720 ms / 3,000 ms |
コード長 | 6,050 bytes |
コンパイル時間 | 4,212 ms |
コンパイル使用メモリ | 302,712 KB |
実行使用メモリ | 29,952 KB |
最終ジャッジ日時 | 2024-04-21 14:54:29 |
合計ジャッジ時間 | 10,259 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 703 ms
29,824 KB |
testcase_01 | AC | 86 ms
9,280 KB |
testcase_02 | AC | 82 ms
9,648 KB |
testcase_03 | AC | 677 ms
29,696 KB |
testcase_04 | AC | 720 ms
29,824 KB |
testcase_05 | AC | 684 ms
29,696 KB |
testcase_06 | AC | 642 ms
29,824 KB |
testcase_07 | AC | 649 ms
29,952 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" void solve(){ int h, w, n; in(h,w,n); vector<ll> xs(n), ys(n); rep(i,n) in(xs[i],ys[i]); vector<ll> ans(n,linf); // same y { map<ll,vector<int>> mp; rep(i,n) mp[ys[i]].emplace_back(i); for (auto [x, ids] : mp){ sort(all(ids),[&](int l, int r){ return xs[l] < xs[r]; }); int sz = ids.size(); rep(i,sz){ if (i > 0){ chmin(ans[ids[i]],xs[ids[i]]-xs[ids[i-1]]); } if (i < sz-1){ chmin(ans[ids[i]],xs[ids[i+1]]-xs[ids[i]]); } } } } // diff 1 y { map<ll,ll> mp; rep(i,n){ if (!mp.contains(ys[i])){ mp[ys[i]] = linf; } chmin(mp[ys[i]],xs[i]); } rep(i,n){ if (mp.contains(ys[i]-1)){ chmin(ans[i],max(xs[i],mp[ys[i]-1])); } if (mp.contains(ys[i]+1)){ chmin(ans[i],max(xs[i],mp[ys[i]+1])); } } } // diff >= 2 y { ll mi = linf; map<ll,vector<int>> mp; rep(i,n) mp[ys[i]].emplace_back(i); for (auto [y, ids] : mp){ for (int i : ids){ chmin(ans[i],xs[i]+ys[i]-2+mi); } for (int i : ids){ chmin(mi,xs[i]-ys[i]); } } mi = linf; for (auto [y, ids] : mp | views::reverse){ for (int i : ids){ chmin(ans[i],xs[i]-ys[i]-2+mi); } for (int i : ids){ chmin(mi,xs[i]+ys[i]); } } } rep(i,n){ out(ans[i]); } } int main(){ int t = 1; //in(t); while (t--) { solve(); } }