# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
485793 | asandikci | Baloni (COCI15_baloni) | C++17 | 70 ms | 18228 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.
/*
Aliberk Sandıkçı
9 November 2021
Current Rank: Newbie: 1033 (max.1188)
Current Grade: 10th in Izmir Science High School
Current Competitive Programming Achievements:
* Turkey National Computer Olympics 2021 - 1st Stage: 27th place
* Turkey Izmir Science Olympics (Computer Branch) 2021 - 1st Stage: 4th place
More About Me: ***there will be LinkedIN link soon***
*/
#include "bits/stdc++.h"
#define pb push_back
#define lwb lower_bound
#define upb upper_bound
#define fi first
#define se second
#define debu cout << "*debug*\n"
#define debug(x) cout << "debug " << x <<"\n"
#define int unsigned long long
constexpr int modn = 1e9+7; // 998244353
constexpr int maxn = 1e6+5;
constexpr int INF = 1e9+5;
using namespace std;
void solve(){
int n;
cin >> n;
int arr[n+5];
for(int i=0;i<n;i++){
cin >> arr[i];
}
vector<int> vec;
for(int i=0;i<n;i++){
vector<int>::iterator ix=vec.begin();
for(auto it : vec){
if(arr[i]==it-1){
vec.erase(ix);
}
ix++;
}
vec.pb(arr[i]);
}
cout << vec.size();
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("","r",stdin);
//freopen("","w",stdout);
int T=1;
//cin >> T;
while(T--){
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |