Submission #59853560

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
  if(x<0) printf("-"),x=-x;
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
int n,q;
const int N=5e5+10;
int fa[N],l[N],r[N];
int val[N];
int find(int x) {
	return x==fa[x]?x:fa[x]=find(fa[x]);
}
int cnt[N];
void solve() {
	in(n),in(q);
	rep(i,1,n) {
		fa[i]=i,val[i]=i;
		cnt[i]++;
		l[i]=r[i]=i;
	}
	while(q--) {
		int opt;
		in(opt);
		if(opt==1) {
			int x,c;
			in(x),in(c);
			int tx=find(x);
			int lst=l[tx]-1;
			cnt[val[tx]]-=(r[tx]-l[tx]+1);
			val[tx]=c;
			cnt[c]+=(r[tx]-l[tx]+1);
			if(lst>=1) {
				int txx=find(lst);
				if(val[txx]==c) {
					fa[tx]=txx;
					l[txx]=l[txx];
					r[txx]=r[tx];
					val[txx]=c;
				}
			}
			tx=find(x);
			int lst1=r[tx]+1;
			if(lst1<=n) {
				int tyy=find(lst1);
				if(val[tyy]==c) {
					fa[tx]=tyy;
					l[tyy]=l[tx];
					r[tyy]=r[tyy];
					val[tyy]=c;
				}
			}
		}else {
			int x;
			in(x);
			printf("%lld\n",cnt[x]);
		}
	}
}
fire main() {
	while(T--) {
		solve();
	}
	return false;
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:36:13: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   36 |         rep(i,1,n) {
      |             ^
Main.cpp:8:37: note: in definition of macro ‘rep’
    8 | #define rep(i,x,y) for(register int i=x;i<=y;i++)
      |                                     ^

Judge Result