# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1031898 | ten_xd | Building 4 (JOI20_building4) | C++17 | 229 ms | 43612 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;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
struct Prz
{
int l,p;
};
const int MAXN = 1e6+5, INF = 2e9+50;
const ull INF_L = (ull)1e19+500;
int n;
int A[2][MAXN];
Prz dp[2][MAXN];
void solve()
{
cin >> n;
rep(j,2) rep(i,n*2) cin >> A[j][i];
dp[0][0] = {1,1}, dp[1][0] = {0,0};
for(int i = 1; i < n*2; ++i)
{
dp[0][i] = {INF,-INF};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |