답안 #49905

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49905 2018-06-04T16:09:11 Z computerbox Lozinke (COCI17_lozinke) C++14
0 / 100
3 ms 516 KB
 //ID:computerbox --> Hajiyev Huseyn
#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);/*cin.tie(0); cout.tie(0);*/
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAXN 2000

using namespace std;



struct vertex
{
  set<ll>leaf;
  ll next[30];
};
ll sz;
vertex t[3000000];

void add_string(string stroka,ll index)
{
  ll v=0;
  for(ll i=0;i<(ll)stroka.size();i++)
  {
    char c=stroka[i]-'a';
    if(t[v].next[c]==-1)
    {
      memset(t[sz].next,255,sizeof t[sz].next);
      t[v].next[c]=sz++;
    }
    v=t[v].next[c];
    t[v].leaf.insert(index);
  
  }

}





ll find(string stroka)
{
  ll maxa=0;
  ll v=0;
  ll cnt=0;
  for(ll i=0;i<(ll)stroka.size();i++)
  {
    char c=stroka[i]-'a';
    if(t[v].next[c]==-1)return 0;
    v=t[v].next[c];
  
  }
  return (t[v].leaf.size()-1);
}
ll n;
vector<string>nuj;
string stroka;
string abc;
int main(){
FAST_READ;
cin.tie(0);
cin>>n;
for(ll i=0;i<=3000000;i++)
{
  memset(t[i].next,-1,sizeof t[i].next);
}
sz=1;
for(ll i=1;i<=n;i++)
{
  cin>>stroka;
  string neww="";
  for(ll j=0;j<(ll)stroka.size();j++)
  {
    neww="";
     for(ll jj=j;jj<(ll)stroka.size();jj++)
     {
      neww+=stroka[jj];
      //debt(neww,j);
      add_string(neww,i);
     }
  }

  nuj.pb(stroka);
}

ll cnt=0;
for(ll i=0;i<nuj.size();i++)
{
  ll ans=find(nuj[i]);
  cnt=cnt+ans;
}
cout<<cnt<<endl;



return 0;
} 

Compilation message

lozinke.cpp: In function 'void add_string(std::__cxx11::string, long long int)':
lozinke.cpp:43:19: warning: array subscript has type 'char' [-Wchar-subscripts]
     if(t[v].next[c]==-1)
                   ^
lozinke.cpp:46:18: warning: array subscript has type 'char' [-Wchar-subscripts]
       t[v].next[c]=sz++;
                  ^
lozinke.cpp:48:18: warning: array subscript has type 'char' [-Wchar-subscripts]
     v=t[v].next[c];
                  ^
lozinke.cpp: In function 'long long int find(std::__cxx11::string)':
lozinke.cpp:67:19: warning: array subscript has type 'char' [-Wchar-subscripts]
     if(t[v].next[c]==-1)return 0;
                   ^
lozinke.cpp:68:18: warning: array subscript has type 'char' [-Wchar-subscripts]
     v=t[v].next[c];
                  ^
lozinke.cpp:61:6: warning: unused variable 'maxa' [-Wunused-variable]
   ll maxa=0;
      ^~~~
lozinke.cpp:63:6: warning: unused variable 'cnt' [-Wunused-variable]
   ll cnt=0;
      ^~~
lozinke.cpp: In function 'int main()':
lozinke.cpp:105:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<nuj.size();i++)
            ~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 2 ms 256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 2 ms 276 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 1 ms 276 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 2 ms 276 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 2 ms 340 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 2 ms 400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 3 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 2 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 1 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 1 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 1 ms 436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 1 ms 516 KB Execution killed with signal 11 (could be triggered by violating memory limits)