Light OJ: 1114 – Easily Readable

0

Problem Link : http://lightoj.com:81/volume/problem/1114


#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<":"<<endl
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

map<string,int>mp;
char s1[200],s2[100005];

int main()
{


//    freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int t;

    sf(t);
    TEST_CASE(t)
    {
        int n;
        sf(n);
        getchar();
        loop(i,n)
        {
            sc("%s",s1);
            int l=strlen(s1);
            string str(s1,s1+l);
            if(SZ(str)>3)
                sort(str.begin()+1,str.end()-1);
            mp[str]++;
        }

        sf(n);

        getchar();

        PRINT_CASE;

        for(int i=0; i<n; i++)
        {
            ll ans=1;
            gets(s2);
            int l=strlen(s2);
            string str(s2,s2+l);
            stringstream ss;
            ss<<str;
            while(ss>>str)
            {
                if(SZ(str)>3)
                    sort(str.begin()+1,str.end()-1);
                ans*=mp[str];
            }
            pf("%lld\n",ans);

        }

        mp.clear();
    }

    return 0;
}


Light OJ: 1129 – Consistency Checker

0

Problem Link : http://lightoj.com:81/volume/problem/1129


#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

struct trie
{
    int stop;
    trie *next[10];
    trie()
    {
        stop=0;
        for(int i=0;i<10;i++)
            next[i]=NULL;
    }
} *root;

bool insert(string str,trie *cur)
{
    int l=SZ(str);
    bool test=0;
    for(int i=0;i<l;i++)
    {
        int now=str[i]-'0';
        if(cur->next[now]==NULL)
        {
            cur->next[now]=new trie();
        }
        if(cur->stop)
        {
            test=1;
            break;
        }
        cur=cur->next[now];
    }
    cur->stop=1;
    return test;
}

void del(trie *cur)
{
    for(int i=0;i<10;i++)
    {
        if(cur->next[i])
            del(cur->next[i]);
    }
    delete (cur);
}

int main()
{

    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    int t;
    cin>>t;
    TEST_CASE(t)
    {
        root = new (trie);
        int n;
        cin>>n;
        string str;
        vector<string>v;
        for(int i=0;i<n;i++)
        {
            cin>>str;
            v.pb(str);
        }

        sort(all(v));

        bool test=0;

        for(int i=0;i<n;i++)
        {
            test=insert(v[i],root);
            if(test) break;
        }
        PRINT_CASE;

        if(test)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
        del(root);
    }


    return 0;
}

UVa 11362 – Phone List

0

/*
User ID: turing_13
Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2347
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d:\n",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

char data[20];
bool ans=0;

struct node
{
    bool endmark;
    node *ara[10];
    node()
    {
        endmark=0;
        for(int i=0; i<10; i++)
            ara[i]=NULL;
    }
}*root;

void insert(string str, int len)
{
    node *cur=root;
    for(int i=0;i<len;i++)
    {
        int indx=str[i]-'0';
        if(cur->ara[indx]==NULL)
            cur->ara[indx]=new node();
        cur=cur->ara[indx];
        if(cur->endmark)
                ans=1;
    }
    cur->endmark=1;
}


void del(node *cur)
{
    for(int i=0;i<10;i++)
    {
        if(cur->ara[i])
            del(cur->ara[i]);
    }
    delete (cur);
}

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int t;
    getint(t);
    vector<string>v;
    TEST_CASE(t)
    {
        root=new node();
        int n;
        getint(n);
        getchar();
        loop(i,n)
        {
            string str;
            cin>>str;
            v.pb(str);
        }
        sort(all(v));
        loop(i,n)
        {
            insert(v[i],SZ(v[i]));
        }
        if(ans)
            cout<<"NO\n";
        else
            cout<<"YES\n";
        ans=0;
        del(root);
        v.clear();
    }
    return 0;
}