oj.uz

Submission #418130

# Submission time Handle Problem Language Result Execution time Memory
418130 2021-06-05T06:42:43 Z JerryLiu06 Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 20 ms 348 KB 
#include <bits/stdc++.h>
#include "grader.h"
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define EACH(a,x) for (auto& a: x)
 
const int MOD = 1e9 + 7;
const int MX = 520;
const ll INF = 1e18;
 
int N; vi adj[MX]; vi ord;
 
void DFS(int X, int P) {
    ord.pb(X); EACH(Y, adj[X]) if (Y != P) DFS(Y, X);
}
 
int findEgg(int _N, vpi bridges) {
    N = _N; FOR(i, 1, N + 1) adj[i].clear(); ord.clear();
    
    EACH(P, bridges) adj[P.f].pb(P.s), adj[P.s].pb(P.f);
 
    DFS(1, 0); int low = 0, high = N - 1, res = -1;
 
    while (low <= high) { int mid = (low + high) / 2;
        if (query(vi(ord.bg(), ord.bg() + mid + 1))) res = mid, high = mid - 1; else low = mid + 1;
    }
    return ord[res];
}

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 7 ms 340 KB Number of queries: 9
2 Correct 15 ms 340 KB Number of queries: 9
3 Correct 17 ms 344 KB Number of queries: 9
4 Correct 17 ms 348 KB Number of queries: 9

Subtask #3
15.0 / 20.0

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