oj.uz

Submission #1026227

# Submission time Handle Problem Language Result Execution time Memory
1026227 2024-07-17T17:59:44 Z AdamGS Meetings 2 (JOI21_meetings2) C++17
4 / 100
 4000 ms 5212 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
vector<int>V[LIM];
int ans[2*LIM], ile[LIM], akt;
void DFS(int x, int o) {
  for(auto i : V[x]) if(i!=o) {
    DFS(i, x);
    ile[x]+=ile[i];
  }
}
void DFS2(int x, int o) {
  if(2*ile[x]==ile[0]) ++akt;
  for(auto i : V[x]) if(i!=o) DFS2(i, x);
}
int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int n;
  cin >> n;
  rep(i, n-1) {
    int a, b;
    cin >> a >> b; --a; --b;
    V[a].pb(b);
    V[b].pb(a);
  }
  rep(i, 1<<n) {
    rep(j, n) if(i&(1<<j)) ile[j]=1; else ile[j]=0;
    DFS(0, 0);
    akt=1;
    DFS2(0, 0);
    ans[ile[0]]=max(ans[ile[0]], akt);
  }
  rep(i, n) cout << ans[i+1] << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 5168 KB Output is correct
7 Correct 4 ms 4956 KB Output is correct
8 Correct 5 ms 5172 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 9 ms 4956 KB Output is correct
11 Correct 9 ms 5168 KB Output is correct
12 Correct 9 ms 4956 KB Output is correct
13 Correct 8 ms 4956 KB Output is correct
14 Correct 4 ms 5164 KB Output is correct
15 Correct 4 ms 5044 KB Output is correct
16 Correct 4 ms 5156 KB Output is correct
17 Correct 8 ms 4956 KB Output is correct
18 Correct 9 ms 4956 KB Output is correct
19 Correct 5 ms 4956 KB Output is correct
20 Correct 7 ms 5164 KB Output is correct
21 Correct 5 ms 4956 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 5168 KB Output is correct
7 Correct 4 ms 4956 KB Output is correct
8 Correct 5 ms 5172 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 9 ms 4956 KB Output is correct
11 Correct 9 ms 5168 KB Output is correct
12 Correct 9 ms 4956 KB Output is correct
13 Correct 8 ms 4956 KB Output is correct
14 Correct 4 ms 5164 KB Output is correct
15 Correct 4 ms 5044 KB Output is correct
16 Correct 4 ms 5156 KB Output is correct
17 Correct 8 ms 4956 KB Output is correct
18 Correct 9 ms 4956 KB Output is correct
19 Correct 5 ms 4956 KB Output is correct
20 Correct 7 ms 5164 KB Output is correct
21 Correct 5 ms 4956 KB Output is correct
22 Execution timed out 4085 ms 5212 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 4 ms 4956 KB Output is correct
5 Correct 3 ms 4956 KB Output is correct
6 Correct 3 ms 5168 KB Output is correct
7 Correct 4 ms 4956 KB Output is correct
8 Correct 5 ms 5172 KB Output is correct
9 Correct 10 ms 4956 KB Output is correct
10 Correct 9 ms 4956 KB Output is correct
11 Correct 9 ms 5168 KB Output is correct
12 Correct 9 ms 4956 KB Output is correct
13 Correct 8 ms 4956 KB Output is correct
14 Correct 4 ms 5164 KB Output is correct
15 Correct 4 ms 5044 KB Output is correct
16 Correct 4 ms 5156 KB Output is correct
17 Correct 8 ms 4956 KB Output is correct
18 Correct 9 ms 4956 KB Output is correct
19 Correct 5 ms 4956 KB Output is correct
20 Correct 7 ms 5164 KB Output is correct
21 Correct 5 ms 4956 KB Output is correct
22 Execution timed out 4085 ms 5212 KB Time limit exceeded
23 Halted 0 ms 0 KB -