# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167186 | SmuggingSpun | Cloud Computing (CEOI18_clo) | C++20 | 3094 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
typedef long long ll;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
const int lim = 2e3 + 5;
const ll INF = 1e18;
struct Data{
int c, f, v;
bool operator <(const Data& other){
return this->f < other.f;
}
};
int n, m;
Data a[lim], b[lim];
namespace sub1{
void solve(){
ll ans = 0;
vector<ll>dp;
for(int mask = (1 << n) - 1; mask > 0; mask--){
ll cost = 0;
vector<int>core(1, -1);
for(int i = 0; i < n; i++){
if(1 << i & mask){
cost += a[i + 1].v;
for(int j = a[i + 1].c; j > 0; j--){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |