oj.uz

답안 #675034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675034 2022-12-26T20:07:03 Z QwertyPi I want to be the very best too! (NOI17_pokemonmaster) C++14
71 / 100
 5000 ms 17276 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
 
const int MAXN = 5e4 + 11, MAXQ = 1e5 + 11;
const int SQ = 600;
int l[MAXN], p[MAXN], tp[MAXN];
int ans[MAXQ];
 
struct DSU{
	int dsu[MAXN], ans[MAXN];
	unordered_map<int, int> info[MAXN];
	void init(int n){
		for(int i = 0; i < n; i++) dsu[i] = i;
		for(int i = 0; i < n; i++) info[i].clear(), info[i][p[i]]++, ans[i] = 1;
	}
	int f(int x){
		return dsu[x] == x ? x : dsu[x] = f(dsu[x]);
	}
	void g(int x, int y){
		x = f(x), y = f(y);
		if(x == y) return;
		if(info[x].size() < info[y].size()) swap(x, y);
		for(auto i : info[y]) ans[x] += info[x][i.fi] == 0 && i.se != 0, info[x][i.fi] += i.se;
		info[y].clear();
		dsu[y] = x;
	}
} dsu;
 
struct qry{
	int t, x, y, v, i; 
};
 
struct edge{
	int u, v, w;
	bool operator< (const edge& o) const {
		return w < o.w;
	}
};
int n, m, q;
pair<int, int> change[MAXQ];
vector<edge> E; int eid = 0;
void solve(vector<qry> Q){
	eid = 0;
	int _l = Q[0].i;
	dsu.init(n * m);
	for(int i = 0; i < n * m; i++) tp[i] = p[i];
	for(auto q : Q){
		if(q.t == 1){
			change[q.i] = {tp[q.x * m + q.y], q.v};
			tp[q.x * m + q.y] = q.v;
		}
	}
	vector<pair<int, int>> Q2;
	for(auto q : Q){
		if(q.t == 2){
			Q2.push_back({q.v, q.i});
		}
	}
	sort(Q2.begin(), Q2.end());
	for(int j = 0; j < Q2.size(); j++){
		while(eid < E.size() && E[eid].w <= Q2[j].fi) dsu.g(E[eid].u, E[eid].v), eid++;
		int i = Q2[j].se, ri = i - _l;
		int pos = dsu.f(Q[ri].x * m + Q[ri].y);
		for(int k = 0; k < ri; k++){
			if(Q[k].t == 1){
				if(dsu.f(Q[k].x * m + Q[k].y) != pos) continue;
				dsu.info[pos][change[_l + k].fi]--;
				if(dsu.info[pos][change[_l + k].fi] == 0) dsu.ans[pos]--;
				dsu.info[pos][change[_l + k].se]++;
				if(dsu.info[pos][change[_l + k].se] == 1) dsu.ans[pos]++;
			}
		}
		if(l[Q[ri].x * m + Q[ri].y] <= Q[ri].v){
			ans[i] = dsu.ans[pos];
		}
		for(int k = 0; k < ri; k++){
			if(Q[k].t == 1){
				if(dsu.f(Q[k].x * m + Q[k].y) != pos) continue;
				dsu.info[pos][change[_l + k].se]--;
				if(dsu.info[pos][change[_l + k].se] == 0) dsu.ans[pos]--;
				dsu.info[pos][change[_l + k].fi]++;
				if(dsu.info[pos][change[_l + k].fi] == 1) dsu.ans[pos]++;
			}
		}
	}
}
 
