結果
問題 | No.286 Modulo Discount Store |
ユーザー | daleksprinter |
提出日時 | 2019-03-16 17:32:09 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 2,768 bytes |
コンパイル時間 | 1,678 ms |
コンパイル使用メモリ | 171,448 KB |
実行使用メモリ | 259,628 KB |
最終ジャッジ日時 | 2024-07-01 22:36:06 |
合計ジャッジ時間 | 6,767 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 82 ms
259,308 KB |
testcase_01 | AC | 86 ms
259,428 KB |
testcase_02 | AC | 85 ms
259,400 KB |
testcase_03 | AC | 84 ms
259,428 KB |
testcase_04 | AC | 84 ms
259,404 KB |
testcase_05 | AC | 85 ms
259,476 KB |
testcase_06 | AC | 88 ms
259,432 KB |
testcase_07 | AC | 83 ms
259,444 KB |
testcase_08 | AC | 91 ms
259,472 KB |
testcase_09 | AC | 88 ms
259,312 KB |
testcase_10 | AC | 85 ms
259,424 KB |
testcase_11 | AC | 84 ms
259,544 KB |
testcase_12 | AC | 83 ms
259,484 KB |
testcase_13 | AC | 92 ms
259,304 KB |
testcase_14 | AC | 84 ms
259,512 KB |
testcase_15 | AC | 84 ms
259,452 KB |
testcase_16 | AC | 87 ms
259,340 KB |
testcase_17 | AC | 93 ms
259,444 KB |
testcase_18 | AC | 113 ms
259,428 KB |
testcase_19 | AC | 71 ms
259,372 KB |
testcase_20 | AC | 68 ms
259,364 KB |
testcase_21 | AC | 69 ms
259,428 KB |
testcase_22 | AC | 69 ms
259,628 KB |
testcase_23 | AC | 69 ms
259,320 KB |
testcase_24 | AC | 84 ms
259,528 KB |
testcase_25 | AC | 69 ms
259,396 KB |
testcase_26 | AC | 69 ms
259,476 KB |
testcase_27 | AC | 69 ms
259,460 KB |
testcase_28 | AC | 71 ms
259,520 KB |
testcase_29 | AC | 68 ms
259,464 KB |
testcase_30 | AC | 67 ms
259,476 KB |
testcase_31 | AC | 69 ms
259,320 KB |
testcase_32 | AC | 68 ms
259,488 KB |
testcase_33 | AC | 68 ms
259,304 KB |
testcase_34 | AC | 67 ms
259,376 KB |
testcase_35 | AC | 66 ms
259,344 KB |
testcase_36 | AC | 70 ms
259,524 KB |
testcase_37 | AC | 69 ms
259,420 KB |
testcase_38 | AC | 70 ms
259,440 KB |
testcase_39 | AC | 70 ms
259,360 KB |
testcase_40 | AC | 67 ms
259,392 KB |
testcase_41 | AC | 66 ms
259,304 KB |
testcase_42 | AC | 67 ms
259,380 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; /* macro */ #define rep(i,a,b) for(int i=a;i<b;i++) #define revrep(i,a,b) for(int i = a; i > b; i--) #define int long long #define exist(s,e) ((s).find(e)!=(s).end()) #define all(v) (v).begin(), (v).end() #define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++) #define sum(v) accumulate(all(v), (0LL)) #define isin(a, b, c) (b <= a && a <= c) #define println cout << "\n"; #define sz(v) (int)v.size() #define bin(x) static_cast<bitset<16> >(x) /* alias */ template<class T> using vec = vector<T>; typedef vector<int> vi; typedef pair<int, int> pi; typedef tuple<int, int, int> ti; typedef map<int, int> mi; typedef set<int> si; /* constant */ const int inf = 1LL << 62; const int mod = 1e9 + 7; const int dx[8]={1,0,-1,0,-1,1,-1,1}; const int dy[8]={0,1,0,-1,-1,-1,1,1}; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; /* io_method */ int input(){int tmp;cin >> tmp;return tmp;} string raw_input(){string tmp;cin >> tmp;return tmp;} template<class T> void printx(T n){cout << n;} template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";} template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;} template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";} template<class T> void print(T n){printx(n);cout << endl;} template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;} template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;} template<class T> void printans(vec<T> v){rep(i,0,sz(v)){cout << v[i] << (i == sz(v) - 1 ? "" : " ");}cout << endl;} /* general_method */ 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 (b<a) { a=b; return 1; } return 0; } template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);} /* main */ int n; vi arr; void in(){ cin >> n; rep(i,0,n) arr.push_back(input()); } int dp[(1 << 15)][1000]; int dfs(int s, int m){ if(s == (1 << n) - 1) return 0; if(dp[s][m] > -1) return dp[s][m]; int ans = inf; rep(i,0,n){ if(!(s & (1 << i))){ chmin(ans, max(0LL, arr[i] - m) + dfs(s | (1 << i), (m + arr[i]) % 1000)); } } return dp[s][m] = ans; } void solve(){ memset(dp, -1, sizeof(dp)); print(dfs(0, 0)); } signed main(){ cin.tie(0); ios::sync_with_stdio(false); in(); solve(); }