oj.uz

답안 #250214

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250214 2020-07-17T08:13:13 Z leaked Lozinke (COCI17_lozinke) C++14
100 / 100
 663 ms 55868 KB 
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=1e5+3;
const int M=1e9+7;

//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
int lol[12];
map<string,set<int>>mp;
signed main()
{
    fast_io;
    int n;
    cin>>n;
    vector<string>s(n);
    for(auto &z : s) cin>>z;
    for(int i=0;i<n;i++){
        //cout<<s[i]<<endl;
        for(int j=0;j<sz(s[i]);j++){
            for(int k=1;k+j<=sz(s[i]);k++){
                mp[s[i].substr(j,k)].insert(i);
               // mp[s[i].substr(j,k)]++;
               // cout<<j<<' '<<i<<' '<<k<<' '<<s[i].substr(j,k)<<endl;
            }
        }
    }
    int ans=0;
    //debug()<<imie(mp);
    int i=0;
    for(auto &z : s){
        mp[z].erase(i);
        ans+=sz(mp[z]);
          mp[z].insert(i);
        i++;
    }
    cout<<ans;
    return 0;
}
/*
    2 0 2 0 1
*/

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 11 ms 1920 KB Output is correct
6 Correct 18 ms 2560 KB Output is correct
7 Correct 23 ms 3960 KB Output is correct
8 Correct 38 ms 6392 KB Output is correct
9 Correct 141 ms 12408 KB Output is correct
10 Correct 276 ms 26520 KB Output is correct
11 Correct 299 ms 19872 KB Output is correct
12 Correct 639 ms 54008 KB Output is correct
13 Correct 544 ms 31220 KB Output is correct
14 Correct 425 ms 43000 KB Output is correct
15 Correct 663 ms 55868 KB Output is correct
16 Correct 529 ms 33160 KB Output is correct
17 Correct 172 ms 10384 KB Output is correct
18 Correct 93 ms 8440 KB Output is correct
19 Correct 540 ms 36516 KB Output is correct
20 Correct 246 ms 18424 KB Output is correct