結果
問題 | No.131 マンハッタン距離 |
ユーザー |
![]() |
提出日時 | 2015-11-14 11:50:20 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,894 bytes |
コンパイル時間 | 802 ms |
コンパイル使用メモリ | 94,484 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-13 16:43:15 |
合計ジャッジ時間 | 1,552 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include <cstdio>#include <iostream>#include <vector>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <string>#include <cstring>#include <sstream>#include <algorithm>#include <functional>#include <queue>#include <stack>#include <cmath>#include <iomanip>#include <list>#include <tuple>#include <bitset>#include <ciso646>using namespace std;typedef long long ll;typedef unsigned long long ull;typedef long double ld;typedef pair<ll, ll> P;typedef tuple<ll, ll, ll> T;typedef vector<ll> vec;inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }struct UnionFind { vector<ll> data; UnionFind(int size) : data(size, -1) { } bool unionSet(ll x, ll y) { x = root(x); y = root(y); if (x != y) { if(data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(ll x, ll y) { return root(x) == root(y); } llroot(ll x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(ll x) { return -data[root(x)]; } };template<class T> inline T sqr(T x) { return x*x; }template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; }inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout <<*_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstreamsout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); }#define For(i,a,b) for(ll (i) = (a);i < (b);(i)++)#define rep(i,n) For(i,0,n)#define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--)#define rrep(i,n) rFor(i,n,0)#define clr(a) memset((a), 0 ,sizeof(a))#define mclr(a) memset((a), -1 ,sizeof(a))#define all(a) (a).begin(),(a).end()#define sz(a) (sizeof(a))#define dump(val) cerr << #val " = " << val << endl;#define toint toInt#define tostr toStringconst ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };const ll mod = 1e9 + 7;const ll INF = 1e9 + 9;#define int llsigned main(){int x, y, d;cin >> x >> y >> d;x = min(x, d);y = min(y, d);if (x + y >= d){cout << min((x + y) - d + 1, d + 1) << endl;}else{cout << 0 << endl;}return 0;}