oj.uz

Submission #244976

# Submission time Handle Problem Language Result Execution time Memory
244976 2020-07-05T10:30:52 Z leaked Rima (COCI17_rima) C++14
56 / 140
 331 ms 150392 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
////////////////////////////////???????????????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 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); }
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 N=3e6+1;
const int M=1e9+7;
struct node{
    node* to[26];
    int c1=0,c2=0;
    node(){
        c1=0,c2=0;
        for(int i=0;i<26;i++) to[i]=nullptr;
    }
};
node* top=new node();
void add(string &s){
    node * cur=top;
    for(int i=0;i<sz(s)-1;i++){
        if(!cur->to[s[i]-'a']) cur->to[s[i]-'a']=new node();
        cur=cur->to[s[i]-'a'];
    }
    cur->c1++;
    if(!cur->to[s.back()-'a']){
        cur->to[s.back()-'a']=new node();
    }
    cur=cur->to[s.back()-'a'];
    cur->c2++;
}
int mx=0;
void go(node* cur,int ans){
    ans+=cur->c1;
    mx=max(mx,ans);
    for(int i=0;i<26;i++){
        if(cur->to[i]){
            if(cur->to[i]->c2){
                go(cur->to[i],ans);
            }
            else go(cur->to[i],0);
        }
    }
}
signed main(){
    fast_io;
    int n;
    cin>>n;
    vector<string>a(n);
    for(auto &z : a) cin>>z,reverse(all(z)),add(z);
    go(top,0);
    cout<<mx;
    return 0;
}
///stuff you should look for :
/*


	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* read the conditions carefully
	* WRITE STUFF DOWN
*/

Subtask #1
56.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 331 ms 150392 KB Output isn't correct
5 Correct 21 ms 4096 KB Output is correct
6 Incorrect 82 ms 76816 KB Output isn't correct
7 Incorrect 80 ms 76568 KB Output isn't correct
8 Incorrect 78 ms 76376 KB Output isn't correct
9 Incorrect 95 ms 82660 KB Output isn't correct
10 Incorrect 69 ms 76288 KB Output isn't correct