# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475162 | Mr_Ph | Po (COCI21_po) | C++14 | 1092 ms | 1876 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.
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int dx[4] = {0, 0, 1, -1};
//int dy[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
int n;
cin>>n;
vll arr(n);
ent(arr);
vll arr1(n);
if(n<=1000)
{
ll cnt=0;
while(arr!=arr1)
{
ll mn=INT_MAX;
ll start=-2,End=-1;
for(int i=0; i<n; i++)
{
if(arr[i]==0)
if(start!=-2&&End!=-1)
break;
if(arr[i]!=0)
{
mn=min(mn,arr[i]);
if(start==-2)
start=i;
End=i;
}
}
if(start!=-2&&End!=-1)
{
cnt++;
for(int i=start; i<=End; i++)
arr[i]-=mn;
}
}
cout<<cnt<<endl;
}
else
{
if(n*(n-1)/2<1000000)
{
set<ll>st;
for(int i=0; i<n; i++)
st.insert(arr[i]);
cout<<st.sz<<endl;
}
else
{
ll cnt=0;
for(int i=0; i<n; i++)
{
//cout<<arr[i]<<" ";
if(arr[i]==0)
continue;
ll e=arr[i];
for(int j=i; j<n; j++)
{
if(arr[j]<e)
break;
arr[j]-=e;
}
cnt++;
}
cout<<cnt<<endl;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen("window.in","r",stdin);
//freopen("output.txt","w",stdout);
int t=1;//int st;
//cin>>t;//cin>>st;
while(t--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |