Submission #8411053
Source Code Expand
// includes #include <bits/stdc++.h> using namespace std; // macros #define pb emplace_back #define mk make_pair #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define bit(n) (1LL<<(n)) // functions template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;} template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} 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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair<int, int>; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1000000007; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // io struct fast_io{ fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);} } fast_io_; int main(int argc, char const* argv[]) { int n; cin >> n; ll b, c; cin >> b >> c; vector<ll> a(n); cin >> a; ll res = 0; rrep(i, n){ if(b <= c){ res += a[i] * b; c -= b; }else{ res += a[i] * c; c = 0; } } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ラー油 |
User | fumiphys |
Language | C++14 (GCC 5.4.1) |
Score | 50 |
Code Size | 3226 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt, 00_example_05.txt, 00_example_06.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt, 00_example_05.txt, 00_example_06.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 20_SB_SC_01.txt, 20_SB_SC_02.txt, 20_SB_SC_03.txt, 20_SB_SC_04.txt, 20_SB_SC_05.txt, 30_SB_LC_01.txt, 30_SB_LC_02.txt, 30_SB_LC_03.txt, 30_SB_LC_04.txt, 30_SB_LC_05.txt, 40_LB_SC_01.txt, 40_LB_SC_02.txt, 40_LB_SC_03.txt, 40_LB_SC_04.txt, 40_LB_SC_05.txt, 50_LB_LC_01.txt, 50_LB_LC_02.txt, 50_LB_LC_03.txt, 50_LB_LC_04.txt, 50_LB_LC_05.txt, 60_max_01.txt, 60_max_02.txt, 60_max_03.txt, 60_max_04.txt, 60_max_05.txt, 70_same_01.txt, 70_same_02.txt, 70_same_03.txt, 70_same_04.txt, 70_same_05.txt, 80_sparse_01.txt, 80_sparse_02.txt, 80_sparse_03.txt, 80_sparse_04.txt, 80_sparse_05.txt, 80_sparse_06.txt, 80_sparse_07.txt, 80_sparse_08.txt, 80_sparse_09.txt, 80_sparse_10.txt, 90_hand_01.txt, 90_hand_02.txt, 90_hand_03.txt, 90_hand_04.txt, 90_hand_05.txt, 95_corner_01.txt, 95_corner_02.txt, 95_corner_03.txt, 95_corner_04.txt, 95_corner_05.txt, 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt, 00_example_05.txt, 00_example_06.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
00_example_04.txt | AC | 1 ms | 256 KB |
00_example_05.txt | AC | 1 ms | 256 KB |
00_example_06.txt | AC | 1 ms | 256 KB |
10_rand_01.txt | AC | 1 ms | 256 KB |
10_rand_02.txt | AC | 1 ms | 256 KB |
10_rand_03.txt | AC | 1 ms | 256 KB |
10_rand_04.txt | AC | 1 ms | 256 KB |
10_rand_05.txt | AC | 1 ms | 256 KB |
20_SB_SC_01.txt | AC | 1 ms | 256 KB |
20_SB_SC_02.txt | AC | 1 ms | 256 KB |
20_SB_SC_03.txt | AC | 1 ms | 256 KB |
20_SB_SC_04.txt | AC | 1 ms | 256 KB |
20_SB_SC_05.txt | AC | 1 ms | 256 KB |
30_SB_LC_01.txt | AC | 1 ms | 256 KB |
30_SB_LC_02.txt | AC | 1 ms | 256 KB |
30_SB_LC_03.txt | AC | 1 ms | 256 KB |
30_SB_LC_04.txt | AC | 1 ms | 256 KB |
30_SB_LC_05.txt | AC | 1 ms | 256 KB |
40_LB_SC_01.txt | AC | 1 ms | 256 KB |
40_LB_SC_02.txt | AC | 1 ms | 256 KB |
40_LB_SC_03.txt | AC | 1 ms | 256 KB |
40_LB_SC_04.txt | AC | 1 ms | 256 KB |
40_LB_SC_05.txt | AC | 1 ms | 256 KB |
50_LB_LC_01.txt | AC | 1 ms | 256 KB |
50_LB_LC_02.txt | AC | 1 ms | 256 KB |
50_LB_LC_03.txt | AC | 1 ms | 256 KB |
50_LB_LC_04.txt | AC | 1 ms | 256 KB |
50_LB_LC_05.txt | AC | 1 ms | 256 KB |
60_max_01.txt | AC | 1 ms | 256 KB |
60_max_02.txt | AC | 1 ms | 256 KB |
60_max_03.txt | AC | 1 ms | 256 KB |
60_max_04.txt | AC | 1 ms | 256 KB |
60_max_05.txt | AC | 1 ms | 256 KB |
70_same_01.txt | AC | 1 ms | 256 KB |
70_same_02.txt | AC | 1 ms | 256 KB |
70_same_03.txt | AC | 1 ms | 256 KB |
70_same_04.txt | AC | 1 ms | 256 KB |
70_same_05.txt | AC | 1 ms | 256 KB |
80_sparse_01.txt | AC | 1 ms | 256 KB |
80_sparse_02.txt | AC | 1 ms | 256 KB |
80_sparse_03.txt | AC | 1 ms | 256 KB |
80_sparse_04.txt | AC | 1 ms | 256 KB |
80_sparse_05.txt | AC | 1 ms | 256 KB |
80_sparse_06.txt | AC | 1 ms | 256 KB |
80_sparse_07.txt | AC | 1 ms | 256 KB |
80_sparse_08.txt | AC | 1 ms | 256 KB |
80_sparse_09.txt | AC | 1 ms | 256 KB |
80_sparse_10.txt | AC | 1 ms | 256 KB |
90_hand_01.txt | AC | 1 ms | 256 KB |
90_hand_02.txt | AC | 1 ms | 256 KB |
90_hand_03.txt | AC | 1 ms | 256 KB |
90_hand_04.txt | AC | 1 ms | 256 KB |
90_hand_05.txt | AC | 1 ms | 256 KB |
95_corner_01.txt | AC | 1 ms | 256 KB |
95_corner_02.txt | AC | 1 ms | 256 KB |
95_corner_03.txt | AC | 1 ms | 256 KB |
95_corner_04.txt | AC | 1 ms | 256 KB |
95_corner_05.txt | AC | 1 ms | 256 KB |