#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 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 stlloop0(i,x) for(int i=0;i<x.size();i++)
#define stlloop1(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 PI 3.14159265358979323846264338328
#define MAX 10001
using namespace std;
vector<int>g[MAX],top;
int indeg[MAX];
map<string,int> mp;
int main()
{
CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int t,m;
cin>>t;
loop1(z,t)
{
cin>>m;
int c=1;
ms(indeg,0);
for(int i=0; i<m; i++)
{
string from,to;
cin>>from>>to;
if(mp[from]==0)
{
mp[from]=c;
c++;
}
if(mp[to]==0)
{
mp[to]=c;
c++;
}
g[mp[from]].pb(mp[to]);
indeg[mp[to]]++;
}
for(int i=1; i<=c-1; i++)
{
if(indeg[i]==0) top.pb(i);
}
for(int i=0; i<top.size(); i++)
{
int v=top[i];
for(int j=0; j<g[v].size(); j++)
{
int u=g[v][j];
indeg[u]--;
if(indeg[u]==0) top.pb(u);
}
}
if(top.size()==c-1) cout<<"Case "<<z<<": Yes"<<endl;
else cout<<"Case "<<z<<": No"<<endl;
loop0(i,MAX) g[i].clear();
top.clear();
mp.clear();
}
return 0;
}
Category UVa
Light OJ-1074 – Extended Traffic
#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;
}
UVa – 299 – Train Swapping
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i,t,j,m,n,c,sum;
cin>>t;
for(m=0;m<t;m++)
{
cin>>n;
sum=0;
int a[n];
for(i=0;i<n;i++) cin>>a[i];
c=0;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
swap(a[i],a[j]);
sum=sum+a[i]+a[j];
c++;
}
}
}
cout<<"Optimal train swapping takes "<<sum<<" swaps."<<endl;
cout<<c<<endl;
}
return 0;
}
UVa – 11799 – Horror Dash
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i,j,t,n,m;
cin>>t;
for(m=1;m<=t;m++)
{
cin>>n;
int a[n];
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j]) swap(a[i],a[j]);
}
}
cout<<"Case "<<m<<": "<<a[n-1]<<endl;
}
return 0;
}
UVa – 10327 – Flip Sort
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int i,j,m,n,c;
while(cin>>n)
{
long long int a[n];
for(i=0; i<n; i++) cin>>a[i];
c=0;
m=n-1;
while(m!=0)
{
for(i=0,j=1; i<m; i++,j++)
{
if(a[i]>a[j])
{
swap(a[i],a[j]);
c++;
}
}
m--;
}
cout<<"Minimum exchange operations : "<<c<<endl;
}
return 0;
}
Fall out, Codes! 