/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 22ms 540.0 KiB
#3 Accepted 23ms 576.0 KiB
#4 Accepted 22ms 540.0 KiB
#5 Accepted 23ms 540.0 KiB
#6 Accepted 23ms 540.0 KiB
#7 Accepted 14ms 540.0 KiB
#8 Accepted 14ms 764.0 KiB
#9 Accepted 14ms 516.0 KiB
#10 Accepted 14ms 540.0 KiB
#11 Accepted 14ms 540.0 KiB
#12 Accepted 13ms 2.066 MiB
#13 Accepted 13ms 2.027 MiB
#14 Time Exceeded ≥2098ms ≥2.07 MiB
#15 Time Exceeded ≥2099ms ≥2.027 MiB

Code

#include<bits/stdc++.h>

#define ll long long
#define endl "\n"
#define pb push_back
#define printv for(auto e:v) cout << e << " ";  cout << endl;
#define printmp for(auto [x,y]:mp) cout << x << " " << y << endl; cout << endl;

using namespace std;

void solve(){
    ll n;   cin >> n;
    vector<ll>ar(n);
    for(int i=0;i<n;i++)    cin >> ar[i];
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            ll sum = ar[i] + ar[j];
            int p = (sum & (sum+1));
            //cout << ar[i] <<  " " << ar[j] << " " << p << endl;
            if(!p){
                cout << 1 << endl;
                return;
            }

        }
    }
    cout << 0 << endl;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t;  cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1175 Maximum binary product of sum pairs
Contest
Intra LU IEEE Beginner Programming Contest
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-26 06:34:05
Judged At
2025-02-26 06:34:05
Judged By
Score
70
Total Time
≥2099ms
Peak Memory
≥2.07 MiB