oj.uz

답안 #918136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918136 2024-01-29T13:13:55 Z raul2008487 Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 23 ms 5684 KB 
#include <bits/stdc++.h>
#include "grader.h"
#define ll int
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back

using namespace std;
const int sz = 2e5+5;
vl adj[sz];
vl et;
void dfs(ll node, ll p){
    et.pb(node);
    for(auto edge: adj[node]){
        if(edge == p){continue;}
        dfs(edge, node);
    }
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
    ll i, j;
    for(i=0;i<sz;i++){
        adj[i].clear();
    }
    et.clear();
    for(i=0;i<bridges.size();i++){
        adj[bridges[i].fi].push_back(bridges[i].se);
        adj[bridges[i].se].push_back(bridges[i].fi);
    }
    dfs(1, 0);
    ll lo = 0, hi = N-1, mid, best = 0;
    while(lo < hi){
        mid = (lo + hi) >> 1;
        vl t;
        for(i = 0; i<=mid; i++){
            t.pb(et[i]);
        }
        if(query(t)){
            hi = mid;
        }   
        else{
            lo = mid + 1;
        }
    }
    return et[lo];
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:27:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(i=0;i<bridges.size();i++){
      |             ~^~~~~~~~~~~~~~~
eastereggs.cpp:22:11: warning: unused variable 'j' [-Wunused-variable]
   22 |     ll i, j;
      |           ^
eastereggs.cpp:32:31: warning: unused variable 'best' [-Wunused-variable]
   32 |     ll lo = 0, hi = N-1, mid, best = 0;
      |                               ^~~~

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5428 KB Number of queries: 8
2 Correct 14 ms 5180 KB Number of queries: 9
3 Correct 18 ms 5408 KB Number of queries: 9
4 Correct 23 ms 5684 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 5196 KB Number of queries: 9
2 Correct 20 ms 5684 KB Number of queries: 9
3 Correct 18 ms 5412 KB Number of queries: 9
4 Correct 19 ms 5172 KB Number of queries: 9