제출 #812496

#제출 시각아이디문제언어결과실행 시간메모리
812496mindiyakGap (APIO16_gap)C++14
0 / 100
18 ms1160 KiB
#include "gap.h" #pragma GCC optimize("O3") #pragma GCC target("sse4") #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd; typedef vector<int> vi; typedef vector<bool> vb; typedef vector<vector<int>> vvi; typedef vector<ld> vd; typedef vector<ll> vl; typedef vector<pi> vpi; typedef vector<pl> vpl; #define FOR(i, a, b) for (ll i = a; i < (b); i++) #define F0R(i, a) for (ll i = 0; i < (a); i++) #define FORd(i, a, b) for (ll i = (b)-1; i >= a; i--) #define F0Rd(i, a) for (ll i = (a)-1; i >= 0; i--) #define trav(a, x) for (auto &a : x) #define uid(a, b) uniform_int_distribution<int>(a, b)(rng) #define len(x) (int)(x).size() #define mp make_pair #define pb push_back #define fst first #define nl endl #define sec second #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define ins insert const int MOD = 1000000007; const int MX = INT_MAX; const int MN = INT_MIN; vl arr; void bin(ll left,ll right){ if(right>left)return; ll val_l,val_r; // cout << left << " " << right << " "; MinMax(left,right,&val_l,&val_r); // cout << val_l << " " << val_r << endl; if(val_l==val_r){ if(val_l != -1)arr.pb(val_r); return; } int mid = (val_l+val_r)>>1; bin(val_l,mid); bin(mid+1,val_r); } long long findGap(int T, int N) { arr.clear(); bin(0,1e18); ll ans = 0; // FOR(i,0,arr.size())cout << arr[i] << " "; // cout << endl; FOR(i,1,arr.size())ans = max(ans,arr[i]-arr[i-1]); return ans; }

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:19:39: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 | #define FOR(i, a, b) for (ll i = a; i < (b); i++)
      |                                       ^
gap.cpp:64:2: note: in expansion of macro 'FOR'
   64 |  FOR(i,1,arr.size())ans = max(ans,arr[i]-arr[i-1]);
      |  ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...