# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766989 | Tenis0206 | Exercise Deadlines (CCO20_day1problem2) | C++11 | 1073 ms | 12572 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>
using namespace std;
const int nmax = 2e5;
int n;
int v[nmax + 5];
int poz[nmax + 5];
set<int,greater<int>> s;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
s.insert(i);
}
for(int i=n;i>=1;i--)
{
auto it = s.lower_bound(v[i]);
if(it==s.end())
{
cout<<-1<<'\n';
return 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |