oj.uz

Submission #661140

# Submission time Handle Problem Language Result Execution time Memory
661140 2022-11-24T16:20:47 Z Kaztaev_Alisher Money (IZhO17_money) C++17
0 / 100
 5 ms 340 KB 
//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long  , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x  << " = " << x << endl;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;

const ll N = 1e6+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;

using namespace std;

ll a[N] , l[N] , r[N];

void solve(){
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		l[i] = i-1;
		r[i] = i+1;
	}
	ll ans = 0;
	for(int i = n; i >= 1; i--){
		int j = i , b = a[i];
		while(a[j-1] == l[b]) j-- , b = l[b];
		r[l[a[j]]] = r[a[i]];
		l[r[a[i]]] = l[a[j]];
		i = j;
		ans++;
	}
	cout << ans << "\n";
}
signed main(){
	ios;
	solve();
	return 0;
}
/*
*/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Incorrect 3 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Incorrect 3 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Incorrect 3 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Incorrect 3 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -