Submission #313893

#	Time	Username	Problem	Language	Result	Execution time	Memory
313893		nikatamliani	Split the Attractions (IOI19_split)	C++14	11 / 100	212 ms	27512 KiB

split

#include <bits/stdc++.h>
#define vi vector < int >
#include "split.h"
using namespace std;
const int N = 2e5 + 10;
int in[N], out[N], sub[N], P[N];
int countA, countB, countC, aa = 1, bb = 2, cc = 3;
bool vis[N];
int timer = 0;
vi edges[N], redges[N], ans;
void dfs(int x, int p) {
    if(vis[x]) return;
    in[x] = ++timer;
    vis[x] = sub[x] = 1; 
    for(int to : edges[x]) {
        if(to != p) {
            if(!vis[to]) {
                P[to] = x;
                dfs(to, x);
                sub[x] += sub[to];
                redges[to].push_back(x);
                redges[x].push_back(to);
            }
        }
    }
    out[x] = ++timer;
}
void find_answer(int x, int p, int v) {
    if(in[v] <= in[x] && out[v] >= out[x]) {
        if(countA > 0) {
            ans[x] = aa;
            --countA;
        } 
    } else {
        if(countB > 0) {
            ans[x] = bb;
            --countB;
        }
    }
    for(int to : redges[x]) {
        if(to != p) {
            find_answer(to, x, v);
        }
    }
}
vi find_split(int n, int a, int b, int c, vi p, vi q) {
    ans.resize(n);
    if(a > b) swap(a, b), swap(aa, bb);
    if(b > c) swap(b, c), swap(bb, cc);
    if(a > b) swap(a, b), swap(aa, bb);
    countA = a, countB = b, countC = c;
    for(int i = 0; i < q.size(); ++i) {
        edges[q[i]].push_back(p[i]);
        edges[p[i]].push_back(q[i]);
    }
    dfs(0, -1);
    int from = -1, root = 0;
    for(int i = 0; i < n; ++i) {
        if(sub[i] >= a && sub[i] <= c + a) {
            from = i;
        }
        if(n - sub[i] >= a && n - sub[i] <= c + a) {
            from = P[i];
            root = i;
        }
    }
    for(int i = 0; i < n; ++i)redges[i].clear();
    memset(in, 0, sizeof in);
    memset(out, 0, sizeof out);
    memset(vis, 0, sizeof vis);
    memset(sub, 0, sizeof sub);
    dfs(root, -1);
    find_answer(root, -1, from);
    for(int i = 0; i < n; ++i) if(ans[i] == 0) ans[i] = cc;
    return ans;
}

Compilation message (stderr)

split.cpp: In function 'void dfs(int, int)':
split.cpp:14:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   14 |     vis[x] = sub[x] = 1;
      |              ~~~~~~~^~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i = 0; i < q.size(); ++i) {
      |                    ~~^~~~~~~~~~

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