| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 838902 |
2023-08-28T08:02:29 Z |
sysia |
Prize (CEOI22_prize) |
C++17 |
|
3500 ms |
478256 KB |
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
void ckmin(int &a, int b) {a = min(a, b);}
typedef pair<int, int> T;
const int oo2 = 1e9+7;
const int K = 20;
vector<bool>active;
struct graph{
vector<vector<T>>g;
vector<vector<int>>up;
vector<int>depth, deg, par, pre, post;
int n, root, tt = 0;
void init(int nn){
n = nn;
g.resize(n+1);
deg.resize(n+1);
pre.resize(n+1);
post.resize(n+1);
par.assign(n+1, -1);
depth.assign(n+1, 0);
for (int i = 1; i<=n; i++){
cin >> par[i];
if (par[i] == -1) root = i;
else {
g[par[i]].emplace_back(i, 0);
g[i].emplace_back(par[i], 0);
}
}
up.assign(n+1, vector<int>(K, root));
for (int i = 1; i<=n; i++) if (par[i] != -1) up[i][0] = par[i];
for (int i = 1; i<K; i++){
for (int v = 1; v <= n; v++){
up[v][i] = up[up[v][i-1]][i-1];
}
}
for (int i = 1; i<=n; i++) deg[i] = (int)g[i].size();
dfs(root, root);
}
void dfs(int v, int pa){
pre[v] = ++tt;
for (auto [x, __]: g[v]){
if (x == pa) continue;
depth[x] = depth[v]+1;
dfs(x, v);
}
post[v] = ++tt;
}
int lca(int a, int b){
if (!subtree(a, b)) swap(a, b);
for (int i = K-1; i>=0; i--){
if (subtree(a, up[b][i])){
b = up[b][i];
}
}
if (a == b) return a;
for (int i = K-1; i>=0; i--){
if (up[a][i] != up[b][i]){
a = up[a][i];
b = up[b][i];
}
}
return up[a][0];
}
void remove(int v){
int p = par[v];
if (p == -1) return;
if ((int)deg[v] == 1){ //lisc
deg[p]--;
} else { //z pionowej sciezki ---> jest tylko jedno dziecko,podlaczyc do rodzica v
while (!active[g[v].back().first]) g[v].pop_back();
assert(!g[v].empty());
auto x = g[v].back().first;
if (x == par[v]) {
swap(g[v][0], g[v].back());
while (!active[g[v].back().first]) g[v].pop_back();
assert(!g[v].empty());
x = g[v].back().first;
}
g[p].emplace_back(x, 0);
par[x] = p;
}
}
bool subtree(int a, int b){ //czy b w poddrzewie a
return (pre[a] <= pre[b] && post[a] >= post[b]);
}
void make_vt(vector<int>&curr){
stable_sort(curr.begin(), curr.end(), [&](auto x, auto y){
return pre[x] < pre[y];
});
for (int i = 1; i<=n; i++) g[i].clear();
}
void bfs(){
queue<int>q;
int v = -1;
for (int i = 1; i<=n; i++){
if (v == -1 || ((int)g[i].size() && depth[i] < depth[v])){
v = i;
}
}
debug(v);
depth.assign(n+1, 0);
q.push(v);
vector<bool>vis(n+1);
vis[v] = 1;
while ((int)q.size()){
int u = q.front(); q.pop();
for (auto [x, c]: g[u]){
if (!vis[x]){
depth[x] = depth[u]+c;
vis[x] = 1;
q.push(x);
}
}
}
debug(depth);
}
int get_dist(int a, int b){
return depth[a] + depth[b] - 2 * depth[lca(a, b)];
}
void add(int a, int l, int c){
if (c) {
g[a].emplace_back(l, -c);
g[l].emplace_back(a, c);
}
}
};
void solve(){
int n, k, q, t; cin >> n >> k >> q >> t;
array<graph, 2>g;
g[0].init(n), g[1].init(n);
active.assign(n+1, 1);
stack<int>s;
auto cute = [&](int v){
bool ok = active[v];
for (int rep = 0; rep < 2; rep++) ok &= g[rep].deg[v] <= 2;
return ok;
};
for (int i = 1; i<=n; i++) if (cute(i)) s.push(i);
for (int rep = 0; rep<n-k; rep++){
while ((int)s.size() && !active[s.top()]) s.pop();
assert(!s.empty());
int v = s.top(); s.pop();
debug(v);
active[v] = 0;
g[0].remove(v);
g[1].remove(v);
for (auto ck: {g[0].par[v], g[1].par[v]}){
if (ck != -1 && cute(ck)) {
s.push(ck);
}
}
}
vector<int>curr;
for (int i = 1; i<=n; i++) if (active[i]) curr.emplace_back(i);
for (auto u: curr) cout << u << " ";
cout << "\n"; cout.flush();
g[1].make_vt(curr);
g[0].make_vt(curr);
debug(curr);
vector<T>edges;
for (int i = 1; i<(int)curr.size(); i++){
cout << "? " << curr[i-1] << " " << curr[i] << "\n";
edges.emplace_back(curr[i-1], curr[i]);
}
cout << "!\n"; cout.flush();
for (auto [a, b]: edges){
//b w poddrzewie a
for (int rep = 0; rep < 2; rep++){
int a1, b1; cin >> a1 >> b1;
int lca = g[rep].lca(a, b);
g[rep].add(a, lca, a1);
g[rep].add(b, lca, b1);
}
}
g[0].bfs(); g[1].bfs();
vector<T>que;
while (t--){
int a, b; cin >> a >> b;
que.emplace_back(a, b);
}
for (auto [a, b]: que){
cout << g[0].get_dist(a, b) << " " << g[1].get_dist(a, b) << "\n";
}
cout.flush();
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1598 ms |
238800 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2725 ms |
238152 KB |
Output is correct |
| 2 |
Runtime error |
1695 ms |
238676 KB |
Execution killed with signal 13 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1413 ms |
239540 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
3373 ms |
478256 KB |
Execution killed with signal 13 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3560 ms |
475696 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
