Category Light OJ

Light OJ-1074 – Extended Traffic

Arunima Mandal Leave a comment 
#include <bits/stdc++.h>

#define ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case(z,x)       cout<<"Case "<<i<<": "<<x<<endl
#define case(z)         cout<<"Case "<<z<<": "
#define PI              3.14159265358979323846264338328
#define valid(tx,ty)    tx>=0 && tx<r && ty>=0 && ty<c
#define MAX             300
#define inf             10000000

/*---------------------------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
/*------------------------------------------------------------------*/

using namespace std;

int dis[MAX],parent[MAX];
vector<int>gu,gv,cost;
int node,edge;
map <int, int> mp;

bool bellman_ford()
{
    loop0(i,MAX) dis[i]=inf;
    dis[1]=0;
    loop1(i,node)
    {
        bool change=0;
        loop0(j,edge)
        {
            int u=gu[j];
            int v=gv[j];
            if(dis[u]+cost[j]<dis[v])
            {
                change=1;
                dis[v]=dis[u]+cost[j];
            }
        }
        if(change==0) return 1;
    }
}

int main()
{
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    int n_cost,t;
    cin>>t;
    loop1(z,t)
    {
        cin>>node;
        loop1(i,node)
        {
            cin>>n_cost;
            mp[i]=n_cost;
        }
        cin>>edge;
        loop0(i,edge)
        {
            int from,to,w;
            cin>>from>>to;
            gu.pb(from);
            gv.pb(to);
            w=mp[to]-mp[from];
            cost.pb(w*w*w);
        }
        int q,n;
        cin>>q;
        cout<<"Case "<<z<<":"<<endl;
        int a=bellman_ford();
        loop0(i,q)
        {
            cin>>n;
            if(dis[n]<3 || dis[n]>100000) cout<<"?"<<endl;
            else cout<<dis[n]<<endl;
        }
        gu.clear();
        gv.clear();
        cost.clear();
        mp.clear();
    }
    return 0;
}

Light OJ-1249 – Chocolate Thief

Arunima Mandal Leave a comment 
#include <bits/stdc++.h>

#define pf              printf
#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 ms(a,b)         memset(a,b,sizeof(a))
#define pb(a)           push_back(a)
#define db              double
#define ft              float
#define ll              long long
#define ull             unsigned long long
#define ff              first
#define ss              second
#define sz(x)           x.size()
#define qu              queue
#define pqu             priority_queue
#define vc              vector
#define vi              vector<int>
#define vll             vector<long long>
#define pii             pair<int,int>
#define pis             pair<int,string>
#define psi             pair<string,int>
#define all(x)          x.begin(),x.end()
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define loop0(i,n)      for(int i=0;i<n;i++)
#define loop1(i,n)      for(int i=1;i<=n;i++)
#define stlloop(x)     for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b)       __gcd(a, b)
#define lcm(a, b)       ((a)*((b)/gcd(a,b)))
#define case1(z)         cout<<"Case "<<z<<": "
#define case2(z,x)       cout<<"Case "<<z<<": "<<x<<endl
#define PI              3.14159265358979323846264338328
#define valid(tx,ty)    tx>=0 && tx<r && ty>=0 && ty<c
#define intlim          2147483648
#define MAX             2000
#define inf             10000000

/*------------------------------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
/*---------------------------------------------------------------------*/

using namespace std;

vector<pair<int,string> > v;

int main()
{
    CIN;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    cin>>t;
    loop1(z,t)
    {
        int n,a=-inf,b=inf;
        cin>>n;
        loop0(i,n)
        {
            string s;
            cin>>s;
            int x,y,z;
            cin>>x>>y>>z;
            x=x*y*z;
            v.push_back(make_pair(x,s));
            a=max(a,x);
            b=min(b,x);
        }
        sort(all(v));
        if(a!=b)
        {
            cout<<"Case "<<z<<": "<<v[n-1].ss<<" took chocolate from "<<v[0].ss<<endl;
        }
        else cout<<"Case "<<z<<": no thief"<<endl;
        v.clear();
    }
    return 0;
}