oj.uz

답안 #625328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
625328 2022-08-10T04:26:56 Z MinaRagy06 Paprike (COI18_paprike) C++17
24 / 100
 35 ms 8956 KB 
#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);
    if (n <= 15)
    {
        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;
    }
    else
    {
        for (int i =0 ; i < n; i++) cin >> sum[i], par[i] = i, sz[i] = 1;
        int ans =0 ;
        vector<vector<int>> edges;
        for (int i = 0; i < n-1; i++) cin >> x >> y, edges.push_back({--x, --y, sum[x]+sum[y]});
        // sort(edges.begin(), edges.end(), [&](auto _a, auto _b) {return _a[2] < _b[2];});
        for (int i = 0; i < n-1; i++) ans+=unionn(edges[i][0], edges[i][1]);
        cout << ans;
    }
    return 0;
}

Compilation message

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.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 3 ms 316 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 8956 KB Output is correct
2 Correct 30 ms 8864 KB Output is correct
3 Correct 31 ms 8828 KB Output is correct
4 Correct 30 ms 8916 KB Output is correct
5 Correct 29 ms 8888 KB Output is correct
6 Correct 31 ms 8896 KB Output is correct
7 Correct 34 ms 8868 KB Output is correct
8 Correct 26 ms 8884 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 3 ms 316 KB Output is correct
22 Incorrect 1 ms 340 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 3 ms 316 KB Output is correct
22 Correct 35 ms 8956 KB Output is correct
23 Correct 30 ms 8864 KB Output is correct
24 Correct 31 ms 8828 KB Output is correct
25 Correct 30 ms 8916 KB Output is correct
26 Correct 29 ms 8888 KB Output is correct
27 Correct 31 ms 8896 KB Output is correct
28 Correct 34 ms 8868 KB Output is correct
29 Correct 26 ms 8884 KB Output is correct
30 Incorrect 1 ms 340 KB Output isn't correct
31 Halted 0 ms 0 KB -