Submission #287482

#	Time	Username	Problem	Language	Result	Execution time	Memory
287482		Haunted_Cpp	Split the Attractions (IOI19_split)	C++17	0 / 100	5 ms	5248 KiB

split

#include "split.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5 + 5;
vector<vector<int>> g(MAX_N);

vector<int> euler;
void dfs(int node, int p) {
  euler.emplace_back(node);
  for (auto to : g[node]) {
    if (to != p) {
      dfs(to, node);
    }
  }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
  vector<int> in(n);
  const int m = p.size();
  for (int i = 0; i < m; i++) {
    int st = p[i];
    int et = q[i];
    --st; --et;
    g[st].emplace_back(et);
    g[et].emplace_back(st);
    ++in[st];
    ++in[et];
  }
  for (int i = 0; i < n; i++) {
    if (in[i] == 1) {
      dfs(i, -1);
      break;
    }
  }
  vector<int> res(n);
  for (auto to : euler) {
    if (a) {
      res[to] = 1;
      --a;
    } else if (b) {
      res[to] = 2;
      --b;
    } else {
      res[to] = 3;
    }
  }
	return res;
}

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