Submission #1176674
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <cstdio> #include <utility> #include <string> #include <sstream> #include <fstream> #include <cmath> #include <stack> #include <queue> #include <list> #include <map> #include <iomanip> #include <set> #include <bitset> using namespace std; typedef vector<int> VI; typedef vector<VI> VVI; #define MAX(x,y) ( (x) > (y) ? (x) : (y) ) #define MIN(x, y) ( (x) < (y) ? (x) : (y) ) #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define IVFOR(p,a) for(vector<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ILFOR(p,a) for(list<int>::iterator p = (a).begin(); p!=(a).end(); p++) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define CHECK(x) cout << #x << " = " << (x) << endl #define FINA(y) cout << (y) << endl int main(){ int n, x; cin >> n >> x; // cout << bitset<n>(x) << endl; bitset<20> bit_x; bit_x = bitset<20>(x); int cost; int sum; REP(i,n){ cin >> cost; sum += cost * bit_x[i]; } FINA(sum); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | Rx17Qq |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1142 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 1 ms | 256 KB |
subtask0_sample02.txt | AC | 1 ms | 256 KB |
subtask0_sample03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | AC | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |