oj.uz

Submission #583197

# Submission time Handle Problem Language Result Execution time Memory
583197 2022-06-25T04:35:20 Z rxlfd314 Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 1 ms 208 KB 
// https://oj.uz/problem/view/info1cup17_eastereggs
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> adj[512], bruh;
void dfs(int f = 0, int pf = -1) {
        bruh.push_back(f);
        for (int nf : adj[f]) {
                if (nf != pf) {
                        dfs(nf, f);
                }
        }
}
int findEgg(int n, vector<pair<int, int>> bridges) {
        cin >> n;
        for (pair<int, int> i : bridges) {
                adj[i.second - 1].push_back(i.first - 1);
                adj[i.first - 1].push_back(i.second - 1);
        }
        dfs();
        int lo = 0, hi = n - 1;
        while (lo <= hi) {
                int mid = lo + hi >> 1;
                if (query(vector<int>(bruh.begin(), bruh.begin() + mid))) {
                        hi = mid - 1;
                } else {
                        lo = mid + 1;
                }
        }
        return bruh[hi + 1];
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:23:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   23 |                 int mid = lo + hi >> 1;
      |                           ~~~^~~~

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 0 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -