oj.uz

답안 #909991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909991 2024-01-17T17:39:41 Z nasir_bashirov Easter Eggs (info1cup17_eastereggs) C++11
87 / 100
 12 ms 1348 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
 
#define db long double
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio\
    ios_base::sync_with_stdio(0);\
    cin.tie(0);\
    cout.tie(0)\
 
vi g[550], v;
int n;

void dfs(int node, int par){
    v.push_back(node);
    for(int i : g[node]){
        if(i == par)    continue;
        dfs(i, node);
    }
}

int findEgg(int N, vii bridges){
    n = N;
    for(int i = 1; i <= n; i++){
        g[i].clear();
    }
    for(pii i : bridges){
        g[i.first].push_back(i.second);
        g[i.second].push_back(i.first);
    }
    dfs(1, 1);
    int l = 0, r = n - 1, res = 0;
    while(l <= r){
        int mid = (l + r) / 2;
        vi vv;
        for(int i = 0; i <= mid; i++)   vv.push_back(v[i]);
        if(query(vv)){
            res = mid;
            r = mid - 1;
        }
        else{
            l = mid + 1;
        }
    }
    return v[res];
}

Subtask #1
32.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 452 KB Number of queries: 5
2 Partially correct 1 ms 344 KB Number of queries: 5
3 Partially correct 1 ms 452 KB Number of queries: 5
4 Partially correct 1 ms 444 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 724 KB Number of queries: 9
2 Correct 9 ms 1256 KB Number of queries: 9
3 Correct 12 ms 1348 KB Number of queries: 9
4 Correct 10 ms 1292 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 12 ms 1068 KB Number of queries: 10
2 Correct 9 ms 472 KB Number of queries: 9
3 Partially correct 11 ms 1324 KB Number of queries: 10
4 Partially correct 11 ms 1112 KB Number of queries: 10