oj.uz

답안 #344396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
344396 2021-01-05T16:25:13 Z YJU Baloni (COCI15_baloni) C++14
100 / 100
 80 ms 11356 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e6+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,x,ans,cnt[N];
vector<ll> v;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP(i,n)cin>>x,v.pb(x);
	reverse(v.begin(),v.end());
	REP(i,n){
		if(cnt[v[i]])--cnt[v[i]],++cnt[v[i]+1];
		else ++cnt[v[i]+1],++ans;
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 78 ms 11356 KB Output is correct
6 Correct 80 ms 10976 KB Output is correct
7 Correct 68 ms 10976 KB Output is correct
8 Correct 64 ms 10972 KB Output is correct
9 Correct 76 ms 11100 KB Output is correct
10 Correct 72 ms 10972 KB Output is correct