Submission #532716

#	Time	Username	Problem	Language	Result	Execution time	Memory
532716		exopeng	Cloud Computing (CEOI18_clo)	C++14	0 / 100	139 ms	262148 KiB

clo

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;

#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define f first
#define ll long long
#define ld long double
#define s second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pll pair<ll,ll>
#define is insert
const long long INF = 1e9;
const long long MOD = 1e9+7;
const int MAXN = 4e5;
//store test cases here
/*


process in decreasing order of clock rate
so later orders can always use cores of earlier orders
dp[i][j][k]= maximum profit considering first i orders
first j computers, and having k cores leftover

*/
ll dp[2001][2001][50];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    for(int i=0;i<2000;i++){
        for(int j=0;j<2000;j++){
            for(int k=0;k<50;k++){
                dp[i][j][k]=INF;
            }
        }
    }
    cout<<0<<'\n';
    return 0;
}

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