제출 #49400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49400		georgerapeanu	Easter Eggs (info1cup17_eastereggs)	C++11	81 / 100	20 ms	540 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector<int> G[600];
vector<int> nodes;


void linearize(int node,int father){
    nodes.push_back(node);
    for(auto it:G[node]){
        if(it != father){
            linearize(it,node);
            nodes.push_back(node);
        }
    }
}

vector<int> que;
map< vector<int> , int > Map;

bool ok(int le,int ri){
    que.clear();
    for(int i = le;i <= ri;i++){
        que.push_back(nodes[i]);
    }
    sort(que.begin(),que.end());
    que.resize(unique(que.begin(),que.end()) - que.begin());
    if(Map.count(que)){
        return Map[que];
    }
    return Map[que] = query(que);
}

int findEgg (int N, vector < pair < int, int > > bridges){
    nodes.clear();
    Map.clear();
    for(int i = 1;i <= N;i++){
        G[i].clear();
    }
    for(auto it:bridges){
        G[it.first].push_back(it.second);
        G[it.second].push_back(it.first);
    }

    linearize(1,0);

    int lo = 0,hi = (int)nodes.size() - 1;
    while(hi - lo > 0){
        int mid = (lo + hi) / 2;
        if(ok(lo,mid)){
            hi = mid;
        }
        else{
            lo = mid + 1;
        }
    }
    return nodes[lo];
}

컴파일 시 표준 에러 (stderr) 메시지

eastereggs.cpp: In function 'bool ok(int, int)':
eastereggs.cpp:33:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
     return Map[que] = query(que);

• Subtask 1: 32 / 40
• Subtask 2: 34 / 40
• Subtask 3: 15 / 20