結果

問題 No.511 落ちゲー 〜手作業のぬくもり〜
ユーザー はむこはむこ
提出日時 2016-09-01 04:37:12
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 3,612 bytes
コンパイル時間 1,360 ms
コンパイル使用メモリ 163,472 KB
実行使用メモリ 13,640 KB
最終ジャッジ日時 2024-11-14 14:05:09
合計ジャッジ時間 36,546 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
12,964 KB
testcase_01 AC 2 ms
13,636 KB
testcase_02 AC 2 ms
12,968 KB
testcase_03 AC 2 ms
13,096 KB
testcase_04 AC 2 ms
12,452 KB
testcase_05 AC 2 ms
12,960 KB
testcase_06 AC 2 ms
13,216 KB
testcase_07 AC 2 ms
13,220 KB
testcase_08 WA -
testcase_09 AC 2 ms
6,816 KB
testcase_10 WA -
testcase_11 AC 2 ms
6,820 KB
testcase_12 AC 2 ms
6,816 KB
testcase_13 WA -
testcase_14 AC 2 ms
6,820 KB
testcase_15 WA -
testcase_16 AC 2 ms
6,816 KB
testcase_17 AC 1 ms
6,816 KB
testcase_18 AC 2 ms
6,816 KB
testcase_19 WA -
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 6 ms
6,820 KB
testcase_22 WA -
testcase_23 AC 6 ms
6,820 KB
testcase_24 AC 2 ms
6,816 KB
testcase_25 AC 5 ms
6,816 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 TLE -
testcase_30 TLE -
testcase_31 TLE -
testcase_32 TLE -
testcase_33 WA -
testcase_34 WA -
testcase_35 TLE -
testcase_36 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>;
vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using P = pair<ll, ll>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
void printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }
#define ldout fixed << setprecision(40) 



ll height[100010];
ll a[100010];
ll b[100010];
ll x[100010];
int main() {
    cin.tie(0); ios::sync_with_stdio(false);

    ll n, w, h; cin >> n >> w >> h;
    rep(i, n) { 
        cin >> a[i] >> b[i] >> x[i];
        x[i]--;
    }

    ll a_point = 0;
    bitset<100000> bef;
    bitset<100000> aft;
    rep(i, n) {
        if (i % 2 == 1) continue;
        bef.reset();
        aft.reset();
        rep(j, a[i]) {
            ll& tmp = height[x[i]+j];
            bef.set(x[i]+j, tmp < h);
            aft.set(x[i]+j, tmp + b[i] >= h);
            height[x[i]+j] += b[i];
        }
        a_point += (bef & aft).count();
//        cout << height << endl;
    }
    if (a_point * 2 == w) {
        cout << "DRAW" << endl;
    } else if (a_point > w / 2) {
        cout << "A" << endl;
    } else {
        cout << "B" << endl;
    }
    return 0;
}
0