Submission #6104757
Source Code Expand
#include <bits/stdc++.h> #define int long long #define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ ) #define REP( i, n ) FOR( i, 0, n ) #define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- ) #define REPONE( i, n ) FOR( i, 1, n + 1 ) #define ALL( a ) (a).begin(), (a).end() #define MP make_pair using namespace std; using P = pair<int, int>; 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; } const int INF = 1e9; const int MOD = 1e9 + 7; signed main(){ int N, X; cin >> N >> X; vector<int> a( N ); REP( i, N ) cin >> a[i]; int sum = 0; REP( i, N ){ if( X >> i & 1 ){ sum += a[i]; } } cout << sum << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | leaf_b |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 895 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 |