/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"DA":"NE")<<endl;
}
const int N=1e6+5;
vector<int>p[N];
struct segtree{
vector<ll>tree;
int size;
void init(int n){
size=n;
tree.assign(n*4+5,0LL);
}
void set(int l,int r,int p,int i,int v){
if(l==r){
tree[p]=v;
return;
}
int mid=(l+r)/2;
if(i>mid)set(mid+1,r,p*2+1,i,v);
else set(l,mid,p*2,i,v);
tree[p]=max(tree[p*2],tree[p*2+1]);
}
void set(int i,int v){
set(1,size,1,i,v);
}
ll query(int l,int r,int p,int l_q,int r_q){
if(l>=l_q && r<=r_q){
return tree[p];
}
if(r<l_q || l>r_q){
return 0;
}
int mid=(l+r)/2;
return max(query(l,mid,p*2,l_q,r_q),query(mid+1,r,p*2+1,l_q,r_q));
}
ll query(int l,int r){
return query(1,size,1,l,r);
}
}s;
set<int>a[N],b[N],c[N];
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#ifndef ONLINE_JUDGE
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
fast
int n,q;cin>>n>>q;
s.init(n);
for(int i=2;i<=n;i++){
if(p[i].size()==0){
for(int j=i;j<=n;j+=i){
p[j].push_back(i);
}
}
}
vector<bool>state(n+5);
vector<int>v(n+5);
while(q--){
char t;cin>>t;
if(t=='S'){
int x;cin>>x;
state[x]=!state[x];
if(state[x]){
for(auto i:p[x]){
auto j=c[i].upper_bound(x);
if(j!=c[i].begin()){
--j;
a[x].insert(*j);
b[*j].insert(x);
if(a[x].size())v[x]=*(--a[x].end());
else v[x]=0;
s.set(x,v[x]);
j++;
}
if(j!=c[i].end()){
a[*j].insert(x);
b[x].insert(*j);
if(a[*j].size())v[*j]=*(--a[*j].end());
else v[*j]=0;
s.set(*j,v[*j]);
}
c[i].insert(x);
}
}
else{
for(auto i:b[x]){
a[i].erase(x);
if(!a[i].size()){
v[i]=0;
s.set(i,v[i]);
continue;
}
v[i]=*(--a[i].end());
s.set(i,v[i]);
}
for(auto i:p[x]){
c[i].erase(x);
auto j=c[i].upper_bound(x);
if(j!=c[i].end() && j!=c[i].begin()){
auto k=(--j);
a[*j].insert(*k);
b[*k].insert(*j);
if(!a[*j].size())v[*j]=0;
else v[*j]=*(--a[*j].end());
s.set(*j,v[*j]);
}
}
v[x]=0;
b[x].clear();
a[x].clear();
s.set(x,v[x]);
}
}
else{
int a,b;cin>>a>>b;
bool valid=0;
for(int i=a;i<=b;i++){
if(v[i]>=a){
valid=1;
}
}
person_bool(valid);
}
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
73 ms |
164688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1267 ms |
195696 KB |
Output is correct |
| 2 |
Execution timed out |
1552 ms |
223492 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
73 ms |
164688 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
