D2. Submarine in the Rybinsk Sea (hard edition)

最新推荐文章于 2021-04-23 23:31:03 发布

newhonor

最新推荐文章于 2021-04-23 23:31:03 发布

阅读量187

点赞数

本文链接：https://blog.csdn.net/weixin_39132605/article/details/96475869

版权

http://codeforces.com/contest/1195/problem/D2

思路：记录长度；判断每个数的贡献；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e5+9;
const int maxm=4e5+9;
const int mod=998244353;

string s[maxn];

int num[20];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    ll ans=0;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>s[i];
        num[s[i].length()]++;
    }

    //for(int i=0;i<n;i++)cout<<s[i]<<endl;

    for(int i=0;i<n;i++)
    {
        int len=s[i].length();
        for(int j=1;j<=10;j++)
        {
            if(num[j])
            {
                if(len<=j)
                {
                    ll cnt=1;
                    ll tmp=0;
                    ll cnt2=10;
                    for(int k=len-1;k>=0;k--)
                    {
                        tmp=tmp+(s[i][k]-'0')*cnt%mod;
                        tmp%=mod;
                        cnt*=10;
                        cnt%=mod;
                        cnt*=10;
                        cnt%=mod;

                        tmp=tmp+(s[i][k]-'0')*cnt2%mod;
                        tmp%=mod;
                        cnt2*=10;
                        cnt2%=mod;
                        if(len-1-k<j-1)
                        {
                            cnt2*=10;
                            cnt2%=mod;
                        }

                    }
                    //cout<<s[i]<<" "<<tmp<<endl;
                    ans=ans+tmp*num[j]%mod;
                    ans%=mod;
                }
                else
                {
                    //cout<<j<<endl;
                    ll cnt=1;
                    ll tmp=0;
                    ll cnt2=10;
                    for(int k=len-1;k>=0;k--)
                    {
                        if(len-1-k<j)
                        {
                            tmp=tmp+(s[i][k]-'0')*cnt%mod;
                            tmp%=mod;
                            cnt*=10;
                            cnt%=mod;
                            cnt*=10;
                            cnt%=mod;

                            tmp=tmp+(s[i][k]-'0')*cnt2%mod;
                            tmp%=mod;
                            cnt2*=10;
                            cnt2%=mod;
                            if(len-1-k<j-1)
                            {
                                cnt2*=10;
                                cnt2%=mod;
                            }


                        }
                        else
                        {
                            //cout<<cnt<<" "<<cnt2<<endl;
                            tmp=tmp+(s[i][k]-'0')*cnt%mod;
                            tmp%=mod;
                            cnt*=10;
                            cnt%=mod;

                            tmp=tmp+(s[i][k]-'0')*cnt2%mod;
                            tmp%=mod;
                            cnt2*=10;
                            cnt2%=mod;
                        }

                    }
                    ans=ans+tmp*num[j]%mod;
                    ans%=mod;
                }
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}