oj.uz

답안 #654408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654408 2022-10-31T09:02:04 Z atigun Stranded Far From Home (BOI22_island) C++14
0 / 100
 5 ms 724 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 2e3;

int n, m;
vector<ll> a(maxn+5), sum(maxn+5);
vector<vector<int>> g(maxn+5);
vector<bool> work(maxn+5), vis(maxn+5);

void dfs1(int v, int p){
  vis[v] = 1, sum[v] = a[v];
  for(int u : g[v]){
    if(u == p)
      continue;
    dfs1(u, v);
    sum[v]+= sum[u];
  }
  if(p != -1)
    work[v] = (sum[v] >= a[p]);
}

void dfs2(int v, int p){
  if(p != -1)
    work[v] = min(work[v], work[p]);
  for(int u : g[v]){
    if(u == p)
      continue;
    dfs2(u, v);
  }
}

void solve(){
  cin >> n >> m;
  assert(m == n-1);
  for(int i = 1; i <= n; i++)
    cin >> a[i];
  for(int i = 0; i < m; i++){
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs1(1, -1);
  work[1] = 1;
  dfs2(1, -1);
  for(int i = 1; i <= n; i++)
    cout << work[i];
  cout << "\n";
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  // cin >> tt;
  while(tt--){
    solve();
  }
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Runtime error 4 ms 724 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 5 ms 724 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 1 ms 596 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -