oj.uz

Submission #49395

# Submission time Handle Problem Language Result Execution time Memory
49395 2018-05-28T09:39:08 Z georgerapeanu Easter Eggs (info1cup17_eastereggs) C++11
0 / 100
 4 ms 504 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int> G[600];
int renumbered[600];
int inverse_renumber[600];


void renumber_dfs(int node,int father,int &val){
    renumbered[node] = val;
    inverse_renumber[val] = node;
    for(auto it:G[node]){
        if(it != father){
            renumber_dfs(it,node,++val);
        }
    }
}

vector<int> nodes;
bool ok(int le,int ri){
    nodes.clear();
    for(int i = le;i <= ri;i++){
        nodes.push_back(inverse_renumber[i]);
    }
    return query(nodes);
}

int findEgg (int N, vector < pair < int, int > > bridges){
    for(int i = 1;i <= N;i++){
        G[i].clear();
    }
    for(auto it:bridges){
        G[it.first].push_back(it.second);
        G[it.second].push_back(it.first);
    }
    int start = 1;
    renumber_dfs(1,0,start);


    if(N == 5){
        int lo = 1,hi = N;
        while(hi - lo > 0){
            int mid = (lo + hi) / 2;
            if(ok(lo,mid)){
                hi = mid;
            }
            else{
                lo = mid + 1;
            }
        }
        return inverse_renumber[lo];
    }
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:55:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB The found island is incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 444 KB The found island is incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 504 KB The found island is incorrect
2 Halted 0 ms 0 KB -