# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14381 | tncks0121 | Bali Sculptures (APIO15_sculpture) | C++14 | 109 ms | 1756 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>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <time.h>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef double lf;
const int N_ = 2050;
int N, A, B;
ll S[N_];
ll ans;
bool tb1[105][105];
void solve1() {
ans = 0;
ll cur = 0;
for(int b = 41; b >= 0; b--) {
ll t = cur | (1ll << b);
tb1[0][0] = true;
for(int i = 1; i <= N; i++) for(int x = 1; x <= i; x++) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |