oj.uz

Submission #883421

# Submission time Handle Problem Language Result Execution time Memory
883421 2023-12-05T09:13:50 Z stelle Ruka (COI15_ruka) C++14
0 / 100
 1 ms 2396 KB 
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int x[N],y[N];
int n,q;
int tinh()
{
    int ans=0;
    int x1=1,y1=1;
    for(int i=1;i<=n;i++)
    {
        int ul,yl;
        ul=x1+x[i];
        yl=y1+y[i];
        if(x1*y1*ul*yl<0)ans++;
        if(x1<0&&y1<0&&ul>0&&yl>0)ans+=2;
        if(x1>0&&y1>0&&ul<0&&yl<0)ans+=2;
        if(x1<0&&y1>0&&ul>0&&yl<0)ans+=2;
        if(x1>0&&y1<0&&ul<0&&yl>0)ans+=2;
        x1=ul;
        y1=yl;
    }
    return ans;
}
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;
    }
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 56.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -