Submission #817072

#	Time	Username	Problem	Language	Result	Execution time	Memory
817072		vjudge1	Split the Attractions (IOI19_split)	C++17	0 / 100	29 ms	7712 KiB

split

#include "split.h"
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <iomanip>
using namespace std;

const int nax = (int)200'000;
vector<int>adj[nax];

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	
	vector<int>res(n);
	for (int i = 0; i < a; i++)res[i] = 1;
	for (int i = a; i < b + a; i++)res[i] = 2;
	for (int i = b + a; i < c + b + a; i++)res[i] = 3;
	return res;
}

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