結果
問題 |
No.1816 MUL-DIV Game
|
ユーザー |
|
提出日時 | 2022-01-21 21:44:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 4,021 bytes |
コンパイル時間 | 1,869 ms |
コンパイル使用メモリ | 203,516 KB |
最終ジャッジ日時 | 2025-01-27 13:34:42 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
コンパイルメッセージ
In file included from /usr/include/c++/13/istream:41, from /usr/include/c++/13/sstream:40, from /usr/include/c++/13/complex:45, from /usr/include/c++/13/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127, from main.cpp:4: In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’, inlined from ‘void Main()’ at main.cpp:94:13: /usr/include/c++/13/ostream:204:25: warning: ‘val’ may be used uninitialized [-Wmaybe-uninitialized] 204 | { return _M_insert(__n); } | ~~~~~~~~~^~~~~ main.cpp: In function ‘void Main()’: main.cpp:89:8: note: ‘val’ was declared here 89 | ll val; | ^~~
ソースコード
bool TEST = false; using namespace std; #include<bits/stdc++.h> #include<fstream> #define rep(i,n) for(ll (i)=0;(i)<(ll)(n);i++) #define rrep(i,n) for(ll (i)=(ll)(n)-1;(i)>=0;i--) #define range(i,start,end,step) for(ll (i)=start;(i)<(ll)(end);(i)+=(step)) #define rrange(i,start,end,step) for(ll (i)=start;(i)>(ll)(end);(i)+=(step)) #define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n"; #define spa << " " << #define fi first #define se second #define all(a) (a).begin(),(a).end() #define allr(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; template<typename T> using V = vector<T>; template<typename T> using VV = V<V<T>>; template<typename T, typename T2> using P = pair<T, T2>; template<typename T, typename T2> using M = map<T, T2>; template<typename T> using S = set<T>; template<typename T, typename T2> using UM = unordered_map<T, T2>; template<typename T> using PQ = priority_queue<T, V<T>, greater<T>>; template<typename T> using rPQ = priority_queue<T, V<T>, less<T>>; template<class T>vector<T> make_vec(size_t a){return vector<T>(a);} template<class T, class... Ts>auto make_vec(size_t a, Ts... ts){return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));} template<class SS, class T> ostream& operator << (ostream& os, const pair<SS, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;} template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template <class T> void UNIQUE(vector<T> &x) {sort(all(x));x.erase(unique(all(x)), x.end());} template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template<typename T> void debug(vector<vector<T>>&v){for(ll i=0;i<v.size();i++) {cerr<<v[i][0];for(ll j=1;j<v[i].size();j++)cerr spa v[i][j];cerr<<"\n";}}; template<typename T> void debug(vector<T>&v){if(v.size()!=0)cerr<<v[0]; for(ll i=1;i<v.size();i++)cerr spa v[i]; cerr<<"\n";}; template<typename T, typename T2> void debug(map<T,T2>&v){for(auto [k,v]: v) cerr << k spa v << "\n"; cerr<<"\n";} template<typename T, typename T2> void debug(unordered_map<T,T2>&v){for(auto [k,v]: v) cerr << k spa v << "\n";cerr<<"\n";} V<int> listrange(int n) {V<int> res(n); rep(i,n) res[i]=i; return res;} template<typename T> P<T,T> divmod(T a, T b) {return make_pair(a/b, a%b);} const ll INF = (1ll<<62); // const ld EPS = 1e-10; // const ld PI = acos(-1.0); void Main(){ ll n; cin >> n; V<ll> a(n); multiset<ll> s; rep(i,n) { cin >> a[i]; s.insert(a[i]); } bool f = 1; while (s.size()>1) { if (f) { auto u = s.begin(); s.erase(u); auto v = s.begin(); s.erase(v); s.insert((*u) * (*v)); } else { auto u = *s.rbegin(); s.erase(s.find(u)); auto v = *s.rbegin(); s.erase(s.find(v)); s.insert((v + u -1) / (u)); } f = !f; } ll val; for (auto v: s) { val = v; } cout << val << endl; } int main(void){ std::ifstream in("tmp_in"); if (TEST) { std::cin.rdbuf(in.rdbuf()); std::cout << std::fixed << std::setprecision(15); } else { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(15); } Main(); }