oj.uz

답안 #867114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867114 2023-10-27T17:01:58 Z HoriaHaivas Parametriziran (COCI19_parametriziran) C++14
99 / 110
 997 ms 65536 KB 
/*
    "care a facut teste cu Lattice reduction attack e ciudat"
    "linistiti va putin"
    - 2023 -
*/
#include<bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
 
using namespace std;
 
const int mod=1e9+9;
const int base=29;
 
unordered_map<int,unsigned short int> hashcount[(1<<6)];
 
int main()
{
    ifstream fin(".in");
    ofstream fout(".out");
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int i,j,n,m,ans,mask,hashbuild,mask2;
    string s;
    bool ok;
    cin >> n >> m;
    ans=0;
    for (j=1; j<=n; j++)
    {
        cin >> s;
        for (i=0; i<s.size(); i++)
        {
            if (s[i]=='?')
                s[i]='{';///urmatorul caracter dupa z
        }
        for (mask=1; mask<(1<<(m)); mask++)
        {
            hashbuild=0;
            for (i=0; i<s.size(); i++)
            {
                if (mask&(1<<i))
                    hashbuild=((hashbuild*base)%mod+(s[i]-'a'+1))%mod;
            }
            hashcount[mask][hashbuild]++;
        }
        mask=0;
        for (i=0; i<s.size(); i++)
        {
            if (s[i]!='{')
            {
                mask=mask|(1<<i);
            }
        }
        if (mask!=0)
        {
            for (mask2=0; mask2<=mask; mask2++)
            {
                ok=true;
                for (i=0; i<s.size() && ok; i++)
                {
                    if ((mask2&(1<<i)) && !(mask&(1<<i)))
                        ok=false;
                }
                if (ok)
                {
                    hashbuild=0;
                    for (i=0; i<s.size(); i++)
                    {
                        if (mask&(1<<i))
                        {
                            if (mask2&(1<<i))
                                hashbuild=((hashbuild*base)%mod+('{'-'a'+1))%mod;
                            else
                                hashbuild=((hashbuild*base)%mod+(s[i]-'a'+1))%mod;
                        }
                    }
                    ans+=hashcount[mask][hashbuild];
                }
            }
        }
        else
        {
            ans+=j;
        }
    }
    cout << ans-n;
    return 0;
}

Compilation message

parametriziran.cpp: In function 'int main()':
parametriziran.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for (i=0; i<s.size(); i++)
      |                   ~^~~~~~~~~
parametriziran.cpp:41:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for (i=0; i<s.size(); i++)
      |                       ~^~~~~~~~~
parametriziran.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (i=0; i<s.size(); i++)
      |                   ~^~~~~~~~~
parametriziran.cpp:61:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |                 for (i=0; i<s.size() && ok; i++)
      |                           ~^~~~~~~~~
parametriziran.cpp:69:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |                     for (i=0; i<s.size(); i++)
      |                               ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 348 KB Output is correct
2 Correct 8 ms 348 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 980 KB Output is correct
2 Correct 9 ms 600 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 852 KB Output is correct
2 Correct 29 ms 1628 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 6412 KB Output is correct
2 Correct 33 ms 860 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 15820 KB Output is correct
2 Correct 37 ms 1616 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 422 ms 29936 KB Output is correct
2 Correct 155 ms 14020 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 997 ms 57216 KB Output is correct
2 Correct 93 ms 3216 KB Output is correct

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 876 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -