結果
| 問題 | No.247 線形計画問題もどき |
| ユーザー |
 jell
|
| 提出日時 | 2018-11-25 15:26:25 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,218 bytes |
| コンパイル時間 | 1,433 ms |
| コンパイル使用メモリ | 124,576 KB |
| 実行使用メモリ | 13,008 KB |
| 最終ジャッジ日時 | 2024-06-07 00:17:47 |
| 合計ジャッジ時間 | 4,709 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | TLE | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
コンパイルメッセージ
main.cpp:119:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
119 | i64 bins(i64 ok, i64 ng, auto judge) {
| ^~~~
ソースコード
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <tuple>
#include <string>
#include <functional>
#include <iterator>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <bitset>
#include <stack>
#include <iomanip>
using namespace std;
typedef int64_t i64;
typedef double db;
typedef vector<vector<int64_t>> mat;
typedef pair<int,int> pii;
typedef pair<int64_t,int> pli;
typedef pair<db,int> pdi;
#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v),end_copy = end(v); i != end_copy; ++i)
#define reach(i,v) for(auto i = rbegin(v),rend_copy = rend(v); i != rend_copy; ++i)
#define urep(i,s,t) for(int64_t i = (s),t_copy = (t); i <= t_copy; ++i)
#define drep(i,s,t) for(int64_t i = (s),t_copy = (t); i >= t_copy; --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define prque priority_queue
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second
void setup(uint8_t prec = 10) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(prec);
#ifdef Local
#define debug 1
#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
cout << "-- Execution At Local ---\n" << "\n<Standard Output>\n\n";
auto print_atexit = []() {
time_t end_time = time(NULL);
struct tm *ret = localtime(&end_time);
cout << "\n----------------\n";
cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
};
atexit(print_atexit);
#endif
}
template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vector<T>& v) { for(auto i = v.begin(); i != v.end(); i++) { if(i != begin(v)) s << " "; s << *i; } return s; }
template <class T> void hash_combine(size_t &seed, T const &key) {
hash<T> hasher;
seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &p) const {
size_t seed(0);
hash_combine(seed,p.first);
hash_combine(seed,p.second);
return seed;
}
};
template <class T, class U, class V> struct hash<tuple<T,U,V>> {
size_t operator()(tuple<T,U,V> const &t) const {
size_t seed(0);
hash_combine(seed,get<0>(t));
hash_combine(seed,get<1>(t));
hash_combine(seed,get<2>(t));
return seed;
}
};
}
auto lam_min = [](auto x, auto y) { return min(x,y); };
auto lam_max = [](auto x, auto y) { return max(x,y); };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
int ilog(i64 x, uint64_t b) { if(x) return ilog(x / b,b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); if(a % b) return gcd(b, a % b); return abs(b); }
i64 lcm(i64 a, i64 b) { if(a & b) return abs(a / gcd(a, b) * b); return 0; }
template <class T, class U> void chval(T& m, U x) { m = x; }
template <class T, class U> bool chmax(T& m, U x) { if(m < x) { m = x; return 1; } return 0; }
template <class T, class U> bool chmin(T& m, U x) { if(m > x) { m = x; return 1; } return 0; }
i64 bins(i64 ok, i64 ng, auto judge) {
while(abs(ok - ng) > 1) {
i64 mid = ok + ng >> 1;
(judge(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T> T cmprs(T& v) {
T tmp = v,ret = v;
sort(all(tmp));
tmp.erase(unique(all(tmp)),end(tmp));
each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
return ret;
}
const int dir[8][2] = { {1,0},{0,1},{-1,0},{0,-1},{1,1},{-1,1},{-1,-1},{1,-1} };
const i64 mod = 1e9 + 7;
const db gold = sqrt(1.25) + 0.5;
const db eps = 1e-15;
int main() {
setup();
int c,n;
cin>>c>>n;
vct<int> a(n);
rep(i,n) cin>>a[i];
sort(all(a));
a.erase(unique(all(a)),end(a));
n=a.size();
unordered_map<int,int> dp;
dp[0]=0;
rep(i,n) {
int lim;
if(i<n-1) lim=a[i+1];
else lim=inf(int);
each(l,dp) {
int j=l->fir;
int llim=min((c-j)/a[i]+1,lim);
rep(k,llim) {
if(dp.count(k*a[i]+j)) {
chmin(dp[k*a[i]+j],k+dp[j]);
} else {
dp[k*a[i]+j]=dp[j]+k;
}
}
}
}
if(dp.count(c)) esc(dp[c]);
esc(-1);
}