Submission #229556
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef vector<int> vi; typedef vector<vi> vii; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<vb> vbb; typedef pair<int, int> pii; typedef long long ll; typedef unsigned long long ull; #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(), (a).rend() #define pb push_back #define mp make_pair #define loop(i,a,b) for(int i=(a);i<ull(b);++i) #define rep(i,n) loop(i,0,n) const double eps = 1e-10; const double pi = acos(-1.0); const double inf = (int)1e8; template <typename T> inline std::string to_bin_str(T n) { std::string str; while (n > 0) { str.push_back('0' + (n & 1)); n >>= 1; } std::reverse(str.begin(), str.end()); return str; } int main(){ int n, x; vi v; cin >> n >> x; for(int i=0; i < n; i++){ int n; cin >> n; v.pb(n); } string str = to_bin_str(x); int ret = 0; for(int i=0; i < str.size(); i++){ if(str[i] == '1') ret += v[i]; } cout << ret << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | LazyMii |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1151 Byte |
Status | WA |
Exec Time | 38 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 23 ms | 800 KB |
subtask0_sample02.txt | AC | 22 ms | 916 KB |
subtask0_sample03.txt | AC | 23 ms | 916 KB |
subtask1_01.txt | AC | 21 ms | 860 KB |
subtask1_02.txt | AC | 23 ms | 788 KB |
subtask1_03.txt | AC | 24 ms | 788 KB |
subtask1_04.txt | AC | 21 ms | 800 KB |
subtask1_05.txt | WA | 22 ms | 920 KB |
subtask1_06.txt | WA | 23 ms | 800 KB |
subtask1_07.txt | WA | 24 ms | 676 KB |
subtask1_08.txt | WA | 23 ms | 796 KB |
subtask1_09.txt | WA | 24 ms | 800 KB |
subtask1_10.txt | WA | 27 ms | 748 KB |
subtask1_11.txt | WA | 23 ms | 924 KB |
subtask1_12.txt | WA | 24 ms | 920 KB |
subtask1_13.txt | WA | 26 ms | 732 KB |
subtask1_14.txt | WA | 38 ms | 740 KB |
subtask1_15.txt | WA | 23 ms | 792 KB |
subtask1_16.txt | WA | 22 ms | 672 KB |
subtask1_17.txt | WA | 22 ms | 800 KB |