oj.uz

Submission #860104

# Submission time Handle Problem Language Result Execution time Memory
860104 2023-10-11T16:20:10 Z Nonoze Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 12 ms 988 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int> vec;
vector<bool> visited(520, false);
vector<int> adj[520];

void dfs(int s) {
    if (visited[s]) return;
    vec.push_back(s);
    visited[s]=true;
    for (auto u: adj[s]) dfs(u);
}

int findEgg (int N, vector < pair < int, int > > bridges)
{
    vec.clear();
    for (int i=0; i<=N; i++) adj[i].clear(), visited[i]=false;
    for (auto u: bridges) {
        adj[u.first].push_back(u.second);
        adj[u.second].push_back(u.first);
    }
    dfs(1);
    int l=0, r=N-1;
    int ans=0;
    while (l<=r) {
        int mid=l+(r-l)/2;
        if (query(vector<int>(vec.begin(), vec.begin()+mid+1))) {
            ans=mid;
            r=mid-1;
        } else {
            l=mid+1;
        }
    }
    return vec[ans];
}

Subtask #1
32.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Number of queries: 5
2 Partially correct 1 ms 600 KB Number of queries: 5
3 Partially correct 1 ms 344 KB Number of queries: 5
4 Partially correct 1 ms 344 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 472 KB Number of queries: 9
2 Correct 7 ms 488 KB Number of queries: 9
3 Correct 12 ms 488 KB Number of queries: 9
4 Correct 10 ms 988 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 11 ms 764 KB Number of queries: 10
2 Correct 9 ms 488 KB Number of queries: 9
3 Partially correct 10 ms 752 KB Number of queries: 10
4 Partially correct 10 ms 488 KB Number of queries: 10