結果

問題 No.855 ヘビの日光浴
ユーザー ei1333333ei1333333
提出日時 2019-07-26 23:01:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 6,377 bytes
コンパイル時間 2,341 ms
コンパイル使用メモリ 210,136 KB
実行使用メモリ 14,112 KB
最終ジャッジ日時 2024-04-09 20:29:17
合計ジャッジ時間 21,135 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
13,756 KB
testcase_01 AC 1 ms
6,812 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 1 ms
6,940 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 RE -
testcase_15 AC 2 ms
6,940 KB
testcase_16 RE -
testcase_17 AC 2 ms
6,940 KB
testcase_18 RE -
testcase_19 RE -
testcase_20 AC 1 ms
6,944 KB
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 RE -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
testcase_45 RE -
testcase_46 RE -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 RE -
testcase_52 RE -
testcase_53 RE -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 RE -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 RE -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 RE -
testcase_71 RE -
testcase_72 RE -
testcase_73 RE -
testcase_74 RE -
testcase_75 RE -
testcase_76 RE -
testcase_77 RE -
testcase_78 RE -
testcase_79 RE -
testcase_80 RE -
testcase_81 RE -
testcase_82 RE -
testcase_83 AC 605 ms
6,940 KB
testcase_84 AC 610 ms
6,944 KB
testcase_85 AC 612 ms
6,944 KB
testcase_86 AC 785 ms
6,944 KB
testcase_87 AC 643 ms
6,940 KB
testcase_88 AC 571 ms
6,940 KB
testcase_89 AC 628 ms
6,944 KB
testcase_90 AC 676 ms
6,944 KB
testcase_91 AC 684 ms
6,940 KB
testcase_92 AC 624 ms
6,940 KB
testcase_93 AC 1 ms
6,944 KB
testcase_94 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


int main() {
  int W, H, N;
  cin >> W >> H >> N;
  vector< int > X(N), Y(N), L(N);

  for(int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i] >> L[i];
  }


  map< int, int > mpSita, mpUe;
  map< int, int > mpMigi, mpHidari;


  for(int i = 0; i < N; i++) {
    if(Y[i] == 0) {

      mpSita[X[i]] += L[i];

      int cash = mpSita[X[i]];

      int64 times = infll;
      int type = -1;

      if(mpUe.count(X[i])) {
        if(mpUe[X[i]] <= cash) {
          if(chmin(times, mpUe[X[i]])) type = 0;
        }
      }

      for(auto &p : mpHidari) {
        if(p.first <= cash) {
          if(p.second >= X[i]) {
            if(chmin(times, p.first)) type = 1;
          }
        }
      }

      for(auto &p : mpMigi) {
        if(p.first <= cash) {
          if(p.second <= X[i]) {
            if(chmin(times, p.first)) type = 2;
          }
        }
      }

      if(H + 1 <= cash) {
        if(chmin(times, H + 1)) type = 3;
      }

      if(~type) {
        mpSita.erase(X[i]);
        if(type == 0) {
          mpUe.erase(X[i]);
        } else if(type == 1) {
          mpHidari.erase(times);
        } else if(type == 2) {
          mpMigi.erase(times);
        }
      }

    } else if(Y[i] == H + 1) {

      if(!mpUe.count(X[i])) mpUe[X[i]] = H + 1;
      mpUe[X[i]] -= L[i];

      int cash = mpUe[X[i]];

      int64 times = -infll;
      int type = -1;

      if(mpSita.count(X[i])) {
        if(mpSita[X[i]] >= cash) {
          if(chmax(times, mpUe[X[i]])) type = 0;
        }
      }

      for(auto &p : mpHidari) {
        if(p.first >= cash) {
          if(p.second >= X[i]) {
            if(chmax(times, p.first)) type = 1;
          }
        }
      }

      for(auto &p : mpMigi) {
        if(p.first >= cash) {
          if(p.second <= X[i]) {
            if(chmax(times, p.first)) type = 2;
          }
        }
      }

      if(cash <= 0) {
        if(chmax(times, 0)) type = 3;
      }

      if(~type) {
        mpUe.erase(X[i]);
        if(type == 0) {
          mpSita.erase(X[i]);
        } else if(type == 1) {
          mpHidari.erase(times);
        } else if(type == 2) {
          mpMigi.erase(times);
        }
      }


    } else if(X[i] == 0) {

      mpHidari[Y[i]] += L[i];

      int cash = mpHidari[Y[i]];

      int64 times = infll;
      int type = -1;

      if(mpMigi.count(Y[i])) {
        if(mpMigi[Y[i]] <= cash) {
          if(chmin(times, mpMigi[Y[i]])) type = 0;
        }
      }

      for(auto &p : mpUe) {
        if(p.first <= cash) {
          if(p.second <= Y[i]) {
            if(chmin(times, p.first)) type = 1;
          }
        }
      }

      for(auto &p : mpSita) {
        if(p.first <= cash) {
          if(p.second >= Y[i]) {
            if(chmin(times, p.first)) type = 2;
          }
        }
      }

      if(W + 1 <= cash) {
        if(chmin(times, W + 1)) type = 3;
      }


      if(~type) {
        mpHidari.erase(Y[i]);
        if(type == 0) {
          mpMigi.erase(Y[i]);
        } else if(type == 1) {
          mpUe.erase(times);
        } else if(type == 2) {
          mpSita.erase(times);
        }
      }


    } else if(X[i] == W + 1) {


      if(!mpMigi.count(Y[i])) mpMigi[Y[i]] = W + 1;
      mpMigi[Y[i]] -= L[i];

      int cash = mpMigi[Y[i]];


      int64 times = -infll;
      int type = -1;

      if(mpHidari.count(Y[i])) {
        if(mpHidari[Y[i]] >= cash) {
          if(chmax(times, mpHidari[Y[i]])) type = 0;
        }
      }

      for(auto &p : mpUe) {
        if(p.first >= cash) {
          if(p.second <= Y[i]) {
            if(chmax(times, p.first)) type = 1;
          }
        }
      }

      for(auto &p : mpSita) {
        if(p.first >= cash) {
          if(p.second >= Y[i]) {
            if(chmax(times, p.first)) type = 2;
          }
        }
      }

      if(cash <= 0) {
        if(chmax(times, 0)) type = 3;
      }

      if(~type) {
        mpMigi.erase(Y[i]);
        if(type == 0) {
          mpHidari.erase(Y[i]);
        } else if(type == 1) {
          mpUe.erase(times);
        } else if(type == 2) {
          mpSita.erase(times);
        }
      }

    } else {
      assert(0);
    }
  }

  int64 ret = 0;
  for(auto &p : mpUe) ret += H + 1 - p.second;
  for(auto &p : mpMigi) ret += W + 1 - p.second;
  for(auto &p : mpHidari) ret += p.second;
  for(auto &p : mpSita) ret += p.second;
  cout << ret << endl;


}

0