結果
問題 | No.601 Midpoint Erase |
ユーザー |
![]() |
提出日時 | 2017-12-02 17:49:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 1,618 bytes |
コンパイル時間 | 2,292 ms |
コンパイル使用メモリ | 195,488 KB |
最終ジャッジ日時 | 2025-01-05 04:43:18 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include "bits/stdc++.h"using namespace std;using ll = long long int;using ld = long double;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vd = vector<double>;using vvd = vector<vd>;using vb = vector<bool>;using vvb = vector<vb>;using vs = vector<string>;const int INF = (1 << 30) - 1;const ll INF64 = ((ll)1 << 62) - 1;const double PI = 3.1415926535897932384626433832795;const int dx[] = { -1, 0, 1, 0 };const int dy[] = { 0, 1, 0, -1 };int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }int lcm(int x, int y) { return x / gcd(x, y) * y; }ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }bool isEven(int num) {return num % 2 == 0;}int main() {ios::sync_with_stdio(false);cin.tie(0);int n;cin >> n;vi x(n), y(n);for (int i = 0; i < n; i++) {cin >> x[i] >> y[i];}ll evenEvenCnt = 0, evenOddCnt = 0, oddEvenCnt = 0, oddOddCnt = 0;for (int i = 0; i < n; i++) {if (isEven(x[i]) && isEven(y[i])) {evenEvenCnt++;} else if (isEven(x[i]) && !isEven(y[i])) {evenOddCnt++;} else if (!isEven(x[i]) && isEven(y[i])) {oddEvenCnt++;} else {oddOddCnt++;}}evenEvenCnt = evenEvenCnt == 0 ? 1 : evenEvenCnt;evenOddCnt = evenOddCnt == 0 ? 1 : evenOddCnt;oddEvenCnt = oddEvenCnt == 0 ? 1 : oddEvenCnt;oddOddCnt = oddOddCnt == 0 ? 1 : oddOddCnt;ll res = evenEvenCnt / 2 + evenOddCnt / 2 + oddEvenCnt / 2 + oddOddCnt / 2;cout << (res & 1 ? "Alice" : "Bob") << endl;return 0;}