oj.uz

답안 #209494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209494 2020-03-14T11:37:47 Z mieszko11b 다리 (APIO19_bridges) C++14
44 / 100
 3000 ms 9360 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;

#define X first
#define Y second

const int SQRT = 1000;

int n, m;
int a[100007], b[100007], c[100007];
int q;
int t[100007], d[100007], e[100007], ans[100007];
bool changed[100007];
int lastw[100007];

struct DSU {
	int n;
	vector<int> p, rank;
	vector<vector<int>> G;
	int cnt;
	vector<bool> vis;
	vector<int> aff;
	
	DSU(int _n) {
		n = _n;
		p.resize(n + 1);
		rank.resize(n + 1);
		G.resize(n + 1);
		vis.resize(n + 1);
		for(int i = 1 ; i <= n ; i++) {
			p[i] = i;
			rank[i] = 1;
		}
	}
	
	int Find(int i) {
		if(p[i] == i)
			return i;
		return Find(p[i]);
	}
	
	void Union(int a, int b) {
		a = Find(a);
		b = Find(b);
		
		if(a == b)
			return ;
			
		if(rank[a] < rank[b]) {
			p[a] = b;
			rank[b] += rank[a];
		} else {
			p[b] = a;
			rank[a] += rank[b];
		}
	}
	
	void dfs(int w) {
		if(vis[w])
			return ;
		vis[w] = 1;
		aff.push_back(w);
		cnt += rank[w];
		for(int u : G[w])
			dfs(u);
	}
	
	int count(vector<int> &E, int w) {
		for(int e : E) {
			G[Find(a[e])].push_back(Find(b[e]));
			G[Find(b[e])].push_back(Find(a[e]));
		}
		cnt = 0;
		dfs(Find(w));
		for(int x : aff)
			vis[x] = 0;
		aff.clear();
		for(int e : E) {
			G[Find(a[e])].clear();
			G[Find(b[e])].clear();
		}
		return cnt;
	}
};


void process_queries(int x, int y) {
	vector<ii> not_changed, Q;
	vector<int> chacha;
	memset(changed, 0, sizeof changed);
	for(int i = x ; i <= y ; i++) {
		if(t[i] == 1)
			changed[d[i]] = 1;
		else
			Q.emplace_back(e[i], i);
	}
	not_changed.reserve(m);
	for(int i = 1 ; i <= m ; i++) {
		if(!changed[i])
			not_changed.push_back({c[i], i});
		else
			chacha.push_back(i);
	}
	sort(not_changed.begin(), not_changed.end(), greater<ii>());
	sort(Q.begin(), Q.end(), greater<ii>());
	
	DSU *dsu = new DSU(n);
	
	int i = 0, j = 0;
	while(i < not_changed.size() || j < Q.size()) {
		if(j == Q.size() || (i < not_changed.size() && not_changed[i].X >= Q[j].X)) {
			int e = not_changed[i].Y;
			dsu->Union(a[e], b[e]);
			i++;
		} else {
			int q = Q[j].Y;
			for(int e : chacha)
				lastw[e] = c[e];
			for(int k = x ; k < q ; k++)
				if(t[k] == 1)
					lastw[d[k]] = e[k];
			vector<int> E;
			for(int e : chacha)
				if(lastw[e] >= ::e[q])
					E.push_back(e);
			ans[q] = dsu->count(E, d[q]);
			j++;
		}
	}

	for(int k = x ; k <= y ; k++)
		if(t[k] == 1)
			c[d[k]] = e[k];	
			
	delete dsu;
}

int main() {
	scanf("%d%d",&n, &m);
	for(int i = 1 ; i <= m ; i++)
		scanf("%d%d%d", &a[i], &b[i], &c[i]);
	scanf("%d", &q);
	for(int i = 1 ; i <= q ; i++)
		scanf("%d%d%d", &t[i], &d[i], &e[i]);
		
	for(int i = 1 ; i <= q ; i += SQRT)
		process_queries(i, min(i + SQRT - 1, q));
		
	for(int i = 1 ; i <= q ; i++)
		if(ans[i])
			printf("%d\n", ans[i]);
		
	return 0;
}

Compilation message

bridges.cpp: In function 'void process_queries(int, int)':
bridges.cpp:113:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < not_changed.size() || j < Q.size()) {
        ~~^~~~~~~~~~~~~~~~~~~~
bridges.cpp:113:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < not_changed.size() || j < Q.size()) {
                                  ~~^~~~~~~~~~
bridges.cpp:114:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(j == Q.size() || (i < not_changed.size() && not_changed[i].X >= Q[j].X)) {
      ~~^~~~~~~~~~~
bridges.cpp:114:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(j == Q.size() || (i < not_changed.size() && not_changed[i].X >= Q[j].X)) {
                        ~~^~~~~~~~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:142:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n, &m);
  ~~~~~^~~~~~~~~~~~~~~
bridges.cpp:144:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &a[i], &b[i], &c[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:145:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:147:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &t[i], &d[i], &e[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 106 ms 632 KB Output is correct
4 Correct 14 ms 632 KB Output is correct
5 Correct 33 ms 632 KB Output is correct
6 Correct 30 ms 632 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 31 ms 632 KB Output is correct
9 Correct 43 ms 632 KB Output is correct
10 Correct 31 ms 632 KB Output is correct
11 Correct 31 ms 632 KB Output is correct
12 Correct 34 ms 632 KB Output is correct
13 Correct 42 ms 632 KB Output is correct
14 Correct 38 ms 632 KB Output is correct
15 Correct 60 ms 632 KB Output is correct
16 Correct 37 ms 632 KB Output is correct
17 Correct 36 ms 632 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2205 ms 4936 KB Output is correct
2 Correct 2189 ms 4936 KB Output is correct
3 Correct 2201 ms 4936 KB Output is correct
4 Correct 2155 ms 4936 KB Output is correct
5 Correct 2159 ms 4936 KB Output is correct
6 Execution timed out 3097 ms 4752 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1837 ms 3932 KB Output is correct
2 Correct 1698 ms 2536 KB Output is correct
3 Correct 2493 ms 4064 KB Output is correct
4 Correct 1846 ms 3936 KB Output is correct
5 Correct 98 ms 2168 KB Output is correct
6 Correct 2157 ms 4004 KB Output is correct
7 Correct 1697 ms 3936 KB Output is correct
8 Correct 1412 ms 3932 KB Output is correct
9 Correct 1181 ms 4192 KB Output is correct
10 Correct 1014 ms 4060 KB Output is correct
11 Correct 1120 ms 3936 KB Output is correct
12 Correct 928 ms 3936 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1827 ms 5508 KB Output is correct
2 Correct 100 ms 2168 KB Output is correct
3 Correct 193 ms 2552 KB Output is correct
4 Correct 127 ms 2656 KB Output is correct
5 Correct 1727 ms 5568 KB Output is correct
6 Correct 1799 ms 5504 KB Output is correct
7 Correct 1734 ms 5504 KB Output is correct
8 Correct 932 ms 4804 KB Output is correct
9 Correct 858 ms 4804 KB Output is correct
10 Correct 867 ms 4932 KB Output is correct
11 Correct 1303 ms 5376 KB Output is correct
12 Correct 1291 ms 5248 KB Output is correct
13 Correct 1343 ms 5504 KB Output is correct
14 Correct 1492 ms 5576 KB Output is correct
15 Correct 1626 ms 5504 KB Output is correct
16 Correct 1827 ms 5536 KB Output is correct
17 Correct 1844 ms 5528 KB Output is correct
18 Correct 1857 ms 9352 KB Output is correct
19 Correct 1833 ms 9360 KB Output is correct
20 Correct 1586 ms 8400 KB Output is correct
21 Correct 1552 ms 8632 KB Output is correct
22 Correct 1786 ms 8988 KB Output is correct
23 Correct 1632 ms 7044 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2205 ms 4936 KB Output is correct
2 Correct 2189 ms 4936 KB Output is correct
3 Correct 2201 ms 4936 KB Output is correct
4 Correct 2155 ms 4936 KB Output is correct
5 Correct 2159 ms 4936 KB Output is correct
6 Execution timed out 3097 ms 4752 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 106 ms 632 KB Output is correct
4 Correct 14 ms 632 KB Output is correct
5 Correct 33 ms 632 KB Output is correct
6 Correct 30 ms 632 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 31 ms 632 KB Output is correct
9 Correct 43 ms 632 KB Output is correct
10 Correct 31 ms 632 KB Output is correct
11 Correct 31 ms 632 KB Output is correct
12 Correct 34 ms 632 KB Output is correct
13 Correct 42 ms 632 KB Output is correct
14 Correct 38 ms 632 KB Output is correct
15 Correct 60 ms 632 KB Output is correct
16 Correct 37 ms 632 KB Output is correct
17 Correct 36 ms 632 KB Output is correct
18 Correct 2205 ms 4936 KB Output is correct
19 Correct 2189 ms 4936 KB Output is correct
20 Correct 2201 ms 4936 KB Output is correct
21 Correct 2155 ms 4936 KB Output is correct
22 Correct 2159 ms 4936 KB Output is correct
23 Execution timed out 3097 ms 4752 KB Time limit exceeded
24 Halted 0 ms 0 KB -