# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
983671 | parsadox2 | Building 4 (JOI20_building4) | C++17 | 202 ms | 45388 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>
#define F first
#define S second
using namespace std;
const int N = 1e6 + 10;
int n , A[2][N];
pair <int , int> dp[N][2];
pair <int , int> ejtema(pair<int , int> a , pair <int , int> b , int v)
{
b.F += v; b.S += v;
pair <int , int> res;
res.F = min(a.F , b.F);
res.S = max(a.S , b.S);
return res;
}
string Solve(int id , int val , int ty)
{
string res = "";
while(true)
{
if(ty == 1)
res.push_back('B');
else
res.push_back('A');
val -= ty;
if(id == 1)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |