Submission #3025013
Source Code Expand
#include<string> #include<iostream> #include<algorithm> #include<set> #include<math.h> #include<vector> #include<sstream> #include<queue> #include<functional> #include<bitset> #include<cstdio> #include<iomanip> #include<map> #include<unordered_map> #include<unordered_set> #include <string.h> using ll = long long; #define rep(i, n) for(ll i = 0; i < (int)(n); i++) #define reps(i,x) for(ll i=1;i<=(int)(x);i++) #define rrep(i,x) for(ll i=((int)(x)-1);i>=0;i--) #define rreps(i,x) for(ll i=(int)(x);i>0;i--) #define all(x) (x).begin(),(x).end() #define m0(x) memset(x,0,sizeof(x)) #define vll vector<ll> #define vi vector<int> #define mp make_pair #define vpll vector<pair<ll,ll>> #define vpi vector<pair<int,int>> #define mod 1000000007 using namespace std; int p[11]; int c[11]; int main() { int d,g; cin >> d >> g; rep(i ,d){ cin >> p[i] >> c[i]; } int ans = 1 << 30; rep(i, (1 << d)){ int s = 0, t = 0, mx = 0, cm = 100; rep(j, d){ if(i >> j & 1){ s += p[j]; t += (j + 1) * 100 * p[j] + c[j]; }else{ mx = j; } } if(g > t){ int n = g - t; if((int)ceil(n*1.0 / ((mx + 1) * 100)) > p[mx]) { continue; } s +=ceil(n*1.0 / ((mx + 1) * 100)); } ans = min(s, ans); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - All Green |
User | iroha168 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1310 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03, a04 |
All | a01, a02, a03, a04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
a04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 1 ms | 256 KB |
b15 | AC | 1 ms | 256 KB |
b16 | AC | 1 ms | 256 KB |
b17 | AC | 1 ms | 256 KB |
b18 | AC | 1 ms | 256 KB |
b19 | AC | 1 ms | 256 KB |
b20 | AC | 1 ms | 256 KB |
b21 | AC | 1 ms | 256 KB |
b22 | AC | 1 ms | 256 KB |
b23 | AC | 1 ms | 256 KB |
b24 | AC | 1 ms | 256 KB |