Submission #2587004
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0 ; i < (int)(n) ; i++) typedef long long ll; typedef long double Double; #ifndef INPUTS_DIR #define INPUTS_DIR "./" #endif void solve(ll N, ll K, vector<ll> A, vector<ll> B) { ll ans = 0; for (int i = 31; i >= 0; i--) { if (K >> i & 1) { ll L = K ^ (1 << i) | ((1 << i) - 1); ll sub = 0; for (int k = 0; k < N; k++) { if ((L | A[k]) == L) { sub += B[k]; } } ans = max(ans, sub); } } { ll sub = 0; for (int k = 0; k < N; k++) { if ((K | A[k]) == K) { sub += B[k]; } } ans = max(ans, sub); } cout << ans << endl; } void main_(istream &cin) { ll K; ll N; cin >> N; vector<ll> A(N - 1 + 1); vector<ll> B(N - 1 + 1); cin >> K; for (int i = 0; i <= N - 1; i++) { cin >> A[i]; cin >> B[i]; } solve(N, K, A, B); } int main() { #ifdef INTELLIJ ifstream ifs(string(INPUTS_DIR) + "in_1.txt"); if (ifs.is_open()) { main_(ifs); ifs.close(); } else { cerr << "Error: no input." << endl; } #else ios::sync_with_stdio(false); cin.tie(0); main_(cin); #endif }
Submission Info
Submission Time | |
---|---|
Task | D - IntegerotS |
User | kyuridenamida |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1359 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 3456 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 22 ms | 3456 KB |
02.txt | AC | 23 ms | 3456 KB |
03.txt | AC | 24 ms | 3456 KB |
04.txt | AC | 24 ms | 3456 KB |
05.txt | AC | 22 ms | 3456 KB |
06.txt | AC | 23 ms | 3456 KB |
07.txt | AC | 24 ms | 3456 KB |
08.txt | AC | 23 ms | 3456 KB |
09.txt | AC | 23 ms | 3456 KB |
10.txt | AC | 23 ms | 3456 KB |
11.txt | AC | 29 ms | 3456 KB |
12.txt | AC | 29 ms | 3456 KB |
13.txt | AC | 31 ms | 3456 KB |
14.txt | AC | 31 ms | 3456 KB |
15.txt | AC | 28 ms | 3456 KB |
16.txt | AC | 26 ms | 3456 KB |
17.txt | AC | 30 ms | 3456 KB |
18.txt | AC | 26 ms | 3456 KB |
19.txt | AC | 28 ms | 3456 KB |
20.txt | AC | 28 ms | 3456 KB |
21.txt | AC | 29 ms | 3456 KB |
22.txt | AC | 26 ms | 3456 KB |
23.txt | AC | 26 ms | 3456 KB |
24.txt | AC | 25 ms | 3456 KB |
25.txt | AC | 24 ms | 3456 KB |
26.txt | AC | 27 ms | 3456 KB |
27.txt | AC | 25 ms | 3456 KB |
28.txt | AC | 25 ms | 3456 KB |
29.txt | AC | 26 ms | 3456 KB |
30.txt | AC | 26 ms | 3456 KB |
31.txt | AC | 25 ms | 3456 KB |
32.txt | AC | 25 ms | 3456 KB |
33.txt | AC | 25 ms | 3456 KB |
34.txt | AC | 24 ms | 3456 KB |
35.txt | AC | 24 ms | 3456 KB |
36.txt | AC | 24 ms | 3456 KB |
37.txt | AC | 23 ms | 3456 KB |
38.txt | AC | 23 ms | 3456 KB |
39.txt | AC | 24 ms | 3456 KB |
40.txt | AC | 23 ms | 3456 KB |
41.txt | AC | 22 ms | 3456 KB |
42.txt | AC | 22 ms | 3456 KB |
43.txt | AC | 22 ms | 3456 KB |
44.txt | AC | 23 ms | 3456 KB |
45.txt | AC | 22 ms | 3456 KB |
46.txt | AC | 23 ms | 3456 KB |
47.txt | AC | 36 ms | 3456 KB |
48.txt | AC | 36 ms | 3456 KB |
49.txt | AC | 21 ms | 3456 KB |
50.txt | AC | 17 ms | 3456 KB |
51.txt | AC | 1 ms | 256 KB |
52.txt | AC | 1 ms | 256 KB |
53.txt | AC | 1 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 1 ms | 256 KB |
57.txt | AC | 1 ms | 256 KB |
58.txt | AC | 1 ms | 256 KB |
59.txt | AC | 1 ms | 256 KB |
60.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |