Submission #1757951
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> #include <deque> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; int main() { ios::sync_with_stdio(false); cin.tie(0); ll N, K; cin >> N >> K; ll A[N], B[N]; FOR(i,0,N) cin >> A[i] >> B[i]; ll ans = 0; // i bit目が1なら0にする場合 FOR(i,0,32) { if((K>>i)&1) { // i bit以上はKと同じでないといけない ll cnt = 0; FOR(j,0,N) { bool ok = true; if(((A[j]>>i) & 1) == 1) continue; FOR(k,i+1,32) { if(((K>>k) & 1) == 0 && ((A[j]>>k) & 1) == 1) { ok = false; break; } } if(ok) cnt += B[j]; } ans = max(ans, cnt); } } ll cnt = 0; FOR(j,0,N) { bool ok = true; FOR(k,0,32) { if(((K>>k)&1)==0&&((A[j]>>k)&1)==1) { ok = false; break; } } if(ok) cnt += B[j]; } cout << max(ans, cnt) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - IntegerotS |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1323 Byte |
Status | AC |
Exec Time | 71 ms |
Memory | 1792 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 | 29 ms | 1792 KB |
02.txt | AC | 33 ms | 1792 KB |
03.txt | AC | 41 ms | 1792 KB |
04.txt | AC | 35 ms | 1792 KB |
05.txt | AC | 33 ms | 1792 KB |
06.txt | AC | 32 ms | 1792 KB |
07.txt | AC | 33 ms | 1792 KB |
08.txt | AC | 33 ms | 1792 KB |
09.txt | AC | 29 ms | 1792 KB |
10.txt | AC | 36 ms | 1792 KB |
11.txt | AC | 48 ms | 1792 KB |
12.txt | AC | 46 ms | 1792 KB |
13.txt | AC | 49 ms | 1792 KB |
14.txt | AC | 52 ms | 1792 KB |
15.txt | AC | 41 ms | 1792 KB |
16.txt | AC | 35 ms | 1792 KB |
17.txt | AC | 46 ms | 1792 KB |
18.txt | AC | 33 ms | 1792 KB |
19.txt | AC | 40 ms | 1792 KB |
20.txt | AC | 41 ms | 1792 KB |
21.txt | AC | 47 ms | 1792 KB |
22.txt | AC | 36 ms | 1792 KB |
23.txt | AC | 35 ms | 1792 KB |
24.txt | AC | 33 ms | 1792 KB |
25.txt | AC | 37 ms | 1792 KB |
26.txt | AC | 40 ms | 1792 KB |
27.txt | AC | 35 ms | 1792 KB |
28.txt | AC | 37 ms | 1792 KB |
29.txt | AC | 38 ms | 1792 KB |
30.txt | AC | 43 ms | 1792 KB |
31.txt | AC | 38 ms | 1792 KB |
32.txt | AC | 38 ms | 1792 KB |
33.txt | AC | 32 ms | 1792 KB |
34.txt | AC | 34 ms | 1792 KB |
35.txt | AC | 36 ms | 1792 KB |
36.txt | AC | 35 ms | 1792 KB |
37.txt | AC | 34 ms | 1792 KB |
38.txt | AC | 31 ms | 1792 KB |
39.txt | AC | 36 ms | 1792 KB |
40.txt | AC | 36 ms | 1792 KB |
41.txt | AC | 25 ms | 1792 KB |
42.txt | AC | 25 ms | 1792 KB |
43.txt | AC | 26 ms | 1792 KB |
44.txt | AC | 26 ms | 1792 KB |
45.txt | AC | 27 ms | 1792 KB |
46.txt | AC | 28 ms | 1792 KB |
47.txt | AC | 70 ms | 1792 KB |
48.txt | AC | 71 ms | 1792 KB |
49.txt | AC | 22 ms | 1792 KB |
50.txt | AC | 18 ms | 1792 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 | 2 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |