#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF=0x1fffffffffffffff;
const ll MINF=0x7fffffffffff;
const int INF=0x3fffffff;
const int MOD=1000000007;
const int MODD=998244353;
const ld DINF=numeric_limits<ld>::infinity();
const ld EPS=1e-9;
const ld PI=3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const ll dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
#define overload4(_1,_2,_3,_4,name,...) name
#define overload3(_1,_2,_3,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i=(n)-1;i>=0;i--)
#define rrep2(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep3(i,a,b) for(ll i=(b)-1;i>=(a);i--)
#define rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)
#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define each(i,...) for(auto&& i:__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(),(i).rend()
#define rall2(i,k) (i).rbegin(),(i).rbegin()+k
#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b
#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)
#define elif else if
#define unless(a) if(!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define vec(type,name,...) vector<type> name(__VA_ARGS__)
#define VEC(type,name,size) vector<type> name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }
vector<pll> factor(ull x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
vector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
template<class T> unordered_map<T, ll> press(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); unordered_map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }
template<class T> map<T, ll> press_map(vector<T>& a){ auto b = a; sort(all(b)); b.erase(unique(all(b)), b.end()); map<T,ll> ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; }
int scan(){ return getchar(); }
void scan(int& a){ scanf("%d", &a); }
void scan(unsigned& a){ scanf("%u", &a); }
void scan(long& a){ scanf("%ld", &a); }
void scan(long long& a){ scanf("%lld", &a); }
void scan(unsigned long long& a){ scanf("%llu", &a); }
void scan(char& a){ do{ a = getchar(); }while(a == ' ' || a == '\n'); }
void scan(float& a){ scanf("%f", &a); }
void scan(double& a){ scanf("%lf", &a); }
void scan(long double& a){ scanf("%Lf", &a); }
void scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }
void scan(char a[]){ scanf("%s", a); }
void scan(string& a){ cin >> a; }
template<class T> void scan(vector<T>&);
template<class T, size_t size> void scan(array<T, size>&);
template<class T, class L> void scan(pair<T, L>&);
template<class T, size_t size> void scan(T(&)[size]);
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
template<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }
template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }
template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }
template<class T> void scan(T& a){ cin >> a; }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(float a){ printf("%.15f", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
#ifdef DEBUG
void err(){ putchar('\n'); }
template<class T> void err(const T& t){ print(t); putchar('\n'); }
template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }
#else
template<class... T> void err(const T&...){}
#endif
int first(bool i = true){ return out(i?"first":"second"); }
int yes(bool i = true){ return out(i?"yes":"no"); }
int Yes(bool i = true){ return out(i?"Yes":"No"); }
int No(){ return out("No"); }
int YES(bool i = true){ return out(i?"YES":"NO"); }
int NO(){ return out("NO"); }
int Yay(bool i = true){ return out(i?"Yay!":":("); }
int possible(bool i = true){ return out(i?"possible":"impossible"); }
int Possible(bool i = true){ return out(i?"Possible":"Impossible"); }
int POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }
void Case(ll i){ printf("Case #%lld: ", i); }
struct Lazy{
int type;
int first, last, cnt;
void operator+=(const Lazy& b){
if(!type){
*this = b;
return;
}
cnt += b.cnt;
if(type == 2) cnt += b.first - last;
last = b.last;
type = b.type;
}
};
struct kdTree{
kdTree *l = nullptr, *r = nullptr;
Lazy val = {0, 0, 0, 0};
int xmin = INF, xmax = -INF, ymin = INF, ymax = -INF;
kdTree(vector<pii> a, bool divx = false){
each(i, a){
chmin(xmin, i.first);
chmax(xmax, i.first);
chmin(ymin, i.second);
chmax(ymax, i.second);
}
if(a.size() == 1) return;
auto p = a.begin() + a.size() / 2;
if(divx) nth_element(a.begin(), p, a.end(), [](pii a, pii b){ return a.first < b.first; });
else nth_element(a.begin(), p, a.end(), [](pii a, pii b){ return a.second < b.second; });
l = new kdTree(vector<pii>(a.begin(), p), !divx);
r = new kdTree(vector<pii>(p, a.end()), !divx);
}
void push(){
if(!l) return;
if(!val.type) return;
l->val += val;
r->val += val;
val = {0, 0, 0, 0};
}
void query(int x1, int x2, int y1, int y2, const Lazy& x){ // [x1, x2] && [y1, y2]
if(xmax < x1 || x2 < xmin || ymax < y1 || y2 < ymin) return;
if(x1 <= xmin && xmax <= x2 && y1 <= ymin && ymax <= y2){
val += x;
return;
}
push();
l->query(x1, y1, x2, y2, x);
r->query(x1, y1, x2, y2, x);
}
int get(int x, int y, int time){
if(!l) return val.cnt + (val.type == 2 ? time - val.last : 0);
push();
if(l->xmin <= x && x <= l->xmax && l->ymin <= y && y <= l->ymax) return l->get(x, y, time);
return r->get(x, y, time);
}
};
signed main(){
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<pii> a;
vector<pair<char, pii>> query(q);
each(i, query){
string s;
cin >> s;
i.first = s[0];
int x, y = 2;
cin >> x;
if(i.first == 'q') cin >> y;
x--; y -= 2;
i.second = {x, y};
if(i.first == 'q') a.emplace_back(x, y);
}
Uniq(a);
kdTree tree(a);
set<int> dark = {-1, n};
tree.query(0, n, 0, n, {2, 0, 0, 0});
rep(n) if(s[i] == '0'){
auto p = dark.insert(i).first;
int x1 = *prev(p) + 1, x2 = *next(p) - 1;
tree.query(x1, i, i, x2, {1, 0, 0, 0});
}
rep(q){
char c = query[i].first;
int x, y, time = i + 1;
tie(x, y) = query[i].second;
if(c == 't'){
s[x] ^= 1;
if(s[x] == '1'){
auto p = dark.find(x);
int x1 = *prev(p) + 1, x2 = *next(p) - 1;
tree.query(x1, x, x, x2, {2, time, time, 0});
dark.erase(p);
}
else{
auto p = dark.insert(x).first;
int x1 = *prev(p) + 1, x2 = *next(p) - 1;
tree.query(x1, x, x, x2, {1, time, time, 0});
}
}
else{
cout << tree.get(x, y, time) << endl;
}
}
}
Compilation message
street_lamps.cpp: In function 'std::vector<long long int> divisor(ull)':
street_lamps.cpp:74:151: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
vector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
~~~~~~~~~~~~~~~~~~~~~~~~^~~~
street_lamps.cpp:30:28: note: in definition of macro 'rrep1'
#define rrep1(n) for(ll i=(n)-1;i>=0;i--)
^
street_lamps.cpp:74:108: note: in expansion of macro 'rrep'
vector<ll> divisor(ull x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }
^~~~
street_lamps.cpp: In function 'void scan(int&)':
street_lamps.cpp:78:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(int& a){ scanf("%d", &a); }
~~~~~^~~~~~~~~~
street_lamps.cpp: In function 'void scan(unsigned int&)':
street_lamps.cpp:79:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(unsigned& a){ scanf("%u", &a); }
~~~~~^~~~~~~~~~
street_lamps.cpp: In function 'void scan(long int&)':
street_lamps.cpp:80:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(long& a){ scanf("%ld", &a); }
~~~~~^~~~~~~~~~~
street_lamps.cpp: In function 'void scan(long long int&)':
street_lamps.cpp:81:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(long long& a){ scanf("%lld", &a); }
~~~~~^~~~~~~~~~~~
street_lamps.cpp: In function 'void scan(long long unsigned int&)':
street_lamps.cpp:82:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(unsigned long long& a){ scanf("%llu", &a); }
~~~~~^~~~~~~~~~~~
street_lamps.cpp: In function 'void scan(float&)':
street_lamps.cpp:84:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(float& a){ scanf("%f", &a); }
~~~~~^~~~~~~~~~
street_lamps.cpp: In function 'void scan(double&)':
street_lamps.cpp:85:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(double& a){ scanf("%lf", &a); }
~~~~~^~~~~~~~~~~
street_lamps.cpp: In function 'void scan(long double&)':
street_lamps.cpp:86:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(long double& a){ scanf("%Lf", &a); }
~~~~~^~~~~~~~~~~
street_lamps.cpp: In function 'void scan(char*)':
street_lamps.cpp:88:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void scan(char a[]){ scanf("%s", a); }
~~~~~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
624 ms |
9320 KB |
Output is correct |
| 2 |
Correct |
639 ms |
9576 KB |
Output is correct |
| 3 |
Correct |
736 ms |
10728 KB |
Output is correct |
| 4 |
Correct |
1164 ms |
33048 KB |
Output is correct |
| 5 |
Correct |
1171 ms |
34532 KB |
Output is correct |
| 6 |
Correct |
1052 ms |
30212 KB |
Output is correct |
| 7 |
Correct |
1439 ms |
51032 KB |
Output is correct |
| 8 |
Correct |
1348 ms |
41216 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
376 KB |
Output is correct |
| 2 |
Correct |
7 ms |
376 KB |
Output is correct |
| 3 |
Correct |
8 ms |
376 KB |
Output is correct |
| 4 |
Correct |
9 ms |
504 KB |
Output is correct |
| 5 |
Correct |
745 ms |
22804 KB |
Output is correct |
| 6 |
Correct |
1796 ms |
30928 KB |
Output is correct |
| 7 |
Correct |
1957 ms |
39448 KB |
Output is correct |
| 8 |
Correct |
1469 ms |
55040 KB |
Output is correct |
| 9 |
Incorrect |
739 ms |
9448 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
504 KB |
Output is correct |
| 2 |
Correct |
8 ms |
504 KB |
Output is correct |
| 3 |
Correct |
7 ms |
376 KB |
Output is correct |
| 4 |
Correct |
6 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2836 ms |
57576 KB |
Output is correct |
| 6 |
Correct |
2300 ms |
45088 KB |
Output is correct |
| 7 |
Correct |
1623 ms |
32476 KB |
Output is correct |
| 8 |
Correct |
606 ms |
15892 KB |
Output is correct |
| 9 |
Incorrect |
655 ms |
19308 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
