제출 #498759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
498759		aihay	Easter Eggs (info1cup17_eastereggs)	C++14	0 / 100	3 ms	584 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;
    while(1){
        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<<"\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;
        }
        int a=ch[x],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){
                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]];
            }
        }
        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)){
            bol=0;
            memset(pos,0,sizeof pos);
            for(int i=0;i<vb.size();i++){
                pos[vb[i]]=1;
            }
            if(zz==1){
                for(int i=0;i<v[x].size();i++){
                    if(pos[v[x][i]]){
                        pos[x]=0;
                        x=v[x][i];
                        break;
                    }
                }
            }
        }
        else if((bol==0&&query(va))||bol==1){
            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==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++){
                for(int j=0;j<v[i].size();j++){
                    if(v[i][j]==x){
                        return i;
                    }
                }
            }
        }
        bol=1;
    }
    return x;
}

컴파일 시 표준 에러 (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:62:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |                     for(int j=0;j<v[i].size();j++){
      |                                 ~^~~~~~~~~~~~
eastereggs.cpp:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for(int i=0;i<v[x].size();i++){
      |                     ~^~~~~~~~~~~~
eastereggs.cpp:80:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |                 for(int j=0;j<z.size();j++){
      |                             ~^~~~~~~~~
eastereggs.cpp:104:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             for(int i=0;i<vb.size();i++){
      |                         ~^~~~~~~~~~
eastereggs.cpp:108:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |                 for(int i=0;i<v[x].size();i++){
      |                             ~^~~~~~~~~~~~
eastereggs.cpp:120:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |             for(int i=0;i<va.size();i++){
      |                         ~^~~~~~~~~~
eastereggs.cpp:126:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |             if(zz==v[x].size()-1){
      |                ~~^~~~~~~~~~~~~~~
eastereggs.cpp:127:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |                 for(int i=0;i<v[x].size();i++){
      |                             ~^~~~~~~~~~~~
eastereggs.cpp:138:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |                 for(int j=0;j<v[i].size();j++){
      |                             ~^~~~~~~~~~~~

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