oj.uz

답안 #649348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649348 2022-10-10T03:40:18 Z ghostwriter Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 18 ms 484 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int MAXN = 513;
vi adj[MAXN], a;
void dfs(int u, int p) {
    a.pb(u);
    EACH(v, adj[u]) {
        if (v == p) continue;
        dfs(v, u);
    }
}
int findEgg(int N, vector<pair<int, int> > bridges) {
    EACH(i, bridges) {
        int u = i.st, v = i.nd;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    dfs(1, 0);
    int l = 0, r = sz(a) - 2, ans = -1;
    WHILE(l <= r) {
        int mid = l + (r - l) / 2;
        vi a1;
        FOR(j, 0, mid) a1.pb(a[j]);
        if (query(a1)) {
            ans = mid;
            r = mid - 1;
        }
        else l = mid + 1;
    }
    if (ans == -1) ans = sz(a) - 1;
    ans = a[ans];
    FOR(i, 1, N) adj[i].clear();
    a.clear();
    return ans;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

eastereggs.cpp: In function 'void dfs(int, int)':
eastereggs.cpp:39:31: warning: unnecessary parentheses in declaration of 'v' [-Wparentheses]
   39 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
eastereggs.cpp:58:5: note: in expansion of macro 'EACH'
   58 |     EACH(v, adj[u]) {
      |     ^~~~
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:39:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   39 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
eastereggs.cpp:64:5: note: in expansion of macro 'EACH'
   64 |     EACH(i, bridges) {
      |     ^~~~
eastereggs.cpp:35:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   35 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
eastereggs.cpp:74:9: note: in expansion of macro 'FOR'
   74 |         FOR(j, 0, mid) a1.pb(a[j]);
      |         ^~~
eastereggs.cpp:35:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   35 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
eastereggs.cpp:83:5: note: in expansion of macro 'FOR'
   83 |     FOR(i, 1, N) adj[i].clear();
      |     ^~~

Subtask #1
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Number of queries: 4
2 Correct 1 ms 208 KB Number of queries: 4
3 Correct 1 ms 208 KB Number of queries: 4
4 Correct 1 ms 208 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 336 KB Number of queries: 8
2 Correct 14 ms 352 KB Number of queries: 9
3 Correct 18 ms 348 KB Number of queries: 9
4 Correct 16 ms 468 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 364 KB Number of queries: 9
2 Correct 14 ms 360 KB Number of queries: 9
3 Correct 16 ms 356 KB Number of queries: 9
4 Correct 18 ms 484 KB Number of queries: 9