oj.uz

Submission #389284

# Submission time Handle Problem Language Result Execution time Memory
389284 2021-04-14T02:13:25 Z cheissmart Easter Eggs (info1cup17_eastereggs) C++14
87 / 100
 28 ms 468 KB 
#include <bits/stdc++.h>
#include "grader.h"
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "LINE(" << __LINE__ << "): " << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7, N = 520;

V<int> G[N];
vi q;

void init(int n) {
    for(int i = 1; i <= n; i++) {
        G[i].clear();
    }
}

void dfs(int u, int p = 0) {
    q.PB(u);
    for(int v:G[u]) if(v != p)
        dfs(v, u);
}

int findEgg(int n, V<pi> es) {
    init(n);
    for(pi p:es) G[p.F].PB(p.S), G[p.S].PB(p.F);
    q.clear();
    dfs(1);
    int lb = 0, rb = n - 1;
    while(lb <= rb) {
        int mb = (lb + rb) / 2;
        vi ask;
        for(int j = 0; j <= mb; j++)
            ask.PB(q[j]);
        if(query(ask)) rb = mb - 1;
        else lb = mb + 1;
    }
    //debug(lb);
    return q[lb];
}

Subtask #1
32.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Number of queries: 9
2 Correct 17 ms 344 KB Number of queries: 9
3 Correct 28 ms 328 KB Number of queries: 9
4 Correct 19 ms 452 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 21 ms 448 KB Number of queries: 10
2 Correct 18 ms 340 KB Number of queries: 9
3 Partially correct 21 ms 328 KB Number of queries: 10
4 Partially correct 21 ms 468 KB Number of queries: 10