結果

問題 No.1495 パンの仕入れ
ユーザー fastmathfastmath
提出日時 2021-04-30 22:53:25
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,110 ms / 2,000 ms
コード長 3,934 bytes
コンパイル時間 1,551 ms
コンパイル使用メモリ 131,980 KB
最終ジャッジ日時 2025-01-21 04:14:18
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
for (T& x : data)
input >> x;
return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
output << "(" << data.x << "," << data.y << ")";
return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
for (const T& x : data)
output << x << " ";
return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT> void re(V<T>& x) {
trav(a, x)
cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0;
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0;
}
ll gcd(ll a, ll b) {
while (b) {
tie(a, b) = mp(b, a % b);
}
return a;
}
signed main() {
#ifdef LOCAL
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int t;
cin >> t;
while (t--) {
int n, m, k;
cin >> n >> m >> k;
V <vi> a(n + 1);
FOR (i, m) {
int x, y;
cin >> x >> y;
a[x].app(y);
}
auto Cost = [&] (int c, int x) {
int ans = 0;
trav (e, a[c]) {
ans += (e - x) * (e - x);
}
return ans;
};
auto Get = [&] (int der) {
int ans = 0;
FORN (c, n) {
int l = 0, r = k + 1;
while (l < r - 1) {
int m = (l + r) / 2;
if (Cost(c, m) - Cost(c, m - 1) <= der) {
l = m;
}
else {
r = m;
}
}
ans += l;
}
return ans;
};
int der = 2e18;
FORN (c, n) {
ckmin(der, Cost(c, 1) - Cost(c, 0));
}
der--;
for (int bit = 40; bit >= 0; --bit) {
int nu = der + (1ll << bit);
if (Get(nu) <= k) {
der = nu;
}
}
auto Get_Cost = [&] (int der) {
int ans = 0;
FORN (c, n) {
int l = 0, r = k + 1;
while (l < r - 1) {
int m = (l + r) / 2;
if (Cost(c, m) - Cost(c, m - 1) <= der) {
l = m;
}
else {
r = m;
}
}
ans += Cost(c, l);
}
return ans;
};
assert(der < 1e18);
cout << Get_Cost(der) + (k - Get(der)) * (der + 1) << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0