#362921 (C++17) No.855 ヘビの日光浴

提出ソース

結果

問題	No.855 ヘビの日光浴
ユーザー	ei1333333
提出日時	2019-07-26 23:10:08
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,929 bytes
コンパイル時間	2,722 ms
コンパイル使用メモリ	215,280 KB
実行使用メモリ	13,984 KB
最終ジャッジ日時	2024-10-01 20:50:49
合計ジャッジ時間	17,157 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 13,884 KB
testcase_01	AC	2 ms 6,948 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	2 ms 6,820 KB
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	2 ms 6,820 KB
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	WA	-
testcase_81	WA	-
testcase_82	WA	-
testcase_83	AC	698 ms 6,820 KB
testcase_84	AC	710 ms 6,816 KB
testcase_85	AC	709 ms 6,816 KB
testcase_86	AC	927 ms 6,816 KB
testcase_87	AC	757 ms 6,816 KB
testcase_88	AC	665 ms 6,820 KB
testcase_89	AC	736 ms 6,816 KB
testcase_90	AC	776 ms 6,816 KB
testcase_91	AC	797 ms 6,816 KB
testcase_92	AC	726 ms 6,816 KB
testcase_93	AC	2 ms 6,816 KB
testcase_94	TLE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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) {
          if(!mpUe.count(times)) exit(0);
          mpUe.erase(X[i]);
        } else if(type == 1) {
          if(!mpHidari.count(times)) exit(0);
          mpHidari.erase(times);
        } else if(type == 2) {
          if(!mpMigi.count(times)) exit(0);
          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, mpSita[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) {
          if(!mpSita.count(times)) exit(0);
          mpSita.erase(X[i]);
        } else if(type == 1) {
          if(!mpHidari.count(times)) exit(0);
          mpHidari.erase(times);
        } else if(type == 2) {
          if(!mpMigi.count(times)) exit(0);
          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) {
          if(!mpMigi.count(times)) exit(0);
          mpMigi.erase(Y[i]);
        } else if(type == 1) {
          if(!mpUe.count(times)) exit(0);
          mpUe.erase(times);
        } else if(type == 2) {
          if(!mpSita.count(times)) exit(0);
          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) {
          if(!mpHidari.count(times)) exit(0);
          mpHidari.erase(Y[i]);
        } else if(type == 1) {
          if(!mpUe.count(times)) exit(0);
          mpUe.erase(times);
        } else if(type == 2) {
          if(!mpSita.count(times)) exit(0);
          mpSita.erase(times);
        }
      }

    } else {
      exit(0);
      
      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;


}

yukicoder

結果

テストケース

ソースコード