Submission #230957

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
230957	2020-05-12T07:17:30 Z	kym	Baloni (COCI15_baloni)	C++14	100 / 100	75 ms	4600 KB

baloni

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = 1e6+5;
#ifndef LOCAL
#define cerr if(0)cout
#endif
int A[MAXN];
int cnt[MAXN];
int32_t main() 
{
	IAMSPEED
	int n; cin >> n;
	FOR(i,1,n)cin>>A[i];
	int ans =0;
	FOR(i,1,n) {
		if(cnt[A[i]]==0) {
			cnt[A[i]-1]++;
			++ans;
		} else {
			cnt[A[i]]--;
			cnt[A[i]-1]++;
		}
	}
	cout<<ans;
}

/* DEBUG
** Array bounds
** Overflow
** Edge cases
** do something instead of nothing
** write stuff down
*/

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	75 ms	3556 KB	Output is correct
6	Correct	73 ms	4600 KB	Output is correct
7	Correct	58 ms	3192 KB	Output is correct
8	Correct	56 ms	3196 KB	Output is correct
9	Correct	68 ms	3320 KB	Output is correct
10	Correct	66 ms	3448 KB	Output is correct