| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359929 | nathlol2 | Subset Mex (EGOI22_subsetmex) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 55;
int n, f[N];
void solve(){
cin >> n;
for(int i = 0;i<n;i++) cin >> f[i];
int ans = 0;
for(int i = n - 1;i>=0;i--){
if(f[i] <= 0){
int c = 1 - f[i];
ans += c;
for(int j = i - 1;j>=0;j--) f[j] -= c;
}
}
cout << ans + 1 << '\n';
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc; cin >> tc;
while(tc--) solve();
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
