ICPC 2019 银川

2019银川

N

签到

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

int main()
{
    printf("1 1 2 3 5");
    return 0;
}

B

逆向模拟加数的过程，把与-1无关的行和列全部划归为0。剩下行列其中一个元素之和就是答案

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
const int MAXN = 1005;
int a[MAXN][MAXN], row[MAXN], col[MAXN];
int n, sr, sc;

int main()
{
    memset(row, 0x3f, sizeof(row));
    memset(col, 0x3f, sizeof(col));
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            scanf("%d", &a[i][j]);
            if(a[i][j] == -1)
            {
                sr = i, sc = j;
            }
        }
    }

    for(int i = 1; i <= n; i++)
    {
        if(i != sr)
        {
            for(int j = 1; j <= n; j++)
            {
                row[i] = min(row[i], a[i][j]);
            }
        }
    }

    for(int i = 1; i <= n; i++)
    {
        if(i != sr)
        {
            for(int j = 1; j <= n; j++)
            {
                a[i][j] -= row[i];
            }
        }
    }

    for(int j = 1; j <= n; j++)
    {
        if(j != sc)
        {
            for(int i = 1; i <= n; i++)
            {
                col[j] = min(col[j], a[i][j]);
            }
        }
    }

    for(int j = 1; j <= n; j++)
    {
        if(j != sc)
        {
            for(int i = 1; i <= n; i++)
            {
                a[i][j] -= col[j];
            }
        }
    }

    int ans1 = (sr == 1 ? 2 : 1);
    int ans2 = (sc == 1 ? 2 : 1);

    int ans = a[sr][ans1] + a[ans2][sc];
    printf("%d\n", ans);

    return 0;
}

I

给定两个进制，进制之间互相转化。

讲a进制下表示的数。每次除以b进制，如果有余数就往后加上余数$r\ast a$。模拟一个竖式除法

内存超限：原因是没有把除完之后的前导零去除，pop_back()

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include<vector>

using namespace std;
int a, b;
char al[130];
vector<int>ans, num;

char solve2(int x)
{
    if(0 <= x && x <= 9) return char(x - 0 + '0');
    else if(x >= 10 && x <= 35) return char(x - 10 + 'A');
    else return char(x - 36 + 'a');
}

int solve(char x)
{
    if('0' <= x && x <= '9') return x - '0';
    else if('a' <= x && x <= 'z') return x - 'a' + 36;
    else return x - 'A' + 10;
}

int main()
{
    scanf("%d%d", &a, &b);
    cin >> al;
    for(int i = 0; i < strlen(al); i++) num.push_back(solve(al[i]));
    int id = 0;
    reverse(num.begin(), num.end());
    while(num.size())
    {
        int r = 0;
        for(int i = num.size() - 1; i >= 0; i--)
        {
            num[i] += a * r;
            r = num[i] % b;
            num[i] = num[i] / b;
        }
        ans.push_back(r);
        while(num.size() && num.back() == 0) num.pop_back();
    }
    reverse(ans.begin(), ans.end());
    for(int i = 0; i < ans.size(); i++) printf("%c", solve2(ans[i]));
    printf("\n");

    return 0;
}

// 16 3 BC

F

求：${\sum }_{a=2}^n(a\ast {\sum }_{b=a}^n\lfloor lo{g}_a(b)\rfloor )$

分块+推公式：

对于$[2,sqrt(n)]$的部分，暴力解决，复杂度为$O(sqrt(n)\ast log(sqrt(n)))$

对于$[sqrt(n),n]$的部分
$$\sum _{a=sqrt(n)}^n(a\ast (n-a+1))=(n+1)\sum _{a=sqrt(n)}^{n}a-\sum _{a=sqrt(n)}^n{a}^2$$
推公式可以$O(1)$解决。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;

const ll mod = 998244353;
ll n;

ll qpow(ll x,ll m)
{
    ll res = 1;
    while(m)
    {
        if(m & 1)res = (res * x) % mod;
        x = x * x % mod;
        m >>= 1;
    }
    return res;
}

ll solve(ll x)
{
    ll x1 = (1 + x) * x % mod * qpow(2,mod - 2) % mod * (n % mod + 1) % mod;
    ll x2 = x * (1 + x) % mod * (2 * x % mod + 1) % mod * qpow(6,mod - 2) % mod;
    return (x1 - x2 + mod) % mod;
}

int main()
{
    scanf("%lld",&n);
    ll mx = sqrt(n) + 1;
    ll ans = 0;
    for(int i = 2;i <= mx;i++)
    {
        ll cnt = 1,k = i;
        for(ll j = i;j <= n;j = k)
        {
            k *= i;
            if(k <= n + 1)
            {
                ans = (ans + (k - j) % mod * i % mod * cnt % mod) % mod;
            }
            else
            {
                ans = (ans + (n + 1 - j) % mod * i % mod * cnt % mod) % mod;
            }
            cnt++;
        }
    }


    printf("%lld\n",(ans + solve(n % mod) - solve(mx % mod) + mod) % mod);
    return 0;
}