제출 #1060953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060953		onbert	Simurgh (IOI17_simurgh)	C++17	30 / 100	85 ms	4132 KiB

simurgh

#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
vector<pair<int,int>> adj[maxn];
int vis[maxn], cnt;

vector<int> used;

void dfs(int u) {
    vis[u] = cnt;
    for (auto [v, id]:adj[u]) if (!vis[v]) {
        used.push_back(id);
        dfs(v);
    }
}

vector<int> find_roads(int n, vector<int> U, vector<int> V) {
    for (int i=0;i<U.size();i++) {
        adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
    }
    vector<int> golden;
    for (int i=0;i<n;i++) {
        for (int j=0;j<n;j++) vis[j] = 0;
        vis[i] = -1;
        cnt = 0;
        used.clear();
        vector<vector<int>> vec = {{}};
        for (auto [v, id]:adj[i]) {
            if (vis[v]) vec[vis[v]].push_back(id);
            else {
                cnt++, vec.push_back({id});
                dfs(v);
            }
        }
        for (int j=1;j<=cnt;j++) {
            vector<int> thing = used;
            for (int k=1;k<=cnt;k++) if (j!=k) thing.push_back(vec[k][0]);
            vector<pair<int,int>> ret;
            for (int v:vec[j]) {
                thing.push_back(v);
                // for (int X:thing) cout << X << " "; cout << endl;
                ret.push_back({count_common_roads(thing), v});
                thing.pop_back();
            }
            int mx = (*max_element(ret.begin(), ret.end())).first;
            for (auto [val, v]:ret) {
                if (val==mx) golden.push_back(v);
            }
        }
    }
    sort(golden.begin(), golden.end());
    golden.erase(unique(golden.begin(), golden.end()), golden.end());
    return golden;
}

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

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i=0;i<U.size();i++) {
      |                  ~^~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 17 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30