int32_t main(){
	cin.tie(0); cout.tie(0)->sync_with_stdio(false);
	cin >> n >> m >> q;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> l[i * m + j];
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m - 1; j++){
			int u = i * m + j, v = i * m + j + 1;
			E.push_back({u, v, max(l[u], l[v])});
		}
	}
	for(int i = 0; i < n - 1; i++){
		for(int j = 0; j < m; j++){
			int u = i * m + j, v = (i + 1) * m + j;
			E.push_back({u, v, max(l[u], l[v])});
		}
	}
	sort(E.begin(), E.end());
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> p[i * m + j];
		}
	}
	for(int i = 0; i < q; i += SQ){
		vector<qry> Q;
		for(int j = i; j < min(i + SQ, q); j++){
			int t, x, y, v;
			cin >> t >> y >> x >> v;
			x--; y--;
			Q.push_back({t, x, y, v, j});
		}
		solve(Q);
		for(auto q : Q){
			if(q.t == 1) p[q.x * m + q.y] = q.v;
		}
		for(int j = i; j < min(i + SQ, q); j++){
			if(Q[j - i].t == 2){
				cout << ans[j] << endl;
			}
		}
	}
}

Compilation message

pokemonmaster.cpp: In function 'void solve(std::vector<qry>)':
pokemonmaster.cpp:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for(int j = 0; j < Q2.size(); j++){
      |                 ~~^~~~~~~~~~~
pokemonmaster.cpp:65:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   while(eid < E.size() && E[eid].w <= Q2[j].fi) dsu.g(E[eid].u, E[eid].v), eid++;
      |         ~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 11724 KB Output is correct
2 Correct 34 ms 11660 KB Output is correct
3 Correct 36 ms 11888 KB Output is correct
4 Correct 29 ms 11696 KB Output is correct
5 Correct 32 ms 11748 KB Output is correct
6 Correct 36 ms 11816 KB Output is correct
7 Correct 34 ms 11756 KB Output is correct
8 Correct 40 ms 11676 KB Output is correct
9 Correct 34 ms 11724 KB Output is correct
10 Correct 40 ms 11792 KB Output is correct
11 Correct 33 ms 11752 KB Output is correct
12 Correct 42 ms 11980 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11692 KB Output is correct
2 Correct 25 ms 11596 KB Output is correct
3 Correct 30 ms 11812 KB Output is correct
4 Correct 28 ms 11888 KB Output is correct
5 Correct 32 ms 11976 KB Output is correct
6 Correct 30 ms 11840 KB Output is correct
7 Correct 40 ms 12216 KB Output is correct
8 Correct 47 ms 12392 KB Output is correct
9 Correct 37 ms 12164 KB Output is correct
10 Correct 52 ms 13036 KB Output is correct
11 Correct 43 ms 12564 KB Output is correct
12 Correct 57 ms 13360 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2335 ms 13000 KB Output is correct
2 Correct 2566 ms 13044 KB Output is correct
3 Correct 2363 ms 13112 KB Output is correct
4 Correct 2139 ms 13076 KB Output is correct
5 Correct 2515 ms 13244 KB Output is correct
6 Correct 2185 ms 13452 KB Output is correct
7 Correct 3541 ms 13520 KB Output is correct
8 Correct 3537 ms 13924 KB Output is correct
9 Correct 3551 ms 13724 KB Output is correct
10 Correct 3598 ms 13664 KB Output is correct
11 Correct 3583 ms 13784 KB Output is correct
12 Correct 3511 ms 13724 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 11724 KB Output is correct
2 Correct 34 ms 11660 KB Output is correct
3 Correct 36 ms 11888 KB Output is correct
4 Correct 29 ms 11696 KB Output is correct
5 Correct 32 ms 11748 KB Output is correct
6 Correct 36 ms 11816 KB Output is correct
7 Correct 34 ms 11756 KB Output is correct
8 Correct 40 ms 11676 KB Output is correct
9 Correct 34 ms 11724 KB Output is correct
10 Correct 40 ms 11792 KB Output is correct
11 Correct 33 ms 11752 KB Output is correct
12 Correct 42 ms 11980 KB Output is correct
13 Correct 1630 ms 13116 KB Output is correct
14 Correct 2104 ms 13064 KB Output is correct
15 Correct 2596 ms 13116 KB Output is correct
16 Correct 1708 ms 13056 KB Output is correct
17 Correct 2133 ms 13124 KB Output is correct
18 Correct 2486 ms 13460 KB Output is correct
19 Correct 1751 ms 13164 KB Output is correct
20 Correct 2040 ms 13216 KB Output is correct
21 Correct 1837 ms 13084 KB Output is correct
22 Correct 3100 ms 13272 KB Output is correct
23 Correct 2257 ms 13056 KB Output is correct
24 Correct 3127 ms 13612 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 11724 KB Output is correct
2 Correct 34 ms 11660 KB Output is correct
3 Correct 36 ms 11888 KB Output is correct
4 Correct 29 ms 11696 KB Output is correct
5 Correct 32 ms 11748 KB Output is correct
6 Correct 36 ms 11816 KB Output is correct
7 Correct 34 ms 11756 KB Output is correct
8 Correct 40 ms 11676 KB Output is correct
9 Correct 34 ms 11724 KB Output is correct
10 Correct 40 ms 11792 KB Output is correct
11 Correct 33 ms 11752 KB Output is correct
12 Correct 42 ms 11980 KB Output is correct
13 Correct 25 ms 11692 KB Output is correct
14 Correct 25 ms 11596 KB Output is correct
15 Correct 30 ms 11812 KB Output is correct
16 Correct 28 ms 11888 KB Output is correct
17 Correct 32 ms 11976 KB Output is correct
18 Correct 30 ms 11840 KB Output is correct
19 Correct 40 ms 12216 KB Output is correct
20 Correct 47 ms 12392 KB Output is correct
21 Correct 37 ms 12164 KB Output is correct
22 Correct 52 ms 13036 KB Output is correct
23 Correct 43 ms 12564 KB Output is correct
24 Correct 57 ms 13360 KB Output is correct
25 Correct 2335 ms 13000 KB Output is correct
26 Correct 2566 ms 13044 KB Output is correct
27 Correct 2363 ms 13112 KB Output is correct
28 Correct 2139 ms 13076 KB Output is correct
29 Correct 2515 ms 13244 KB Output is correct
30 Correct 2185 ms 13452 KB Output is correct
31 Correct 3541 ms 13520 KB Output is correct
32 Correct 3537 ms 13924 KB Output is correct
33 Correct 3551 ms 13724 KB Output is correct
34 Correct 3598 ms 13664 KB Output is correct
35 Correct 3583 ms 13784 KB Output is correct
36 Correct 3511 ms 13724 KB Output is correct
37 Correct 1630 ms 13116 KB Output is correct
38 Correct 2104 ms 13064 KB Output is correct
39 Correct 2596 ms 13116 KB Output is correct
40 Correct 1708 ms 13056 KB Output is correct
41 Correct 2133 ms 13124 KB Output is correct
42 Correct 2486 ms 13460 KB Output is correct
43 Correct 1751 ms 13164 KB Output is correct
44 Correct 2040 ms 13216 KB Output is correct
45 Correct 1837 ms 13084 KB Output is correct
46 Correct 3100 ms 13272 KB Output is correct
47 Correct 2257 ms 13056 KB Output is correct
48 Correct 3127 ms 13612 KB Output is correct
49 Correct 2295 ms 15752 KB Output is correct
50 Correct 2369 ms 15544 KB Output is correct
51 Correct 2589 ms 15424 KB Output is correct
52 Correct 2254 ms 15632 KB Output is correct
53 Correct 2694 ms 15892 KB Output is correct
54 Correct 2444 ms 16252 KB Output is correct
55 Correct 3875 ms 15988 KB Output is correct
56 Correct 4062 ms 16356 KB Output is correct
57 Correct 3511 ms 16108 KB Output is correct
58 Correct 4919 ms 16724 KB Output is correct
59 Correct 4355 ms 16636 KB Output is correct
60 Execution timed out 5056 ms 17276 KB Time limit exceeded
61 Halted 0 ms 0 KB -