#include <bits/stdc++.h> #include <math.h> using namespace std; #define endl "\n" #define mp make_pair #define st first #define nd second #define pii pair<int, int> #define pb push_back #define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0); #define REP(i, n) for (int i = 0; i < (n); ++i) #define FWD(i, a, b) for (int i = (a); i < (b); ++i) #define rep(i, n) for (int32_t i = 0; i < (n); ++i) #define fwd(i, a, b) for (int i = (a); i < (b); ++i) #define all(c) (c).begin(), (c).end() #define sz(X) (int)((X).size()) #define what(x) cerr << #x << " is " << x << endl; ostream &operator<<(ostream &out, string str) { for (char c : str) out << c; return out; } template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; } template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) { out << '{'; for (auto it = a.begin(); it != a.end(); it = next(it)) out << (it != a.begin() ? ", " : "") << *it; return out << '}'; } void dump() { cerr << "\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define DEBUG false #define debug(...) \ if (DEBUG) \ cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) const int MAXN = 30; vector<char> operacja[MAXN]; vector<int> tab[MAXN]; long long zmienna[MAXN]; int counter[MAXN]; long long global; int n; inline void make(int i) { int j = counter[i]++; switch (operacja[i][j]) { case '+': zmienna[i] += tab[i][j]; break; case '-': zmienna[i] -= tab[i][j]; break; case 'W': zmienna[i] = global; break; case 'Z': global = zmienna[i]; break; } } void clear_counter() { global = 0; rep(i, n) counter[i] = zmienna[i] = 0; } void clear() { rep(i, MAXN) { tab[i].clear(); operacja[i].clear(); counter[i] = zmienna[i] = 0; } } int32_t main() { int Z; cin >> Z; while (Z--) { cin >> n; clear(); vector<int> X; rep(i, n) { int l; cin >> l; rep(j, l) { X.push_back(i); char c; cin >> c; operacja[i].push_back(c); int a = 0; if (c == '+' || c == '-') { cin >> a; } tab[i].push_back(a); } } long long mini = 1e18; do { clear_counter(); for (int a : X) make(a); mini = min(mini, global); } while (next_permutation(all(X))); cout << mini << endl; } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 | #include <bits/stdc++.h> #include <math.h> using namespace std; #define endl "\n" #define mp make_pair #define st first #define nd second #define pii pair<int, int> #define pb push_back #define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0); #define REP(i, n) for (int i = 0; i < (n); ++i) #define FWD(i, a, b) for (int i = (a); i < (b); ++i) #define rep(i, n) for (int32_t i = 0; i < (n); ++i) #define fwd(i, a, b) for (int i = (a); i < (b); ++i) #define all(c) (c).begin(), (c).end() #define sz(X) (int)((X).size()) #define what(x) cerr << #x << " is " << x << endl; ostream &operator<<(ostream &out, string str) { for (char c : str) out << c; return out; } template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; } template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) { out << '{'; for (auto it = a.begin(); it != a.end(); it = next(it)) out << (it != a.begin() ? ", " : "") << *it; return out << '}'; } void dump() { cerr << "\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define DEBUG false #define debug(...) \ if (DEBUG) \ cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) const int MAXN = 30; vector<char> operacja[MAXN]; vector<int> tab[MAXN]; long long zmienna[MAXN]; int counter[MAXN]; long long global; int n; inline void make(int i) { int j = counter[i]++; switch (operacja[i][j]) { case '+': zmienna[i] += tab[i][j]; break; case '-': zmienna[i] -= tab[i][j]; break; case 'W': zmienna[i] = global; break; case 'Z': global = zmienna[i]; break; } } void clear_counter() { global = 0; rep(i, n) counter[i] = zmienna[i] = 0; } void clear() { rep(i, MAXN) { tab[i].clear(); operacja[i].clear(); counter[i] = zmienna[i] = 0; } } int32_t main() { int Z; cin >> Z; while (Z--) { cin >> n; clear(); vector<int> X; rep(i, n) { int l; cin >> l; rep(j, l) { X.push_back(i); char c; cin >> c; operacja[i].push_back(c); int a = 0; if (c == '+' || c == '-') { cin >> a; } tab[i].push_back(a); } } long long mini = 1e18; do { clear_counter(); for (int a : X) make(a); mini = min(mini, global); } while (next_permutation(all(X))); cout << mini << endl; } } |