oj.uz

답안 #259684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259684 2020-08-08T09:47:29 Z leaked Parametriziran (COCI19_parametriziran) C++14
77 / 110
 3000 ms 36336 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")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#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(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << 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
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) (int)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 = 2e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
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]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=5e2+2;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}
struct trie{
    struct node{
        node *a[27];int cnt;
        node(){
            for(int i=0;i<27;i++) a[i]=nullptr;
            cnt=0;
        }
    };
    node* root=new node();
    int nmb(char smb){
        if(smb=='?') return 26;
        return smb-'a';
    }
    void add(const string &s){
        node* cur=root;
        for(int i=0;i<sz(s);i++){
            int o=nmb(s[i]);
            if(!cur->a[o]) cur->a[o]=new node();
            cur=cur->a[o];
        }
        cur->cnt++;
    }
    int get(node* cur,int j,const string &s){
        int ans=0;
        if(j==sz(s)) return cur->cnt;
        if(s[j]=='?'){
            for(int i=0;i<27;i++){
                if(cur->a[i]) ans+=get(cur->a[i],j+1,s);
            }
            return ans;
        }else{
            ans+=(cur->a[26] ? get(cur->a[26],j+1,s) : 0);
            ans+=(cur->a[s[j]-'a'] ? get(cur->a[s[j]-'a'],j+1,s) : 0);
            return ans;
        }
    }
}T;

signed main()
{
    fast_io;
    int n,m;
    cin>>n>>m;
    string s;
    ll ans=0;
    for(int i=0;i<n;i++){
        cin>>s;
        ans+=T.get(T.root,0,s);
        T.add(s);
    }
    cout<<ans;
    return 0;
}
/*

*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 640 KB Output is correct
2 Correct 17 ms 640 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 640 KB Output is correct
2 Correct 14 ms 640 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 3576 KB Output is correct
2 Correct 163 ms 1400 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 199 ms 2808 KB Output is correct
2 Correct 688 ms 3960 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 14544 KB Output is correct
2 Correct 1659 ms 1784 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1208 ms 16504 KB Output is correct
2 Correct 2608 ms 2112 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 160 ms 23288 KB Output is correct
2 Execution timed out 3088 ms 5460 KB Time limit exceeded

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 22008 KB Output is correct
2 Execution timed out 3076 ms 2412 KB Time limit exceeded

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1389 ms 36336 KB Output is correct
2 Execution timed out 3086 ms 6452 KB Time limit exceeded