oj.uz

답안 #929170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
929170 2024-02-17T19:39:39 Z Zena_Hossam Lozinke (COCI17_lozinke) C++14
25 / 100
 321 ms 16696 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double
#define ll long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int main()
{
    // freopen("maxcross.in","r",stdin);freopen("maxcross.out","w",stdout);

    ll T=1;
    //cin>>T;ll oo=0;
    while(T--)
    {
        ll n;
        cin>>n;
        string a[n];
        map<string,ll>m,d;
        for(ll i=0; i<n; i++)
        {
            cin>>a[i];
            string e="";
            for(ll j=0; j<a[i].sz; j++)
            {
                e+=a[i][j];
                d[e]=1;
            }
            m[a[i]]++;
        }
        ll c=0;
        for(ll i=0; i<n; i++)
        {
            for(ll j=0; j<a[i].sz; j++)
            {
                string e="";
                for(ll o=j;o<a[i].sz;o++){
                    e+=a[i][o];
                    c+=m[e]-(e==a[i]);
                    if(!d[e])break;
                }
            }
        }
        cout<<c;
    }
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:27:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             for(ll j=0; j<a[i].sz; j++)
      |                          ^
lozinke.cpp:37:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for(ll j=0; j<a[i].sz; j++)
      |                          ^
lozinke.cpp:40:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 for(ll o=j;o<a[i].sz;o++){
      |                             ^

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Incorrect 6 ms 860 KB Output isn't correct
6 Incorrect 11 ms 860 KB Output isn't correct
7 Incorrect 14 ms 1624 KB Output isn't correct
8 Correct 19 ms 2396 KB Output is correct
9 Incorrect 67 ms 3364 KB Output isn't correct
10 Correct 123 ms 8168 KB Output is correct
11 Incorrect 115 ms 5984 KB Output isn't correct
12 Correct 276 ms 15424 KB Output is correct
13 Incorrect 213 ms 4448 KB Output isn't correct
14 Incorrect 226 ms 16044 KB Output isn't correct
15 Correct 321 ms 16696 KB Output is correct
16 Incorrect 183 ms 1324 KB Output isn't correct
17 Correct 62 ms 860 KB Output is correct
18 Incorrect 41 ms 1032 KB Output isn't correct
19 Incorrect 227 ms 10328 KB Output isn't correct
20 Incorrect 101 ms 1112 KB Output isn't correct