# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168039 | tkm_algorithms | Bali Sculptures (APIO15_sculpture) | C++20 | 2 ms | 2700 KiB |
/**
* In the name of Allah
* We are nothing and you're everything
* author: najmuddin
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
#define int ll
const char nl = '\n';
const int N = 1e5+5;
const int inf = 1e18+10;
bool dp[102][202][102]; // i, jog, k
void solve() {
int n, a, b;
cin >> n >> a >> b;
int mx = 0;
vector<int> arr(n+1);
for (int i = 1; i <= n; ++i){cin >> arr[i]; mx = max(mx, n*arr[i]);}
vector<int> p(n+1);
for (int i = 1; i <= n; ++i)p[i] = arr[i], p[i] += p[i-1];
# | 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... |