結果
問題 |
No.3166 [Cherry 7th Tune *] 桜の守人
|
ユーザー |
|
提出日時 | 2025-06-02 20:00:38 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,463 bytes |
コンパイル時間 | 4,620 ms |
コンパイル使用メモリ | 260,968 KB |
実行使用メモリ | 7,848 KB |
最終ジャッジ日時 | 2025-06-02 20:01:01 |
合計ジャッジ時間 | 22,289 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | WA * 26 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<int(n);++i) #define rep2(i,a,n) for(int i=int(a);i<int(n);++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int test;cin>>test; rep(_, test){ ll n, lg, k;cin>>n>>lg>>k; vecll a(n); rep(i, n) cin>>a[i], a[i] = (a[i] + lg) * 2; auto f = [&](int m){ vecll t; rep(i, n){ t.push_back(a[i]); t.push_back(a[i] + m * 2 + 1); t.push_back(a[i] - m * 2 - 1); } sort(all(t)); t.erase(unique(all(t)), t.end()); veci c(t.size() + 1), d(t.size() + 1); auto Idx = [&](ll k){return lower_bound(all(t), k) - t.begin();}; rep(i, n){ c[Idx(a[i])]++; d[Idx(a[i])]++; c[Idx(a[i] + 2 * m + 1)]--; d[Idx(a[i] - 2 * m - 1)]--; } rep(i, 1, c.size()) c[i] += c[i - 1]; rrep(i, d.size() - 1) d[i] += d[i + 1]; rep(i, t.size()) if(t[i] % 2){ int r = 0, j; rep(k, 3){ if(t[i] + k * 2 * lg < 6 * lg){ j = upper_bound(all(t), t[i] + k * 2 * lg) - t.begin(); r += c[j - 1]; j = Idx(t[i] + k * 2 * lg); if(j < t.size()) r += d[j]; } if(t[i] - k * 2 * lg >= 0){ j = upper_bound(all(t), t[i] - k * 2 * lg) - t.begin(); if(j) r += c[j - 1]; j = Idx(t[i] - k * 2 * lg); r += d[j]; } } if(r < k) return 0; } return 1; }; int l = -1, r = lg; while(r - l > 1){ int mid = (l + r) / 2; if(f(mid)) r = mid; else l = mid; } cout<<r<<endl; } }