oj.uz

답안 #799836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799836 2023-08-01T05:59:23 Z n3rm1n Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 13 ms 628 KB 
#include<bits/stdc++.h>
#include "grader.h"
#define endl '\n'
using namespace std;
const int MAXN = 513;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
 
int n;
vector < int > g[MAXN];
int used[MAXN];
vector < int > a;
void dfs(int beg)
{
    used[beg] = 1;
    a.push_back(beg);
    int nb;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i];
        if(!used[nb])
        {
            dfs(nb);
        }
    }
}
int findEgg(int N, vector < pair < int, int > > bridges)
{
    n = N;
    for (int i = 0; i < bridges.size(); ++ i)
    {
 
        int x = bridges[i].first;
        int y = bridges[i].second;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1);
    int l = 0, r = n-1, mid;
    while(l < r)
    {
        mid = (l + r)/2;
        vector < int > nodes;
        for (int i = 0; i <= mid; ++ i)
        {
            nodes.push_back(a[i]);
        }
        if(query(nodes) == 1)
        {
            l = l;
            r = mid;
        }
        else
        {
            l = mid+1;
            r = r;
        }
    }
    return a[l];
}

Compilation message

eastereggs.cpp: In function 'void dfs(int)':
eastereggs.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:34:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i = 0; i < bridges.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~~

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 3 ms 336 KB Number of queries: 8
2 Correct 11 ms 480 KB Number of queries: 9
3 Correct 11 ms 628 KB Number of queries: 9
4 Correct 11 ms 492 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 584 KB Number of queries: 9
2 Correct 12 ms 540 KB Number of queries: 9
3 Correct 11 ms 600 KB Number of queries: 9
4 Correct 13 ms 552 KB Number of queries: 9