Submission #1689549
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define mt make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define pb push_back typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vll; int main(){ ios::sync_with_stdio(false); cin.tie(0); int N, K; cin >> N >> K; vi A(N), B(N); rep(i, N)cin >> A[i] >> B[i]; ll ans = 0; auto f = [&](ll x) { ll res = 0; rep(i, N) { int ok = 1; rep(j, 30)if (!(x >> j & 1) && (A[i] >> j & 1)) { ok = 0; break; } if (ok)res += B[i]; } return res; }; ans = f(K); for (int i = 1; i < 30; ++i)if (K >> i & 1) { ll x = (K ^ (1 << i)) | ((1 << i) - 1); smax(ans, f(x)); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - IntegerotS |
User | paruki |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1225 Byte |
Status | AC |
Exec Time | 81 ms |
Memory | 1152 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 | 34 ms | 1024 KB |
02.txt | AC | 44 ms | 1024 KB |
03.txt | AC | 59 ms | 1024 KB |
04.txt | AC | 52 ms | 1024 KB |
05.txt | AC | 42 ms | 1024 KB |
06.txt | AC | 44 ms | 1024 KB |
07.txt | AC | 49 ms | 1024 KB |
08.txt | AC | 45 ms | 1024 KB |
09.txt | AC | 37 ms | 1024 KB |
10.txt | AC | 52 ms | 1024 KB |
11.txt | AC | 55 ms | 1024 KB |
12.txt | AC | 55 ms | 1024 KB |
13.txt | AC | 64 ms | 1024 KB |
14.txt | AC | 64 ms | 1024 KB |
15.txt | AC | 54 ms | 1024 KB |
16.txt | AC | 50 ms | 1024 KB |
17.txt | AC | 59 ms | 1024 KB |
18.txt | AC | 45 ms | 1024 KB |
19.txt | AC | 53 ms | 1024 KB |
20.txt | AC | 54 ms | 1024 KB |
21.txt | AC | 59 ms | 1024 KB |
22.txt | AC | 52 ms | 1024 KB |
23.txt | AC | 48 ms | 1024 KB |
24.txt | AC | 42 ms | 1024 KB |
25.txt | AC | 54 ms | 1024 KB |
26.txt | AC | 55 ms | 1024 KB |
27.txt | AC | 48 ms | 1024 KB |
28.txt | AC | 52 ms | 1024 KB |
29.txt | AC | 52 ms | 1152 KB |
30.txt | AC | 59 ms | 1024 KB |
31.txt | AC | 55 ms | 1024 KB |
32.txt | AC | 55 ms | 1024 KB |
33.txt | AC | 48 ms | 1024 KB |
34.txt | AC | 46 ms | 1024 KB |
35.txt | AC | 50 ms | 1024 KB |
36.txt | AC | 51 ms | 1024 KB |
37.txt | AC | 48 ms | 1024 KB |
38.txt | AC | 42 ms | 1024 KB |
39.txt | AC | 53 ms | 1024 KB |
40.txt | AC | 50 ms | 1024 KB |
41.txt | AC | 39 ms | 1024 KB |
42.txt | AC | 38 ms | 1024 KB |
43.txt | AC | 35 ms | 1024 KB |
44.txt | AC | 35 ms | 1024 KB |
45.txt | AC | 34 ms | 1024 KB |
46.txt | AC | 36 ms | 1024 KB |
47.txt | AC | 81 ms | 1024 KB |
48.txt | AC | 81 ms | 1024 KB |
49.txt | AC | 22 ms | 1024 KB |
50.txt | AC | 18 ms | 1024 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 |