oj.uz

Submission #833708

# Submission time Handle Problem Language Result Execution time Memory
833708 2023-08-22T08:06:17 Z vjudge1 Exam (eJOI20_exam) C++17
0 / 100
 1000 ms 3020 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

// os.erase(os.find_by_order(os.order_of_key(val)));
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define MAX LLONG_MAX
#define MOD 1000000007
#define int long long
#define ll __int128
#define endl '\n'
#define fi first
#define se second
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define pv(x) for (auto i : x) cout << i << ' '; cout << endl;
#define vini(x, y) for (int i = 0; i < y; i++) cin >> x[i];
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a * (b / gcd(a,b)))
#define countonbit(a) __builtin_popcountll(a)

using namespace std;

void solve()
{
	int a; cin >> a;
	int counter = 0;
	vector <int> arr(a), key(a);
	vini(arr, a); vini(key, a);
	vector <pii> arr2(a);
//	for (int i = 0; i < a; i++) arr2[i] = {arr2[i], i};	
	sort(all(arr2));
	int k = key[0];
	for (int i = 0; i < a; i++)
	{
		if (arr[i] == k)
		{
			for (int j = i - 1; j >= 0; j--)
			{
				if (arr[j] > arr[i]) break;
				arr[j] = arr[i];
			}
			
			for (int j = i + 1; j < a; j++)
			{
				if (arr[j] > arr[i]) break;
				arr[j] = arr[i];
			}
		}
	}
	
	for (auto i : arr) counter += i == k;
	
	cout << counter << endl;
}

int32_t main()
{
 	ios::sync_with_stdio(false); cin.tie(NULL);

	int a = 1;
	//cin >> a;
	while(a--) solve();
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 248 ms 852 KB Output is correct
3 Execution timed out 1086 ms 3020 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -