結果
問題 | No.126 2基のエレベータ |
ユーザー |
|
提出日時 | 2019-09-13 22:48:15 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 3,473 bytes |
コンパイル時間 | 1,421 ms |
コンパイル使用メモリ | 167,652 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-10 18:34:29 |
合計ジャッジ時間 | 2,259 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
// includes#include <bits/stdc++.h>using namespace std;// macros#define pb emplace_back#define mk make_pair#define FOR(i, a, b) for(int i=(a);i<(b);++i)#define rep(i, n) FOR(i, 0, n)#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)#define all(x) (x).begin(),(x).end()#define sz(x) ((int)(x).size())#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())#define bit(n) (1LL<<(n))// functionstemplate <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr =itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr;auto titr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; autotitr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os <<itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end();++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}// typesusing ll = long long int;using P = pair<int, int>;// constantsconst int inf = 1e9;const ll linf = 1LL << 50;const double EPS = 1e-10;const int mod = 1000000007;const int dx[4] = {-1, 0, 1, 0};const int dy[4] = {0, -1, 0, 1};// iostruct fast_io{fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}} fast_io_;int main(int argc, char const* argv[]){int a, b, s;cin >> a >> b >> s;if(s == 1){if(a == 0)cout << 2 << endl;else cout << a << endl;}else{if(abs(a - s) <= abs(b - s)){int res = abs(a - s);res += s;cout << res << endl;}else{int res = inf;int tmp1 = abs(b - s);tmp1 += abs(s - 1);tmp1 += abs(a - 1);tmp1 += 1;res = tmp1;if(a > 0){int tmp2 = abs(b - s);tmp2 += abs(a - s);tmp2 += a;res = min(res, tmp2);}cout << res << endl;}}return 0;}