# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88678 | khohko | Hyper-minimum (IZhO11_hyper) | C++17 | 1643 ms | 263104 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>
#pragma GCC optimize("O3")
using namespace std;
#define ll int
#define pb push_back
#define fr first
#define sc second
#define ARRS int(1e5+11)
#define MAX ((int)(1e9+1))
#define HS1 ((long long)(1000001329))
#define HS2 ((long long)(1000001531))
#define MOD ((long long)1000000007)
#define MD ((long long)1000000007)
ll i,j,l,k,n,m,p,d,mx,x,o,y,ans,res,sum;
ll a[35][35][35][35];
ll mn[36][35][35][35][35];
ll N,pp;
ll go(ll n,ll i,ll j,ll k,ll p){
if(n==1)
return mn[n][i][j][k][p]=a[i][j][k][p];
if(i+n>N)return MAX;
if(j+n>N)return MAX;
if(k+n>N)return MAX;
if(p+n>N)return MAX;
if(mn[n][i][j][k][p]!=MAX)return mn[n][i][j][k][p];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |