oj.uz

Submission #965487

# Submission time Handle Problem Language Result Execution time Memory
965487 2024-04-18T18:08:25 Z red24 Pilot (NOI19_pilot) C++14
0 / 100
 41 ms 38236 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define vvi vector<vi>
#define mp make_pair
#define pb push_back
#define all(x) x.begin()+1, x.end()
const int INF = (int)1e17;

vi parent, siz;
int res = 0;

void make(int x)
{
	parent[x] = x;
	siz[x] = 1;
}

int f(int x)
{
	return ((x)*(x+1))/2ll;
}

int find(int x)
{
	if (parent[x] == x) return x;
	return parent[x] = find(parent[x]);
}

void unite(int x, int y)
{
	x = find(x); y = find(y);
	if (x == y) return;
	if (siz[x] < siz[y]) swap(x, y);

	res -= f(siz[x]);
	res -= f(siz[y]);

	siz[x] += siz[y];
	parent[y] = x;
	res += f(siz[x]);
}

void solve()
{
	int n, q; cin >> n >> q;
	vi a(n+1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	siz = vi(n+1);
	parent = vi(n+1);

	const int mx = (int)1e6 + 4529;
	vvi idx(mx+100);
	for (int i = 1; i <= n; i++) idx[a[i]].pb(i);

	for (int i = 1; i <= n; i++) make(i);
	vi ans(mx);
	vi vis(n+1);

	for (int el = 1; el <= mx-100; el++)
	{
		for (int i : idx[el])
		{
			res++;

			if (i < n && vis[i+1]) unite(i, i+1);
			if (i > 1 && vis[i-1]) unite(i, i-1);
		}
		ans[el] = res;
	}
	while (q--)
	{
		int x; cin >> x;
		cout << ans[x] << '\n';
	}
}
 
int32_t main()
{
	auto begin = std::chrono::high_resolution_clock::now();
	// FASTIO
	ios_base::sync_with_stdio(0);
	cin.tie(NULL); cout.tie(NULL);
 
 
 
	int T = 1;
	//cin >> T;
	for (int i = 1; i <= T; i++)
	{
		//cout << "Case #" << i << ": ";
		solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 14.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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