Submission #73571894


Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define test puts("Test");

// sortするときとかにつかえそうなやつ。
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

// dpとかに使えそうなやつ。
void chmax(ll& x, ll y) { x = max(x,y);}
void chmin(ll& x, ll y) { x = min(x,y);}

// dpとかの初期化をするときにおいてる無限。
const ll INF = 3e18;

// 下、左、上、右
int dx[] = {1,0,-1,0};
int dy[] = {0,-1,0,1};

// 小数点表示するのめんどくさいからその時に使えるやつ。
void print(double n){
    printf("%.10f\n", n);
    // exit(0);
}   

int main(){

    ll n,k; cin >> n >> k;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];

    int ans = 0;
    ll num = 0;

    rep(i,n){
        if ((a[i]&k)==a[i]) {
            num |= a[i];
            ans++;
        }
    }

    if (num == k && ans != 0) cout << ans << endl;
    else cout << -1 << endl;

    return 0;
}

Submission Info

Submission Time
Task C - Maximum Number of Team Members
User Litms
Language C++23 (GCC 15.2.0)
Score 300
Code Size 1154 Byte
Status AC
Exec Time 83 ms
Memory 4976 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 65
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3548 KiB
in02.txt AC 1 ms 3460 KiB
in03.txt AC 1 ms 3416 KiB
in04.txt AC 1 ms 3472 KiB
in05.txt AC 1 ms 3600 KiB
in06.txt AC 1 ms 3416 KiB
in07.txt AC 1 ms 3560 KiB
in08.txt AC 1 ms 3472 KiB
in09.txt AC 79 ms 4780 KiB
in10.txt AC 19 ms 4756 KiB
in11.txt AC 82 ms 4808 KiB
in12.txt AC 82 ms 4756 KiB
in13.txt AC 1 ms 3544 KiB
in14.txt AC 82 ms 4796 KiB
in15.txt AC 81 ms 4916 KiB
in16.txt AC 82 ms 4808 KiB
in17.txt AC 83 ms 4780 KiB
in18.txt AC 19 ms 4908 KiB
in19.txt AC 1 ms 3356 KiB
in20.txt AC 2 ms 3728 KiB
in21.txt AC 1 ms 3532 KiB
in22.txt AC 1 ms 3652 KiB
in23.txt AC 1 ms 3548 KiB
in24.txt AC 1 ms 3556 KiB
in25.txt AC 81 ms 4720 KiB
in26.txt AC 1 ms 3532 KiB
in27.txt AC 1 ms 3532 KiB
in28.txt AC 1 ms 3472 KiB
in29.txt AC 50 ms 4808 KiB
in30.txt AC 1 ms 3544 KiB
in31.txt AC 18 ms 4976 KiB
in32.txt AC 1 ms 3512 KiB
in33.txt AC 35 ms 4924 KiB
in34.txt AC 1 ms 3416 KiB
in35.txt AC 82 ms 4780 KiB
in36.txt AC 1 ms 3416 KiB
in37.txt AC 78 ms 4848 KiB
in38.txt AC 79 ms 4916 KiB
in39.txt AC 1 ms 3412 KiB
in40.txt AC 1 ms 3416 KiB
in41.txt AC 1 ms 3332 KiB
in42.txt AC 1 ms 3576 KiB
in43.txt AC 82 ms 4780 KiB
in44.txt AC 82 ms 4916 KiB
in45.txt AC 1 ms 3600 KiB
in46.txt AC 1 ms 3472 KiB
in47.txt AC 1 ms 3528 KiB
in48.txt AC 1 ms 3512 KiB
in49.txt AC 1 ms 3600 KiB
in50.txt AC 1 ms 3560 KiB
in51.txt AC 18 ms 4916 KiB
in52.txt AC 18 ms 4788 KiB
in53.txt AC 1 ms 3556 KiB
in54.txt AC 1 ms 3540 KiB
in55.txt AC 1 ms 3512 KiB
in56.txt AC 1 ms 3356 KiB
in57.txt AC 1 ms 3544 KiB
in58.txt AC 1 ms 3548 KiB
in59.txt AC 1 ms 3416 KiB
in60.txt AC 1 ms 3560 KiB
in61.txt AC 1 ms 3548 KiB
in62.txt AC 82 ms 4924 KiB
sample01.txt AC 1 ms 3600 KiB
sample02.txt AC 1 ms 3540 KiB
sample03.txt AC 1 ms 3576 KiB