Submission #154579

#	Time	Username	Problem	Language	Result	Execution time	Memory
154579		stefdasca	Ruka (COI15_ruka)	C++14	9 / 100	2036 ms	2088 KiB

ruka

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
int n, q;
pair<int, int> dir[100002];
char tip;
int poz = 1, a, b;
int lstque = -1;
void brut()
{
    int ans = 0;
    for(int i = 1; i <= q; ++i)
    {
        cin >> tip;
        if(tip == 'B')
            poz = max(1, poz - 1);
        if(tip == 'F')
            poz = min(poz + 1, n);
        if(tip == 'C')
        {
            cin >> a >> b;
            lstque = -1;
            dir[poz] = {a, b};
        }
        if(tip == 'Q')
        {
            if(lstque == -1)
            {
                ans = 0;
                int pa = 1, pb = 1;
                for(int j = 1; j <= n; ++j)
                {
                    if(pa > 0 && pa + dir[j].fi < 0)
                        ++ans;
                    if(pa < 0 && pa + dir[j].fi > 0)
                        ++ans;
                    if(pb > 0 && pb + dir[j].se < 0)
                        ++ans;
                    if(pb < 0 && pb + dir[j].se > 0)
                        ++ans;
                    pa += dir[j].fi;
                    pb += dir[j].se;
                }
                lstque = i;
            }
            cout << ans << '\n';
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> dir[i].fi >> dir[i].se;
    cin >> q;
   // if(1LL * n * q <= 300000000)
   // {
        brut();
        return 0;
   // }
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 35
• Subtask 3: 0 / 56