10th Shandong 集训

contest

A

#include <iostream>

using namespace std;

int T;                                 //T(about 100)组test样例
string week[6] = {"0","Monday", "Tuesday", "Wednesday", "Thursday", "Friday"};
int main()
{
    long long y1, m1, d1,                    //告诉你日期 周几
        y2 ,m2, d2,                    //求一个新日期是周几
        cnt, mod, date, fn;               //计数
    string first, second;

    //每年12个月 每个月30天6周 每周5天
    //算出天数%5即可

    cin >> T;
    while(T--)
    {
        cin >> y1 >> m1 >> d1 >> first >> y2 >> m2 >> d2;
        for(int i = 1;i < 6;i++)
        {
            if(first == week[i])
            {
                date = i;
                //cout << "DATE-" << date << endl;
            }
        }
        cnt = (y2 - y1) * 360 + (m2 - m1) * 30 + (d2 - d1);
        //cout << "CNT-" << cnt << endl;
        mod = cnt % 5;
        //cout << "MOD-" << mod << endl;

        //cout << "MOD+DATE" << mod + date << endl;
        if(mod + date < 5 && mod + date > 0)
        {
            cout << week[mod + date] << endl;
            //cout << "NUM" << mod + date << endl;
        }
        else if(mod + date <= 0)
        {
            cout << week[mod + date + 5] << endl;
            //cout << "NUM" << mod + date + 4 << endl;
        }
        else
        {
            if((mod + date) % 5 == 0)
                cout << week[5] << endl;
            else
                cout << week[(mod + date) % 5] << endl;
            //cout << "NUM" << (mod + date) % 5 << endl;
        }

    }
    return 0;
}

B

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

typedef long long ll;

int main()
{
    int T;
    ll n, k;  //操作初长 循环数
    string sequence;

    cin >> T;

    while(T--)
    {
        ll maxans = 0, tempx = 0, tempy = 0, tempans = 0;
        cin >> n >> k >> sequence;

        //第一次
        for(int i = 0;i < n;i++)
        {
            if(sequence[i] == 'U')
            {
                tempy++;
            }
            if(sequence[i] == 'D')
            {
                tempy--;
            }
            if(sequence[i] == 'L')
            {
                tempx--;
            }
            if(sequence[i] == 'R')
            {
                tempx++;
            }

            tempans = abs(tempx) + abs(tempy);
            if(tempans > maxans)
            {
                maxans = tempans;
            }
        }

        //最后一次
        tempx *= (k - 1);
        tempy *= (k - 1);

        for(int i = 0;i < n;i++)
        {
            if(sequence[i] == 'U')
            {
                tempy++;
            }
            if(sequence[i] == 'D')
            {
                tempy--;
            }
            if(sequence[i] == 'L')
            {
                tempx--;
            }
            if(sequence[i] == 'R')
            {
                tempx++;
            }

            tempans = abs(tempx) + abs(tempy);
            if(tempans > maxans)
            {
                maxans = tempans;
            }
        }

        cout << maxans << endl;
    }
    return 0;
}

C

#include <iostream>

using namespace std;

typedef long long ll;

ll buckets[100001] = {0};

int main()
{
    int T, n;             //扔是无条件的

    cin >> T;

    while(T--)
    {
        ll sum = 0, cnt = 0;
        cin >> n;
        for(int i = 0;i < n;i++)
        {
            cin >> buckets[i];
            sum += buckets[i];
        }

        sum /= n;

        for(int i = 0;i < n;i++)
        {
            if(buckets[i] > sum)
            {
                cnt += buckets[i] - sum;
            }
        }

        cout << cnt << endl;
    }
    return 0;
}

D

#include <iostream>

using namespace std;

typedef long long ll;

int main()
{
    ll n,                        //钱
       k;                        //死亡数
    int T;

    cin >> T;
    while(T--)
    {
        cin >> n >> k;

        if(n == 0)
        {
            cout << 0 << endl;
            continue;
        }

        for(int i = 0;i < k;i++)
        {
            if(n % 2 == 0)
                n /= 2;
            else
            {
                if(n == 1)
                    break;

                n = n / 2 + 1;   //向上取整
            }
        }

        cout << n << endl;


    }


    return 0;
}

E

#include <iostream>

using namespace std;

int main()
{
    int T,
        k,    //ÈËÊý
        n,    //¶¥µã
        m,    //±ß
        u,
        v,
        maxt;
    string peo;

    cin >> T;
    while(T--)
    {
        cin >> k >> peo >> n >> m;

        for(int i = 0;i < m;i++)
            cin >> u >> v;

        maxt = (m - (n - 1)) % k;

        if(peo[maxt] == '1')
            cout << 2 << endl;
        else
            cout << 1 << endl;
    }
    return 0;
}