結果
問題 | No.2366 登校 |
ユーザー |
|
提出日時 | 2023-06-30 22:13:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,333 bytes |
コンパイル時間 | 1,796 ms |
コンパイル使用メモリ | 194,040 KB |
最終ジャッジ日時 | 2025-02-15 04:02:08 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 7 WA * 18 |
ソースコード
// github.com/Johniel/contests// yukicoder/2365/main.cpp#include <bits/stdc++.h>#define each(i, c) for (auto& i : c)#define unless(cond) if (!(cond))// #define endl "\n"using namespace std;template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; }template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; }template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; }template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; }template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; }template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; }template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; }template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[" << N << "]{"; for (auto& i: a) os << i << ","; os << "}"; return os; }template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); }template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); }__attribute__((constructor)) static void ___initio(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.setf(ios_base::fixed); cout.precision(15); return ; }using lli = long long int;using ull = unsigned long long;using str = string;template<typename T> using vec = vector<T>;constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1});constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1});constexpr lli mod = 1e9 + 7;// constexpr lli mod = 998244353;int main(int argc, char *argv[]){int n, m, k;lli t;while (cin >> n >> m >> k >> t) {lli mn = 1LL << 61;if (n * m - 1 <= t) mn = 0;for (int _ = 0; _ < k; ++_) {lli a, b, c, d;cin >> a >> b >> c >> d;lli x = n * m - 1;unless (t < x) continue;lli y = ((x - t + c - 1) / c) * d;setmin(mn, y);}cout << mn << endl;}return 0;}