oj.uz

답안 #331364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331364 2020-11-28T06:19:24 Z aloo123 Pilot (NOI19_pilot) C++14
100 / 100
 927 ms 99692 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<ll,ll>;
using vl = vector<ll>; 
#define mp make_pair
#define f first
#define s second
 
// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define ins insert 
#define pf push_front 
#define pb push_back
 
// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const ll INF = 1e18; // not too close to LLONG_MAX

 
#define int ll
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
const int N = 1e6+5;
int h[N],ans[N];
pl y[N];
vl what[N];
int cur = 0;
bool is_part[N];
int nc2(int n){
	int x=n;
	x *= (n+1);
	x>>=1ll;
	return x;
}
struct dsu{
	int sz[N];
	int par[N];
	void init_node(int u){
		sz[u] = 1;
		par[u] = u;
		cur++;
		is_part[u]=true;
	}
	int find_par(int u){
		if(u==par[u])return u;
		return par[u]=find_par(par[u]);
	}
	void unite(int u,int v){
		u = find_par(u),v= find_par(v);
		if(u == v)return;
		if(sz[u]>sz[v])swap(u,v);
		cur -= nc2(sz[u]);
		cur -= nc2(sz[v]);
		sz[v]+=sz[u];
		cur += nc2(sz[v]);		
		par[u] =v;
		sz[u]=0;

	}
};
dsu g;
void solve(){
	int n,q;
	cin>>n>>q;
	FOR(i,1,n+1){
		cin>>h[i];
		what[h[i]].pb(i);
	}
	FOR(i,1,q+1){
		cin>>y[i].f;
		y[i].s = i;
	}
	sort(y+1,y+q+1);
	FOR(i,1,q+1){
		int x = y[i].f;
		FOR(j,y[i-1].f+1,x+1){
			if(what[j].empty()) continue;
			trav(id,what[j]){
				g.init_node(id);
				if(id != n && is_part[id+1]) g.unite(id,id+1);
				if(id != 1 && is_part[id-1]) g.unite(id-1,id);
			}
		}		
		ans[y[i].s] = cur;
	}
	FOR(i,1,q+1){
		cout<<ans[i]<<"\n";
	}

}
signed main() {
	cin.tie(0)->sync_with_stdio(0);

	// you should actually read the stuff at the bottom
	int t=1;
	// re(t);
	while(t--){
		solve();
	}
}
 
