# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291677 | crossing0ver | Discharging (NOI20_discharging) | C++17 | 1089 ms | 13600 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 int long long
#define ll long long
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e6+6;
//ll ans;
int n,arr[N],M;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void RAND() {
int ANS = 100000000000;
int M;
for (int mask = 1; mask < (1<<n); mask++) {
if ((mask & (1 << (n-1))) == 0) continue;
int k = 0,last = 0,A = 0;
for (int j = 0; j < n; j++) {
if ( ((1<<j) & mask) == 0) continue;
int mx = 0;
for (int z = last; z <= j;z++)
mx = max(mx,arr[z+1]);
k += mx;
A += (j - last + 1)*k;
last = j + 1;
}
if (A < ANS) {
M = mask;
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |