제출 #1027578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1027578		Gangsta	Gap (APIO16_gap)	C++14	0 / 100	20 ms	2856 KiB

gap

#include "bits/stdc++.h"
#include "gap.h"
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
#define ff first
#define ss second
#define sz size()

const int N = 2e5 + 1;

using namespace std;

ll ans;

// void MinMax(ll s, ll t, ll &mn, ll &mx){
// 	int a, b;
// 	cin >> a >> b;
// 	mn = a;
// 	mx = b;
// }

ll findGap(int t, int n){
	ll mn = 1, mx = 1e18, tmp, tmp1;
	if(t == 1){
		while(1){
			tmp = mn, tmp1 = mx;
			MinMax(mn, mx, &mn+1, &mx-1);
			// cout << mn << ' ' << mx << '\n';
			if(mn == -1) return ans;
			ans = max({ans,mn-tmp, tmp1-mx});
		}
	}
}

// int main(){
//     int n, t;
//     cin >> t >> n;
//     cout << findGap(t, n);
// }

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^
gap.cpp:28:10: warning: array subscript -1 is outside array bounds of 'long long int [1]' [-Warray-bounds]
   28 |    MinMax(mn, mx, &mn+1, &mx-1);
      |    ~~~~~~^~~~~~~~~~~~~~~~~~~~~~
gap.cpp:24:13: note: while referencing 'mx'
   24 |  ll mn = 1, mx = 1e18, tmp, tmp1;
      |             ^~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70