제출 #542071

#제출 시각아이디문제언어결과실행 시간메모리
542071SavicSCloud Computing (CEOI18_clo)C++17
0 / 100
5 ms1876 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]; const int N = 100000; ll dp[N + 5]; ll pomdp[N + 5]; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; ff(i,1,n)ff(j,0,2)cin >> A[i][j]; cin >> m; ff(i,1,m)ff(j,0,2)cin >> B[i][j]; ff(i,0,N){ dp[i] = inf; pomdp[i] = -inf; } dp[0] = 0; ff(i,1,n){ int c = A[i][0]; int f = A[i][1]; int v = A[i][2]; fb(j,N,0){ if(j >= c)dp[j] = min(dp[j], dp[j - c] + v); } } pomdp[0] = 0; ff(i,1,m){ int C = B[i][0]; int F = B[i][1]; int V = B[i][2]; fb(j,N,0){ if(j >= C)pomdp[j] = max(pomdp[j], pomdp[j - C] + V); } } ll rez = 0; fb(i,N,0){ // nekad ce biti jeftinije da uzmem vise procesora dp[i] = min(dp[i], dp[i + 1]); rez = max(rez, pomdp[i] - dp[i]); } 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 */

컴파일 시 표준 에러 (stderr) 메시지

clo.cpp: In function 'int main()':
clo.cpp:62:13: warning: unused variable 'f' [-Wunused-variable]
   62 |         int f = A[i][1];
      |             ^
clo.cpp:72:13: warning: unused variable 'F' [-Wunused-variable]
   72 |         int F = B[i][1];
      |             ^
#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...