oj.uz

답안 #1062196

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1062196 2024-08-16T21:16:16 Z pera Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 15 ms 740 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg(int N , vector<pair<int , int>> bridges){
   vector<int> order;
   vector<vector<int>> g(N + 1);
   for(auto [u , v] : bridges){
      g[u].push_back(v);
      g[v].push_back(u);
   }
   function<void(int , int)> dfs = [&](int u , int p){
      order.emplace_back(u);
      for(int x = 0;x < (int)g[u].size();x ++){
         if(g[u][x] != p){
            dfs(g[u][x] , u);
         }
      }
   };
   dfs(1 , -1);
   auto Query = [&](int x){
      vector<int> u;
      for(int i = 0;i <= x;i ++){
         u.emplace_back(order[i]);
      }
      return query(u);
   };
   int l = 0 , r = N - 1 , ans;
   while(l <= r){
      int m = (l + r) / 2;
      if(Query(m)){
         ans = order[m];
         r = m - 1;
      }else{
         l = m + 1;
      }
   }
   return ans;
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:37:11: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |    return ans;
      |           ^~~

Subtask #1
32.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Number of queries: 5
2 Partially correct 1 ms 344 KB Number of queries: 5
3 Partially correct 1 ms 344 KB Number of queries: 5
4 Partially correct 1 ms 340 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 736 KB Number of queries: 9
2 Correct 10 ms 740 KB Number of queries: 9
3 Correct 15 ms 592 KB Number of queries: 9
4 Correct 11 ms 488 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 11 ms 344 KB Number of queries: 10
2 Correct 10 ms 344 KB Number of queries: 9
3 Partially correct 12 ms 480 KB Number of queries: 10
4 Partially correct 11 ms 500 KB Number of queries: 10