# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102732 | ivopav | Skyscraper (JOI16_skyscraper) | C++17 | 525 ms | 524288 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>
using namespace std;
using i64=long long int;
int main(){
int n;
int t;
cin >> n >> t;
if (n==1){
cout << "1\n";
exit(0);
}
vector<vector<vector<vector<int>>>> dp(n+1,vector<vector<vector<int>>>(n+1,vector<vector<int>>(t+1,vector<int>(3,0))));
dp[0][0][0][0]=1;
vector<int> lis={};
for (int i=0;i<n;i++){
int unos;
cin >> unos;
lis.push_back(unos);
}
sort(lis.begin(),lis.end());
lis.push_back(1e9);
for (int i=1;i<=n;i++){
for (int comp=1;comp<=i;comp++){
for (int rez=0;rez<=t;rez++){
for (int pockra=0;pockra<=2;pockra++){
int prom=(2*comp-pockra)*(lis[i]-lis[i-1]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |