Submission #1041495
Source Code Expand
#include "bits/stdc++.h"
#ifndef err
#define err(...)(void)0
#endif
using namespace std;
using ll = long long;
using ull = decltype(1ull);
template<class T>int size(T&&a) { return a.size(); }
#define REP(t,a)for(typename make_signed<decltype(a.second)>::type t=a.first,_l##t=a.second;t<_l##t;t++)
#define RREP(t,a)for(typename make_signed<decltype(a.second)>::type t=a.second-1,_l##t=a.first;t>=_l##t;t--)
template<class B>pair<int, B>make_pair(B b) { return{ 0,b }; }
#define rep(t,...)REP(t,make_pair(__VA_ARGS__))
#define rrep(t,...)RREP(t,make_pair(__VA_ARGS__))
#define all(a)begin(a),end(a)
#define rall(a)a.rbegin(),a.rend()
void Calc();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cin.exceptions(istream::failbit | istream::badbit);
cout << fixed << setprecision(15); Calc(); cout.flush(); return 0;
}
template<class A>void amax(A&a, A b) { a = max(a, b); }
template<class A>void amin(A&a, A b) { a = min(a, b); }
struct Scanner {
template<class A = string>A Next() { A a; cin >> a; return a; }
template<class A = int>vector<A>Array(int n) { vector<A>a(n); for (A&i : a) cin >> i; return a; }
string Line() const { string s; getline(cin, s); return s; }
template<class A>Scanner&operator,(A&a) { a = Next<A>(); return *this; }
template<class A>operator A() { return Next<A>(); }
}in;
/*---------------------------------------------------------------------*/
void Calc() {
ll a, b;
in, a, b;
ll ans = 0;
if (b < 0) {
if (b <= a) {
ans = min(abs(-a + b) + 1, abs(a + b));
} else {
ans = abs(a - b);
}
ans++;
} else {
if (a < b) {
ans = min(abs(a - b), abs(-a - b) + 1);
} else {
ans = abs(-a - b) + 1;
}
}
cout << (ans) << endl;
}
Submission Info
Submission Time |
|
Task |
A - Simple Calculator |
User |
oigami |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1794 Byte |
Status |
WA |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
2 ms |
256 KB |
0_01.txt |
AC |
3 ms |
256 KB |
0_02.txt |
AC |
3 ms |
256 KB |
1_00.txt |
AC |
2 ms |
256 KB |
1_01.txt |
AC |
3 ms |
256 KB |
1_02.txt |
AC |
3 ms |
256 KB |
1_03.txt |
AC |
3 ms |
256 KB |
1_04.txt |
AC |
2 ms |
256 KB |
1_05.txt |
WA |
3 ms |
256 KB |
1_06.txt |
AC |
3 ms |
256 KB |
1_07.txt |
AC |
2 ms |
256 KB |
1_08.txt |
AC |
3 ms |
256 KB |
1_09.txt |
AC |
2 ms |
256 KB |
1_10.txt |
WA |
3 ms |
256 KB |