제출 #625327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
625327		MinaRagy06	Paprike (COI18_paprike)	C++17	11 / 100	1086 ms	22652 KiB

paprike

#include <bits/stdc++.h>
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl    '\n'
#define int     long long
 
vector<int> a, par, sum, sz;
int n, x, y, k;
int find(int u) {return par[u] = (u == par[u]? u : find(par[u]));}
int unionn(int u, int v)
{
    u = find(u), v = find(v);
    if (sum[u]+sum[v] > k) return 1;
    if (sz[u] < sz[v]) swap(u, v);
    sz[u]+=sz[v], par[v] = u, sum[u]+=sum[v];
    return 0; 
}
vector<vector<int>> edges, cur;
int anss = 1e18;
void solve(int ii, int rem)
{
    if (ii == edges.size())
    {
        int ans =0 ;
        for (int i = 0; i < n; i++) sum[i] = a[i], par[i] = i, sz[i] = 1;
        for (int i = 0; i < cur.size(); i++) ans+=unionn(cur[i][0], cur[i][1]);
        anss =min(anss, ans+rem);
        return;
    }
    cur.push_back(edges[ii]);
    solve(ii+1, rem);
    cur.pop_back();
    solve(ii+1, rem+1);
}
signed main()
{
    lesgooo;
    cin >> n >> k;
    a.resize(n), par.resize(n), sum.resize(n), sz.resize(n);
    for (int i =0 ; i < n; i++) cin >> a[i];
    for (int i = 0; i < n-1; i++) cin >> x >> y, edges.push_back({--x, --y});
    solve(0, 0);
    cout << anss;
    return 0;
}

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

paprike.cpp: In function 'void solve(long long int, long long int)':
paprike.cpp:22:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     if (ii == edges.size())
      |         ~~~^~~~~~~~~~~~~~~
paprike.cpp:26:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i = 0; i < cur.size(); i++) ans+=unionn(cur[i][0], cur[i][1]);
      |                         ~~^~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49