結果
問題 | No.643 Two Operations No.2 |
ユーザー | tubo28 |
提出日時 | 2018-02-02 21:46:59 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,530 bytes |
コンパイル時間 | 1,960 ms |
コンパイル使用メモリ | 167,256 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-10 01:14:29 |
合計ジャッジ時間 | 2,077 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using ll = long long; // #define int ll #define FOR(i, a, b) for (int i = (a); i < int(b); ++i) #define RFOR(i, a, b) for (int i = (b) - 1; i >= int(a); --i) #define rep(i, n) FOR(i, 0, n) #define rep1(i, n) FOR(i, 1, int(n) + 1) #define rrep(i, n) RFOR(i, 0, n) #define rrep1(i, n) RFOR(i, 1, int(n) + 1) #define all(c) begin(c), end(c) namespace io { #ifdef LOCAL #define dump(...) \ do { \ std::ostringstream os; \ os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \ io::print_to(os, ", ", "\n", __VA_ARGS__); \ std::cerr << io::highlight(os.str()); \ } while (0) #define dump_(arr) \ do { \ std::ostringstream os; \ os << __LINE__ << ":\t" << #arr << " = ["; \ io::print_to_(os, ", ", "]\n", all(arr)); \ std::cerr << io::highlight(os.str()); \ } while (0) #define dumpf(fmt, ...) \ do { \ const int N = 65536; \ static char b[N]; \ int l = snprintf(b, N, "%d:\t", __LINE__); \ snprintf(b + l, N - l, fmt, ##__VA_ARGS__); \ std::cerr << io::highlight(b) << std::endl; \ } while(0) #else #define dump(...) #define dump_(...) #define dumpf(...) #endif std::string highlight(std::string s) { #ifdef _MSC_VER return s; #else return "\033[33m" + s + "\033[0m"; #endif } template <typename T> void print_to(std::ostream &os, const char *, const char *tail, const T &fst) { os << fst << tail; } template <typename Fst, typename... Rst> void print_to(std::ostream &os, const char *del, const char *tail, const Fst &fst, const Rst &... rst) { os << fst << del; print_to(os, del, tail, rst...); } template <typename Iter> void print_to_(std::ostream &os, const char *del, const char *tail, Iter bgn, Iter end) { for (Iter it = bgn; it != end;) { os << *it; os << (++it != end ? del : tail); } } template <typename Fst, typename... Rst> void println(const Fst &fst, const Rst &... rst) { io::print_to(std::cout, "\n", "\n", fst, rst...); } template <typename Fst, typename... Rst> void print(const Fst &fst, const Rst &... rst) { io::print_to(std::cout, " ", "\n", fst, rst...); } template <typename Iter> void println_(Iter bgn, Iter end) { print_to_(std::cout, "\n", "\n", bgn, end); } template <typename Iter> void print_(Iter bgn, Iter end) { print_to_(std::cout, " ", "\n", bgn, end); } int trush = (std::cout.precision(10), std::cout.setf(std::ios::fixed), std::cin.tie(0), std::ios::sync_with_stdio(0)); } using io::print; using io::println; using io::println_; using io::print_; using namespace std; // const int MOD = 1000000007; int solve(int x, int y) { if (x == y) return 0; if (x + y == x - y) return 1; if (y - x == y + x) return 2; if (y == -x) return 3; return -1; } signed main() { int x, y; while (cin >> x >> y) { print(solve(x, y)); } }