제출 #767245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
767245		synthesis	Knapsack (NOI18_knapsack)	C++17	0 / 100	9 ms	12244 KiB

knapsack

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(), x.end()
 
using namespace std;
using namespace __gnu_pbds;
using ll = long long int;
using ull = unsigned long long int;
 
constexpr ll mod = 1e9 + 7;
constexpr ll INF = LONG_LONG_MAX;
 
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
string moves = "URDL";
 
int main()
{
    //tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> q;
    /*freopen("problemname.in", "r", stdin);
    freopen("problemname.out", "w", stdout);*/
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll x, n, ans = 0, a, b, c;
    cin >> x >> n;
    vector<ll> arr[x + 1];
    while(n--) {
        cin >> a >> b >> c;
        while(arr[b].size() <= x && c--) {
            arr[b].pb(a);
        }
    }
    for(ll i = 1;i<=x;++i) {
        sort(all(arr[i]));
        reverse(all(arr[i]));
    }
    ll dp[x + 1][x + 1];
    memset(dp, 0, sizeof dp);
    for(ll i = 1;i<=x;++i) {
        for(ll j = 0;j<=x;++j) {
            dp[i][j] = max(dp[i][j], dp[i - 1][j]);
            ll cnt = 1, lim = arr[i].size(), add = 0;
            while(j - cnt*i >= 0 && lim--) {
                add+=arr[i].at(cnt - 1);
                dp[i][j] = max(dp[i][j], dp[i - 1][j - cnt*i] + add);
            }
            ans = max(ans, dp[i][j]);
        }
    }
    cout << ans << endl;
    return 0;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:35:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   35 |         while(arr[b].size() <= x && c--) {
      |               ~~~~~~~~~~~~~~^~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27