oj.uz

Submission #572395

# Submission time Handle Problem Language Result Execution time Memory
572395 2022-06-04T10:33:33 Z MODDI Pilot (NOI19_pilot) C++14
40 / 100
 181 ms 36676 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
const int maxn = 1e6 + 5;
int n, q;
int parent[maxn];
int sz[maxn];
bool on[maxn];
int find(int v){
	if(v == parent[v])
		return v;
	return parent[v] = find(parent[v]);
}
ll rez = 0;
void mrg(int a, int b){
	a = find(a);
	b = find(b);
	if(a != b){
		rez -= (sz[a] * (sz[a] + 1) * 1LL) / 2;
		rez -= (sz[b] * (sz[b] + 1)*1LL) / 2;
		sz[a] += sz[b];
		rez += (sz[a] * (sz[a] + 1)*1LL) / 2;
		parent[b] = a;
	}
}
vi G[maxn];
ll ans[maxn];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	for(int i = 0; i < n; i++){
		parent[i] = i;
		sz[i] = 1;
	}
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		G[a].pb(i);
	}
	for(int i = 1; i <= 1000000; i++){
		for(int x : G[i]){
			++rez;
			on[x] = 1;
			if(x && on[x-1]) mrg(x, x-1);
			if(x != n-1 && on[x+1]) mrg(x, x + 1);
		}
		ans[i] = rez;
	}
	for(int i = 0; i < q; i++){
		int a;
		cin>>a;
		cout<<ans[a]<<endl;
	}
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Correct 17 ms 31600 KB Output is correct
12 Correct 17 ms 31572 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31572 KB Output is correct
15 Correct 17 ms 31624 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Correct 17 ms 31600 KB Output is correct
12 Correct 17 ms 31572 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31572 KB Output is correct
15 Correct 17 ms 31624 KB Output is correct
16 Correct 19 ms 31652 KB Output is correct
17 Correct 18 ms 31640 KB Output is correct
18 Correct 19 ms 31572 KB Output is correct
19 Correct 17 ms 31572 KB Output is correct
20 Correct 17 ms 31572 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Correct 17 ms 31600 KB Output is correct
12 Correct 17 ms 31572 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31572 KB Output is correct
15 Correct 17 ms 31624 KB Output is correct
16 Correct 19 ms 31652 KB Output is correct
17 Correct 18 ms 31640 KB Output is correct
18 Correct 19 ms 31572 KB Output is correct
19 Correct 17 ms 31572 KB Output is correct
20 Correct 17 ms 31572 KB Output is correct
21 Correct 19 ms 31700 KB Output is correct
22 Correct 22 ms 31700 KB Output is correct
23 Correct 19 ms 31692 KB Output is correct
24 Correct 19 ms 31640 KB Output is correct
25 Correct 18 ms 31692 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 14.0

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

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Incorrect 42 ms 34488 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Correct 17 ms 31600 KB Output is correct
12 Correct 17 ms 31572 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31572 KB Output is correct
15 Correct 17 ms 31624 KB Output is correct
16 Correct 19 ms 31652 KB Output is correct
17 Correct 18 ms 31640 KB Output is correct
18 Correct 19 ms 31572 KB Output is correct
19 Correct 17 ms 31572 KB Output is correct
20 Correct 17 ms 31572 KB Output is correct
21 Correct 19 ms 31700 KB Output is correct
22 Correct 22 ms 31700 KB Output is correct
23 Correct 19 ms 31692 KB Output is correct
24 Correct 19 ms 31640 KB Output is correct
25 Correct 18 ms 31692 KB Output is correct
26 Incorrect 42 ms 34488 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31572 KB Output is correct
2 Correct 18 ms 31572 KB Output is correct
3 Correct 21 ms 31560 KB Output is correct
4 Correct 17 ms 31600 KB Output is correct
5 Correct 17 ms 31632 KB Output is correct
6 Correct 17 ms 31628 KB Output is correct
7 Correct 19 ms 31572 KB Output is correct
8 Correct 17 ms 31572 KB Output is correct
9 Correct 17 ms 31544 KB Output is correct
10 Correct 22 ms 31532 KB Output is correct
11 Correct 17 ms 31600 KB Output is correct
12 Correct 17 ms 31572 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31572 KB Output is correct
15 Correct 17 ms 31624 KB Output is correct
16 Correct 19 ms 31652 KB Output is correct
17 Correct 18 ms 31640 KB Output is correct
18 Correct 19 ms 31572 KB Output is correct
19 Correct 17 ms 31572 KB Output is correct
20 Correct 17 ms 31572 KB Output is correct
21 Correct 19 ms 31700 KB Output is correct
22 Correct 22 ms 31700 KB Output is correct
23 Correct 19 ms 31692 KB Output is correct
24 Correct 19 ms 31640 KB Output is correct
25 Correct 18 ms 31692 KB Output is correct
26 Incorrect 42 ms 34488 KB Output isn't correct
27 Halted 0 ms 0 KB -