| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1294456 | chaitanyamehta | Airplane (NOI23_airplane) | C++20 | 29 ms | 1972 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<vector<pair<int ,int>>> g;
signed main(){
int n ,m;
cin>>n>>m;
vector<int> a(n + 1);
for(int i =1;i<=n;i++)cin>>a[i];
int ans = 0;
int idx = max_element(a.begin() , a.end()) - a.begin();
int alt = a[idx];
ans =2 * max(idx , a[idx]);
cout << ans << "\n";
}| # | 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... | ||||
