Submission #3014109
Source Code Expand
#include <iostream> #include <iomanip> #include <algorithm> #include <vector> #include <string> #include <sstream> #include <set> #include <map> #include <iostream> #include <utility> #include <cctype> #include <queue> #include <stack> #include <cstdio> #include <cstdlib> #include <cmath> #include <unordered_set> #include <unordered_map> #include <limits.h> #include <cstring> #include <tuple> #include <cassert> #include <numeric> using namespace std; // type alias typedef long long LL; typedef vector < int > VI; typedef unordered_map < int, int > MAPII; typedef unordered_set < int > SETI; typedef pair< int , int > II; typedef tuple< int, int, int > III; // repetition #define FORE(i,a,b) for(int i=(a);i<=(b);++i) #define REPE(i,n) for(int i=0;i<=(n);++i) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define FORR(x,arr) for(auto& x:arr) #define SZ(a) int((a).size()) // DP #define MINUS(dp) memset(dp, -1, sizeof(dp)) #define ZERO(dp) memset(dp, 0, sizeof(dp)) // minmax #define SMAX(a,b) a = max(a,b) #define SMIN(a,b) a = min(a,b) // debug cerr #define TRACE true #define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; } #define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; } #define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; } #define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; } #define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; } /* 8/15/2018 17:20-17:34 analysis */ // $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG x.cpp && ./a.out const int MAX_N=1e5+1; int N; LL K; LL A[MAX_N],B[MAX_N]; void solve() { LL res=0; REP(i,N) if((A[i]|K)==K) res+=B[i]; REPE(i,30) if((K>>i)&1) { LL mask=K-(1LL<<i); mask|=(1LL<<i)-1LL; LL x=0; REP(i,N) if((A[i]|mask)==mask) x+=B[i]; SMAX(res,x); } cout<<res<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin>>N>>K; REP(i,N) cin>>A[i]>>B[i]; solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - IntegerotS |
User | kumalimak |
Language | C++14 (Clang 3.8.0) |
Score | 500 |
Code Size | 2286 Byte |
Status | AC |
Exec Time | 226 ms |
Memory | 1920 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 | 214 ms | 1920 KB |
02.txt | AC | 214 ms | 1792 KB |
03.txt | AC | 215 ms | 1792 KB |
04.txt | AC | 216 ms | 1792 KB |
05.txt | AC | 213 ms | 1792 KB |
06.txt | AC | 214 ms | 1792 KB |
07.txt | AC | 214 ms | 1792 KB |
08.txt | AC | 215 ms | 1792 KB |
09.txt | AC | 217 ms | 1792 KB |
10.txt | AC | 214 ms | 1792 KB |
11.txt | AC | 208 ms | 1792 KB |
12.txt | AC | 215 ms | 1792 KB |
13.txt | AC | 220 ms | 1792 KB |
14.txt | AC | 220 ms | 1792 KB |
15.txt | AC | 215 ms | 1792 KB |
16.txt | AC | 217 ms | 1792 KB |
17.txt | AC | 217 ms | 1792 KB |
18.txt | AC | 211 ms | 1792 KB |
19.txt | AC | 214 ms | 1792 KB |
20.txt | AC | 216 ms | 1792 KB |
21.txt | AC | 213 ms | 1792 KB |
22.txt | AC | 216 ms | 1792 KB |
23.txt | AC | 215 ms | 1792 KB |
24.txt | AC | 204 ms | 1792 KB |
25.txt | AC | 215 ms | 1792 KB |
26.txt | AC | 215 ms | 1792 KB |
27.txt | AC | 211 ms | 1792 KB |
28.txt | AC | 212 ms | 1792 KB |
29.txt | AC | 214 ms | 1792 KB |
30.txt | AC | 216 ms | 1792 KB |
31.txt | AC | 216 ms | 1792 KB |
32.txt | AC | 214 ms | 1792 KB |
33.txt | AC | 216 ms | 1792 KB |
34.txt | AC | 209 ms | 1792 KB |
35.txt | AC | 210 ms | 1792 KB |
36.txt | AC | 214 ms | 1792 KB |
37.txt | AC | 213 ms | 1792 KB |
38.txt | AC | 211 ms | 1792 KB |
39.txt | AC | 212 ms | 1792 KB |
40.txt | AC | 214 ms | 1792 KB |
41.txt | AC | 209 ms | 1792 KB |
42.txt | AC | 210 ms | 1792 KB |
43.txt | AC | 203 ms | 1792 KB |
44.txt | AC | 211 ms | 1792 KB |
45.txt | AC | 210 ms | 1792 KB |
46.txt | AC | 209 ms | 1792 KB |
47.txt | AC | 225 ms | 1792 KB |
48.txt | AC | 226 ms | 1792 KB |
49.txt | AC | 213 ms | 1792 KB |
50.txt | AC | 151 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 | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |