結果
| 問題 | No.3051 Make All Divisible |
| ユーザー |
 noya2
|
| 提出日時 | 2025-03-07 22:59:07 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,411 bytes |
| コンパイル時間 | 3,863 ms |
| コンパイル使用メモリ | 291,528 KB |
| 実行使用メモリ | 8,608 KB |
| 最終ジャッジ日時 | 2025-03-07 22:59:13 |
| 合計ジャッジ時間 | 6,098 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 13 WA * 18 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"using namespace std;#include<bits/stdc++.h>#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"namespace noya2 {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p){os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p){is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v){int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v){for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &...u){cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u){cout << t;if (sizeof...(u)) cout << sep;out(u...);}template<typename T>void out(const vector<vector<T>> &vv){int s = (int)vv.size();for (int i = 0; i < s; i++) out(vv[i]);}struct IoSetup {IoSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetup_noya2;} // namespace noya2#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"namespace noya2{const int iinf = 1'000'000'007;const long long linf = 2'000'000'000'000'000'000LL;const long long mod998 = 998244353;const long long mod107 = 1000000007;const long double pi = 3.14159265358979323;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";void yes(){ cout << "Yes\n"; }void no(){ cout << "No\n"; }void YES(){ cout << "YES\n"; }void NO(){ cout << "NO\n"; }void yn(bool t){ t ? yes() : no(); }void YN(bool t){ t ? YES() : NO(); }} // namespace noya2#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"namespace noya2{unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){if (a == 0 || b == 0) return a + b;int n = __builtin_ctzll(a); a >>= n;int m = __builtin_ctzll(b); b >>= m;while (a != b) {int mm = __builtin_ctzll(a - b);bool f = a > b;unsigned long long c = f ? a : b;b = f ? b : a;a = (c - b) >> mm;}return a << std::min(n, m);}template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }long long sqrt_fast(long long n) {if (n <= 0) return 0;long long x = sqrt(n);while ((x + 1) * (x + 1) <= n) x++;while (x * x > n) x--;return x;}template<typename T> T floor_div(const T n, const T d) {assert(d != 0);return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);}template<typename T> T ceil_div(const T n, const T d) {assert(d != 0);return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);}template<typename T> void uniq(std::vector<T> &v){std::sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }} // namespace noya2#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)#define all(v) (v).begin(),(v).end()using ll = long long;using ld = long double;using uint = unsigned int;using ull = unsigned long long;using pii = pair<int,int>;using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;namespace noya2{/* ~ (. _________ . /) */}using namespace noya2;#line 2 "c.cpp"void solve(){int n, k; in(n,k);vector<ll> a(n); in(a);if (n == k){int mo = a[0] % k;rep(i,n){if (a[i] % k != mo){out(-1);return ;}}out(mo);return ;}vector<ll> b(n);vector<int> c(n);rep(i,n){b[i] = a[i] / k;c[i] = a[i] % k;}ll csum = 0;rep(i,n){csum += c[i];}if (csum % k != 0){out(-1);return ;}csum /= k;if (csum >= ranges::max(c)){out(csum);return ;}int qlim = ranges::max(c);ll ans = linf;auto upd = [&](ll p, int q){// p * k + q - csum > ans :> mudaif (p > (ans + csum) / k + 1) return ;chmin(ans, p*k+q - csum);};for (int q = 0; q < k; q++){// minimize : p*k+q - csum// s.t. p*c1 + c0 >= 0// ple <= p <= priauto proc = [&](ll c1, ll c0, ll ple, ll pri){if (ple > pri) return ;if (c1 == 0){if (c0 >= 0){upd(ple, q);}return ;}if (c1 < 0){if (ple*c1 + c0 >= 0){upd(ple, q);}return ;}ll p = ceil_div(-c0, c1);p = clamp(p, ple, pri);if (p*c1 + c0 >= 0){upd(p, q);}};ll ple = (q < qlim ? 1 : 0);vector<pli> ps(n);rep(i,n){ps[i].first = b[i] - floor_div(q - c[i], k);ps[i].second = i;}sort(all(ps));ll c1 = n - k, c0 = csum - q;rep(i,n){c0 += floor_div(q - c[i], k);}for (auto [pri, i] : ps){proc(c1,c0,ple,pri);c1--;c0 -= floor_div(q - c[i], k);c0 += b[i];chmax(ple, pri);}proc(c1,c0,ple,linf);}}int main(){int t = 1; in(t);while (t--) { solve(); }}