# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17308 | gs14004 | Skyline (IZhO11_skyline) | C++14 | 208 ms | 53560 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int a[305], n;
int dp[305][205][205];
int f(int pos, int t1, int t2){
if(t1 < 0 || t2 < 0) return 1e9;
if(pos == n) return 0;
if(~dp[pos][t1][t2]) return dp[pos][t1][t2];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |