結果
| 問題 | No.2743 Twisted Lattice |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-04-20 16:37:07 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 676 ms / 3,000 ms |
| コード長 | 5,821 bytes |
| コンパイル時間 | 5,305 ms |
| コンパイル使用メモリ | 277,560 KB |
| 実行使用メモリ | 36,220 KB |
| 最終ジャッジ日時 | 2024-04-20 16:37:19 |
| 合計ジャッジ時間 | 11,682 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 633 ms
36,220 KB |
| testcase_01 | AC | 172 ms
16,704 KB |
| testcase_02 | AC | 170 ms
15,800 KB |
| testcase_03 | AC | 642 ms
36,008 KB |
| testcase_04 | AC | 629 ms
36,096 KB |
| testcase_05 | AC | 648 ms
36,096 KB |
| testcase_06 | AC | 676 ms
36,180 KB |
| testcase_07 | AC | 654 ms
36,108 KB |
| testcase_08 | AC | 1 ms
5,376 KB |
| testcase_09 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
void input(){
}
void solve(){
ll h, w, n; in(h, w, n);
vll a(n), b(n);
rep(i, n){
in(a[i], b[i]);
}
map<ll, vll> mp;
rep(i, n){
mp[b[i]].push_back(a[i]);
}
for(auto [k, x] : mp){
Sort(mp[k]);
}
using T = tuple<ll, ll, ll>;
vector<T> p(n);
rep(i, n) p[i] = {b[i], a[i], i};
Sort(p);
vll ans(n, INF);
rep(i, n){
auto iter = upper_bound(ALL(mp[b[i]]), a[i]);
if(iter != mp[b[i]].end()){
chmin(ans[i], *iter - a[i]);
}
auto iter2 = lower_bound(ALL(mp[b[i]]), a[i]);
if(iter2 != mp[b[i]].begin()){
iter2--;
chmin(ans[i], a[i] - *iter2);
}
if(mp.count(b[i] - 1)){
ll x = mp[b[i] - 1][0];
chmin(ans[i], abs(a[i] - x) + x);
chmin(ans[i], abs(a[i] - x) + a[i]);
}
if(mp.count(b[i] + 1)){
ll x = mp[b[i] + 1][0];
chmin(ans[i], abs(a[i] - x) + x);
chmin(ans[i], abs(a[i] - x) + a[i]);
}
}
ll mn = INF;
rep(i, n){
auto [y, x, idx] = p[i];
if(i == 0){
mn = x - 1;
}else{
ll d = abs(y - get<0>(p[i - 1]));
chmin(ans[idx], mn + d + x - 1);
mn = min(mn + d, x - 1);
}
}
mn = INF;
rrep(i, n){
auto [y, x, idx] = p[i];
if(i == n - 1){
mn = x - 1;
}else{
ll d = abs(y - get<0>(p[i + 1]));
chmin(ans[idx], mn + d + x - 1);
mn = min(mn + d, x - 1);
}
}
vout(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}