Submission #498812

#	Time	Username	Problem	Language	Result	Execution time	Memory
498812		aihay	Easter Eggs (info1cup17_eastereggs)	C++14	26.40 / 100	3028 ms	448 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

#define pb push_back
#define f first
#define s second
int vis[513],pos[513],ch[513];
int dfs(int n,vector<int>v[513],int idx=1){
    vis[idx]=1;
    int x=1;
    for(int i=0;i<v[idx].size();i++){
        if(!vis[v[idx][i]])
            x+=dfs(n,v,v[idx][i]);
    }
    ch[idx]=x;
    return x;
}
vector<int> dfs2(int n,vector<int>v[513],int idx=1){
    vis[idx]=1;
    vector<int> ans;
    ans.pb(idx);
    for(int i=0;i<v[idx].size();i++){
        if(!vis[v[idx][i]]){
            vector<int> z=dfs2(n,v,v[idx][i]);
            for(int j=0;j<z.size();j++){
                ans.pb(z[j]);
            }
        }
    }
    return ans;
}
int findEgg (int n, vector<pair<int,int> > edg){
    memset(vis,0,sizeof vis);
    memset(pos,0,sizeof pos);
    vector<int> v[513];
    for(int i=0;i<edg.size();i++){
        v[edg[i].f].pb(edg[i].s);
        v[edg[i].s].pb(edg[i].f);
        pos[edg[i].f]=1;
        pos[edg[i].s]=1;
    }
    dfs(n,v,1);
    int x=1;
    bool bol=1;
    vector<int> cur;
    while(1){
        if(x<1||x>n)
            return n/2;
        bol=0;
        int tk[513]={0};
        vector<int> h;
        for(int i=1;i<=n;i++){
            if(pos[i])
                h.pb(i);
        }
        /*cout<<h.size()<<"\n";
        for(int i=0;i<h.size();i++){
            cout<<h[i]<<" ";
        }
        cout<<"cur: "<<cur.size()<<"\n";
        for(int i=0;i<cur.size();i++){
            cout<<cur[i]<<" ";
        }
        cout<<"\n";
        cout<<"bol: "<<bol<<"\n";*/
        if(cur.size()>=h.size()){
            if(query(cur)){
                //cout<<"cur > h\n";
                x=cur[0];
                for(int i=0;i<cur.size();i++){
                    pos[cur[i]]=1;
                }
                for(int i=0;i<h.size();i++){
                    pos[h[i]]=0;
                }
                for(int i=0;i<v[cur[cur.size()-1]].size();i++){
                    for(int j=0;j<h.size();j++){
                        if(v[cur[cur.size()-1]][i]==h[j]){
                            ch[cur[cur.size()-1]]-=ch[h[j]];
                            v[cur[cur.size()-1]][i]=v[cur[cur.size()-1]][v[cur[cur.size()-1]].size()-1];
                            //cout<<"deleted: "<<v[cur[cur.size()-1]][v[cur[cur.size()-1]].size()-1]<<"\n";
                            v[cur[cur.size()-1]].pop_back();
                            //cout<<"deleted: "<<v[cur[cur.size()-1]][v[cur[cur.size()-1]].size()-1]<<"\n";
                        }
                    }
                }
            }
            cur.clear();
            continue;
        }
        //cout<<"\n\n";
        if(h.size()==1){
            if(bol==0&&query(h)==0)
                for(int i=1;i<=n;i++){
                    for(int j=0;j<v[i].size();j++){
                        if(v[i][j]==x){
                            return i;
                        }
                    }
                }
            break;
        }
        for(int i=1;i<=n;i++){
            if(pos[i])
                vis[i]=0;
            else
                vis[i]=1;
        }
        int a=dfs2(n,v,x).size(),b=1;
        vector<int> va,vb;
        vb.pb(x);
        int zz=0;
        for(int i=0;i<v[x].size();i++){
            if(b+ch[v[x][i]]<a&&pos[v[x][i]]==1){
                //cout<<"took: "<<v[x][i]<<" and his children because "<<b<<"+"<<ch[v[x][i]]<<"<"<<a<<"-"<<ch[v[x][i]]<<"\n";
                zz++;
                memset(vis,0,sizeof vis);
                vis[x]=1;
                vector<int> z=dfs2(n,v,v[x][i]);
                for(int j=0;j<z.size();j++){
                    vb.pb(z[j]);
                    tk[z[j]]=1;
                }
                b+=ch[v[x][i]];
                a-=ch[v[x][i]];
            }
        }
        if(zz==0){
            //cout<<"a: "<<a<<" element "<<x<<" added to cur ";
            cur.pb(x);
            pos[x]=0;
            for(int i=0;i<v[x].size();i++){
                if(pos[v[x][i]]){
                    x=v[x][i];
                    break;
                }
            }
            //cout<<"and x became "<<x<<"\n";
            continue;
        }
        for(int i=1;i<=n;i++){
            if(pos[i]==1&&!tk[i]){
                va.pb(i);
            }
        }
        /*cout<<"va: "<<va.size()<<"\n";
        for(int i=0;i<va.size();i++)
            cout<<va[i]<<" ";
        cout<<"\n";
        cout<<"vb: "<<vb.size()<<"\n";
        for(int i=0;i<vb.size();i++)
            cout<<vb[i]<<" ";
        cout<<"\n\n";*/
        if(query(vb)){
            cur.clear();
            bol=0;
            memset(pos,0,sizeof pos);
            for(int i=0;i<vb.size();i++){
                pos[vb[i]]=1;
            }
            //cout<<"zz: "<<zz<<"\n";
            if(zz==1){
                for(int i=0;i<v[x].size();i++){
                    if(pos[v[x][i]]){
                        cur.pb(x);
                        pos[x]=0;
                        x=v[x][i];
                        //cout<<"x became "<<x<<"\n";
                        break;
                    }
                }
            }
        }
        else if((bol==0&&query(va))||bol==1){
            cur.clear();
            bol=1;
            memset(pos,0,sizeof pos);
            for(int i=0;i<va.size();i++){
                pos[va[i]]=1;
            }
            //cout<<"zz: "<<zz<<"\n";
            if(x!=1)
                zz++;
            if(zz==(int)(v[x].size())-1){
                for(int i=0;i<v[x].size();i++){
                    if(pos[v[x][i]]){
                        pos[x]=0;
                        x=v[x][i];
                        break;
                    }
                }
            }
        }
        else{
            for(int i=1;i<=n;i++){
                if(pos[i])
                    continue;
                for(int j=0;j<v[i].size();j++){
                    if(v[i][j]==x){
                        return i;
                    }
                }
            }
        }
    }
    return x;
}