/* stuff you should look for
	* read the probem 3 more times in case of WA :)
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 20 ms 23916 KB Output is correct
12 Correct 20 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 20 ms 23916 KB Output is correct
12 Correct 20 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 20 ms 23916 KB Output is correct
19 Correct 20 ms 23916 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 20 ms 23916 KB Output is correct
12 Correct 20 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 20 ms 23916 KB Output is correct
19 Correct 20 ms 23916 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23936 KB Output is correct
22 Correct 20 ms 23916 KB Output is correct
23 Correct 19 ms 23916 KB Output is correct
24 Correct 22 ms 23916 KB Output is correct
25 Correct 19 ms 23916 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 28268 KB Output is correct
2 Correct 77 ms 29292 KB Output is correct
3 Correct 48 ms 28140 KB Output is correct
4 Correct 60 ms 28908 KB Output is correct
5 Correct 49 ms 28140 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 32236 KB Output is correct
2 Correct 67 ms 32364 KB Output is correct
3 Correct 68 ms 32236 KB Output is correct
4 Correct 64 ms 32492 KB Output is correct
5 Correct 62 ms 32108 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 32236 KB Output is correct
2 Correct 69 ms 32236 KB Output is correct
3 Correct 68 ms 32236 KB Output is correct
4 Correct 66 ms 32492 KB Output is correct
5 Correct 68 ms 32492 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 50 ms 28268 KB Output is correct
12 Correct 77 ms 29292 KB Output is correct
13 Correct 48 ms 28140 KB Output is correct
14 Correct 60 ms 28908 KB Output is correct
15 Correct 49 ms 28140 KB Output is correct
16 Correct 40 ms 28140 KB Output is correct
17 Correct 63 ms 29164 KB Output is correct
18 Correct 54 ms 29292 KB Output is correct
19 Correct 43 ms 28012 KB Output is correct
20 Correct 57 ms 29164 KB Output is correct
21 Correct 47 ms 28012 KB Output is correct
22 Correct 54 ms 28908 KB Output is correct
23 Correct 39 ms 28396 KB Output is correct
24 Correct 51 ms 28780 KB Output is correct
25 Correct 48 ms 28212 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 20 ms 23916 KB Output is correct
12 Correct 20 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 20 ms 23916 KB Output is correct
19 Correct 20 ms 23916 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23936 KB Output is correct
22 Correct 20 ms 23916 KB Output is correct
23 Correct 19 ms 23916 KB Output is correct
24 Correct 22 ms 23916 KB Output is correct
25 Correct 19 ms 23916 KB Output is correct
26 Correct 50 ms 28268 KB Output is correct
27 Correct 77 ms 29292 KB Output is correct
28 Correct 48 ms 28140 KB Output is correct
29 Correct 60 ms 28908 KB Output is correct
30 Correct 49 ms 28140 KB Output is correct
31 Correct 72 ms 32236 KB Output is correct
32 Correct 67 ms 32364 KB Output is correct
33 Correct 68 ms 32236 KB Output is correct
34 Correct 64 ms 32492 KB Output is correct
35 Correct 62 ms 32108 KB Output is correct
36 Correct 66 ms 32236 KB Output is correct
37 Correct 69 ms 32236 KB Output is correct
38 Correct 68 ms 32236 KB Output is correct
39 Correct 66 ms 32492 KB Output is correct
40 Correct 68 ms 32492 KB Output is correct
41 Correct 40 ms 28140 KB Output is correct
42 Correct 63 ms 29164 KB Output is correct
43 Correct 54 ms 29292 KB Output is correct
44 Correct 43 ms 28012 KB Output is correct
45 Correct 57 ms 29164 KB Output is correct
46 Correct 47 ms 28012 KB Output is correct
47 Correct 54 ms 28908 KB Output is correct
48 Correct 39 ms 28396 KB Output is correct
49 Correct 51 ms 28780 KB Output is correct
50 Correct 48 ms 28212 KB Output is correct
51 Correct 95 ms 31372 KB Output is correct
52 Correct 95 ms 31980 KB Output is correct
53 Correct 80 ms 31468 KB Output is correct
54 Correct 105 ms 31980 KB Output is correct
55 Correct 90 ms 31340 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23916 KB Output is correct
4 Correct 15 ms 23916 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 18 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 20 ms 23916 KB Output is correct
12 Correct 20 ms 23916 KB Output is correct
13 Correct 18 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23916 KB Output is correct
18 Correct 20 ms 23916 KB Output is correct
19 Correct 20 ms 23916 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23936 KB Output is correct
22 Correct 20 ms 23916 KB Output is correct
23 Correct 19 ms 23916 KB Output is correct
24 Correct 22 ms 23916 KB Output is correct
25 Correct 19 ms 23916 KB Output is correct
26 Correct 50 ms 28268 KB Output is correct
27 Correct 77 ms 29292 KB Output is correct
28 Correct 48 ms 28140 KB Output is correct
29 Correct 60 ms 28908 KB Output is correct
30 Correct 49 ms 28140 KB Output is correct
31 Correct 72 ms 32236 KB Output is correct
32 Correct 67 ms 32364 KB Output is correct
33 Correct 68 ms 32236 KB Output is correct
34 Correct 64 ms 32492 KB Output is correct
35 Correct 62 ms 32108 KB Output is correct
36 Correct 66 ms 32236 KB Output is correct
37 Correct 69 ms 32236 KB Output is correct
38 Correct 68 ms 32236 KB Output is correct
39 Correct 66 ms 32492 KB Output is correct
40 Correct 68 ms 32492 KB Output is correct
41 Correct 40 ms 28140 KB Output is correct
42 Correct 63 ms 29164 KB Output is correct
43 Correct 54 ms 29292 KB Output is correct
44 Correct 43 ms 28012 KB Output is correct
45 Correct 57 ms 29164 KB Output is correct
46 Correct 47 ms 28012 KB Output is correct
47 Correct 54 ms 28908 KB Output is correct
48 Correct 39 ms 28396 KB Output is correct
49 Correct 51 ms 28780 KB Output is correct
50 Correct 48 ms 28212 KB Output is correct
51 Correct 95 ms 31372 KB Output is correct
52 Correct 95 ms 31980 KB Output is correct
53 Correct 80 ms 31468 KB Output is correct
54 Correct 105 ms 31980 KB Output is correct
55 Correct 90 ms 31340 KB Output is correct
56 Correct 920 ms 97628 KB Output is correct
57 Correct 906 ms 98088 KB Output is correct
58 Correct 844 ms 93420 KB Output is correct
59 Correct 914 ms 95724 KB Output is correct
60 Correct 927 ms 99692 KB Output is correct