Submission #315138

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
3151382020-10-22 03:17:39yjojdkgk5bpCostinland (info1cup19_costinland)C++14
11.98 / 100
1052 ms23852 KiB
#include <bits/stdc++.h>
#define ll long long
#define sec second
#define ft first
#define pb push_back
using namespace std;
ll k,dp[50][50],sum1[50][50],sum2[50][50],mx,a,b;
vector<pair<int,int>> p;
int ans[50][50];
int main()
{
cin >> k;
dp[0][1]=1;
for(int i=1; i<33; i++)
for(int j=1; j<33; j++)
{
dp[i][j]=dp[i-1][j]+dp[i][j-1];
sum1[i][j]=sum1[i-1][j]+dp[i][j];
sum2[i][j]=sum2[i][j-1]+dp[i][j];
ll v=sum1[i][j]+sum2[i][j];
if(sum1[i][j]+sum2[i][j]<=k && i>=j &&max(i,j)<=5 && (mx<v || (mx==v&&max(i,j)<max(a,b))))
mx=v,a=i,b=j;
}/*
for(int i=32; i&&k; i--)
for(int j=i; j&&k; j--)
{
if(sum1[i][j]+sum2[i][j]<=k)
{//
k-=sum1[i][j]+sum2[i][j];
p.pb({i,j});
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...