Submission #1816016


Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

int main(){
	int n, k;
	cin>>n>>k;
	vector<int> a(n), b(n);
	rep(i, n){
		cin>>a[i]>>b[i];
	}
	ll res = 0;
	for(int i = 0; i < 30; i++){
		int k2 = k;
		if(i>0){
			if(!(1&(k>>i))) continue;
			k2 = k&(~(1<<i))|((1<<i)-1);
		}
		ll s = 0;
		rep(j, n) if((k2|a[j])==k2) s += b[j];
		res = max(res, s);
	}
	cout<<res<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - IntegerotS
User Lepton
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1516 Byte
Status AC
Exec Time 97 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 63
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 81 ms 1024 KB
02.txt AC 81 ms 1024 KB
03.txt AC 82 ms 1024 KB
04.txt AC 82 ms 1024 KB
05.txt AC 80 ms 1024 KB
06.txt AC 81 ms 1024 KB
07.txt AC 81 ms 1024 KB
08.txt AC 81 ms 1024 KB
09.txt AC 81 ms 1024 KB
10.txt AC 82 ms 1024 KB
11.txt AC 83 ms 1024 KB
12.txt AC 85 ms 1024 KB
13.txt AC 89 ms 1024 KB
14.txt AC 88 ms 1024 KB
15.txt AC 85 ms 1024 KB
16.txt AC 89 ms 1024 KB
17.txt AC 87 ms 1024 KB
18.txt AC 82 ms 1024 KB
19.txt AC 85 ms 1024 KB
20.txt AC 85 ms 1024 KB
21.txt AC 84 ms 1024 KB
22.txt AC 83 ms 1024 KB
23.txt AC 83 ms 1024 KB
24.txt AC 89 ms 1024 KB
25.txt AC 82 ms 1024 KB
26.txt AC 84 ms 1024 KB
27.txt AC 81 ms 1024 KB
28.txt AC 81 ms 1024 KB
29.txt AC 83 ms 1024 KB
30.txt AC 83 ms 1024 KB
31.txt AC 83 ms 1024 KB
32.txt AC 83 ms 1024 KB
33.txt AC 83 ms 1024 KB
34.txt AC 79 ms 1024 KB
35.txt AC 80 ms 1024 KB
36.txt AC 81 ms 1024 KB
37.txt AC 80 ms 1024 KB
38.txt AC 80 ms 1024 KB
39.txt AC 81 ms 1024 KB
40.txt AC 81 ms 1024 KB
41.txt AC 80 ms 1024 KB
42.txt AC 81 ms 1024 KB
43.txt AC 75 ms 1024 KB
44.txt AC 80 ms 1024 KB
45.txt AC 80 ms 1024 KB
46.txt AC 80 ms 1024 KB
47.txt AC 93 ms 1024 KB
48.txt AC 97 ms 1024 KB
49.txt AC 86 ms 1024 KB
50.txt AC 56 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