oj.uz

답안 #762285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762285 2023-06-21T08:54:29 Z salmon Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 1 ms 592 KB 
#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.push_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());
}

Compilation message

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);
      |           ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -