oj.uz

Submission #864991

# Submission time Handle Problem Language Result Execution time Memory
864991 2023-10-23T21:45:13 Z gutzzy Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 1 ms 500 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int> islands;
vector<bool> visited;
vector<vector<int>> lst;

void dfs(int nodo){
    visited[nodo] = true;
    islands.push_back(nodo);
    for(int vecino:lst[nodo]){
        if(!visited[vecino]) dfs(vecino);
    }
}

int findEgg(int n, vector<pair<int, int>>bridges){
    // vector 1D de todas las islas
    lst = vector<vector<int>>(n,vector<int>());
    
    for(auto b:bridges){
        lst[b.first-1].push_back(b.second-1);
        lst[b.second-1].push_back(b.first-1);
    }
    
    visited = vector<bool>(n,false);
    dfs(0);
    
    // binary search
    
    int l = 0;
    int r = n-1;
    while(l<=r){
        int m = (l+r)/2;
        bool egg = query({islands.begin(),islands.begin()+m});
        if(egg) r = m-1;
        else l = m+1;
    }
    return l;
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 436 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 500 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -