제출 #762284

#제출 시각아이디문제언어결과실행 시간메모리
762284salmonEaster Eggs (info1cup17_eastereggs)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int findEgg (int N, vector <pair<int,int>> bridges){ set<int> notdone; queue<int> q; bool visited[1100]; vector<int> adjlst[1100]; vector<int> quer; int goal; for(int i = 1; i <= N; i++){ visited[i] = false; notdone.insert(i); } for(int i = 0; i < N - 1; i++){ adjlst[bridges[i].first].push_back(bridges[i].second); adjlst[bridges[i].second].push_back(bridges[i].first); } while(notdone.size() != 1){ int sise = notdone.size(); goal = sise/2; for(auto i : notdone){ bool flag = false; if(sise != N){ for(int j : adjlst[i]){ if(visited[j]){ flag = true; break; } } } else{ flag = true; } if(flag){ q.push(i); while(!q.empty()){ int i = q.front(); q.pop(); if(visited[i]) continue; if(goal == 0) continue; visited[i] = true; goal--; quer.push_back(i); for(int j : adjlst[i]){ q.push(j); } } } } if(goal != 0){ goal = goal / (goal - goal); } /*printf("q: "); for(auto i : quer){ printf("%d ",i); } printf("\n");*/ int con = quer.size(); vector<int> temp; if(query(quer)){ for(int i = 1; i <= sise/2; i++){ notdone.erase(quer[con - i]); } for(auto i : notdone){ visited[i] = true; temp.push_back(i); } notdone.clear(); for(int i = 1; i <= sise/2; i++){ //printf("%d ",quer[i]); notdone.insert(quer[con - i]); visited[quer[con - i]] = false; quer.pop_back(); } for(int i : temp){ quer.pusuh_back(i); } } else{ for(int i = 1; i <= sise/2; i++){ notdone.erase(quer[con - i]); } } /*for(auto i : notdone){ printf("%d ",i); } printf("\n");*/ } return (*notdone.begin()); }

컴파일 시 표준 에러 (stderr) 메시지

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:64:16: warning: division by zero [-Wdiv-by-zero]
   64 |    goal = goal / (goal - goal);
      |           ~~~~~^~~~~~~~~~~~~~~
eastereggs.cpp:93:10: error: 'class std::vector<int>' has no member named 'pusuh_back'; did you mean 'push_back'?
   93 |     quer.pusuh_back(i);
      |          ^~~~~~~~~~
      |          push_back