Submission #1002261

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002261		Faissel	Cloud Computing (CEOI18_clo)	C++17	0 / 100	1 ms	348 KiB

clo

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
        int n;cin >> n;
        vector<array<ll,3>>a(n);
        ll cnt = 0;
        for(int i=0;i<n;i++){
            cin >> a[i][1] >> a[i][0] >> a[i][2];
            cnt += a[i][1];
        }
        int m;cin >> m;
        vector<array<ll,3>>b(m);
        for(int i=0;i<m;i++){
            cin >> b[i][1] >> b[i][0] >> b[i][2];
        }
        sort(a.begin(),a.end());
        reverse(a.begin(),a.end());
        sort(b.begin(),b.end());
        reverse(b.begin(),b.end());
        int idx = 0;
        vector<ll>dp(cnt + 5);
        for(int i=0;i<=cnt;i++){
            dp[i] = -1e18;
        }
        dp[0] = 0;
        for(int i=0;i<m;i++){
            while(idx < n && b[i][0] <= a[idx][0]){
                for(int j = dp.size() - 1;j >= a[idx][1];j--){
                    dp[j] = max(dp[j],dp[j - a[idx][1]] - a[idx][2]);
                }
                idx++;
            }
            for(int j= 0;j < dp.size() - b[i][1];j++){
                dp[j] = max(dp[j],dp[j+b[i][1]] + b[i][2]);
            }
            for(int i=0;i<dp.size();i++)cout << i << ' ' << dp[i]<< endl;
        }
        cout << dp[1];
}

Compilation message (stderr)

clo.cpp: In function 'int main()':
clo.cpp:39:28: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   39 |             for(int j= 0;j < dp.size() - b[i][1];j++){
clo.cpp:42:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for(int i=0;i<dp.size();i++)cout << i << ' ' << dp[i]<< endl;
      |                         ~^~~~~~~~~~

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10