oj.uz

Submission #764143

# Submission time Handle Problem Language Result Execution time Memory
764143 2023-06-23T07:43:38 Z vjudge1 Exam (eJOI20_exam) C++17
0 / 100
 13 ms 13864 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define len(x) (int)x.size()
#define ull unsigned long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define int long long

using namespace std;
using namespace __gnu_pbds;
using ll = long long;

const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int n,a[N],b[N],sp[30][N],ans,lg[N];
vector <pair<int,int>> q;
vector <int> g[N];
set <int> st;
map <int,int> mp;

main(){
	// freopen("txt.in", "r", stdin);
	// freopen("txt.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i=1;i<=n;i++){
		cin >> a[i];
		st.insert(a[i]);
	}
	for (int i=1;i<=n;i++){
		cin >> b[i];
		st.insert(b[i]);
	}
	int cnt = 0;
	for (auto it : st){
		mp[it] = ++cnt;
	}
	for (int i=1;i<=n;i++){
		a[i] = mp[a[i]];
		g[a[i]].pb(i);
	}
	for (int i=1;i<=n;i++){
		b[i] = mp[b[i]];
	}
	lg[2] = 1;
	for (int i=2;i<=n;i++){
		if (!lg[i]){
			lg[i] = lg[i-1];
		}
		lg[i*2] = lg[i] + 1;
	}
	for (int i=1;i<=n;i++){
		sp[0][i] = a[i];
	}
	for (int j=1;j<=20;j++){
		for (int i=1;i<=n;i++){
			sp[j][i] = max(sp[j-1][i], sp[j-1][i+(1<<(j-1))]);
		}
	}
	for (int i=1;i<=n;i++){
		if (b[i] < a[i]){
			q.pb({b[i], i});
		}
		if (b[i]==a[i]){
			ans++;
		}
	}
	sort(q.begin(), q.end());
	for (int i=0;i<len(q);i++){
		int l = 0;
		int r = len(g[q[i].F]) - 1;
		while(l<=r){
			int md = (l + r) / 2;
			if (g[q[i].F][md] < q[i].S){
				l = md + 1;
			}
			else{
				r = md - 1;
			}
		}
		if (l>=0 && l<len(g[q[i].F])){
			int ln = (i - g[q[i].F][l] + 1);
			int x = lg[ln];
			if (q[i].F == max(sp[x][g[q[i].F][l]], sp[x][i - (1<<x) + 1])){
				ans++;
				continue;
			}
		}
		if (r>=0 && r<len(g[q[i].F])){
			int ln = (g[q[i].F][r] - i + 1);
			int x = lg[ln];
			if (q[i].F == max(sp[x][i], sp[x][g[q[i].F][r]-(1<<x)+1])){
				ans++;
			}
		}
	}
	cout << ans;
}

//order_of_key(k): Number of items strictly smaller than k .
//find_by_order(k): K-th element in a set (counting from zero).

//sum of squares n*(n+1)*(2n+1)/6
//sum of cubes [n*(n+1)/2]^2
//sum of squares for odds n*(4*n*n-1)/3
//sum of cubes for odds n*n*(2*n*n-1)

//a/b%mod = a*(b^(m-2)%mod)
//(a>>x)&1 == 0
//a^b = (a+b)-2(a&b)

//srand(time(0))-always changing

Compilation message

exam.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main(){
      | ^~~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Runtime error 8 ms 10620 KB Execution killed with signal 7
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 13864 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

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

Subtask #6
0 / 22.0

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