// ~Be name khoda~ //
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 25e2 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
int grsz, mxed, pos = 0;
vector <int> verex, adj[maxn5], av[maxn5], tmp, esh;
int grsize, outedge, haveout[maxn5];
bool re, ntm[maxn5], ex[maxn5];
bool ex1[maxn5], ex2[maxn5];
bool ed[maxn5][maxn5], ab[maxn5];
inline void kill(){
cout << "detention" << endl;
assert(mxed <= 2);
exit(0);
}
inline void solve(){
if(grsize > grsz || outedge > mxed)
return;
if(re)
return;
int v = -1;
for(auto u : verex) for(auto z : adj[u]) if(ntm[z]){
v = z;
}
if(v == -1){
//cout << "and now " << pos << ' ' << verex.size() << endl;
av[pos] = verex;
re = true;
return;
}
//cout << verex.size() << ' ' << "this is " << v << endl;
ntm[v] = false;
ex[v] = true;
verex.pb(v);
grsize++;
int remem = outedge;
for(auto u : adj[v]) if(!ntm[u] && !ex[u])
outedge++;
solve();
//cout << "finaly see " << v << ' ' << verex.size() << endl;
if(re)
return;
verex.pop_back();
ex[v] = false;
grsize--;
outedge = remem;
for(auto u : adj[v]) if(!ntm[u] && ex[u])
outedge++;
solve();
if(re)
return;
outedge = remem;
ntm[v] = true;
return;
}
inline void mostaghel_kon(int id1, int id2){
if(av[id1].empty() || av[id2].empty())
return;
esh.clear();
for(auto u : av[id1])
ex1[u] = true;
for(auto u : av[id2])
ex2[u] = true;
for(auto u : av[id2]) if(ex1[u]){
esh.pb(u);
ab[u] = true;
}
int ext1 = 0, ext2 = 0;
for(auto u : esh) for(auto z : adj[u]) if(!ab[z]){
if(ex1[z])
ext1++;
if(ex2[z])
ext2++;
}
tmp.clear();
int rpid = id1;
if(ext1 + haveout[id1] <= mxed){
for(auto u : av[id1]) if(!ab[u])
tmp.pb(u);
}
else{
rpid = id2;
for(auto u : av[id2]) if(!ab[u])
tmp.pb(u);
}
for(auto u : av[id1])
ex1[u] = false;
for(auto u : av[id2])
ex2[u] = false;
for(auto u : esh)
ab[u] = false;
av[rpid] = tmp;
return;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n; cin >> n >> grsz >> mxed;
for(int i = 0; i < n; i++){
int l; cin >> l;
while(l--){
int a; cin >> a;
ed[i][a] = true;
adj[i].pb(a);
}
}
for(int i = 0; i < n; i++) if(adj[i].size() > grsz + mxed)
kill();
for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++)
if(ed[i][j] != ed[j][i])
kill();
for(int i = 0; i < n; i++){
memset(ntm, true, sizeof ntm);
ex[i] = true;
ntm[i] = re = false;
outedge = 0;
grsize = 1;
verex.clear();
verex.pb(i);
solve();
if(!re)
kill();
haveout[pos] = outedge;
pos++;
}
/*
cout << "___" << endl;
for(int i = 0; i < n; i++){
cout << av[i].size() << ' ';
for(auto u : av[i])
cout << u << ' ';
cout << endl;
}
//*/
cout << "home" << endl;
memset(ex, false, sizeof ex);
for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++)
mostaghel_kon(i, j);
int cnt = 0;
for(int i = 0; i < n; i++) if(av[i].size())
cnt++;
cout << cnt << endl;
for(int i = 0; i < n; i++) if(av[i].size()){
cout << av[i].size() << ' ';
for(auto u : av[i])
cout << u << ' ';
cout << '\n';
}
}
Compilation message
friends.cpp: In function 'int main()':
friends.cpp:131:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
131 | for(int i = 0; i < n; i++) if(adj[i].size() > grsz + mxed)
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
0 ms |
468 KB |
Output is correct |
| 6 |
Runtime error |
1 ms |
724 KB |
Execution killed with signal 6 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
852 KB |
Output is correct |
| 3 |
Correct |
1 ms |
724 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1052 KB |
Output is correct |
| 5 |
Correct |
1 ms |
980 KB |
Output is correct |
| 6 |
Correct |
1 ms |
980 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
980 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
852 KB |
Output is correct |
| 3 |
Correct |
1 ms |
724 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1052 KB |
Output is correct |
| 5 |
Correct |
1 ms |
980 KB |
Output is correct |
| 6 |
Correct |
1 ms |
980 KB |
Output is correct |
| 7 |
Correct |
1 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
980 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
15 ms |
3040 KB |
Output is correct |
| 11 |
Correct |
21 ms |
3540 KB |
Output is correct |
| 12 |
Correct |
24 ms |
3524 KB |
Output is correct |
| 13 |
Correct |
28 ms |
3540 KB |
Output is correct |
| 14 |
Correct |
5 ms |
4896 KB |
Output is correct |
| 15 |
Correct |
6 ms |
4936 KB |
Output is correct |
| 16 |
Correct |
3 ms |
5332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
468 KB |
Output is correct |
| 4 |
Correct |
1 ms |
468 KB |
Output is correct |
| 5 |
Correct |
0 ms |
468 KB |
Output is correct |
| 6 |
Runtime error |
1 ms |
724 KB |
Execution killed with signal 6 |
| 7 |
Halted |
0 ms |
0 KB |
- |
