#include<stdio.h>
#include<vector>
#include<iostream>
#include<stack>
#include<set>
#include<cstdlib>
using namespace std;
int n,p,q;
vector<vector<int> > G;
vector<bool> visited; // already put in some previous group
vector<bool> in; // active group
vector<bool> undecided; // neighbors of active group, may go into active group.
stack<int> undecidedStack; // a stack of the yet undecided neighbors of the active group
vector<bool> out; // neighbors of active group, may NOT go into active group.
vector<set<int> > output;
vector<int> myGroup;
bool branchWithFirstVertexOut(int groupSize, int neighSize);
bool mainBranch(int groupSize, int neighSize);
bool branchWithFirstVertexInGroup(int groupSize, int neighSize);
bool findgroup(int v);
void fix(int i, int j);
int firstConflict();
bool isValidGroup(const set<int> &s);
void printSet(const set<int> &S);
void printPartition();
// ----------------------------------------
// ---------------------------------------------- MAIN GREEDY
// ----------------------------------------
int main() {
scanf("%d %d %d",&n, &p, &q);
G = vector<vector<int> > ();
bool success = true;
// read graph
for(int i = 0; i < n && success; ++i) {
int mi;
scanf("%d", &mi);
if(mi > p + q) success = false;
G.push_back(vector<int> (mi, 0));
for(int j = 0; j < mi; ++j) {
scanf("%d", &(G[i][j]));
}
}
// verify undirected
for(int u = 0; u < n && success; ++u) {
for(int i = 0; i < G[u].size(); ++i) {
int v = G[u][i];
bool foundu = false;
for(int j = 0; j < G[v].size(); ++j) {foundu |= (G[v][j] == u);}
success &= foundu;
}
}
// check that each vertex can be put in some group.
visited = vector<bool> (n, false);
in = vector<bool> (n, false);
undecided = vector<bool> (n, false);
out = vector<bool> (n, false);
myGroup = vector<int>(n, -1);
for(int i = 0; i < n && success; ++i) {
//cout << i << endl;
if(visited[i]) continue;
if(!findgroup(i)) {
success = false;
break;
}
// resolve conflicts between new group and old groups
int p = output.size() - 1;
//printf("set:\n");
//printSet(output[p]);
while(true) {
int conf = firstConflict();
//printf("CONF %d\n", conf);
if(conf == -1) break;
fix(p, conf);
}
for(set<int>::iterator it = output[p].begin(); it != output[p].end(); ++it) {myGroup[*it] = p;}
//printf("second\n");
//printPartition();
}
if(success) {
printf("home\n");
printPartition();
} else {
printf("detention\n");
}
return 0;
}
// ----------------------------
// ---------------------- HELPER FUCNTIONS FOR BRANCHING ALGORITHM BELOW
// ----------------------------
inline int popUndecided() {
int v = undecidedStack.top();
undecidedStack.pop();
undecided[v] = false;
return v;
}
inline void pushUndecided(int v) {
undecided[v] = true;
undecidedStack.push(v);
}
vector<int> freshNeighbors(int v) {
vector<int> ans;
for(int i = 0; i < G[v].size(); ++i) {
if(!(in[G[v][i]] || undecided[G[v][i]] || out[G[v][i]])) ans.push_back(G[v][i]);
}
return ans;
}
// ------------------------------------------------- BRANCHING
// ------------------------------------------------- FINDING IF V CAN BE PUT IN A GROUP
bool findgroup(int v) {
pushUndecided(v);
bool ans = branchWithFirstVertexInGroup(0,0);
popUndecided();
if(ans) output[output.size() - 1].insert(v);
visited[v] = true;
return ans;
}
// groupsize is the current size of the group, cutsize is the size of the cut
bool mainBranch(int groupSize, int cutSize) {
if(groupSize > p || cutSize > q || groupSize + cutSize + undecidedStack.size() > p+q) return false;
if(undecidedStack.empty()) {
output.push_back(set<int>());
return true;
}
return(branchWithFirstVertexOut(groupSize, cutSize) || branchWithFirstVertexInGroup(groupSize, cutSize));
}
bool branchWithFirstVertexOut(int groupSize, int cutSize) {
int v = popUndecided();
out[v] = true;
for(int i = 0; i < G[v].size(); ++i) {cutSize += in[G[v][i]];}
bool ans = mainBranch(groupSize, cutSize);
out[v] = false;
pushUndecided(v);
return ans;
}
bool branchWithFirstVertexInGroup(int groupSize, int cutSize) {
int v = popUndecided();
in[v] = true;
vector<int> nv = freshNeighbors(v);
for(int i = 0; i < nv.size(); ++i) {pushUndecided(nv[i]);}
for(int i = 0; i < G[v].size(); ++i) {cutSize += out[G[v][i]];}
bool ans = mainBranch(groupSize + 1, cutSize);
if(ans) {output[output.size() - 1].insert(v);}
in[v] = false;
for(int i = 0; i < nv.size(); ++i) {popUndecided();}
pushUndecided(v);
if(ans) visited[v] = true; // If found a group with v in it, v becomes visited.
return ans;
}
int firstConflict() {
int p = output.size() - 1;
if(p < 0) return - 1;
for(set<int>::iterator s = output[p].begin(); s != output[p].end(); ++s) {
if(*s < 0 || *s > n-1) {
cout << "wtf" << endl;
exit(0);
}
if(myGroup[*s] != -1 && myGroup[*s] != p) return myGroup[*s]; }
return -1;
}
// i is the new group, j is the old one.
void fix(int i, int j) {
set<int> si(output[i]), sj(output[j]), nsi(output[i]), nsj(output[j]);
for(set<int>::iterator it = si.begin(); it != si.end(); ++it) {
if(sj.count(*it) != 0) {
nsi.erase(*it);
nsj.erase(*it);
}
}
/*
printf("si:\n");
printSet(si);
printf("nsi:\n");
printSet(nsi);
printf("sj:\n");
printSet(sj);
printf("nsj:\n");
printSet(nsj);
*/
/*
if(nsj.empty() && isValidGroup(si)) {
// cout << "i should be here" << endl;
// kill the conflict group, update myGroup.
for(set<int>::iterator it = sj.begin(); it != sj.end(); ++it) {myGroup[*it] = i;}
output[j] = set<int>();
} else
*/
if(isValidGroup(nsi)) {
// make last group smaller
printf("nsi was valid\n");
output[i] = set<int> (nsi);
} else if(isValidGroup(nsj)) {
// make the conflict group smaller, update myGroup.
for(set<int>::iterator it = sj.begin(); it != sj.end(); ++it) {
if(nsj.count(*it) == 0) myGroup[*it] = i;
}
output[j] = set<int> (nsj);
} else {
printf("goddammit\n");
exit(1);
}}
bool isValidGroup(const set<int> &s) {
//printf("is valid group:\n");
//printSet(s);
int cnt = 0;
if(s.empty()) return true;
for(set<int>::iterator itr = s.begin(); itr != s.end(); ++itr) {
int u = *itr;
//printf("vertex u: %d\n", u);
for(int i = 0; i < G[u].size(); ++i) {
int v = G[u][i];
cnt += (s.count(G[u][i]) == 0 ? 1 : 0);
//printf("vertex v: %d count: %d\n", v, cnt);
}
}
//printf("answer is %d\n", (cnt <= q ? 1 : 0));
return cnt <= q;
}
void printSet(const set<int> &S) {
if(S.empty()) return;
printf("%d", S.size());
for(set<int>::iterator s = S.begin(); s != S.end(); ++s) {printf(" %d", (*s));}
printf("\n");
}
void printPartition() {
// DEBUG:
//printf("current partition\n");
// ---
int numGroups = 0;
for(int i = 0; i < output.size(); ++i) {if(!output[i].empty()) numGroups++;}
printf("%d\n", numGroups);
for(int i = 0; i < output.size(); ++i) {
//cout << "-- " << i << "-- " << endl;
printSet(output[i]);
}
}
Compilation message
friends.cpp: In function 'int main()':
friends.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[u].size(); ++i) {
~~^~~~~~~~~~~~~
friends.cpp:63:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0; j < G[v].size(); ++j) {foundu |= (G[v][j] == u);}
~~^~~~~~~~~~~~~
friends.cpp: In function 'std::vector<int> freshNeighbors(int)':
friends.cpp:133:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[v].size(); ++i) {
~~^~~~~~~~~~~~~
friends.cpp: In function 'bool mainBranch(int, int)':
friends.cpp:153:81: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(groupSize > p || cutSize > q || groupSize + cutSize + undecidedStack.size() > p+q) return false;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
friends.cpp: In function 'bool branchWithFirstVertexOut(int, int)':
friends.cpp:165:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[v].size(); ++i) {cutSize += in[G[v][i]];}
~~^~~~~~~~~~~~~
friends.cpp: In function 'bool branchWithFirstVertexInGroup(int, int)':
friends.cpp:180:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < nv.size(); ++i) {pushUndecided(nv[i]);}
~~^~~~~~~~~~~
friends.cpp:181:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[v].size(); ++i) {cutSize += out[G[v][i]];}
~~^~~~~~~~~~~~~
friends.cpp:188:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < nv.size(); ++i) {popUndecided();}
~~^~~~~~~~~~~
friends.cpp: In function 'bool isValidGroup(const std::set<int>&)':
friends.cpp:261:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < G[u].size(); ++i) {
~~^~~~~~~~~~~~~
friends.cpp:262:8: warning: unused variable 'v' [-Wunused-variable]
int v = G[u][i];
^
friends.cpp: In function 'void printSet(const std::set<int>&)':
friends.cpp:274:23: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::set<int>::size_type {aka long unsigned int}' [-Wformat=]
printf("%d", S.size());
~~~~~~~~^
friends.cpp: In function 'void printPartition()':
friends.cpp:284:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < output.size(); ++i) {if(!output[i].empty()) numGroups++;}
~~^~~~~~~~~~~~~~~
friends.cpp:287:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < output.size(); ++i) {
~~^~~~~~~~~~~~~~~
friends.cpp: In function 'int main()':
friends.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d",&n, &p, &q);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~
friends.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &mi);
~~~~~^~~~~~~~~~~
friends.cpp:54:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &(G[i][j]));
~~~~~^~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
252 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
3 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
256 KB |
Output is correct |
| 10 |
Correct |
4 ms |
376 KB |
Output is correct |
| 11 |
Correct |
4 ms |
504 KB |
Output is correct |
| 12 |
Correct |
4 ms |
428 KB |
Output is correct |
| 13 |
Correct |
4 ms |
504 KB |
Output is correct |
| 14 |
Correct |
3 ms |
504 KB |
Output is correct |
| 15 |
Correct |
3 ms |
504 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
256 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
252 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
256 KB |
Output is correct |
| 8 |
Correct |
2 ms |
256 KB |
Output is correct |
| 9 |
Correct |
2 ms |
256 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
256 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
256 KB |
Output is correct |
| 18 |
Correct |
4 ms |
376 KB |
Output is correct |
| 19 |
Correct |
4 ms |
504 KB |
Output is correct |
| 20 |
Correct |
4 ms |
428 KB |
Output is correct |
| 21 |
Correct |
4 ms |
504 KB |
Output is correct |
| 22 |
Correct |
3 ms |
504 KB |
Output is correct |
| 23 |
Correct |
3 ms |
504 KB |
Output is correct |
| 24 |
Correct |
3 ms |
376 KB |
Output is correct |
| 25 |
Correct |
2 ms |
256 KB |
Output is correct |
| 26 |
Correct |
7 ms |
632 KB |
Output is correct |
| 27 |
Correct |
6 ms |
632 KB |
Output is correct |
| 28 |
Correct |
6 ms |
504 KB |
Output is correct |
| 29 |
Correct |
4 ms |
348 KB |
Output is correct |
| 30 |
Correct |
4 ms |
504 KB |
Output is correct |
| 31 |
Correct |
3 ms |
376 KB |
Output is correct |
| 32 |
Correct |
3 ms |
376 KB |
Output is correct |
| 33 |
Correct |
9 ms |
632 KB |
Output is correct |
| 34 |
Correct |
6 ms |
504 KB |
Output is correct |
