結果
| 問題 |
No.738 平らな農地
|
| ユーザー |
 jell
|
| 提出日時 | 2018-10-27 17:51:31 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 6,253 bytes |
| コンパイル時間 | 935 ms |
| コンパイル使用メモリ | 102,748 KB |
| 最終ジャッジ日時 | 2024-11-14 20:40:19 |
| 合計ジャッジ時間 | 2,073 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function ‘uint64_t gcd(uint64_t, uint64_t)’:
main.cpp:110:57: error: call of overloaded ‘abs(uint64_t&)’ is ambiguous
110 | uint64_t gcd(uint64_t a, uint64_t b) { if(!b) return abs(a); if(a % b) return gcd(b, a % b); return b; }
| ~~~^~~
In file included from /usr/include/c++/11/cstdlib:75,
from /usr/include/c++/11/bits/stl_algo.h:59,
from /usr/include/c++/11/algorithm:62,
from main.cpp:10:
/usr/include/stdlib.h:848:12: note: candidate: ‘int abs(int)’
848 | extern int abs (int __x) __THROW __attribute__ ((__const__)) __wur;
| ^~~
In file included from /usr/include/c++/11/cstdlib:77,
from /usr/include/c++/11/bits/stl_algo.h:59,
from /usr/include/c++/11/algorithm:62,
from main.cpp:10:
/usr/include/c++/11/bits/std_abs.h:103:3: note: candidate: ‘constexpr __float128 std::abs(__float128)’
103 | abs(__float128 __x)
| ^~~
/usr/include/c++/11/bits/std_abs.h:85:3: note: candidate: ‘constexpr __int128 std::abs(__int128)’
85 | abs(__GLIBCXX_TYPE_INT_N_0 __x) { return __x >= 0 ? __x : -__x; }
| ^~~
/usr/include/c++/11/bits/std_abs.h:79:3: note: candidate: ‘constexpr long double std::abs(long double)’
79 | abs(long double __x)
| ^~~
/usr/include/c++/11/bits/std_abs.h:75:3: note: candidate: ‘constexpr float std::abs(float)’
75 | abs(float __x)
| ^~~
/usr/include/c++/11/bits/std_abs.h:71:3: note: candidate: ‘constexpr double std::abs(double)’
71 | abs(double __x)
| ^~~
/usr/include/c++/11/bits/std_abs.h:61:3: note: candidate: ‘long long int std::abs(long long int)’
61 | abs(long long __x) { return __builtin_llabs (__x); }
| ^~~
/usr/include/c++/11/bits/std_abs.h:56:3: note: candidate: ‘long int std::abs(long int)’
56 | abs(long __i) { return __builtin_labs(__i); }
ソースコード
/*
#include <boost/functional/hash.hpp>
#include <boost/multiprecision/cpp_int.hpp>
typedef boost::multiprecision::cpp_int mlint;
*/
// #include <bits/stdc++.h>
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <tuple>
#include <string>
#include <functional>
#include <iterator>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <bitset>
#include <stack>
#include <iomanip>
using namespace std;
typedef int64_t i64;
typedef double db;
typedef vector<vector<int64_t>> mat;
typedef pair<int,int> pii;
typedef pair<int64_t,int> pli;
typedef pair<db,int> pdi;
#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v),end_copy = end(v); i != end_copy; ++i)
#define reach(i,v) for(auto i = rbegin(v),rend_copy = rend(v); i != rend_copy; ++i)
#define urep(i,s,t) for(int64_t i = (s),t_copy = (t); i <= t_copy; ++i)
#define drep(i,s,t) for(int64_t i = (s),t_copy = (t); i >= t_copy; --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define prque priority_queue
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second
void setup(uint8_t prec = 10) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(prec);
#ifdef Local
#define debug 1
#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
cout << "-- Execution At Local ---\n" << "\n<Standard Output>\n\n";
auto print_atexit = []() {
time_t end_time = time(NULL);
struct tm *ret = localtime(&end_time);
cout << "\n----------------\n";
cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
};
atexit(print_atexit);
#endif
}
template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vector<T>& v) { for(auto i = v.begin(); i != v.end(); i++) { if(i != begin(v)) s << " "; s << *i; } return s; }
template <class T> void hash_combine(size_t &seed, T const &key) {
hash<T> hasher;
seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &p) const {
size_t seed(0);
hash_combine(seed,p.first);
hash_combine(seed,p.second);
return seed;
}
};
}
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
uint64_t gcd(uint64_t a, uint64_t b) { if(!b) return abs(a); if(a % b) return gcd(b, a % b); return b; }
uint64_t lcm(uint64_t a, uint64_t b) { if(a & b) return a / gcd(a, b) * b; return 0; }
template <class T, class U> bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; }
template <class T, class U> bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; }
template <class T> T cmprs(T& v) {
T tmp = v,ret = v;
sort(all(tmp));
tmp.erase(unique(all(tmp)),end(tmp));
each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
return ret;
}
const int dir[8][2] = { {1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,1},{-1,-1},{1,-1} };
const i64 mod = 1e9 + 7;
const db eps = 1e-15;
template <class Abel = int> struct BIT {
typedef function<Abel(const Abel&,const Abel&)> opr_t;
const opr_t opr,invopr;
const Abel idel;
const int sz;
int range = 1;
vector<Abel> data,val;
BIT(int sz, Abel init_val, const opr_t &f = plus<Abel>(), const opr_t &g = minus<Abel>(), Abel idel = 0) : sz(sz), opr(f),invopr(g),idel(idel)
{
while(sz >= range) range <<= 1;
data.resize(range);
init(init_val);
}
void init(Abel v) {
val.assign(range,v);
val[0] = idel;
vector<Abel> tmp(range);
partial_sum(begin(val),end(val),begin(tmp),opr);
for(int i = 0; i < range; ++i) data[i] = invopr(tmp[i],tmp[i - (i & -i)]);
}
Abel query(int n) { return n ? opr(query(n - (n & -n)),data[n]) : idel; }
Abel query(int l, int r) { return invopr(query(r),query(l - 1)); }
void add(int idx, Abel diff = 1) { update(idx,val[idx] + diff); }
void update(int idx, Abel v) {
Abel prev = val[idx];
for(val[idx] = v; idx < range; idx += idx & -idx) data[idx] = opr(invopr(data[idx],prev),v);
}
int lower_bound(Abel obj) {
int l = 0,r = range;
while(r - l > 1) {
int mid = (l + r) / 2;
if(data[mid] >= obj) r = mid;
else obj -= data[l = mid];
}
return min(r,sz + 1);
}
int upper_bound(Abel obj) {
int l = 0,r = range;
while(r - l > 1) {
int mid = (l + r) / 2;
if(data[mid] > obj) r = mid;
else obj -= data[l = mid];
}
return min(r,sz + 1);
}
};
int N,K;
i64 ans = inf(i64);
int main() {
setup();
cin >> N >> K;
BIT<i64> bt(N,0),bt2(N,0);
vct<pii> v(N);
vct<int> a(N);
rep(i,N) {
cin >> v[i].fir;
v[i].sec = i;
a[i] = v[i].fir;
}
sort(all(v));
vct<int> rank(N);
rep(i,N) rank[v[i].sec] = i + 1;
rep(i,K - 1) bt.add(rank[i]);
rep(i,K - 1) bt2.add(rank[i],a[i]);
urep(i,K,N) {
bt.add(rank[i - 1]);
bt2.add(rank[i - 1],a[i - 1]);
if(odd(K)) {
int lb = bt.l_bnd((K + 1) / 2);
chmin(ans,bt2.query(lb,N) - bt2.query(lb));
} else {
int lb = bt.l_bnd(K / 2);
chmin(ans,bt2.query(lb + 1,N) - bt2.query(lb));
}
bt.add(rank[i - K],-1);
bt2.add(rank[i - K],-a[i - K]);
}
esc(ans);
}