Submission #68925764

---

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
#define int long long

int Rt, Ct, Ra, Ca, N, M, L;

pair<int, int> getd(char ch)
{
    if (ch == 'U') return {-1, 0};
    if (ch == 'D') return {1, 0};
    if (ch == 'L') return {0, -1};
    if (ch == 'R') return {0, 1};
    return {0, 0};
}

signed main()
{
    cin >> Rt >> Ct >> Ra >> Ca >> N >> M >> L;
    vector<pair<char, int>> segs(M);
    for(int i=0;i<M;i++) cin >> segs[i].first >> segs[i].second;
    vector<pair<char, int>> segt(L);
    for(int i=0;i<L;i++) cin >> segt[i].first >> segt[i].second;
    int dr = Rt - Ra;
    int dc = Ct - Ca;
    int ccc = 0;
    int i = 0, j = 0;
    while(i < M && j < L)
    {
        int k = min(segs[i].second, segt[j].second);
        char chS = segs[i].first, chT = segt[j].first;
        auto moveS = getd(chS);
        auto moveT = getd(chT);
        int delta_r = moveS.first - moveT.first, delta_c = moveS.second - moveT.second;
        if(delta_r == 0 && delta_c == 0)
        {
            if (dr == 0 && dc == 0) ccc += k;
        }
        else
        {
            if(delta_r == 0)
            {
                if(dr == 0)
                    if(delta_c != 0 && (-dc) % delta_c == 0)
                    {
                        int x = -dc / delta_c;
                        if(x >= 1 && x <= k) ccc++;
                    }
            }
            else if(delta_c == 0)
            {
                if(dc == 0)
                    if(delta_r != 0 && (-dr) % delta_r == 0)
                    {
                        int x = -dr / delta_r;
                        if(x >= 1 && x <= k) ccc++;
                    }
            }
            else
            {
                if((-dr) % delta_r == 0 && (-dc) % delta_c == 0)
                {
                    int x1 = -dr / delta_r, x2 = -dc / delta_c;
                    if(x1 == x2 && x1 >= 1 && x1 <= k) ccc++;
                }
            }
        }
        dr += k * delta_r; dc += k * delta_c;
        segs[i].second -= k; segt[j].second -= k;
        if(segs[i].second == 0) i++;
        if(segt[j].second == 0) j++;
    }
    cout << ccc << endl;
    return 0;
}

Submission Info

Judge Result