제출 #818998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
818998		Gangsta	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	296 KiB

molecules

/*
ID: didarco1
LANG: C++17
TASK:
*/
// a >> b = a / pow(2,b)
// a << b = a * pow(2,b)
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define sz size()
#define ss second
#define ff first
#define N 200001
#define pii pair<int,int>

using namespace std;

//ll  _, x, n;

vector<int> find_subset(int l, int u, vector<int> w){
	int x = w[0], uly = 0, kici = 0, den = 0, sum = 0, n = w.sz;
	vector<int> result;
	result.resize(n);
	for(int i = 1; i < n; i++){
		if(w[i] == x + 1) uly++;
		else if(w[i] == x - 1) kici++;
		else if(w[i] == x) den++;
	}
	if(den + 1 == n){
		for(int i = 0; i < n; i++){
			sum += w[i];
			result[i] = i;
			if(sum >= l and sum <= u) return result;
		}
		for(int i = 0; i < n; i++) result[i] = 0;
		return result;
	}
	return result;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31