oj.uz

답안 #697184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697184 2023-02-08T17:40:23 Z bin9638 Raspad (COI17_raspad) C++17
61 / 100
 6000 ms 43468 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

#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("omit-frame-pointer")
#pragma GCC optimize("unroll-loops")

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

struct haha
{
    int val=0,sum=0,sl=0;
    int32_t cnt[52]={},id[52]={},ktr[52]={};

    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)
    {
        ktr[u]=times;
        if(ktr[u-1]==0&&a[row][u-1]==1)
            DFS(u-1);
        if(ktr[u+1]==0&&a[row][u+1]==1)
            DFS(u+1);
        for(int i=1;i<=m;i++)
            if(ktr[i]==0&&id[i]==id[u])
                DFS(i);
    }

    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++)
            if(id[i]!=0&&id[i]<=m)
                cnt[id[i]]=0;
        for(int i=1;i<=m;i++)
            if(cnt[i]>0)
                sum+=sl;
        dem=0;
        row=h;
        memset(ktr,0,sizeof(ktr));
        for(int i=1;i<=m;i++)
            if(ktr[i]==0&&id[i]!=0)
            {
                times=++dem;
                DFS(i);
            }
        for(int i=1;i<=m;i++)
            id[i]=ktr[i];
        val=get(1e9+8277);
    }

    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;
    }

};
vector<haha>s,luu,vec;
vector<ii>SS;

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]=rand()%2;
            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);
        SS.clear();
        for(int j=0;j<s.size();j++)
            SS.pb({s[j].val,j});
        sort(SS.begin(),SS.end());
        vec.clear();
        for(int j=0;j<s.size();j++)
             vec.pb(s[SS[j].sc]);
        s=vec;
        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;
        for(auto cc:s)
            ans+=cc.sum+cc.solve()*cc.sl;
    }
    cout<<ans;
    return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 33 ms 724 KB Output is correct
10 Correct 9 ms 732 KB Output is correct
11 Correct 22 ms 724 KB Output is correct
12 Correct 24 ms 752 KB Output is correct
13 Correct 19 ms 744 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 21856 KB Output is correct
2 Correct 230 ms 43376 KB Output is correct
3 Correct 469 ms 43392 KB Output is correct
4 Correct 117 ms 39068 KB Output is correct
5 Correct 63 ms 13268 KB Output is correct
6 Correct 287 ms 43468 KB Output is correct
7 Correct 354 ms 43396 KB Output is correct
8 Correct 207 ms 34780 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 33 ms 724 KB Output is correct
10 Correct 9 ms 732 KB Output is correct
11 Correct 22 ms 724 KB Output is correct
12 Correct 24 ms 752 KB Output is correct
13 Correct 19 ms 744 KB Output is correct
14 Correct 82 ms 21856 KB Output is correct
15 Correct 230 ms 43376 KB Output is correct
16 Correct 469 ms 43392 KB Output is correct
17 Correct 117 ms 39068 KB Output is correct
18 Correct 63 ms 13268 KB Output is correct
19 Correct 287 ms 43468 KB Output is correct
20 Correct 354 ms 43396 KB Output is correct
21 Correct 207 ms 34780 KB Output is correct
22 Correct 752 ms 34776 KB Output is correct
23 Correct 3775 ms 43400 KB Output is correct
24 Correct 3682 ms 43408 KB Output is correct
25 Correct 819 ms 43380 KB Output is correct
26 Correct 760 ms 43376 KB Output is correct
27 Correct 983 ms 43380 KB Output is correct
28 Correct 2518 ms 43404 KB Output is correct
29 Correct 1462 ms 43388 KB Output is correct
30 Correct 492 ms 43368 KB Output is correct
31 Execution timed out 6031 ms 43340 KB Time limit exceeded
32 Halted 0 ms 0 KB -