oj.uz

답안 #928053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928053 2024-02-15T19:34:10 Z xad Lozinke (COCI17_lozinke) C++14
25 / 100
 120 ms 2136 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nn "\n"
#define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define intt int _; cin >> _; while (_--)
#define emp push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ld long double
#define A first
#define B second
typedef long long ll;
const ld eps = 1e-27;
// diff between decimals 0.000000001 mt19937 mt(time(nullptr));
int fx[]={1,-1,0,0}, fy[]={0,0,1,-1};

int main() {
    /*freopen("measurement.in","r",stdin);
    freopen("measurement.out","w", stdout);*/

    x_x
    int n; cin>>n; string ar[n]; map<string,int>mp;
    for (auto&i:ar) cin>>i, mp[i]++;
    ll ans=0;
    for (int i=0; i<n; i++ ){
            mp[ar[i]]--;
        for (int j=1; j<=ar[i].size(); j++) {
            for (int k=0; (k+j)<=ar[i].size(); k++) {
                if (mp.find(ar[i].substr(k,j))!=mp.end()) ans+=mp[ar[i].substr(k,j)];
            }
        }
        ++mp[ar[i]];
    }
    cout<<ans;
   return 0;
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:31:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int j=1; j<=ar[i].size(); j++) {
      |                       ~^~~~~~~~~~~~~~
lozinke.cpp:32:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for (int k=0; (k+j)<=ar[i].size(); k++) {
      |                           ~~~~~^~~~~~~~~~~~~~

Subtask #1
25.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Incorrect 4 ms 348 KB Output isn't correct
6 Incorrect 7 ms 344 KB Output isn't correct
7 Incorrect 8 ms 604 KB Output isn't correct
8 Correct 8 ms 600 KB Output is correct
9 Incorrect 47 ms 1196 KB Output isn't correct
10 Correct 48 ms 1116 KB Output is correct
11 Incorrect 75 ms 1628 KB Output isn't correct
12 Correct 92 ms 1628 KB Output is correct
13 Incorrect 120 ms 2068 KB Output isn't correct
14 Incorrect 98 ms 2136 KB Output isn't correct
15 Correct 107 ms 2136 KB Output is correct
16 Incorrect 100 ms 1112 KB Output isn't correct
17 Correct 23 ms 1112 KB Output is correct
18 Incorrect 24 ms 860 KB Output isn't correct
19 Incorrect 101 ms 1884 KB Output isn't correct
20 Incorrect 76 ms 1112 KB Output isn't correct