Submission #1092067

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1092067	2024-09-23T04:07:38 Z	thunopro	A Plus B (IOI23_aplusb)	C++17	100 / 100	59 ms	4576 KB

aplusb

#include<bits/stdc++.h>
#include "aplusb.h"

using namespace std; 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define re exit(0); 
#define left id<<1 
#define right id<<1|1 

const int mod = 1e9+7;  
const int INF = 1e9; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

void add ( int &a , int b ) { if ( a += b >= mod) a -= mod; } 
void sub ( int &a , int b ) { if ( a -= b <= mod ) a += mod; } 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }

void runfile() { freopen ("inp.txt","r",stdin) ; } 

vi smallest_sums ( int N , vi A , vi B )
{
    ll l = 0 , r = 2e9 , res ; 
    while ( l <= r ) 
    {
        ll mid = (l+r)/2 ; 
        int j = N-1 ; 
        ll total = 0 ; 
        for ( int i = 0 ; i < N ; i ++ ) 
        {
            while ( A[i] + B[j] > mid && j >= 1 ) j -- ; 
            if ( A[i] + B[j] <= mid ) total += j+1 ;  
        }
        if ( total >= N ) r = mid-1 , res = mid ; 
        else l = mid+1 ; 
    }
    vi answer ; 
    for ( int i = 0 ; i < N ; i ++ ) 
    {
        for ( int j = 0 ; j < N ; j ++ ) 
        {
            if ( A[i] + B[j] <= res ) answer . pb (A[i]+B[j]) ; 
            else break ; 
        }
    }
    sort(answer.begin(),answer.end()) ;
    while (answer.size() > N ) answer.pop_back() ;
    return answer ; 
}

Compilation message

aplusb.cpp: In function 'vi smallest_sums(int, vi, vi)':
aplusb.cpp:54:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     while (answer.size() > N ) answer.pop_back() ;
      |            ~~~~~~~~~~~~~~^~~
aplusb.cpp: In function 'void runfile()':
aplusb.cpp:26:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 | void runfile() { freopen ("inp.txt","r",stdin) ; }
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
aplusb.cpp: In function 'vi smallest_sums(int, vi, vi)':
aplusb.cpp:49:13: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   49 |             if ( A[i] + B[j] <= res ) answer . pb (A[i]+B[j]) ;
      |             ^~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	436 KB	Output is correct

Subtask #3
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	436 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	488 KB	Output is correct
36	Correct	1 ms	480 KB	Output is correct

Subtask #4
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	436 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	436 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	2 ms	488 KB	Output is correct
36	Correct	1 ms	480 KB	Output is correct
37	Correct	7 ms	1216 KB	Output is correct
38	Correct	26 ms	3288 KB	Output is correct
39	Correct	29 ms	3544 KB	Output is correct
40	Correct	24 ms	3544 KB	Output is correct
41	Correct	34 ms	4564 KB	Output is correct
42	Correct	59 ms	4576 KB	Output is correct
43	Correct	28 ms	3824 KB	Output is correct
44	Correct	6 ms	1212 KB	Output is correct
45	Correct	26 ms	3536 KB	Output is correct
46	Correct	22 ms	3540 KB	Output is correct
47	Correct	23 ms	3544 KB	Output is correct
48	Correct	32 ms	4556 KB	Output is correct
49	Correct	40 ms	4416 KB	Output is correct
50	Correct	27 ms	4056 KB	Output is correct
51	Correct	28 ms	3800 KB	Output is correct
52	Correct	31 ms	3752 KB	Output is correct
53	Correct	31 ms	3800 KB	Output is correct

Submission #1092067

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0