제출 #1160414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160414		Doncho_Bonboncho	Gap (APIO16_gap)	C++20	0 / 100	35 ms	2240 KiB

gap

#include <algorithm>
#include <random>
#include <stdio.h>
#include <stdlib.h>
#include <vector>

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

#ifndef LOCAL
#define cerr if(false) cerr
#endif

#define out( x ) #x << " = " << x << "  "
#define endl "\n"

template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }

typedef long long ll;
const ll mod = 1e9 +7;
const int MAX_N = 1e6 + 42;



long long findGap(int subtask, int n){

	if( subtask == 1 ){
		std::vector< ll > a;
		ll mn = -1;
		ll mx = 1e18 + 2LL;
		while( true ){
			MinMax(mn + 1, mx - 1, &mn, &mx);
			if (mn != mx) {
				a.push_back(mn);
				a.push_back(mx);
			}else a.push_back(mn);
            
            if( (ll)a.size() == n ) break;
		}

		std::sort( a.begin(), a.end() );

		//for( auto j : a ) cerr << j << " ";
		//cerr << endl;

		ll nas = -1;
		for( int i=0 ; i < (ll)a.size() - 1 ; i++ ) nas = std::max( nas, (ll)a[i+1] - a[i] );
		cerr << out( nas ) << endl;

		return nas;
	}else{
		// QJ MI KURA
	}
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
   56 | }
      | ^

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