oj.uz

Submission #561459

# Submission time Handle Problem Language Result Execution time Memory
561459 2022-05-12T20:35:52 Z fatemetmhr Friends (BOI17_friends) C++17
100 / 100
 171 ms 7048 KB 
//  ~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];
int nn, exex[maxn5];
 
inline void kill(){
    cout << "detention" << endl;
    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;
    }
    /*
    cout << "_______ " << endl;
    for(int i = 0; i < nn; i++)
        cout << i << ' ' << ntm[i] << ' ' << ex[i] << endl;
    cout << endl << outedge << endl;
    //*/
    if(v == -1){
        //cout << "and now " << pos << ' ' << verex.size() << endl;
        av[pos] = verex;
        re = true;
        int cnt = 0;
        memset(ex1, false, sizeof ex1);
        for(auto u : verex){
            //cout << "hey " << u << ' ' << adj[u].size() << endl;
            ex1[u] = true;
        }
        for(auto u : verex) for(auto z : adj[u]){
            cnt += (!ex1[z]);
        }
        //cout << "oh " << cnt << endl;
        assert(cnt == outedge);
        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 update(int id){
    for(auto u : av[id])
        ex[u] = true;
    haveout[id] = 0;
    for(auto u : av[id]) for(auto z : adj[u])
        haveout[id] += (!ex[z]);
    for(auto u : av[id])
        ex[u] = false;

}
 
inline void mostaghel_kon(int id1, int id2){
    /*
    cout << "having " << id1 << ' ' << id2 << endl;
    for(auto u : av[id1])
        cout << u << ' ';
    cout << endl;
    for(auto u : av[id2])
        cout << u << ' ';
    cout << endl;
    //*/
    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;
    }
    if(esh.empty()){
        for(auto u : av[id1])
            ex1[u] = false;
        for(auto u : av[id2])
            ex2[u] = false;
        for(auto u : esh)
            ab[u] = false;
        return;
    }

    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] - ext2 <= mxed){
        for(auto u : av[id1]) if(!ab[u])
            tmp.pb(u);
        haveout[id1] += ext1;
    }
    else{
        rpid = id2;
        for(auto u : av[id2]) if(!ab[u])
            tmp.pb(u);
        haveout[id2] += ext2;
    }
    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;
    update(id1);
    update(id2);
    //cout << "and " << av[id1].size() << ' ' << av[id2].size() << ' ' << rpid << ' ' << haveout[id1] << ' ' << haveout[id2] << endl;
    return;
}
 
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
 
    int n; cin >> n >> grsz >> mxed;
    nn = n;
 
    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;
    }
    //*/
    //if(mxed > 2 && nn > 16)
        //kill();
    //assert(mxed <= 2 || nn <= 16);
    memset(ex, false, sizeof ex);
    memset(ex1, false, sizeof ex1);
    memset(ex2, false, sizeof ex2);
    for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++)
        mostaghel_kon(i, j);
    for(int i = 0; i < n; i++){
        memset(ex, false, sizeof ex);
        for(auto u : av[i])
            ex[u] = true;
        int cnt = 0;
        for(auto u : av[i]) for(auto z : adj[u])
            cnt += (!ex[z]);
        //cout << "all about " << i << endl;
        //for(auto u : av[i])
            //cout << u << ' ';
        //cout << endl;
        //cout << endl << haveout[i] << ' ' << cnt << endl;
        assert(cnt <= mxed);
        //assert(haveout[i] == cnt);
    }
    int cnt = 0;
    for(int i = 0; i < n; i++) if(av[i].size()){
        for(auto u : av[i]){
            exex[u]++;
        }
        assert(av[i].size() <= grsz);
        cnt++;
    }

 
    for(int i = 0; i < n; i++)
        assert(exex[i] == 1);
    cout << "home" << endl;
    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:184:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  184 |     for(int i = 0; i < n; i++) if(adj[i].size() > grsz + mxed)
      |                                   ~~~~~~~~~~~~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from friends.cpp:3:
friends.cpp:241:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  241 |         assert(av[i].size() <= grsz);
      |                ~~~~~~~~~~~~~^~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 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 1108 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 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 1108 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 13 ms 3028 KB Output is correct
11 Correct 19 ms 3660 KB Output is correct
12 Correct 20 ms 3532 KB Output is correct
13 Correct 18 ms 3664 KB Output is correct
14 Correct 4 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 3 ms 5332 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 13 ms 3028 KB Output is correct
19 Correct 19 ms 3660 KB Output is correct
20 Correct 20 ms 3532 KB Output is correct
21 Correct 18 ms 3664 KB Output is correct
22 Correct 4 ms 4948 KB Output is correct
23 Correct 4 ms 4948 KB Output is correct
24 Correct 3 ms 5332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 61 ms 5204 KB Output is correct
27 Correct 48 ms 5068 KB Output is correct
28 Correct 49 ms 4680 KB Output is correct
29 Correct 10 ms 3156 KB Output is correct
30 Correct 29 ms 3668 KB Output is correct
31 Correct 5 ms 3668 KB Output is correct
32 Correct 4 ms 5460 KB Output is correct
33 Correct 171 ms 7048 KB Output is correct
34 Correct 30 ms 6772 KB Output is correct