# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959638 | AndreiBOTO | Building 4 (JOI20_building4) | C++14 | 260 ms | 34896 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 optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
const int INF=1e9;
const int NMAX=1e6+5;
long long dp[NMAX][2];
int v[NMAX][2];
int n;
void get_dp(int x)
{
int i,j,k;
for(i=1;i<=n;i++)
for(j=0;j<2;j++)
dp[i][j]=-INF;
for(i=n;i>0;i--)
{
for(j=0;j<2;j++)
{
for(k=0;k<2;k++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |