結果
問題 | No.1517 Party Location |
ユーザー |
|
提出日時 | 2021-05-28 21:01:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,830 bytes |
コンパイル時間 | 2,123 ms |
コンパイル使用メモリ | 192,264 KB |
最終ジャッジ日時 | 2025-01-21 19:25:18 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 13 |
ソースコード
// J A I S H R E E R A M //#include <bits/stdc++.h>#pragma GCC optimize "trapv"// #pragma GCC optimize ("Ofast")// // #pragma GCC target ("fpmath=sse,sse2")// #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")// #pragma GCC optimize ("-ffloat-store")using namespace std;typedef long long int lld;typedef unsigned long long int llu;#define forn(I7, E4) for(lld I7=0ll; I7 < E4; (I7)+=1ll)#define forn1(I7, E4) for(lld I7=1ll; I7 < E4+1; (I7)+=1ll)#define len(v) ((int)((v).size()))#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define f1 first#define s2 secondtemplate<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }template < typename T_container, typename T = typename enable_if < !is_same<T_container, string>::value, typename T_container::value_type >::type >ostream & operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }void dbg_out() { cout << "\n"; }template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << H << ", "; dbg_out(T...);}#define _____error_____(...) cout << #__VA_ARGS__ << " : ", dbg_out(__VA_ARGS__)const lld d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};const lld d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};const long double EPS = 1e-6;lld TempVar, mod, MOD;/*:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*/void solveEachTest(int _TestCase) {// cout << "Case #" << _TestCase << ": ";lld d; cin >> d;lld a, b; cin >> a >> b;cout << min(a * d, b * d);return;}signed main() {ios_base::sync_with_stdio(false); cin.tie(0);// cout.precision(10); cout << fixed;#ifdef LUCTIVUD// const auto start_time = std::chrono::high_resolution_clock::now();freopen("/home/luctivud/CPPractice/Zinput.txt", "r", stdin);freopen("/home/luctivud/CPPractice/Zoutput.txt", "w", stdout);#endifMOD = mod = lld(1e9) + 7ll;lld _T0T4 = 1;// cin >> _T0T4;for (int _TestCase = 1; _TestCase <= _T0T4; _TestCase++) {solveEachTest(_TestCase);cout << "\n";}#ifdef LUCTIVUD// auto end_time = std::chrono::high_resolution_clock::now();// std::chrono::duration<double> diff = end_time - start_time;// cerr << "Finished in : " << diff.count() << "\n";#endifreturn 0;}/* ~~Author : Udit "luctivud" Guptalinkedin : https://www.linkedin.com/in/udit-gupta-1b7863135/*/