제출 #266626

#제출 시각아이디문제언어결과실행 시간메모리
266626kaageGap (APIO16_gap)C++17
100 / 100
88 ms3308 KiB
#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; }

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

/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'
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...