# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112355 | vjudge1 | Baloni (COCI15_baloni) | C++17 | 2101 ms | 14160 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
using namespace std;
int32_t main()
{
int n,tut,cev=0;
cin >> n;
int arr[n+5],visited[n+5];
for(int i=0;i<n;i++){
cin >> arr[i];
visited[i]=0;
}
for(int i=0;i<n;i++)
{
if(visited[i]==1)
continue;
cev++;
tut=arr[i];
tut--;
for(int j=i+1;j<n;j++)
{
if(arr[j]==tut){
visited[j]=1;
tut--;
}
}
}
cout << cev;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |