oj.uz

답안 #941666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
941666 2024-03-09T09:21:07 Z Baizho 다리 (APIO19_bridges) C++14
100 / 100
 1554 ms 207768 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, m, q, u[N], v[N], d[N], t[N], x[N], y[N], par[N], siz[N], ans[N], changed[N];
vector<int> unchanged, ask, change, ex[N];

const int B = 1000;

int findpar(int v) {
	if(v == par[v]) return v;
	return findpar(par[v]);
}

vector<pair<pair<int, int>, int> > dat;

void rollback(int s) {
	while(dat.size() > s) {
		int a = dat.back().ff.ff, b = dat.back().ff.ss, parb = dat.back().ss;
		par[b] = parb;
		siz[a] -= siz[b];
		dat.pop_back();
	}
}

void combine(int a, int b) {
	a = findpar(a), b = findpar(b);
	if(a != b) {
		if(siz[a] < siz[b]) swap(a, b);
		dat.pb({{a, b}, par[b]});
		par[b] = a;
		siz[a] += siz[b];
	}
}

void Baizho() {
	cin>>n>>m;
	for(int i = 1; i <= m; i ++) cin>>u[i]>>v[i]>>d[i];
	cin>>q;
	for(int i = 1; i <= q; i ++) {
		cin>>t[i]>>x[i]>>y[i];
	}
	for(int l = 1; l <= q; l += B) {
		unchanged.clear(), ask.clear(), change.clear();
		for(int i = 1; i <= n; i ++) {
			par[i] = i;
			siz[i] = 1;
		}
		for(int i = 1; i <= m; i ++) changed[i] = 0;
		int r = min(q, l + B - 1);
		for(int i = l; i <= r; i ++) {
			if(t[i] == 1) changed[x[i]] = 1;
			else ask.pb(i);
		}
		for(int i = 1; i <= m; i ++) {
			if(!changed[i]) unchanged.pb(i);
			else change.pb(i);
		}
		for(int i = l; i <= r; i ++) {
			if(t[i] == 2) {
				for(auto p : change) if(d[p] >= y[i]) ex[i].pb(p);
			} else d[x[i]] = y[i];
		}
		sort(all(unchanged), [](int i, int j) {
			return d[i] < d[j];
		});
		sort(all(ask), [](int i, int j) {
			return y[i] > y[j];
		});
		for(auto i : ask) {
			while(!unchanged.empty() && d[unchanged.back()] >= y[i]) {
//				cout<<i<<" "<<unchanged.back()<<"\n";
				combine(u[unchanged.back()], v[unchanged.back()]);
				unchanged.pop_back();
			}
			// add the extra bridges which we changed in this block so they are a special case
			int prev = dat.size();
			for(auto p : ex[i]) {
//				cout<<i<<" "<<p<<" yolo \n";
				combine(u[p], v[p]);
			}
			ans[i] = siz[findpar(x[i])];
//			cout<<i<<" "<<y[i]<<" "<<findpar(x[i])<<"\n";
			rollback(prev);
		}
	}
	for(int i = 1; i <= q; i ++) if(t[i] == 2) cout<<ans[i]<<"\n";
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:50:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |  while(dat.size() > s) {
      |        ~~~~~~~~~~~^~~
bridges.cpp: In function 'void Freopen(std::string)':
bridges.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 22 ms 10332 KB Output is correct
4 Correct 4 ms 4696 KB Output is correct
5 Correct 9 ms 6232 KB Output is correct
6 Correct 9 ms 6488 KB Output is correct
7 Correct 8 ms 6236 KB Output is correct
8 Correct 9 ms 6236 KB Output is correct
9 Correct 10 ms 7440 KB Output is correct
10 Correct 10 ms 6236 KB Output is correct
11 Correct 11 ms 6312 KB Output is correct
12 Correct 11 ms 6748 KB Output is correct
13 Correct 16 ms 7256 KB Output is correct
14 Correct 12 ms 6748 KB Output is correct
15 Correct 10 ms 6236 KB Output is correct
16 Correct 9 ms 6800 KB Output is correct
17 Correct 9 ms 6744 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 899 ms 163704 KB Output is correct
2 Correct 850 ms 162752 KB Output is correct
3 Correct 857 ms 162756 KB Output is correct
4 Correct 832 ms 161488 KB Output is correct
5 Correct 837 ms 163880 KB Output is correct
6 Correct 1014 ms 207080 KB Output is correct
7 Correct 1018 ms 207768 KB Output is correct
8 Correct 1028 ms 202576 KB Output is correct
9 Correct 25 ms 5716 KB Output is correct
10 Correct 565 ms 182056 KB Output is correct
11 Correct 553 ms 181800 KB Output is correct
12 Correct 744 ms 145700 KB Output is correct
13 Correct 693 ms 140292 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 661 ms 111520 KB Output is correct
2 Correct 389 ms 100540 KB Output is correct
3 Correct 710 ms 137112 KB Output is correct
4 Correct 648 ms 112380 KB Output is correct
5 Correct 25 ms 5720 KB Output is correct
6 Correct 686 ms 131744 KB Output is correct
7 Correct 590 ms 103576 KB Output is correct
8 Correct 537 ms 88508 KB Output is correct
9 Correct 480 ms 80284 KB Output is correct
10 Correct 444 ms 71156 KB Output is correct
11 Correct 465 ms 77468 KB Output is correct
12 Correct 426 ms 70316 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1192 ms 106416 KB Output is correct
2 Correct 29 ms 5712 KB Output is correct
3 Correct 122 ms 6624 KB Output is correct
4 Correct 53 ms 6616 KB Output is correct
5 Correct 603 ms 106016 KB Output is correct
6 Correct 1169 ms 107264 KB Output is correct
7 Correct 585 ms 107408 KB Output is correct
8 Correct 571 ms 105788 KB Output is correct
9 Correct 583 ms 106532 KB Output is correct
10 Correct 570 ms 107272 KB Output is correct
11 Correct 884 ms 106376 KB Output is correct
12 Correct 868 ms 107040 KB Output is correct
13 Correct 901 ms 106928 KB Output is correct
14 Correct 526 ms 106276 KB Output is correct
15 Correct 558 ms 106736 KB Output is correct
16 Correct 1213 ms 107332 KB Output is correct
17 Correct 1216 ms 107040 KB Output is correct
18 Correct 1189 ms 107812 KB Output is correct
19 Correct 1174 ms 106532 KB Output is correct
20 Correct 1010 ms 107432 KB Output is correct
21 Correct 1027 ms 107580 KB Output is correct
22 Correct 1155 ms 106604 KB Output is correct
23 Correct 668 ms 106632 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 899 ms 163704 KB Output is correct
2 Correct 850 ms 162752 KB Output is correct
3 Correct 857 ms 162756 KB Output is correct
4 Correct 832 ms 161488 KB Output is correct
5 Correct 837 ms 163880 KB Output is correct
6 Correct 1014 ms 207080 KB Output is correct
7 Correct 1018 ms 207768 KB Output is correct
8 Correct 1028 ms 202576 KB Output is correct
9 Correct 25 ms 5716 KB Output is correct
10 Correct 565 ms 182056 KB Output is correct
11 Correct 553 ms 181800 KB Output is correct
12 Correct 744 ms 145700 KB Output is correct
13 Correct 693 ms 140292 KB Output is correct
14 Correct 661 ms 111520 KB Output is correct
15 Correct 389 ms 100540 KB Output is correct
16 Correct 710 ms 137112 KB Output is correct
17 Correct 648 ms 112380 KB Output is correct
18 Correct 25 ms 5720 KB Output is correct
19 Correct 686 ms 131744 KB Output is correct
20 Correct 590 ms 103576 KB Output is correct
21 Correct 537 ms 88508 KB Output is correct
22 Correct 480 ms 80284 KB Output is correct
23 Correct 444 ms 71156 KB Output is correct
24 Correct 465 ms 77468 KB Output is correct
25 Correct 426 ms 70316 KB Output is correct
26 Correct 869 ms 163160 KB Output is correct
27 Correct 1020 ms 184688 KB Output is correct
28 Correct 919 ms 160968 KB Output is correct
29 Correct 708 ms 124292 KB Output is correct
30 Correct 981 ms 175852 KB Output is correct
31 Correct 982 ms 177724 KB Output is correct
32 Correct 983 ms 176416 KB Output is correct
33 Correct 901 ms 162628 KB Output is correct
34 Correct 908 ms 160532 KB Output is correct
35 Correct 912 ms 161876 KB Output is correct
36 Correct 751 ms 131344 KB Output is correct
37 Correct 735 ms 130668 KB Output is correct
38 Correct 732 ms 129568 KB Output is correct
39 Correct 641 ms 116464 KB Output is correct
40 Correct 637 ms 115412 KB Output is correct
41 Correct 629 ms 114988 KB Output is correct
42 Correct 613 ms 115708 KB Output is correct
43 Correct 648 ms 114820 KB Output is correct
44 Correct 616 ms 113460 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 22 ms 10332 KB Output is correct
4 Correct 4 ms 4696 KB Output is correct
5 Correct 9 ms 6232 KB Output is correct
6 Correct 9 ms 6488 KB Output is correct
7 Correct 8 ms 6236 KB Output is correct
8 Correct 9 ms 6236 KB Output is correct
9 Correct 10 ms 7440 KB Output is correct
10 Correct 10 ms 6236 KB Output is correct
11 Correct 11 ms 6312 KB Output is correct
12 Correct 11 ms 6748 KB Output is correct
13 Correct 16 ms 7256 KB Output is correct
14 Correct 12 ms 6748 KB Output is correct
15 Correct 10 ms 6236 KB Output is correct
16 Correct 9 ms 6800 KB Output is correct
17 Correct 9 ms 6744 KB Output is correct
18 Correct 899 ms 163704 KB Output is correct
19 Correct 850 ms 162752 KB Output is correct
20 Correct 857 ms 162756 KB Output is correct
21 Correct 832 ms 161488 KB Output is correct
22 Correct 837 ms 163880 KB Output is correct
23 Correct 1014 ms 207080 KB Output is correct
24 Correct 1018 ms 207768 KB Output is correct
25 Correct 1028 ms 202576 KB Output is correct
26 Correct 25 ms 5716 KB Output is correct
27 Correct 565 ms 182056 KB Output is correct
28 Correct 553 ms 181800 KB Output is correct
29 Correct 744 ms 145700 KB Output is correct
30 Correct 693 ms 140292 KB Output is correct
31 Correct 661 ms 111520 KB Output is correct
32 Correct 389 ms 100540 KB Output is correct
33 Correct 710 ms 137112 KB Output is correct
34 Correct 648 ms 112380 KB Output is correct
35 Correct 25 ms 5720 KB Output is correct
36 Correct 686 ms 131744 KB Output is correct
37 Correct 590 ms 103576 KB Output is correct
38 Correct 537 ms 88508 KB Output is correct
39 Correct 480 ms 80284 KB Output is correct
40 Correct 444 ms 71156 KB Output is correct
41 Correct 465 ms 77468 KB Output is correct
42 Correct 426 ms 70316 KB Output is correct
43 Correct 1192 ms 106416 KB Output is correct
44 Correct 29 ms 5712 KB Output is correct
45 Correct 122 ms 6624 KB Output is correct
46 Correct 53 ms 6616 KB Output is correct
47 Correct 603 ms 106016 KB Output is correct
48 Correct 1169 ms 107264 KB Output is correct
49 Correct 585 ms 107408 KB Output is correct
50 Correct 571 ms 105788 KB Output is correct
51 Correct 583 ms 106532 KB Output is correct
52 Correct 570 ms 107272 KB Output is correct
53 Correct 884 ms 106376 KB Output is correct
54 Correct 868 ms 107040 KB Output is correct
55 Correct 901 ms 106928 KB Output is correct
56 Correct 526 ms 106276 KB Output is correct
57 Correct 558 ms 106736 KB Output is correct
58 Correct 1213 ms 107332 KB Output is correct
59 Correct 1216 ms 107040 KB Output is correct
60 Correct 1189 ms 107812 KB Output is correct
61 Correct 1174 ms 106532 KB Output is correct
62 Correct 1010 ms 107432 KB Output is correct
63 Correct 1027 ms 107580 KB Output is correct
64 Correct 1155 ms 106604 KB Output is correct
65 Correct 668 ms 106632 KB Output is correct
66 Correct 869 ms 163160 KB Output is correct
67 Correct 1020 ms 184688 KB Output is correct
68 Correct 919 ms 160968 KB Output is correct
69 Correct 708 ms 124292 KB Output is correct
70 Correct 981 ms 175852 KB Output is correct
71 Correct 982 ms 177724 KB Output is correct
72 Correct 983 ms 176416 KB Output is correct
73 Correct 901 ms 162628 KB Output is correct
74 Correct 908 ms 160532 KB Output is correct
75 Correct 912 ms 161876 KB Output is correct
76 Correct 751 ms 131344 KB Output is correct
77 Correct 735 ms 130668 KB Output is correct
78 Correct 732 ms 129568 KB Output is correct
79 Correct 641 ms 116464 KB Output is correct
80 Correct 637 ms 115412 KB Output is correct
81 Correct 629 ms 114988 KB Output is correct
82 Correct 613 ms 115708 KB Output is correct
83 Correct 648 ms 114820 KB Output is correct
84 Correct 616 ms 113460 KB Output is correct
85 Correct 1552 ms 164808 KB Output is correct
86 Correct 149 ms 13004 KB Output is correct
87 Correct 77 ms 17360 KB Output is correct
88 Correct 838 ms 173480 KB Output is correct
89 Correct 1535 ms 162288 KB Output is correct
90 Correct 843 ms 181796 KB Output is correct
91 Correct 931 ms 163364 KB Output is correct
92 Correct 923 ms 163412 KB Output is correct
93 Correct 1055 ms 193060 KB Output is correct
94 Correct 1227 ms 161828 KB Output is correct
95 Correct 1247 ms 161972 KB Output is correct
96 Correct 1243 ms 194724 KB Output is correct
97 Correct 696 ms 135140 KB Output is correct
98 Correct 703 ms 132744 KB Output is correct
99 Correct 1523 ms 164544 KB Output is correct
100 Correct 1554 ms 163968 KB Output is correct
101 Correct 1549 ms 163244 KB Output is correct
102 Correct 1544 ms 162160 KB Output is correct
103 Correct 1389 ms 197420 KB Output is correct
104 Correct 1358 ms 197156 KB Output is correct
105 Correct 1149 ms 139260 KB Output is correct
106 Correct 962 ms 124320 KB Output is correct
107 Correct 1184 ms 145304 KB Output is correct
108 Correct 1498 ms 195692 KB Output is correct
109 Correct 981 ms 206888 KB Output is correct