/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Wrong Answer 1ms 580.0 KiB
#3 Wrong Answer 4ms 536.0 KiB
#4 Wrong Answer 4ms 648.0 KiB
#5 Wrong Answer 6ms 536.0 KiB
#6 Wrong Answer 47ms 684.0 KiB
#7 Wrong Answer 865ms 1.504 MiB
#8 Time Exceeded ≥1086ms ≥1.898 MiB
#9 Time Exceeded ≥1090ms ≥2.672 MiB
#10 Wrong Answer 27ms 1.359 MiB
#11 Wrong Answer 31ms 1.27 MiB

Code

/*
 *Copyright (c) Swadheen Islam Robi (SIR01)
 *Created on Thu Sep 05 2024 10:16:49 PM
 */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pie 2*(acos(0.0))
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define endl "\n"
#define lcm(a,b) (a*b)/(__gcd<ll>(a,b))
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define ALLAHU_AKBAR ios::sync_with_stdio(false); cin.tie(nullptr);

void sir()
{
        int n, k;
        cin >> n >> k;

        vector<int> A(n, 0);

        int mon = min(k, n);

        for (int i = 0; i < mon; i++) {
            A[i] = 1;
        }

        int X = k - mon;
        int Y = 1;

        for (int i = mon; i < n; i++) {
            Y &= A[i];
        }

        int ans = X * Y;
        cout << ans << endl;
}

int main() {
    ALLAHU_AKBAR

    ll t = 1;
    cin>>t;
    while(t--)
    {
        sir();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 17:17:13
Judged At
2024-10-03 13:04:49
Judged By
Score
1
Total Time
≥1090ms
Peak Memory
≥2.672 MiB