# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018748 | MarwenElarbi | Netrpeljivost (COI23_netrpeljivost) | C++17 | 1550 ms | 122784 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;
#define pb push_back
#define se second
#define fi first
const int nax=2050;
int cost [nax][nax];
long long dp1[nax][nax];
long long dp[nax][nax];
void solve(int l,int r){
if(l+1==r){
dp[l][r]=dp[r][l]=cost[l][r];
return;
}
int mid=(r+l)/2;
solve(l,mid);
solve(mid+1,r);
for (int i = l; i <= mid; ++i)
{
for (int j1 = mid+1; j1 <= (mid+1+r)/2; ++j1)
{
for (int j2 = (mid+1+r)/2+1; j2 <= r; ++j2)
{
dp1[i][j1]=min(dp1[i][j1],dp[j1][j2]+cost[i][j2]);
dp1[i][j2]=min(dp1[i][j2],dp[j1][j2]+cost[i][j1]);
}
}
}
for (int i1 = l; i1 <= (l+mid)/2; ++i1)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |