oj.uz

답안 #675023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
675023 2022-12-26T19:34:34 Z QwertyPi I want to be the very best too! (NOI17_pokemonmaster) C++14
47 / 100
 3746 ms 11764 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int MAXN = 5e4 + 11, MAXQ = 1e5 + 11;
const int SQ = 1000;
int l[MAXN], p[MAXN], tp[MAXN];
int ans[MAXQ];

struct DSU{
	int dsu[MAXN], ans[MAXN];
	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]) info[x][i.fi] += i.se, ans[x] += info[x][i.fi] == i.se;
		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 >> 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:61: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]
   61 |  for(int j = 0; j < Q2.size(); j++){
      |                 ~~^~~~~~~~~~~
pokemonmaster.cpp:62:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   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 38 ms 6596 KB Output is correct
2 Correct 55 ms 6644 KB Output is correct
3 Correct 67 ms 6864 KB Output is correct
4 Correct 37 ms 6624 KB Output is correct
5 Correct 54 ms 6604 KB Output is correct
6 Correct 54 ms 6800 KB Output is correct
7 Correct 36 ms 6568 KB Output is correct
8 Correct 49 ms 6632 KB Output is correct
9 Correct 39 ms 6568 KB Output is correct
10 Correct 86 ms 6884 KB Output is correct
11 Correct 58 ms 6540 KB Output is correct
12 Correct 96 ms 7360 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 6656 KB Output is correct
2 Correct 44 ms 6716 KB Output is correct
3 Correct 46 ms 6940 KB Output is correct
4 Correct 42 ms 6920 KB Output is correct
5 Correct 44 ms 6912 KB Output is correct
6 Correct 49 ms 7100 KB Output is correct
7 Correct 51 ms 7124 KB Output is correct
8 Correct 58 ms 8508 KB Output is correct
9 Correct 48 ms 7368 KB Output is correct
10 Correct 74 ms 10480 KB Output is correct
11 Correct 63 ms 9156 KB Output is correct
12 Correct 76 ms 11764 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 719 ms 8076 KB Output is correct
2 Correct 888 ms 7888 KB Output is correct
3 Correct 696 ms 7996 KB Output is correct
4 Correct 697 ms 8196 KB Output is correct
5 Correct 926 ms 8256 KB Output is correct
6 Correct 742 ms 8172 KB Output is correct
7 Correct 1345 ms 8840 KB Output is correct
8 Correct 1440 ms 8864 KB Output is correct
9 Correct 1434 ms 8792 KB Output is correct
10 Correct 1442 ms 8696 KB Output is correct
11 Correct 1410 ms 8796 KB Output is correct
12 Correct 1429 ms 8744 KB Output is correct

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 6596 KB Output is correct
2 Correct 55 ms 6644 KB Output is correct
3 Correct 67 ms 6864 KB Output is correct
4 Correct 37 ms 6624 KB Output is correct
5 Correct 54 ms 6604 KB Output is correct
6 Correct 54 ms 6800 KB Output is correct
7 Correct 36 ms 6568 KB Output is correct
8 Correct 49 ms 6632 KB Output is correct
9 Correct 39 ms 6568 KB Output is correct
10 Correct 86 ms 6884 KB Output is correct
11 Correct 58 ms 6540 KB Output is correct
12 Correct 96 ms 7360 KB Output is correct
13 Correct 776 ms 8008 KB Output is correct
14 Correct 2621 ms 8256 KB Output is correct
15 Incorrect 3746 ms 8160 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 6596 KB Output is correct
2 Correct 55 ms 6644 KB Output is correct
3 Correct 67 ms 6864 KB Output is correct
4 Correct 37 ms 6624 KB Output is correct
5 Correct 54 ms 6604 KB Output is correct
6 Correct 54 ms 6800 KB Output is correct
7 Correct 36 ms 6568 KB Output is correct
8 Correct 49 ms 6632 KB Output is correct
9 Correct 39 ms 6568 KB Output is correct
10 Correct 86 ms 6884 KB Output is correct
11 Correct 58 ms 6540 KB Output is correct
12 Correct 96 ms 7360 KB Output is correct
13 Correct 39 ms 6656 KB Output is correct
14 Correct 44 ms 6716 KB Output is correct
15 Correct 46 ms 6940 KB Output is correct
16 Correct 42 ms 6920 KB Output is correct
17 Correct 44 ms 6912 KB Output is correct
18 Correct 49 ms 7100 KB Output is correct
19 Correct 51 ms 7124 KB Output is correct
20 Correct 58 ms 8508 KB Output is correct
21 Correct 48 ms 7368 KB Output is correct
22 Correct 74 ms 10480 KB Output is correct
23 Correct 63 ms 9156 KB Output is correct
24 Correct 76 ms 11764 KB Output is correct
25 Correct 719 ms 8076 KB Output is correct
26 Correct 888 ms 7888 KB Output is correct
27 Correct 696 ms 7996 KB Output is correct
28 Correct 697 ms 8196 KB Output is correct
29 Correct 926 ms 8256 KB Output is correct
30 Correct 742 ms 8172 KB Output is correct
31 Correct 1345 ms 8840 KB Output is correct
32 Correct 1440 ms 8864 KB Output is correct
33 Correct 1434 ms 8792 KB Output is correct
34 Correct 1442 ms 8696 KB Output is correct
35 Correct 1410 ms 8796 KB Output is correct
36 Correct 1429 ms 8744 KB Output is correct
37 Correct 776 ms 8008 KB Output is correct
38 Correct 2621 ms 8256 KB Output is correct
39 Incorrect 3746 ms 8160 KB Output isn't correct
40 Halted 0 ms 0 KB -