This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int x[N],y[N];
int n,q;
int tinh(){
int x1=1, y1=1, d=0;
for (int i=1; i<=n; i++){
int x2=x1+x[i];
int y2=y1+y[i];
if (x2*x1<=0 && x2!=0) d++;
if (y2*y1<=0 && y2!=0) d++;
x1=x2;
y1=y2;
}
return d;
}
void sub1()
{
int i=1;
while(q--)
{
char a;
cin>>a;
if(a=='B')
{
if(i==1)continue;
i--;
}
if(a=='F')
{
if(i!=n)
{
i++;
}
}
if(a=='Q')
{
cout<<tinh()<<'\n';
}
if(a=='C')
{
int nx,ny;
cin>>nx>>ny;
x[i]=nx;
y[i]=ny;
}
}
}
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("simulation.inp","r",stdin);
// freopen("simulation.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i]>>y[i];
cin>>q;
if(n<=1000)
{
sub1();
return 0;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |