oj.uz

답안 #1068537

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068537 2024-08-21T10:31:17 Z duckindog Inside information (BOI21_servers) C++17
15 / 100
 103 ms 47876 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 120'000 + 10;
int n, k;
vector<pair<int, int>> ad[N];
vector<tuple<int, int, int>> Q;

int st[N], ed[N], it;
int f[N][18], increase[N][18], decrease[N][18];
void dfs(int u, int p = -1) { 
  st[u] = ++it;

  for (int i = 1; i <= 17; ++i) { 
    f[u][i] = f[f[u][i - 1]][i - 1];

    if (increase[u][i - 1] != -1 && increase[f[u][i - 1]][i - 1] != -1) { 
      if (increase[u][i - 1] < increase[f[u][i - 1]][0]) 
        increase[u][i] = increase[f[u][i - 1]][i - 1];
    }
    if (decrease[u][i - 1] != -1 && decrease[f[u][i - 1]][i - 1] != -1) { 
      if (decrease[u][i - 1] > decrease[f[u][i - 1]][0]) 
        decrease[u][i] = decrease[f[u][i - 1]][i - 1];
    }
  }

  for (const auto& [v, w] : ad[u]) { 
    if (v == p) continue;
    f[v][0] = u;
    increase[v][0] = decrease[v][0] = w;
    dfs(v, u);
  }

  ed[u] = it;
}
inline bool anc(int u, int v) { return st[u] <= st[v] && ed[u] >= ed[v]; }

int get(int u, int v) { 
  int uwd = 0, dwd = 1'000'000, ma = 0;
  for (int i = 17; i >= 0; --i) { 
    if (anc(f[u][i], v)) continue;
    if (uwd > increase[u][i] || increase[u][i] == -1) return -1;
    uwd = increase[u][i];
    u = f[u][i];
  }
  if (!anc(u, v) && anc(f[u][0], v)) { 
    if (uwd > increase[u][0] || increase[u][0] == -1) return -1;
    uwd = increase[u][0];
    u = f[u][0];
  } ma = uwd;

  for (int i = 17; i >= 0; --i) { 
    if (anc(f[v][i], u)) continue;
    if (dwd < decrease[v][i] || decrease[v][i] == -1) return -1;
    dwd = decrease[v][i];
    ma = max(ma, decrease[v][0]);
    v = f[v][i];
  }
  
  if (v != u) { 
    if (dwd < decrease[v][0] || decrease[v][0] == -1) return -1;
    dwd = decrease[v][0];
    ma = max(ma, decrease[v][0]);
    v = f[v][0];
  }

  return uwd < dwd ? ma : -1;
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> k;
  for (int i = 1; i < n + k; ++i) { 
    char type; cin >> type;
    if (type == 'S') { 
      int a, b; cin >> a >> b;
      ad[a].push_back({b, i});
      ad[b].push_back({a, i});
    }

    if (type == 'Q') { 
      int a, d; cin >> a >> d;
      Q.emplace_back(a, d, i);
    }

    if (type == 'C') { 
      int d; cin >> d;
      Q.emplace_back(0, d, i);
    }
  }

  memset(increase, -1, sizeof increase);
  memset(decrease, -1, sizeof decrease);
  dfs(f[1][0] = 1);

  for (const auto& [a, d, i] : Q) { 
    if (!a) continue;
    int time = get(d, a);
    cout << (time == -1 || time > i ? "no" : "yes") << '\n';
  }
}

Subtask #1
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 26060 KB Output is correct
2 Correct 25 ms 26552 KB Output is correct
3 Correct 29 ms 26788 KB Output is correct
4 Correct 27 ms 26612 KB Output is correct
5 Correct 30 ms 27140 KB Output is correct
6 Correct 26 ms 26588 KB Output is correct

Subtask #2
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 26060 KB Output is correct
2 Correct 25 ms 26552 KB Output is correct
3 Correct 29 ms 26788 KB Output is correct
4 Correct 27 ms 26612 KB Output is correct
5 Correct 30 ms 27140 KB Output is correct
6 Correct 26 ms 26588 KB Output is correct
7 Incorrect 26 ms 26064 KB Extra information in the output file
8 Halted 0 ms 0 KB -

Subtask #3
2.5 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 26064 KB Output is correct
2 Correct 87 ms 38692 KB Output is correct
3 Correct 87 ms 38776 KB Output is correct

Subtask #4
0 / 2.5

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 26064 KB Output is correct
2 Correct 87 ms 38692 KB Output is correct
3 Correct 87 ms 38776 KB Output is correct
4 Incorrect 22 ms 26092 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26060 KB Output is correct
2 Incorrect 97 ms 47688 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26060 KB Output is correct
2 Incorrect 97 ms 47688 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26064 KB Output is correct
2 Correct 78 ms 39208 KB Output is correct
3 Correct 83 ms 39680 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26064 KB Output is correct
2 Correct 78 ms 39208 KB Output is correct
3 Correct 83 ms 39680 KB Output is correct
4 Incorrect 25 ms 26064 KB Extra information in the output file
5 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 26144 KB Output is correct
2 Incorrect 103 ms 47836 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 26144 KB Output is correct
2 Incorrect 103 ms 47836 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26136 KB Output is correct
2 Correct 25 ms 26532 KB Output is correct
3 Correct 27 ms 26836 KB Output is correct
4 Correct 25 ms 26664 KB Output is correct
5 Correct 26 ms 27144 KB Output is correct
6 Correct 29 ms 26600 KB Output is correct
7 Correct 22 ms 26064 KB Output is correct
8 Correct 83 ms 38772 KB Output is correct
9 Correct 64 ms 38824 KB Output is correct
10 Correct 25 ms 26064 KB Output is correct
11 Incorrect 82 ms 47876 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 26136 KB Output is correct
2 Correct 25 ms 26532 KB Output is correct
3 Correct 27 ms 26836 KB Output is correct
4 Correct 25 ms 26664 KB Output is correct
5 Correct 26 ms 27144 KB Output is correct
6 Correct 29 ms 26600 KB Output is correct
7 Correct 22 ms 26064 KB Output is correct
8 Correct 83 ms 38772 KB Output is correct
9 Correct 64 ms 38824 KB Output is correct
10 Correct 25 ms 26064 KB Output is correct
11 Incorrect 82 ms 47876 KB Output isn't correct
12 Halted 0 ms 0 KB -