Compilation message (stderr)

eastereggs.cpp: In function 'int dfs(int, std::vector<int>*, int)':
eastereggs.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0;i<v[idx].size();i++){
      |                 ~^~~~~~~~~~~~~~
eastereggs.cpp: In function 'std::vector<int> dfs2(int, std::vector<int>*, int)':
eastereggs.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<v[idx].size();i++){
      |                 ~^~~~~~~~~~~~~~
eastereggs.cpp:27:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             for(int j=0;j<z.size();j++){
      |                         ~^~~~~~~~~
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=0;i<edg.size();i++){
      |                 ~^~~~~~~~~~~
eastereggs.cpp:72:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |                 for(int i=0;i<cur.size();i++){
      |                             ~^~~~~~~~~~~
eastereggs.cpp:75:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |                 for(int i=0;i<h.size();i++){
      |                             ~^~~~~~~~~
eastereggs.cpp:78:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |                 for(int i=0;i<v[cur[cur.size()-1]].size();i++){
      |                             ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
eastereggs.cpp:79:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |                     for(int j=0;j<h.size();j++){
      |                                 ~^~~~~~~~~
eastereggs.cpp:97:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |                     for(int j=0;j<v[i].size();j++){
      |                                 ~^~~~~~~~~~~~
eastereggs.cpp:115:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |         for(int i=0;i<v[x].size();i++){
      |                     ~^~~~~~~~~~~~
eastereggs.cpp:122:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |                 for(int j=0;j<z.size();j++){
      |                             ~^~~~~~~~~
eastereggs.cpp:134:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |             for(int i=0;i<v[x].size();i++){
      |                         ~^~~~~~~~~~~~
eastereggs.cpp:160:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |             for(int i=0;i<vb.size();i++){
      |                         ~^~~~~~~~~~
eastereggs.cpp:165:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |                 for(int i=0;i<v[x].size();i++){
      |                             ~^~~~~~~~~~~~
eastereggs.cpp:180:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |             for(int i=0;i<va.size();i++){
      |                         ~^~~~~~~~~~
eastereggs.cpp:187:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  187 |                 for(int i=0;i<v[x].size();i++){
      |                             ~^~~~~~~~~~~~
eastereggs.cpp:200:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |                 for(int j=0;j<v[i].size();j++){
      |                             ~^~~~~~~~~~~~

• Subtask 1: 26.4 / 40
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20