Submission #287755

#	Time	Username	Problem	Language	Result	Execution time	Memory
287755		Haunted_Cpp	Split the Attractions (IOI19_split)	C++17	11 / 100	127 ms	14456 KiB

split

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

using namespace std;

const int MAX_N = 1e5 + 5;

bool vis[MAX_N];

vector<vector<int>> g(MAX_N);

vector<int> euler;
vector<int> ans;

int k;

void dfs(int node) {
  vis[node] = true;
  if (euler.size() < k) euler.emplace_back(node);
  for (auto to : g[node]) {
    if (!vis[to]) {
      vis[to] = true;
      dfs(to);
    }
  }
}

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

Compilation message (stderr)

split.cpp: In function 'void dfs(int)':
split.cpp:19:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |   if (euler.size() < k) euler.emplace_back(node);
      |       ~~~~~~~~~~~~~^~~
In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from split.cpp:2:
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:41:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |   assert(euler.size() == b);
      |          ~~~~~~~~~~~~~^~~~

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