제출 #288938

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
288938		mohammad	Split the Attractions (IOI19_split)	C++14	0 / 100	56 ms	3700 KiB

split

#include "split.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
// #define int long long

typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

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

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