結果
問題 | No.247 線形計画問題もどき |
ユーザー |
|
提出日時 | 2020-01-02 20:20:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 3,313 bytes |
コンパイル時間 | 2,770 ms |
コンパイル使用メモリ | 195,312 KB |
最終ジャッジ日時 | 2025-01-08 15:31:17 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 23 |
コンパイルメッセージ
main.cpp: In function ‘int main(int, char**)’: main.cpp:59:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 59 | if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:60:42: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 60 | if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h> #define endl '\n' #define int long long #define lint long long #define pii pair<int, int> #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define FORR(i, a, b) for(int i = (a); i > (b); --i) #define REP(i, n) FOR(i, 0, n) #define SZ(v) ((int)v.size()) #define ZERO(a) memset(a, 0, sizeof(a)) #define MINUS(a) memset(a, 0xff, sizeof(a)) #define FILLINF(a) memset(a, 0x3f, sizeof(a)) #define POW(n) (1LL << (n)) #define POPCNT(n) (__builtin_popcount(n)) #define IN(i, a, b) ((a) <= (i) && (i) <= (b)) using namespace std; template <typename T> inline bool CHMIN(T& a,T b) { if(a > b) { a = b; return 1; } return 0; } template <typename T> inline bool CHMAX(T& a,T b) { if(a < b) { a = b; return 1; } return 0; } template <typename T> inline void SORT(T& a) { sort(begin(a), end(a)); } template <typename T> inline void REV(T& a) { reverse(begin(a), end(a)); } template <typename T> inline void UNI(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); } template <typename S, typename T> inline T LB(S& v, T a) { return *lower_bound(begin(v), end(v), a); } template <typename S, typename T> inline int LBP(S& v, T a) { return lower_bound(begin(v), end(v), a) - begin(v); } template <typename S, typename T> inline T UB(S& v, T a) { return *upper_bound(begin(v), end(v), a); } template <typename S, typename T> inline int UBP(S& v, T a) { return upper_bound(begin(v), end(v), a) - begin(v); } template <typename S, typename T> ostream& operator << (ostream& os, const pair<S, T>& p) { os << p.first << " " << p.second; return os; } template <typename S, typename T> istream& operator >> (istream& is, pair<S, T>& p) { is >> p.first >> p.second; return is; } template <typename T> ostream& operator << (ostream& os, const vector<T>& v) { for (int i = 0; i < v.size(); ++i) { if (i) os << " "; os << v[i]; } return os; } template <typename T> istream& operator >> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; } template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); } template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); } template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; } template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } const double PI = 3.14159265358979323846; const double EPS = 1e-10; const lint INF = 0x3f3f3f3f3f3f3f3f; const lint MOD = 1000000007; int C, N; int a[100010]; int dp[110][100010]; void _main() { cin >> C >> N; REP (i, N) cin >> a[i]; sort(a, a + N); reverse(a, a + N); FILLINF(dp); dp[0][0] = 0; REP (i, N) REP (j, C + 1) { dp[i + 1][j] = dp[i][j]; if (j - a[i] >= 0) CHMIN(dp[i + 1][j], dp[i + 1][j - a[i]] + 1); } cout << (dp[N][C] == INF ? -1 : dp[N][C]) << endl; } signed main(signed argc, char **argv) { if (argc > 1) { if (strchr(argv[1], 'i')) freopen("input.txt", "r", stdin); if (strchr(argv[1], 'o')) freopen("output.txt", "w", stdout); } ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); _main(); return 0; }