oj.uz

답안 #636645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
636645 2022-08-29T21:07:15 Z Mr_Ph Lozinke (COCI17_lozinke) C++14
0 / 100
 3 ms 340 KB 
///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void bla()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("notsus.txt","w",stdout);
#endif
}
ll power(ll x,ll y)
{
    if(y==0)
        return 1;
    if(y==1)
        return x%mod;
    ll r=power(x%mod,(y%mod)/2)%mod;
    if(y%2)
        return ((r%mod)*(r%mod)*(x%mod));
    else
        return ((r%mod)*(r%mod));
}
ll lcm(ll a,ll b)
{
    return max(a,b)/__gcd(a,b)*min(a,b);
}
void preprocess(){}
void solve()
{
  int n;
  cin>>n;
  vector<string>arr(n);
  ent(arr);
  sort(all(arr));
  map<string,int>mp;
  int ans=0;
  for(int i=0;i<n;i++)mp[arr[i]]++;
  for(int i=0;i<n;i++)
  {
    mp[arr[i]]--;
    bool valid=true;
    set<string>st;
            for(int k=0; k<arr[i].sz; k++)
        {
            string c;
            for(int e=k; e<arr[i].sz; e++)
            {
                c+=arr[i][e];
        st.insert(c);
            }
        }
    for(auto i:st)
    {
      ans+=mp[i];
      //cout<<i<<" "<<mp[i]<<endl;
    }
    //cout<<"goodbye"<<endl;
    mp[arr[i]]++;
  }
  cout<<ans<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Compilation message

lozinke.cpp: In function 'void solve()':
lozinke.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
lozinke.cpp:52:3: note: in expansion of macro 'ent'
   52 |   ent(arr);
      |   ^~~
lozinke.cpp:62:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for(int k=0; k<arr[i].sz; k++)
      |                           ^
lozinke.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |             for(int e=k; e<arr[i].sz; e++)
      |                           ^
lozinke.cpp:60:10: warning: unused variable 'valid' [-Wunused-variable]
   60 |     bool valid=true;
      |          ^~~~~
lozinke.cpp: In function 'void bla()':
lozinke.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen("input.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
lozinke.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen("notsus.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Incorrect 2 ms 340 KB Output isn't correct
3 Incorrect 2 ms 340 KB Output isn't correct
4 Incorrect 2 ms 340 KB Output isn't correct
5 Incorrect 2 ms 340 KB Output isn't correct
6 Incorrect 2 ms 340 KB Output isn't correct
7 Incorrect 2 ms 340 KB Output isn't correct
8 Incorrect 2 ms 340 KB Output isn't correct
9 Incorrect 2 ms 340 KB Output isn't correct
10 Incorrect 3 ms 340 KB Output isn't correct
11 Incorrect 2 ms 340 KB Output isn't correct
12 Incorrect 2 ms 340 KB Output isn't correct
13 Incorrect 2 ms 340 KB Output isn't correct
14 Incorrect 2 ms 340 KB Output isn't correct
15 Incorrect 2 ms 340 KB Output isn't correct
16 Incorrect 2 ms 340 KB Output isn't correct
17 Incorrect 2 ms 340 KB Output isn't correct
18 Incorrect 2 ms 340 KB Output isn't correct
19 Incorrect 2 ms 340 KB Output isn't correct
20 Incorrect 2 ms 340 KB Output isn't correct