oj.uz

답안 #1092063

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092063 2024-09-23T04:02:41 Z vjudge1 A Plus B (IOI23_aplusb) C++17
0 / 100
 1000 ms 348 KB 
#include<bits/stdc++.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 )
{
    int l = 0 , r = 2e9 , res ; 
    while ( l <= r ) 
    {
        int mid = (l+r)/2 ; 
        int j = N-1 ; 
        ll total = 0 ; 
        for ( int i = 0 ; i < N ; i ++ ) 
        {
            if ( 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:52:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |     while (answer.size() > N ) answer.pop_back() ;
      |            ~~~~~~~~~~~~~~^~~
aplusb.cpp: In function 'void runfile()':
aplusb.cpp:24:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 | void runfile() { freopen ("inp.txt","r",stdin) ; }
      |                  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
aplusb.cpp: In function 'vi smallest_sums(int, vi, vi)':
aplusb.cpp:47:13: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   47 |             if ( A[i] + B[j] <= res ) answer . pb (A[i]+B[j]) ;
      |             ^~

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 1089 ms 348 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 1089 ms 348 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 1089 ms 348 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 1089 ms 348 KB Time limit exceeded
5 Halted 0 ms 0 KB -