oj.uz

Submission #865004

# Submission time Handle Problem Language Result Execution time Memory
865004 2023-10-23T22:43:24 Z gutzzy Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 13 ms 1276 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);
    
    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);
    islands.clear();
    
    dfs(0);
    
    for(int i=0;i<n;i++) islands[i]++;
    
    // binary search
    
    int l = 0;
    int r = n-1;
    while(l<r){
        int m = (l+r)/2;
        //cout << l << " " << r << " " << m << endl;
        bool egg = query({islands.begin(),islands.begin()+m+1});
        if(egg) r = m;
        else l = m+1;
    }
    return islands[l];
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Number of queries: 4
2 Correct 1 ms 344 KB Number of queries: 4
3 Correct 0 ms 344 KB Number of queries: 4
4 Correct 0 ms 344 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 728 KB Number of queries: 8
2 Correct 8 ms 472 KB Number of queries: 9
3 Correct 12 ms 492 KB Number of queries: 9
4 Correct 11 ms 736 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1276 KB Number of queries: 9
2 Correct 10 ms 476 KB Number of queries: 9
3 Correct 12 ms 748 KB Number of queries: 9
4 Correct 11 ms 748 KB Number of queries: 9