Scheduling – Live with passion

872

Asif NaeemMarch 22, 2015

#include <iostream>
#include <string>
#include <sstream>
#include <fstream>
#include <queue>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

int noOfelement;
int mp[26];
string str,str1,str2;
string output[2000];
int kk;
bool gr[27][27];
stringstream ss;
int elements[26];
set<string> SET;
//ofstream out;

bool check(int elemnt,bool visit[])
{
	for(int i=0;i<26;i++)
	{
		if(gr[i][elemnt] && mp[i]!=-1 && visit[mp[i]]==0)
		return 0;
	}
	return 1;
}

int recur(bool used[],string s)
{
	if(s.size()==noOfelement)
	{
		output[kk++]=s;
		return 0;
	}

	for(int i=0;i<noOfelement;i++)
	{
		if(used[i]==0 && check(elements[i],used)==1)
		{
			used[i]=1;
			s.append(1u,char(elements[i]+'A'));
			recur(used,s);
			s.erase(s.begin()+(s.size()-1));
			used[i]=0;
		}
	}
	return 0;
}

void topologicalsort()
{
	bool visit[noOfelement];
	string res = "";
	for(int i=0;i<noOfelement;i++)
	{
		visit[i]=false;
	}
	for(int i=0;i<noOfelement;i++)
	{
		if(visit[i]==0 && check(elements[i],visit)==1)
		{
			visit[i]=1;
			res.append(1u,char(elements[i]+'A'));
			recur(visit,res);
			res.erase(res.begin()+(res.size()-1));
			visit[i]=0;
		}
	}

}

