제출 #598707

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
598707	2022-07-18 18:17:59	alirezasamimi100	Split the Attractions (IOI19_split)	C++17	100 / 100	106 ms	20224 KiB

split

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
using pii = pair<int,int>;
const int N = 1e5 + 10;
int n,a,b,c,sz[N],f[N],dp[N],h[N],np[N],t=1,k,r,l;
vector<int> adj[N],ans;
void dfs(int v, int p){
    f[v]=1;
    sz[v]=1;
    dp[v]=h[v];
    int fl=1;
    for(int u : adj[v]){
        if(u==p) continue;
        if(f[u]) dp[v]=min(dp[v],h[u]);
        else{
            h[u]=h[v]+1;
            dfs(u,v);
            dp[v]=min(dp[v],dp[u]);
            sz[v]+=sz[u];
            if(sz[u]>=a) fl=0;
        }
    }
    if(sz[v]>=a && fl){
        k=sz[v];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 24 / 24
• Subtask 5: 36 / 36