結果
問題 | No.48 ロボットの操縦 |
ユーザー |
|
提出日時 | 2022-12-06 02:18:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 2,426 bytes |
コンパイル時間 | 1,941 ms |
コンパイル使用メモリ | 194,072 KB |
最終ジャッジ日時 | 2025-02-09 05:36:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>using namespace std;//#include <atcoder/all>//using namespace atcoder;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;using vvvvvvll = vector<vvvvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define ALL(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}/*using mint = modint998244353;//using Mint = modint;vector<mint> fact, factinv, inv;const ll mod = 998244353;void prenCkModp(ll n) {fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = mod - (inv[mod % i] * (mod / i));factinv[i] = (factinv[i - 1] * inv[i]);}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return fact[n] * (factinv[k] * factinv[n - k]);}*/int main() {ll X,Y,L;cin>>X>>Y>>L;ll an=(abs(X)+L-1)/L+(abs(Y)+L-1)/L;if(X==0){if(Y>=0)cout<<an<<endl;else cout<<an+2<<endl;}else if(Y==0){cout<<an+1<<endl;}else if(Y>0){cout<<an+1<<endl;}else{cout<<an+2<<endl;}}