#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
inline lint gcd(lint a, lint b) {
while (b) {
lint c = a;
a = b; b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) {
return a / gcd(a, b) * b;
}
bool isprime(lint n) {
if (n == 1)return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
template<typename T>
T mypow(T a, lint b) {
T res(1);
while(b){
if(b&1)res*=a;
a*=a;
b>>=1;
}
return res;
}
lint modpow(lint a, lint b, lint m) {
lint res(1);
while(b){
if(b&1){
res*=a;res%=m;
}
a*=a;a%=m;
b>>=1;
}
return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
rep(i, vec.size()){
std::cout << vec[i];
std::cout<<(i==(int)vec.size()-1?"\n":" ");
}
}
template<typename T>
void printArray(T l, T r) {
T rprev = std::prev(r);
for (T i = l; i != rprev; i++) {
std::cout << *i << " ";
}
std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
if(b==0)return {1,0};
LP s=extGcd(b,a%b);
std::swap(s.first,s.second);
s.second-=a/b*s.first;
return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
lint p=extGcd(m1,m2).first;
lint tmp=(b2-b1)*p%m2;
lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
return std::make_pair(r,m1*m2);
}
/*template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
return [f=std::forward<F>(f)](auto&&... args){
return f(f,std::forward<decltype(args)>(args)...);
};
}*/
#line 3 "/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/UnionFind.hpp"
class UnionFind {
protected:
std::vector<int> par, size;
public:
UnionFind(){}
UnionFind(int size) {init(size);}
void init(int size){
par.resize(size); this->size.resize(size, 1);
rep(i, size) {
par[i] = i;
}
}
int find(int n) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)return;
int a=n,b=m;
if(size[a]>size[b])std::swap(a,b);
par[a] = b;
size[b] += size[a];
}
bool same(int n, int m) {
return find(n) == find(m);
}
int getsize(int n) {
return size[find(n)];
}
};
#line 4 "/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/PersistentUnionFind.hpp"
class PersistentUnionFind :UnionFind {
std::vector<P> notparent;
std::vector<std::vector<std::pair<int, int>>> sizevec;
int opcount = 0;
public:
PersistentUnionFind(unsigned int size) :UnionFind(size) {
notparent.resize(size); sizevec.resize(size);
rep(i, size) {
par[i] = i;
sizevec[i].push_back(std::make_pair(-1, 1));
notparent[i] = std::make_pair(INF, i);
}
}
int find(int n, int t = INF) {
if (opcount <= t) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
if (notparent[n].first <= t)return find(notparent[n].second, t);
return n;
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m) {
opcount++;
return;
}
if(size[n]>size[m])std::swap(n,m);
par[n] = m;
notparent[n] = std::make_pair(opcount, m);
sizevec[m].emplace_back(opcount, sizevec[m].back().second + sizevec[n].back().second);
opcount++;
}
bool same(int n, int m, int t = INF) {
return find(n, t) == find(m, t);
}
int getsize(int n, int t = INF) {
n = find(n, t);
auto ite = std::lower_bound(all(sizevec[n]), std::make_pair(t, 0));
if (ite == sizevec[n].end())ite--;
if (t < (*ite).first)ite--;
return (*ite).second;
}
};
#line 3 "main.cpp"
int n,q,last[300010],ans[300010];
std::string s,type[300010];
bool flag[300010];
std::vector<int> opindex;
int main(){
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cin>>n>>q>>s;
PersistentUnionFind uf(n+1);
int startcount=0;
rep(i,s.size()){
if(s[i]=='1'){
startcount++;
uf.unite(i,i+1);
}
}
int nowcount=startcount;
rep(i,q){
std::cin>>type[i];
if(type[i]=="query"){
int a,b;
std::cin>>a>>b;
a--;b--;
if(!uf.same(a,b))std::cout<<0<<std::endl;
else if(uf.same(a,b,startcount-1))std::cout<<i+1<<std::endl;
else{
int min=startcount-1,max=nowcount;
while(min+1<max){
int mid=(min+max)/2;
if(uf.same(a,b,mid))max=mid;
else min=mid;
}
std::cout<<i-opindex[max-startcount]<<std::endl;
}
}
else{
int t;
std::cin>>t;
t--;
uf.unite(t,t+1);
opindex.emplace_back(i);
nowcount++;
}
}
}
Compilation message
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:3: warning: ignoring #pragma target [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:4: warning: ignoring #pragma optimize [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:5: warning: ignoring #pragma optimize [-Wunknown-pragmas]
/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/PersistentUnionFind.hpp: In constructor 'PersistentUnionFind::PersistentUnionFind(unsigned int)':
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/PersistentUnionFind.hpp:11:3: note: in expansion of macro 'rep'
main.cpp: In function 'int main()':
/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp:33:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
main.cpp:13:2: note: in expansion of macro 'rep'
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
9728 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
471 ms |
12272 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
9856 KB |
Output is correct |
| 2 |
Correct |
8 ms |
9856 KB |
Output is correct |
| 3 |
Correct |
9 ms |
9856 KB |
Output is correct |
| 4 |
Correct |
14 ms |
9856 KB |
Output is correct |
| 5 |
Correct |
242 ms |
36484 KB |
Output is correct |
| 6 |
Correct |
518 ms |
35716 KB |
Output is correct |
| 7 |
Correct |
660 ms |
34700 KB |
Output is correct |
| 8 |
Execution timed out |
5055 ms |
35684 KB |
Time limit exceeded |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
9856 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
9856 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
7 ms |
9728 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
