oj.uz

Submission #640155

# Submission time Handle Problem Language Result Execution time Memory
640155 2022-09-13T18:46:55 Z tvladm2009 Easter Eggs (info1cup17_eastereggs) C++14
87 / 100
 19 ms 360 KB 
#include <bits/stdc++.h>
#include "grader.h"

using ll = long long;

const int MAX_N = 512;

std::vector<int> g[MAX_N + 1], v;

void dfs(int u, int p = -1) {
  v.push_back(u);
  for (int v : g[u]) {
    if (v != p) {
      dfs(v, u);
    }
  }
}

int bsearch() {
  int l = 0, r = v.size() - 1, sol = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    std::vector<int> tmp;
    for (int i = 0; i <= mid; i++) {
      tmp.push_back(v[i]);
    }
    if (query(tmp)) {
      r = mid - 1;
      sol = mid;
    } else {
      l = mid + 1;
    }
  }
  return v[sol];
}

int findEgg(int n, std::vector<std::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);
  }
  v.clear();
  dfs(1);
  int answer = bsearch();
  return answer;
}

Subtask #1
32.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 336 KB Number of queries: 9
2 Correct 10 ms 336 KB Number of queries: 9
3 Correct 15 ms 336 KB Number of queries: 9
4 Correct 15 ms 356 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 19 ms 360 KB Number of queries: 10
2 Correct 16 ms 336 KB Number of queries: 9
3 Partially correct 14 ms 344 KB Number of queries: 10
4 Partially correct 17 ms 352 KB Number of queries: 10