oj.uz

Submission #1057053

# Submission time Handle Problem Language Result Execution time Memory
1057053 2024-08-13T13:40:05 Z pan Baloni (COCI15_baloni) C++17
100 / 100
 47 ms 18512 KB 
#include <bits/stdc++.h>
//#include "bits_stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;

int main()
{
	ll n, ans = 0;
	input(n);
	ll arr[n];
	ll cnt[1000005];
	for (ll i=0; i<n; ++i) input(arr[i]);
	for (ll i=n-1; i>=0; --i)
	{
		if (cnt[arr[i]-1]) cnt[arr[i]-1]--; 
		else ans++;
		cnt[arr[i]]++;
	}
	print(ans, '\n');
	return 0;
}

Compilation message

baloni.cpp: In function 'int main()':
baloni.cpp:12:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
baloni.cpp:39:2: note: in expansion of macro 'input'
   39 |  input(n);
      |  ^~~~~
baloni.cpp:12:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input(x) scanf("%lld", &x);
      |                  ~~~~~^~~~~~~~~~~~
baloni.cpp:42:25: note: in expansion of macro 'input'
   42 |  for (ll i=0; i<n; ++i) input(arr[i]);
      |                         ^~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8024 KB Output is correct
2 Correct 3 ms 8028 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 3 ms 8284 KB Output is correct
5 Correct 47 ms 17884 KB Output is correct
6 Correct 46 ms 18512 KB Output is correct
7 Correct 37 ms 16724 KB Output is correct
8 Correct 37 ms 16700 KB Output is correct
9 Correct 42 ms 17236 KB Output is correct
10 Correct 40 ms 17392 KB Output is correct