結果
| 問題 | No.859 路線A、路線B、路線C |
| ユーザー |
 NyaanNyaan
|
| 提出日時 | 2019-08-09 21:45:37 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 1,000 ms |
| コード長 | 6,079 bytes |
| コンパイル時間 | 1,478 ms |
| コンパイル使用メモリ | 118,232 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-07-19 11:35:04 |
| 合計ジャッジ時間 | 1,814 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 12 |
ソースコード
#pragma GCC optimize("O2")#include <algorithm>#include <bitset>#include <cassert>#include <cmath>#include <cstdarg>#include <cstdio>#include <cstring>#include <ctime>#include <deque>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <utility>#include <vector>#define whlie while#define retunr return#define reutrn return#define reutnr return#define mp make_pair#define pb push_back#define eb emplace_back#define fi first#define se second#define inf 1001001001#define infLL (1LL << 61)#define FOR(i,a,b) for(int (i)=(int)(a); (i)<(int)(b); (i)++) // [a,b)#define rep(i,N) FOR((i), 0, (int)(N)) // [0,N)#define FORR(i,a,b) for(int (i)=(int)(b) - 1; (i)>=(int)(a); (i)--)#define repr(i,N) FORR((i), 0, (int)(N))#define each(x,v) for(auto &x : v)#define all(v) (v).begin(),(v).end()#define sz(v) ((int)(v).size())#define vrep(v,it) for(auto it=v.begin();it!=v.end();it++)#define vrepr(v,it) for(auto it=v.rbegin();it!=v.rend();it++)#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)#define ind(...) double __VA_ARGS__; in(__VA_ARGS__)#define inpii(...) pii __VA_ARGS__; in(__VA_ARGS__)#ifdef LOCAL#define trc(...) do { cout << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)#define stopif(val) assert( !(val) )#define trcv(v,...) do { cout << #v << " = "; vector_debug(v , ##__VA_ARGS__);cout << endl;} while(0)#else#define trc(...)#define stopif(...)#define trcv(...)#endifusing namespace std;using ll = long long;using pii = pair<int,int>;using pll = pair<ll,ll>;using vi = vector<int>;using vl = vector<ll>;using vs = vector<string>;using vpii = vector<pii>;using vvi = vector< vector<int> >;struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(15);} } iosetupnya;int gcd(int a, int b){if(a>b) swap(a,b); return a==0 ? b : gcd(b%a,a);} ll gcd(ll a, ll b){if(a>b) swap(a,b); return a==0 ? b : gcd(b%a,a);}ll lcm(int a, int b){return (1LL * a / gcd(a,b)) * b;} ll lcm(ll a, ll b){return (a / gcd(a,b)) * b;}inline ll pow(int a, int b){ll ans = 1; rep(i,b) ans *= a; return ans;} inline ll pow(ll a, ll b){ll ans = 1; rep(i,b) ans*= a; return ans;}inline ll pow(int a, ll b){ll ans = 1; rep(i,b) ans *= a; return ans;} inline ll pow(ll a, int b){ll ans = 1; rep(i,b) ans*= a; return ans;}template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename C> inline void _cin(C &c){cin >> c;}template<typename T,typename U> inline void _cin(pair<T,U> &p){cin >> p.fi; cin >> p.se;}template<typename C> inline void _cout(const C &c){cout << c;}template<typename T,typename U> inline void _cout(const pair<T,U> &p){cout << p.fi << ' ' << p.se;}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> void out(const T &t,U ...u){ _cout(t); if(sizeof...(u)) cout << ' '; out(u...);}template<typename C> inline void in(vector<C> &v,int N=-1){if(sz(v) != 0){int M=(N == -1) ? sz(v) : N; rep(i,M) _cin(v[i]);}else{C c;rep(i,N) v.pb((_cin(c),c));}}template<typename C> inline void in(C v[],int N){rep(i,N) _cin(v[i]);}template<typename C> inline void out(const vector<C> &v,int N=-1){int M=(N == -1) ? sz(v) : N; rep(i,M) {cout<<( (i)?" ":"" ); _cout(v[i]);} cout<<"\n";}template<typename C> inline void out(C v[],int N){rep(i,N) {cout<<( (i)?" ":"" ); _cout(v[i]);} cout<<"\n";}template<typename C> inline void vector_debug(const vector<C> &v,int N=-1){cout << "{"; int M=(N == -1) ? sz(v) : N; rep(i,M) {cout<<( (i)?", ":"" );_cout(v[i]);} cout<<"}";}template<typename C> inline void vector_debug(C v[], int N){cout << "{"; rep(i,N) {cout<<((i)?", ":""); _cout(*(v+i));} cout<<"}";}void dbg_out(){cout << endl;} template <typename T,class... U> void dbg_out(const T &t,U ...u){ _cout(t); if(sizeof...(u)) cout << ", "; dbg_out(u...);}template<typename C,class... U> void dbg_out(const vector<C> &v,U ...u){vector_debug(v); if(sizeof...(u)) cout << ", "; dbg_out(u...);}template<typename C,class... U> void dbg_out(const vector<vector<C>> &v,U ...u){cout << "{ "; rep(i,sz(v)) {if(i)cout<<", "; vector_debug(v[i]);}cout << " }"; if(sizeof...(u)) cout << ", "; dbg_out(u...);}template<typename C> inline C vmax(const vector<C> &v){C n=v[0]; rep(i,sz(v)) amax(n,v[i]); return n;} template<typename C> inline C vmax(C v[], intN){C n=v[0]; rep( i , N ) amax(n,v[i]); return n;}template<typename C> inline C vmin(const vector<C> &v){C n=v[0]; rep(i,sz(v)) amin(n,v[i]); return n;} template<typename C> inline C vmin(C v[], intN){C n=v[0]; rep( i , N ) amin(n,v[i]); return n;}void die(string s){out(s); exit(0);}#define rand mtrand#define randinit() random_device seed_gen; mt19937_64 mtrand(seed_gen())#define MOD 1000000007/////////////// main ///////////////int main(){randinit();#ifdef LOCALauto start = clock();#endifinl(x,y,z);vector<ll> a(256);a['A'] = x, a['B'] = y , a['C'] = z;inc(s0); inl(t0);inc(s1); inl(t1);if(s0 == s1) {ll ans = abs(t0 - t1);rep(i,3){int s = 'A' + i;if(s == s0) continue;amin(ans , t0 + a[s] + a[s1] - t1);amin(ans , t1 + a[s] + a[s0] - t0);trc(ans , i);}out(ans);}else{int s2 = 'A' + 'B' + 'C' - s0 - s1;trc(a[s0] , a[s1] , a[s2]);ll ans = (t0 + t1 - 1);amin(ans , a[s0] -t0 + a[s1] - t1 + 1);amin(ans , t0 + a[s2] + a[s1] - t1);amin(ans , t1 + a[s2] + a[s0] - t0);out(ans);}#ifdef LOCALcerr << "time : " << clock() - start << " ms" << endl;#endif}