oj.uz

답안 #697185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697185 2023-02-08T17:57:31 Z bin9638 Raspad (COI17_raspad) C++17
61 / 100
 6000 ms 43540 KB 
#include<bits/stdc++.h>

using namespace std;
#define N  100010
#define ll long long
#define ii pair<int,int>
#define fs first
#define sc second
#define pb push_back
#define iii pair<int,ii>
#define int ll

int f[N],a[N][55],n,m;

struct haha
{
    int val=0,sum=0,sl=0,cnt[55]={},id[55]={},ktr[55]={};
    vector<int>lis[55];

    int get(int mod)
    {
        int res=0;
        for(int i=1;i<=m;i++)
            res=(res+f[i]%mod*id[i])%mod;
        return res;
    }

    void DFS(int u,int dem,int h)
    {
        ktr[u]=dem;
        if(ktr[u-1]==0&&a[h][u-1]==1)
            DFS(u-1,dem,h);
        if(ktr[u+1]==0&&a[h][u+1]==1)
            DFS(u+1,dem,h);
        if(id[u]<=m)
        {
            while(!lis[id[u]].empty())
            {
                int i=lis[id[u]].back();
                lis[id[u]].pop_back();
                if(ktr[i]==0)
                    DFS(i,dem,h);
            }
        }
    }

    void build(int h)
    {
        memset(cnt,0,sizeof(cnt));
        for(int i=1;i<=m;i++)
            if(id[i]!=0)
                cnt[id[i]]=1;
        int dem=m+1;
        for(int i=1;i<=m;i++)
            if(a[h][i]==0)
                id[i]=0;
                else{
                    if(id[i]==0)
                        id[i]=++dem;
                }
        for(int i=1;i<=m;i++)
            lis[i].clear();
        for(int i=1;i<=m;i++)
            if(id[i]!=0&&id[i]<=m)
            {
                cnt[id[i]]=0;
                lis[id[i]].pb(i);
            }
        for(int i=1;i<=m;i++)
            if(cnt[i]>0)
                sum+=sl;
        dem=0;
        memset(ktr,0,sizeof(ktr));
        for(int i=1;i<=m;i++)
            if(ktr[i]==0&&id[i]!=0)
            {
                dem++;
                DFS(i,dem,h);
            }
        for(int i=1;i<=m;i++)
            id[i]=ktr[i];
        val=get(1e9+8277)*1e9+get(1e9+9277);
    }

    int solve()
    {
        memset(cnt,0,sizeof(cnt));
         for(int i=1;i<=m;i++)
            if(id[i]!=0)
                cnt[id[i]]=1;
        int res=0;
        for(int i=1;i<=m;i++)
            if(cnt[i]!=0)
                res++;
        return res;
    }

    bool operator<(const haha&A)const
    {
        return val<A.val;
    }
};
vector<haha>s,luu;

int32_t main()
{
   //freopen("A.inp","r",stdin);
  //  freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        s=" "+s;
        for(int j=1;j<=m;j++)
        {
            a[i][j]=(s[j]-'0');
          ///  cout<<i<<" "<<j<<" "<<a[i][j]<<endl;
        }
    }
    for(int i=1;i<=m;i++)
        f[i]=1ll*rand()*rand()*rand();
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        s.emplace_back();
        s.back().sl=1;
        for(int j=0;j<s.size();j++)
            s[j].build(i);
        sort(s.begin(),s.end());
        luu.clear();
        while(!s.empty())
        {
            haha cc=s.back();
            s.pop_back();
            if(!s.empty()&&s.back().val==cc.val)
            {
                s.back().sum+=cc.sum;
                s.back().sl+=cc.sl;
            }else
            {
                luu.pb(cc);
            }
        }
        s=luu;
          //cout<<i<<endl;
        // for(auto cc:s)
         {
             //cout<<cc.val<<" "<<cc.sum<<" "<<cc.sl<<" "<<cc.solve()<<endl;
           //  for(int i=1;i<=m;i++)cout<<cc.id[i]<<" ";cout<<endl;
         }
        for(auto cc:s)
            ans+=cc.sum+cc.solve()*cc.sl;
       // cout<<ans<<endl;
    }
    cout<<ans;
    return 0;
}

Compilation message

raspad.cpp: In function 'int32_t main()':
raspad.cpp:131:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<haha>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int j=0;j<s.size();j++)
      |                     ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 7 ms 768 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 9 ms 724 KB Output is correct
11 Correct 18 ms 852 KB Output is correct
12 Correct 40 ms 852 KB Output is correct
13 Correct 18 ms 788 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 21864 KB Output is correct
2 Correct 393 ms 43400 KB Output is correct
3 Correct 801 ms 43424 KB Output is correct
4 Correct 286 ms 39076 KB Output is correct
5 Correct 117 ms 13268 KB Output is correct
6 Correct 495 ms 43424 KB Output is correct
7 Correct 1197 ms 43448 KB Output is correct
8 Correct 414 ms 34892 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 7 ms 768 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 9 ms 724 KB Output is correct
11 Correct 18 ms 852 KB Output is correct
12 Correct 40 ms 852 KB Output is correct
13 Correct 18 ms 788 KB Output is correct
14 Correct 166 ms 21864 KB Output is correct
15 Correct 393 ms 43400 KB Output is correct
16 Correct 801 ms 43424 KB Output is correct
17 Correct 286 ms 39076 KB Output is correct
18 Correct 117 ms 13268 KB Output is correct
19 Correct 495 ms 43424 KB Output is correct
20 Correct 1197 ms 43448 KB Output is correct
21 Correct 414 ms 34892 KB Output is correct
22 Correct 686 ms 34816 KB Output is correct
23 Correct 2818 ms 43484 KB Output is correct
24 Correct 2593 ms 43540 KB Output is correct
25 Correct 691 ms 43420 KB Output is correct
26 Correct 922 ms 43400 KB Output is correct
27 Correct 1070 ms 43424 KB Output is correct
28 Correct 2393 ms 43528 KB Output is correct
29 Correct 1162 ms 43464 KB Output is correct
30 Correct 549 ms 43380 KB Output is correct
31 Execution timed out 6060 ms 43536 KB Time limit exceeded
32 Halted 0 ms 0 KB -