oj.uz

Submission #446386

# Submission time Handle Problem Language Result Execution time Memory
446386 2021-07-21T20:07:00 Z aryan12 Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 21 ms 456 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
const int MAXN = 520;
vector<int> order;
vector<int> g[MAXN];

void dfs(int node, int par) {
    order.push_back(node);
    for(int i = 0; i < g[node].size(); i++) {
        if(g[node][i] != par) {
            dfs(g[node][i], node);
        }
    }
}

int findEgg(int N, vector<pair<int, int> > bridges) {
    vector<int> queryVector;
    order.clear();
    for(int i = 0; i < MAXN; i++) {
        g[i].clear();
    }
    for(int i = 0; i < bridges.size(); i++) {
        g[bridges[i].first].push_back(bridges[i].second);
        g[bridges[i].second].push_back(bridges[i].first);
    }
    dfs(1, -1);
    /*for(int i = 0; i < order.size(); i++) {
        cout << order[i] << " ";
    }
    cout << "\n";*/
    int l = 0, r = order.size() - 1;
    int ans = 0, mid;
    while(l < r) {
        mid = (l + r + 1) >> 1;
        vector<int> tempVector;
        for(int i = 0; i < queryVector.size(); i++) {
            tempVector.push_back(queryVector[i]);
        }
        for(int i = l; i < mid; i++) {
            tempVector.push_back(order[i]);
        }
        int foundSpecial = query(tempVector);
        /*if(l == r - 1) {
            assert(l == mid);
            if(foundSpecial == 1) {
                ans = mid;
                break;
            }
            else {
                ans = mid + 1;
                break;
            }
        }*/
        if(foundSpecial == 1) {
            r = mid - 1;
        }
        else {
            for(int i = l; i < mid; i++) {
                queryVector.push_back(order[i]);
            }
            ans = mid;
            l = mid;
        }
    }
    return order[ans];
}

Compilation message

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

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Number of queries: 4
2 Correct 1 ms 200 KB Number of queries: 4
3 Correct 1 ms 200 KB Number of queries: 4
4 Correct 1 ms 200 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 328 KB Number of queries: 8
2 Correct 15 ms 344 KB Number of queries: 9
3 Correct 17 ms 456 KB Number of queries: 9
4 Correct 18 ms 344 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 364 KB Number of queries: 9
2 Correct 16 ms 328 KB Number of queries: 9
3 Correct 21 ms 348 KB Number of queries: 9
4 Correct 18 ms 452 KB Number of queries: 9