็ตๆ
| ๅ้ก | No.8077 ๐ง |
| ใฆใผใถใผ |
 iiljj
|
| ๆๅบๆฅๆ | 2021-04-01 20:26:25 |
| ่จ่ช | C++17 (gcc 13.3.0 + boost 1.87.0) |
| ็ตๆ |
AC
|
| ๅฎ่กๆ้ | 2 ms / 2,000 ms |
| ใณใผใ้ท | 10,953 bytes |
| ใณใณใใคใซๆ้ | 1,170 ms |
| ใณใณใใคใซไฝฟ็จใกใขใช | 130,736 KB |
| ๆ็ตใธใฃใใธๆฅๆ | 2025-01-20 05:40:09 |
|
ใธใฃใใธใตใผใใผID ๏ผๅ่ๆ ๅ ฑ๏ผ |
judge3 / judge3 |
๏ผ่ฆใญใฐใคใณ๏ผ
| ใใกใคใซใใฟใผใณ | ็ตๆ |
|---|---|
| sample | AC * 3 |
| other | AC * 10 |
ใฝใผในใณใผใ
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector ๅ ฅๅfor (T &x : vec) is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector ๅบๅ (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector ๅบๅ (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array ๅ ฅๅREP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array ๅบๅ (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair ๅ ฅๅis >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair ๅบๅos << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us ๅบๅtemplate <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end()) os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}void pprint() { cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail) > 0) cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0) DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (ๆดๆฐใใใใใใใใใใชใๅคใๅ)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (ๆดๆฐใใใใใใใใใใชใๅคใๅ)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ใญใผใซใซ็จ#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \cin >> __VA_ARGS__;template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH) cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }/* #endregion */// #include <atcoder/all>// using namespace atcoder;/* #region mint2 */// ่ชๅใง mod ใๅใๆดๆฐ (mod ใๅ็ใซๆฑบใใ็)struct mint {ll mod;ll x;mint(ll mod, ll x) : mod(mod), x((x % mod + mod) % mod) {}// mint(const mint &another) : mod(another.mod), x(another.x) {}mint() : mod(0), x(0) {}mint &operator+=(const mint a) {assert(a.mod == mod);if ((x += a.x) >= mod) x -= mod;return *this;}mint &operator+=(const ll a) {if ((x += a % mod) >= mod) x -= mod;return *this;}mint &operator-=(const mint a) {assert(a.mod == mod);if ((x += mod - a.x) >= mod) x -= mod;return *this;}mint &operator-=(const ll a) {if ((x += mod - (a % mod)) >= mod) x -= mod;return *this;}mint &operator*=(const mint a) {assert(a.mod == mod);(x *= a.x) %= mod;return *this;}mint &operator*=(const ll a) {// (x *= a % mod) %= mod;*this *= mint(mod, a);return *this;}mint operator+(const mint a) const {mint res(*this);return res += a;}mint operator+(const ll a) const {mint res(*this);return res += a;}mint operator-(const mint a) const {mint res(*this);return res -= a;}mint operator-(const ll a) const {mint res(*this);return res -= a;}mint operator*(const mint a) const {mint res(*this);return res *= a;}mint operator*(const ll a) const {mint res(*this);return res *= a;}// O(log(t))mint pow(ll t) const {if (!t) return mint(mod, 1);mint a = pow(t >> 1); // โt/2โ ไนa *= a; // โt/2โ*2 ไนif (t & 1) // โt/2โ*2 == t-1 ใฎใจใa *= *this; // โt/2โ*2+1 ไน => t ไนreturn a;}// for prime modmint inv_prime() const {return pow(mod - 2); // ใชใคใฉใผใฎๅฎ็ใใ๏ผ x^(-1) โก x^(p-2)}mint inv() const {ll a = this->x, b = mod, u = 1, v = 0, t;// mint res;while (b) {t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}if (u < 0) u += mod;mint res(mod, u);return res;}mint &operator/=(const mint a) { return (*this) *= a.inv(); }mint &operator/=(const ll a) { return (*this) *= mint(mod, a).inv(); }mint operator/(const mint a) const {mint res(*this);return res /= a;}mint operator/(const ll a) const {mint res(*this);return res /= a;}bool operator==(const mint a) const { return this->x == a.x; }bool operator==(const ll a) const { return this->x == a % mod; }// mint ๅ ฅๅfriend istream &operator>>(istream &is, mint &x) {is >> x.x;return is;}// mint ๅบๅfriend ostream &operator<<(ostream &os, mint x) {os << x.x;return os;}};/* #endregion */// Problemvoid solve() {VAR(ll, a, b, c, d, k); //// aรb+c-d ใ k ใงๅฒใฃใไฝใใๅบๅใใฆใใ ใใใ// [1, 1e9]// ab + c >= dmint ans(k, a);ans *= b;ans += c;ans -= d;pprint(ans);}// entry pointint main() {solve();return 0;}