bool cmp(string s1,string s2)
{
	int sum = 0;
	for(int i=0;i<s1.size();i++)
	{
		if(s1[i]!=s2[i])
		{
			return (s1[i]<s2[i]);
		}
	}
}
int main()
{
	int cnt = 0,t;
	int a,b;
	stringstream ss;
	bool first = 0;
	char c;

	getline(cin,str);
	ss<<str;
	ss>>t;
	ss.clear();
	getline(cin,str);

	while(t--)
	{
		getline(cin,str1);
		getline(cin,str2);
		if(t)
		getline(cin,str);

		ss.clear();
		ss<<str1;
		for(int i=0;i<26;i++)
		{
			mp[i]=-1;
			elements[i]=0;
			for(int j=0;j<26;j++)
			gr[i][j]=0;
		}
		noOfelement=0;
		while(ss>>c)
		{
			mp[c-'A']=noOfelement;
			elements[noOfelement]=c-'A';
			noOfelement++;
		}

		ss.clear();
		ss<<str2;
		bool f = 0;
		char tmp[200];
		int char_cnt = 0;
		while(ss>>c)
		{
			if(c>='A' && c<='Z')
			tmp[char_cnt++]=c;
		}
		for(int i=0;i<char_cnt;i++)
		{
			if(i%2)
			{
				b = tmp[i]-'A';
				gr[a][b]=1;
			}
			else
			a = tmp[i]-'A';
		}
		kk=0;
		topologicalsort();
		sort(output+0,output+kk,cmp);
		for(int ii=0;ii<kk;ii++)
		{
			for(int jj=0;jj<output[ii].size();jj++)
			cout<<output[ii][jj]<<(jj!=output[ii].size()-1?" ":"\n");
		}
		if(kk==0)
		cout<<"NO\n";
		if(t)
		cout<<"\n";
	}

	//out.close();
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

#include <iostream>

#include <string>

#include <sstream>

#include <fstream>

#include <queue>

#include <algorithm>

#include <cstring>

#include <set>

using namespace std;

int noOfelement;

int mp[26];

string str,str1,str2;

string output[2000];

int kk;

bool gr[27][27];

stringstream ss;

int elements[26];

set<string> SET;

//ofstream out;

bool check(int elemnt,bool visit[])

{

for(int i=0;i<26;i++)

{

if(gr[i][elemnt] && mp[i]!=-1 && visit[mp[i]]==0)

return 0;

}

return 1;

}

int recur(bool used[],string s)

{

if(s.size()==noOfelement)

{

output[kk++]=s;

return 0;

}

for(int i=0;i<noOfelement;i++)

{

if(used[i]==0 && check(elements[i],used)==1)

{

used[i]=1;

s.append(1u,char(elements[i]+'A'));

recur(used,s);

s.erase(s.begin()+(s.size()-1));

used[i]=0;

}

return 0;

}

void topologicalsort()

{

bool visit[noOfelement];

string res = "";

for(int i=0;i<noOfelement;i++)

{

visit[i]=false;

}

for(int i=0;i<noOfelement;i++)

{

if(visit[i]==0 && check(elements[i],visit)==1)

{

visit[i]=1;

res.append(1u,char(elements[i]+'A'));

recur(visit,res);

res.erase(res.begin()+(res.size()-1));

visit[i]=0;

}

bool cmp(string s1,string s2)

{

int sum = 0;

for(int i=0;i<s1.size();i++)

{

if(s1[i]!=s2[i])

{

return (s1[i]<s2[i]);

}

int main()

{

int cnt = 0,t;

int a,b;

stringstream ss;

bool first = 0;

char c;

getline(cin,str);

ss<<str;

ss>>t;

ss.clear();

getline(cin,str);

while(t--)

{

getline(cin,str1);

getline(cin,str2);

if(t)

getline(cin,str);

ss.clear();

ss<<str1;

for(int i=0;i<26;i++)

{

mp[i]=-1;

elements[i]=0;

for(int j=0;j<26;j++)

gr[i][j]=0;

}

noOfelement=0;

while(ss>>c)

{

mp[c-'A']=noOfelement;

elements[noOfelement]=c-'A';

noOfelement++;

}

ss.clear();

ss<<str2;

bool f = 0;

char tmp[200];

int char_cnt = 0;

while(ss>>c)

{

if(c>='A' && c<='Z')

tmp[char_cnt++]=c;

}

for(int i=0;i<char_cnt;i++)

{

if(i%2)

{

b = tmp[i]-'A';

gr[a][b]=1;

}

else

a = tmp[i]-'A';

}

kk=0;

topologicalsort();

sort(output+0,output+kk,cmp);

for(int ii=0;ii<kk;ii++)

{

for(int jj=0;jj<output[ii].size();jj++)

cout<<output[ii][jj]<<(jj!=output[ii].size()-1?" ":"\n");

}

if(kk==0)

cout<<"NO\n";

if(t)

cout<<"\n";

}

//out.close();

return 0;

}

124

Asif NaeemMarch 22, 2015

#include <iostream>
#include <string>
#include <sstream>
#include <fstream>
#include <queue>
#include <algorithm>
#include <cstring>
#include <set>

using namespace std;

int noOfelement;
int mp[26];
string str,str1,str2;
string output[2000];
int kk;
bool gr[27][27];
stringstream ss;
int elements[26];
set<string> SET;
//ofstream out;

bool check(int elemnt,bool visit[])
{
	for(int i=0;i<26;i++)
	{
		if(gr[i][elemnt] && mp[i]!=-1 && visit[mp[i]]==0)
		return 0;
	}
	return 1;
}

int recur(bool used[],string s)
{
	if(s.size()==noOfelement)
	{
		output[kk++]=s;
		//cout<<s<<"\n";
		//out<<s<<"\n";
		return 0;
	}

	for(int i=0;i<noOfelement;i++)
	{
		if(used[i]==0 && check(elements[i],used)==1)
		{
			used[i]=1;
			s.append(1u,char(elements[i]+'a'));
			recur(used,s);
			s.erase(s.begin()+(s.size()-1));
			used[i]=0;
		}
	}
	return 0;
}

void topologicalsort()
{
	bool visit[noOfelement];
	string res = "";
	for(int i=0;i<noOfelement;i++)
	{
		visit[i]=false;
	}
	for(int i=0;i<noOfelement;i++)
	{
		if(visit[i]==0 && check(elements[i],visit)==1)
		{
			visit[i]=1;
			res.append(1u,char(elements[i]+'a'));
			recur(visit,res);
			res.erase(res.begin()+(res.size()-1));
			visit[i]=0;
		}
	}

}

bool cmp(string s1,string s2)
{
	int sum = 0;
	for(int i=0;i<s1.size();i++)
	{
		if(s1[i]!=s2[i])
		{
			return (s1[i]<s2[i]);
		}
	}
}
int main()
{
	int cnt = 0;
	int a,b;
	bool first = 0;
	char c;

	while(getline(cin,str))
	{
		cnt+=1;
		if(cnt%2)
		{
			str1 = str;
			ss.clear();
			ss<<str1;
			for(int i=0;i<26;i++)
			{
				mp[i]=-1;
				elements[i]=0;
				for(int j=0;j<26;j++)
				gr[i][j]=0;
			}
			noOfelement=0;
			while(ss>>c)
			{
				mp[c-'a']=noOfelement;
				elements[noOfelement]=c-'a';
				noOfelement++;
			}
		}
		else
		{
			str2=str;
			ss.clear();
			ss<<str2;
			bool f = 0;
			while(ss>>c)
			{
				if(f)
				{
					b = c -'a';gr[a][b]=1;
				}
				else
				a = c-'a';
				f = !f;
			}
			kk=0;
			topologicalsort();
			if (first) cout<<"\n";
		    first = 1;
			sort(output+0,output+kk,cmp);
			for(int ii=0;ii<kk;ii++)
			{
				cout<<output[ii]<<"\n";
			}
		}
	}

	//out.close();
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

#include <iostream>

#include <string>

#include <sstream>

#include <fstream>

#include <queue>

#include <algorithm>

#include <cstring>

#include <set>

using namespace std;

int noOfelement;

int mp[26];

string str,str1,str2;

string output[2000];

int kk;

bool gr[27][27];

stringstream ss;

int elements[26];

set<string> SET;

//ofstream out;

bool check(int elemnt,bool visit[])

{

for(int i=0;i<26;i++)

{

if(gr[i][elemnt] && mp[i]!=-1 && visit[mp[i]]==0)

return 0;

}

return 1;

}

int recur(bool used[],string s)

{

if(s.size()==noOfelement)

{

output[kk++]=s;

//cout<<s<<"\n";

//out<<s<<"\n";

return 0;

}

for(int i=0;i<noOfelement;i++)

{

if(used[i]==0 && check(elements[i],used)==1)

{

used[i]=1;

s.append(1u,char(elements[i]+'a'));

recur(used,s);

s.erase(s.begin()+(s.size()-1));

used[i]=0;

}

return 0;

}

void topologicalsort()

{

bool visit[noOfelement];

string res = "";

for(int i=0;i<noOfelement;i++)

{

visit[i]=false;

}

for(int i=0;i<noOfelement;i++)

{

if(visit[i]==0 && check(elements[i],visit)==1)

{

visit[i]=1;

res.append(1u,char(elements[i]+'a'));

recur(visit,res);

res.erase(res.begin()+(res.size()-1));

visit[i]=0;

}

bool cmp(string s1,string s2)

{

int sum = 0;

for(int i=0;i<s1.size();i++)

{

if(s1[i]!=s2[i])

{

return (s1[i]<s2[i]);

}

int main()

{

int cnt = 0;

int a,b;

bool first = 0;

char c;

while(getline(cin,str))

{

cnt+=1;

if(cnt%2)

{

str1 = str;

ss.clear();

ss<<str1;

for(int i=0;i<26;i++)

{

mp[i]=-1;

elements[i]=0;

for(int j=0;j<26;j++)

gr[i][j]=0;

}

noOfelement=0;

while(ss>>c)

{

mp[c-'a']=noOfelement;

elements[noOfelement]=c-'a';

noOfelement++;

}

else

{

str2=str;

ss.clear();

ss<<str2;

bool f = 0;

while(ss>>c)

{

if(f)

{

b = c -'a';gr[a][b]=1;

}

else

a = c-'a';

f = !f;

}

kk=0;

topologicalsort();

if (first) cout<<"\n";

first = 1;

sort(output+0,output+kk,cmp);

for(int ii=0;ii<kk;ii++)

{

cout<<output[ii]<<"\n";

}

//out.close();

return 0;

}

452

Asif NaeemMarch 21, 2015

#include <iostream>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>

#define INF 10000000

using namespace std;

bool gr[26][26];
int daysreq[26],indegree[26];
int accumulated_days[26];
int t;

int bfs(queue<int> q)
{

	while(!q.empty())
	{
		int a = q.front();q.pop();
		for(int i=0;i<26;i++)
		{
			if(gr[a][i])
			{
				accumulated_days[i]=max(accumulated_days[i],accumulated_days[a]+daysreq[i]);
				if(--indegree[i]==0)
				q.push(i);
			}

		}

	}

	int MX = 0;
	for(int i=0;i<26;i++)
	{
		MX =  max(accumulated_days[i],MX);
	}
	cout<<MX<<"\n";
	if(t)
	cout<<"\n";

	return 0;
}

int main()
{
	string s;
	stringstream ss;
	getline(cin,s);
	ss<<s;
	ss>>t;
	getline(cin,s);
	ss.clear();
	while(t--)
	{
		for(int i=0;i<26;i++)
		{
			daysreq[i]=0;
			indegree[i]=0;
			accumulated_days[i]=0;
			for(int j=0;j<26;j++)
				gr[i][j]=0;
		}
		while(getline(cin,s) && s!="")
		{
			ss<<s;
			char c;
			int d,u;
			ss>>c>>d;
			u = c-'A';
			daysreq[u]=d;
			while(ss>>c)
			{
				gr[c-'A'][u]=1;
			}
			ss.clear();
		}

		for(int i=0;i<26;i++)
		{
			for(int j=0;j<26;j++)
			{
				if(gr[i][j])
					indegree[j]++;
			}
		}
		queue<int> q;
		for(int i=0;i<26;i++)
		{
			if(daysreq[i]!=0 && indegree[i]==0)
			{
				accumulated_days[i]=daysreq[i];
				q.push(i);
			}
		}
		bfs(q);
	}
	return 0;
}

100

101

#include <iostream>

#include <sstream>

#include <string>

#include <queue>

#include <cstdio>

#define INF 10000000

using namespace std;

bool gr[26][26];

int daysreq[26],indegree[26];

int accumulated_days[26];

int t;

int bfs(queue<int> q)

{

while(!q.empty())

{

int a = q.front();q.pop();

for(int i=0;i<26;i++)

{

if(gr[a][i])

{

accumulated_days[i]=max(accumulated_days[i],accumulated_days[a]+daysreq[i]);

if(--indegree[i]==0)

q.push(i);

}

int MX = 0;

for(int i=0;i<26;i++)

{

MX = max(accumulated_days[i],MX);

}

cout<<MX<<"\n";

if(t)

cout<<"\n";

return 0;

}

int main()

{

string s;

stringstream ss;

getline(cin,s);

ss<<s;

ss>>t;

getline(cin,s);

ss.clear();

while(t--)

{

for(int i=0;i<26;i++)

{

daysreq[i]=0;

indegree[i]=0;

accumulated_days[i]=0;

for(int j=0;j<26;j++)

gr[i][j]=0;

}

while(getline(cin,s) && s!="")

{

ss<<s;

char c;

int d,u;

ss>>c>>d;

u = c-'A';

daysreq[u]=d;

while(ss>>c)

{

gr[c-'A'][u]=1;

}

ss.clear();

}

for(int i=0;i<26;i++)

{

for(int j=0;j<26;j++)

{

if(gr[i][j])

indegree[j]++;

}

queue<int> q;

for(int i=0;i<26;i++)

{

if(daysreq[i]!=0 && indegree[i]==0)

{

accumulated_days[i]=daysreq[i];

q.push(i);

}

bfs(q);

}

return 0;

}

Category: Scheduling

872

124

452

Archives

Categories