제출 #542072

#제출 시각아이디문제언어결과실행 시간메모리
542072SavicSCloud Computing (CEOI18_clo)C++17
0 / 100
3071 ms340 KiB
#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <bits/stdc++.h> using namespace std; using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<ld,ld> pdd; #define ff(i,a,b) for(int i = a; i <= b; i++) #define fb(i,b,a) for(int i = b; i >= a; i--) #define trav(a,x) for (auto& a : x) #define sz(a) (int)(a).size() #define pb push_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // os.order_of_key(k) the number of elements in the os less than k // *os.find_by_order(k) print the k-th smallest number in os(0-based) const int mod = 1000000007; const ll inf = 1e18 + 5; const int mxN = 2005; int n, m; array<int,3> A[mxN]; array<int,3> B[mxN]; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; ff(i,0,n - 1)ff(j,0,2)cin >> A[i][j]; cin >> m; ff(i,0,m - 1)ff(j,0,2)cin >> B[i][j]; ll rez = 0; ff(mask,0,(1 << n) - 1){ ll A_c = 0, A_v = 0; ff(i,0,n - 1)if(mask & (1 << i))A_c += A[i][0], A_v += A[i][2]; ff(mask,0,(1 << m) - 1){ ll B_c = 0, B_v = 0; ff(i,0,m - 1)if(mask & (1 << i))B_c += B[i][0], B_v += B[i][2]; if(A_c >= B_c)rez = max(rez, B_v - A_v); } } cout << rez << '\n'; return 0; } /* 4 4 1 700 2 1 10 20 1 9999 4 1 750 3 1 1 300 6 1 1500 3 1 4550 // probati bojenje sahovski */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...