oj.uz

답안 #266626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
266626 2020-08-15T11:39:15 Z kaage Gap (APIO16_gap) C++17
100 / 100
 88 ms 3308 KB 
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}*/
#line 1 "gap.h"

void MinMax(long long, long long, long long*, long long*);
#line 3 "gap.cpp"
lint findGap(int t,int n){
	lint res=0;
	if(t==1){
		lint min,max;
		MinMax(1,1000000000000000000,&min,&max);
		if(n==2)return max-min;
		rep(i,(n-1)/2){
			lint newmin,newmax;
			MinMax(min+1,max-1,&newmin,&newmax);
			chmax(res,newmin-min);
			chmax(res,max-newmax);
			min=newmin;max=newmax;
		}
		chmax(res,max-min);
		return res;
	}
	else{
		lint min,max;
		MinMax(1,1000000000000000000,&min,&max);
		lint p=std::max((lint)2,(max-min-1-(n-2))/(n-1))+2;
		std::vector<lint> vec;
		vec.emplace_back(min);
		for(lint i=min+1;i<max-1;i+=p){
			lint newmin,newmax;
			MinMax(i,std::min(max-1,i+p-1),&newmin,&newmax);
			if(newmin!=-1){
				vec.emplace_back(newmin);
				vec.emplace_back(newmax);
			}
		}
		vec.emplace_back(max);
		rep(i,vec.size()-1){
			chmax(res,vec[i+1]-vec[i]);
		}
	}
	return res;
}

Compilation message

/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
gap.cpp: In function 'lint findGap(int, int)':
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
gap.cpp:34:3: note: in expansion of macro 'rep'

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 13 ms 512 KB Output is correct
17 Correct 15 ms 496 KB Output is correct
18 Correct 14 ms 512 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 9 ms 512 KB Output is correct
21 Correct 52 ms 1040 KB Output is correct
22 Correct 54 ms 1152 KB Output is correct
23 Correct 58 ms 1088 KB Output is correct
24 Correct 57 ms 1144 KB Output is correct
25 Correct 43 ms 1144 KB Output is correct
26 Correct 59 ms 1148 KB Output is correct
27 Correct 50 ms 1144 KB Output is correct
28 Correct 51 ms 1144 KB Output is correct
29 Correct 52 ms 1144 KB Output is correct
30 Correct 39 ms 1272 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 16 ms 896 KB Output is correct
17 Correct 19 ms 896 KB Output is correct
18 Correct 16 ms 896 KB Output is correct
19 Correct 18 ms 896 KB Output is correct
20 Correct 8 ms 604 KB Output is correct
21 Correct 69 ms 2288 KB Output is correct
22 Correct 72 ms 2288 KB Output is correct
23 Correct 70 ms 2288 KB Output is correct
24 Correct 70 ms 2352 KB Output is correct
25 Correct 65 ms 3308 KB Output is correct
26 Correct 88 ms 2452 KB Output is correct
27 Correct 69 ms 2288 KB Output is correct
28 Correct 76 ms 2416 KB Output is correct
29 Correct 77 ms 2236 KB Output is correct
30 Correct 36 ms 1528 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct