Submission #1257903

#	Time	Username	Problem	Language	Result	Execution time	Memory
1257903		alizhan	Knapsack (NOI18_knapsack)	C++20	12 / 100	1 ms	328 KiB

knapsack

#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int mod = 1000000007;
const int N = (int)1e4 + 7;
#define endl '\n'
#define skip continue
#define uno first
#define duo second
#define YES cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define GO while(tt--)
#define ins insert
#define pb push_back
#define all(x) x.begin(), x.end()
#define forest signed
#define Kaldun cin.tie(0)->sync_with_stdio(0)
#define int long long

int bp(int a, int n) {
    if(n == 0) return 1;
    if(n % 2 == 1) return (bp(a, n-1) * 1LL * a) % mod;
    long long b = bp(a, n/2);
    return (b * b) % mod;
} 
signed main() {
    //freopen("snakes.in", "r", stdin);
    //freopen("snakes.out", "w", stdout);
    Kaldun;
    int S,n;
    cin>>S>>n;
    for(int i=1;i<=n;i++){
        int v,w,k;
        cin>>v>>w>>k;
        int cnt=min(S/w,k);
        cout<<v*cnt;
    }
}

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