# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573080 | BenyKarimi | Knapsack (NOI18_knapsack) | C++17 | 26 ms | 33320 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define For(i, x, n) for(int i = x; i < n; i++)
#define Rof(i, x, n) for(int i = n - 1; i >= x; i--)
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define F first
#define S second
#define pb push_back
#define po pop_back
#define En endl
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend();
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PLL> VPLL;
const int MN = 2e3 + 5;
const int MOD = 1e9 + 7;
const int LOG = 20;
const LL INF = 1e18 + 7;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |