제출 #706795

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706795		aedmhsn	새로운 문제 (POI13_luk)	C++17	0 / 100	340 ms	22280 KiB

luk

#include <bits/stdc++.h>
using namespace std;
 
 
#define A first
#define B second
#define MP make_pair
#define ms(a, x) memset(a, x, sizeof(a)) 
 
 
#define boost() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pld;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);

const int mxN=3e5+5;

vector <vector<int>> adj(mxN);

int dist[mxN];

void dfs(int node, int par){
    for(auto x:adj[node]){
        if(x != par){
            dist[x] = dist[node]+1;
            dfs(x, node);
        }
    }
}

int dfs2(int node, int par, int workers=0){
    if(adj[node].size() - (node != 1) == 0)
        return 0;
    ll temp, ret=0;
    temp = (adj[node].size() - (node != 1) - workers)/(dist[node]+1) + ((adj[node].size()-(node != 1)-workers)%(dist[node]+1) != 0);
    for(auto x:adj[node]){
        if(x != par){
            ret += dfs2(x, node, temp);
        }
    }
    return temp + ret;
}

int main(){

    // amount of workers needed=ceil(amount of children/distance) + answer for each subtree
    // so idea is simple like
    // we will solve each subtree seperately
    // for each subtree answer will be equal to:
    // workers_needed - workers_assigned
    //  1
    // / \
    //2   3
    int n;
    cin >> n;
    for(int i=0; i<n-1; i++){
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    dfs(1, -1);
    cout << dfs2(1, -1);
}

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

luk.cpp:57:5: warning: multi-line comment [-Wcomment]
   57 |     // / \
      |     ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10