oj.uz

Submission #547308

# Submission time Handle Problem Language Result Execution time Memory
547308 2022-04-10T10:28:38 Z Monarchuwu Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 19 ms 464 KB 
/**
 *  Problem:    info1cup17_eastereggs - Easter Eggs
 *  Link:       https://oj.uz/problem/view/info1cup17_eastereggs
 *  Tags:       Interactive
**/
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include "grader.h"

using namespace std;

typedef pair<int, int> pii;
#define ff first
#define ss second

const int N = 600;
vector<int> g[N], ord;
void dfs(int u, int p) {
    ord.push_back(u);
    for (int v : g[u])
        if (v != p) dfs(v, u);
}
int findEgg(int n, vector<pii> bridges) {
    for (int i = 1; i <= n; ++i) g[i].clear();
    for (pii e : bridges) {
        g[e.ff].push_back(e.ss);
        g[e.ss].push_back(e.ff);
    }
    ord.clear();
    dfs(1, 0);
    int lo(0), hi(n - 1), m;
    while (lo <= hi) {
        m = (lo + hi) >> 1;
        if (query(vector<int>(ord.begin(), ord.begin() + m + 1)))
            hi = m - 1;
        else lo = m + 1;
    }
    return ord[hi + 1];
}

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 2 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 6 ms 344 KB Number of queries: 9
2 Correct 12 ms 464 KB Number of queries: 9
3 Correct 16 ms 348 KB Number of queries: 9
4 Correct 16 ms 348 KB Number of queries: 9

Subtask #3
15.0 / 20.0

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