# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147431 | ray1457 | Discharging (NOI20_discharging) | C++20 | 65 ms | 23880 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vi vector<int>
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x,end()
#define int ll
void solve() {
int n;
cin >> n;
vi a(n+1);
for (int i = 1; i<=n; i++) cin >> a[i];
vi x(n), y(n);
for (int i = 1; i<n; i++) {
x[i] = a[i] * n;
y[i] = a[n] * i;
}
int ans = 0;
int mx = a[n];
for (int i = n-1; i>=1; i--) {
if (y[i] > x[i]) {
# | 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... |