結果
問題 | No.745 letinopia raoha |
ユーザー | naimonon77 |
提出日時 | 2018-11-09 19:05:41 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,651 bytes |
コンパイル時間 | 3,038 ms |
コンパイル使用メモリ | 213,884 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-21 05:21:35 |
合計ジャッジ時間 | 2,973 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,816 KB |
testcase_05 | AC | 1 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
ソースコード
#define TEST_MODE true #define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i, a, b) for (int i = (a); i < (b); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, a, b) for (int i = (a)-1; i >= b; --i) #define range(i, a, b, c) for (int i = a; \ c > 0 ? i < b : i > b; \ i += c) #define chmax(a, b) (a = (a) < (b) ? (b) : (a)) #define chmin(a, b) (a = (a) > (b) ? (b) : (a)) using ll = long long; using ull = unsigned long long; using ld = long double; #define all(a) begin(a), end(a) #define ifnot(a) if (not(a)) #define int long long #if TEST_MODE == true const bool test = true; #define dump(x) cerr << #x << " = " << (x) #define dumpl(x) dump(x) << endl #else const bool test = false; #define dump(x) #define dumpl(x) #endif int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int INF = (int)1 << 60; const ll INFL = (ll)1 << 60; ll mod_n = (int)1e9 + 7; const double eps = 1e-10; typedef long double Real; // return -1, 0, 1 int sgn(const Real &r) { return (r > eps) - (r < -eps); } int sgn(const Real &a, const Real &b) { return sgn(a - b); } //..................... const int MAX = (int)2e5 + 5; vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); } return v; } string reverse_str(string input) { string res = input; reverse(all(res)); return res; } vector<int> sorted(vector<int> a) { vector<int> b = a; sort(all(b)); return b; } template <class InputIterator> int sum(InputIterator begin, InputIterator end) { return accumulate(begin, end, 0ll); } string operator * (const string s, const int& v) { string res = ""; rep(i, v) res += s; return res; } template<typename T> T sum(T a[], int size) { T res = 0; for (int i = 0; i < size; i += 1) res += a[i]; return res; } void solve(); class Solver { public: int H, W; bool ng(int y, int x) { return y < 0 || H <= y || x < 0 || W <= x; } struct Point { int y, x; }; int C, D; int e[2]; int score[2] = {100, 50}; void solve() { cin >> e[0] >> e[1] >> C >> D; int life = 1000 - D * 100; if (life <= 0) { cout << "Impossible" << endl; return; } cout << "Possible" << endl; int combo = 0; int combo_bonus = 1; int res = 0; rrep(i, 2) { rep(j, e[i]) { combo += 1; res += score[i] * combo_bonus; if (combo % 100 == 0) { combo_bonus *= 2; } } } cout << res << endl; } }; signed main() { cout << fixed << setprecision(20); auto ptr = new Solver(); ptr->solve(); delete ptr; // while (true) { // auto ptr = new Solver(); // ptr->solve(); // delete ptr; // } return 0; } // class Mycin { // bool flag = true; // public: // Mycin& operator >> (int& a) {flag = scanf("%lld", &a) != EOF; return *this;} // Mycin& operator >> (char& a) {flag = scanf("%c", &a) != EOF; return *this;} // Mycin& operator >> (string& s) {flag = (bool)(cin >> s); return *this;} // operator bool() {return flag;} // } mycin; // class Mycout { // public: // Mycout& operator << (const int& a) {printf("%lld", a); return *this;} // Mycout& operator << (const char c) {printf("%c", c); return *this;} // Mycout& operator << (const string& s) {printf("%s", s.c_str()); return *this;} // } mycout; // #define cin mycin // #define cout mycout // #define endl '\n'