Submission #3420969


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
int a[maxn],b[maxn];
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int res=0;
    for(int i=0;i<n;i++){
        scanf("%d%d",&a[i],&b[i]);
        if((a[i]&k)==a[i])  res+=b[i];
    }
    for(int i=30;i>=0;i--){
        int tmp=1<<i;
        if(k&tmp){
            int f=(k^tmp)|(tmp-1);
            int ans=0;
            for(int j=0;j<n;j++){
                if((a[j]&f)==a[j])    ans+=b[j];
            }
            res=max(res,ans);
        }
    }
    printf("%d\n",res);
    return 0;
}

Submission Info

Submission Time
Task D - IntegerotS
User aoweiyin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 622 Byte
Status WA
Exec Time 34 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&k);
                        ^
./Main.cpp:12:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a[i],&b[i]);
                                  ^

Judge Result

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