結果
問題 | No.107 モンスター |
ユーザー | mai |
提出日時 | 2017-08-09 23:08:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 125 ms / 5,000 ms |
コード長 | 4,958 bytes |
コンパイル時間 | 3,422 ms |
コンパイル使用メモリ | 230,336 KB |
実行使用メモリ | 13,696 KB |
最終ジャッジ日時 | 2024-04-27 02:28:48 |
合計ジャッジ時間 | 4,869 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,948 KB |
testcase_02 | AC | 2 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 | 2 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,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 43 ms
6,940 KB |
testcase_14 | AC | 92 ms
8,576 KB |
testcase_15 | AC | 91 ms
8,576 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 13 ms
6,944 KB |
testcase_18 | AC | 51 ms
13,696 KB |
testcase_19 | AC | 48 ms
13,696 KB |
testcase_20 | AC | 54 ms
6,940 KB |
testcase_21 | AC | 38 ms
6,944 KB |
testcase_22 | AC | 83 ms
8,576 KB |
testcase_23 | AC | 125 ms
13,696 KB |
testcase_24 | AC | 93 ms
13,568 KB |
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)': main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type] 63 | } | ^
ソースコード
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debugm(m) {printf("L%d %s \n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}} #define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,w,h) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}} #define debugaar(m,w,h) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt) #define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } mt19937 mt(8901016); inline int rand_int(int l, int h) { return uniform_int_distribution<>(l, h)(mt); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; int n, len; int result = -1; int dd[20]; map<vector<int>, int> memo; // 嘘解法成らず // ------------------------- int dfs(vector<int> used, int life, int max_life, int m = 0) { if (m == n) return life; auto memoit = memo.find(used); if (memoit != memo.end() && memoit->second < life) return 0; int best = 0; repeat(i, n) { if (used[i]) continue; vector<int> new_used = used; new_used[i] = true; if (dd[i] < 0) { // わるいスライム int new_life = life + dd[i]; if (new_life <= 0) continue; best = max(best, dfs(new_used, new_life, max_life + 100, m + 1)); } else { // ホイミン int new_life = min(max_life, life + dd[i]); best = max(best, dfs(new_used, new_life, max_life, m + 1)); } } return memo[used] = best; } void calc(const vector<int>& used) { int life; int max_life = 100; life = memo[used]; if (life == 0) return; repeat(i, n) { if (used[i] && dd[i] < 0) { max_life += 100; } } int best = 0; repeat(i, n) { if (used[i]) continue; vector<int> new_used = used; new_used[i] = true; if (dd[i] < 0) { // わるいスライム int new_life = life + dd[i]; if (new_life <= 0) continue; memo[new_used] = max(memo[new_used], new_life); } else { // ホイミン int new_life = min(max_life, life + dd[i]); memo[new_used] = max(memo[new_used], new_life); } } } int main() { scanner >> n; repeat(i, n) { scanner >> dd[i]; } //sort(dd, dd + n, greater<int>()); // cout << dfs(vector<int>(n), 100, 100) << endl; vector<int> used(n, 0); memo[used] = 100; iterate(bit, 0, (1 << n) - 1) { for (int i = 0, b = bit; i < n; ++i, b >>= 1) used[i] = b & 1; calc(used); } fill(ALL(used), 1); cout << memo[used] << endl; // for (auto x : memo){ // debugv(x.first) // cout << x.second << endl; // } return 0; }