CSES - Aalto Competitive Programming 2024 - wk8 - Homework C++ - Results
Submission details
Task:Counting ones
Sender:Nallue
Submission time:2024-10-26 18:12:11 +0300
Language:C++ (C++11)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.24 sdetails
#8ACCEPTED0.24 sdetails
#9ACCEPTED0.24 sdetails
#10ACCEPTED0.24 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:27:16: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   27 |         if(temp>t){
      |            ~~~~^~
input/code.cpp:33:50: warning: 'll' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     cout << t << "\n" << vec[ii] << " " << vec[ll] << "\n";
      |                                                  ^
input/code.cpp:33:32: warning: 'ii' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     cout << t << "\n" << vec[ii] << " " << vec[ll] << "\n";
      |                                ^

Code

#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef vector<ll> vll;

#define rep(i,a,b) for(int i=a; i<b; i++)

#define supREP(i,l,a,b) for(int i=a; i<b; i++)for(int l=i+1; l<b; l++)

int max(ll a, ll b){
    return __builtin_popcountll(a*b);
}

int main(){
    int n;
    cin >> n;
    vll vec(n);

    rep(i,0,n)cin>>vec[i];
    unsigned int ii,ll;
    unsigned int t=0;
    supREP(i,l,0,n){
        int temp = max(vec[i], vec[l]);
        if(temp>t){
            t=temp;
            ii=i;
            ll=l;
        }
    }
    cout << t << "\n" << vec[ii] << " " << vec[ll] << "\n";
}

Test details

Test 1

Verdict: ACCEPTED

input
5
42 100 73 94 1 

correct output
9
42 73

user output
9
42 73

Test 2

Verdict: ACCEPTED

input
5
44 19 3 94 55 

correct output
8
19 94

user output
8
19 94

Test 3

Verdict: ACCEPTED

input
10
551 71 709 840 291 122 511 570...

correct output
15
893 438

user output
15
893 438

Test 4

Verdict: ACCEPTED

input
10
968 901 548 173 973 856 715 61...

correct output
14
715 698

user output
14
715 698

Test 5

Verdict: ACCEPTED

input
100
221994 55181 870733 831328 206...

correct output
29
396737 649459

user output
29
396737 649459

Test 6

Verdict: ACCEPTED

input
100
892861 947477 331980 209407 82...

correct output
29
825210 578859

user output
29
825210 578859

Test 7

Verdict: ACCEPTED

input
10000
76308292 227339075 779918796 3...

correct output
50
978548139 589096701

user output
50
978548139 589096701

Test 8

Verdict: ACCEPTED

input
10000
873429404 968540665 239439572 ...

correct output
49
661547021 435157931

user output
49
661547021 435157931

Test 9

Verdict: ACCEPTED

input
10000
10374159 364461027 501874596 4...

correct output
50
313852607 889662850

user output
50
313852607 889662850

Test 10

Verdict: ACCEPTED

input
10000
771320644 298761159 20751947 4...

correct output
49
516789275 257079921

user output
49
516789275 257079921